About the Execution of ITS-Tools for FunctionPointer-PT-c008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.668 | 3600000.00 | 8477508.00 | 234950.60 | TTTF??F?FTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850800731.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FunctionPointer-PT-c008, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850800731
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679571717686
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-23 11:42:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 11:42:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:42:01] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2023-03-23 11:42:01] [INFO ] Transformed 2826 places.
[2023-03-23 11:42:01] [INFO ] Transformed 8960 transitions.
[2023-03-23 11:42:01] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1198 places in 52 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 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 297 places :
Symmetric choice reduction at 1 with 297 rule applications. Total rules 314 place count 1314 transition count 3686
Iterating global reduction 1 with 297 rules applied. Total rules applied 611 place count 1314 transition count 3686
Ensure Unique test removed 354 transitions
Reduce isomorphic transitions removed 354 transitions.
Iterating post reduction 1 with 354 rules applied. Total rules applied 965 place count 1314 transition count 3332
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1121 place count 1158 transition count 3020
Iterating global reduction 2 with 156 rules applied. Total rules applied 1277 place count 1158 transition count 3020
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1345 place count 1158 transition count 2952
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1359 place count 1144 transition count 2924
Iterating global reduction 3 with 14 rules applied. Total rules applied 1373 place count 1144 transition count 2924
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1386 place count 1131 transition count 2898
Iterating global reduction 3 with 13 rules applied. Total rules applied 1399 place count 1131 transition count 2898
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1412 place count 1118 transition count 2872
Iterating global reduction 3 with 13 rules applied. Total rules applied 1425 place count 1118 transition count 2872
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1437 place count 1106 transition count 2848
Iterating global reduction 3 with 12 rules applied. Total rules applied 1449 place count 1106 transition count 2848
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1461 place count 1094 transition count 2824
Iterating global reduction 3 with 12 rules applied. Total rules applied 1473 place count 1094 transition count 2824
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1484 place count 1083 transition count 2802
Iterating global reduction 3 with 11 rules applied. Total rules applied 1495 place count 1083 transition count 2802
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1506 place count 1072 transition count 2780
Iterating global reduction 3 with 11 rules applied. Total rules applied 1517 place count 1072 transition count 2780
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 1562 place count 1027 transition count 2612
Iterating global reduction 3 with 45 rules applied. Total rules applied 1607 place count 1027 transition count 2612
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1663 place count 971 transition count 2388
Iterating global reduction 3 with 56 rules applied. Total rules applied 1719 place count 971 transition count 2388
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1775 place count 915 transition count 2242
Iterating global reduction 3 with 56 rules applied. Total rules applied 1831 place count 915 transition count 2242
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1887 place count 859 transition count 2130
Iterating global reduction 3 with 56 rules applied. Total rules applied 1943 place count 859 transition count 2130
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1999 place count 803 transition count 2018
Iterating global reduction 3 with 56 rules applied. Total rules applied 2055 place count 803 transition count 2018
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2111 place count 747 transition count 1906
Iterating global reduction 3 with 56 rules applied. Total rules applied 2167 place count 747 transition count 1906
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2220 place count 694 transition count 1800
Iterating global reduction 3 with 53 rules applied. Total rules applied 2273 place count 694 transition count 1800
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 2289 place count 678 transition count 1768
Iterating global reduction 3 with 16 rules applied. Total rules applied 2305 place count 678 transition count 1768
Applied a total of 2305 rules in 1452 ms. Remains 678 /1628 variables (removed 950) and now considering 1768/5962 (removed 4194) transitions.
[2023-03-23 11:42:02] [INFO ] Flow matrix only has 1186 transitions (discarded 582 similar events)
// Phase 1: matrix 1186 rows 678 cols
[2023-03-23 11:42:02] [INFO ] Computed 2 place invariants in 36 ms
[2023-03-23 11:42:03] [INFO ] Implicit Places using invariants in 688 ms returned []
[2023-03-23 11:42:03] [INFO ] Flow matrix only has 1186 transitions (discarded 582 similar events)
[2023-03-23 11:42:03] [INFO ] Invariant cache hit.
[2023-03-23 11:42:03] [INFO ] State equation strengthened by 292 read => feed constraints.
[2023-03-23 11:42:05] [INFO ] Implicit Places using invariants and state equation in 2442 ms returned []
Implicit Place search using SMT with State Equation took 3156 ms to find 0 implicit places.
[2023-03-23 11:42:05] [INFO ] Flow matrix only has 1186 transitions (discarded 582 similar events)
[2023-03-23 11:42:05] [INFO ] Invariant cache hit.
[2023-03-23 11:42:06] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 678/1628 places, 1768/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5299 ms. Remains : 678/1628 places, 1768/5962 transitions.
Support contains 12 out of 678 places after structural reductions.
[2023-03-23 11:42:07] [INFO ] Flatten gal took : 265 ms
[2023-03-23 11:42:07] [INFO ] Flatten gal took : 108 ms
[2023-03-23 11:42:07] [INFO ] Input system was already deterministic with 1768 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-23 11:42:08] [INFO ] Flow matrix only has 1186 transitions (discarded 582 similar events)
[2023-03-23 11:42:08] [INFO ] Invariant cache hit.
[2023-03-23 11:42:08] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-23 11:42:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:42:09] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 11:42:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 11:42:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:42:09] [INFO ] After 480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 11:42:09] [INFO ] State equation strengthened by 292 read => feed constraints.
[2023-03-23 11:42:10] [INFO ] After 283ms SMT Verify possible using 292 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 11:42:10] [INFO ] After 701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-23 11:42:10] [INFO ] After 1841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 14 ms.
Support contains 6 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1768/1768 transitions.
Graph (complete) has 2915 edges and 678 vertex of which 486 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.4 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 486 transition count 1384
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 389 place count 482 transition count 1376
Iterating global reduction 1 with 4 rules applied. Total rules applied 393 place count 482 transition count 1376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 397 place count 482 transition count 1372
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 400 place count 479 transition count 1366
Iterating global reduction 2 with 3 rules applied. Total rules applied 403 place count 479 transition count 1366
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 405 place count 477 transition count 1362
Iterating global reduction 2 with 2 rules applied. Total rules applied 407 place count 477 transition count 1362
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 410 place count 474 transition count 1352
Iterating global reduction 2 with 3 rules applied. Total rules applied 413 place count 474 transition count 1352
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 416 place count 471 transition count 1342
Iterating global reduction 2 with 3 rules applied. Total rules applied 419 place count 471 transition count 1342
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 422 place count 468 transition count 1336
Iterating global reduction 2 with 3 rules applied. Total rules applied 425 place count 468 transition count 1336
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 428 place count 465 transition count 1330
Iterating global reduction 2 with 3 rules applied. Total rules applied 431 place count 465 transition count 1330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 435 place count 461 transition count 1318
Iterating global reduction 2 with 4 rules applied. Total rules applied 439 place count 461 transition count 1318
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 443 place count 457 transition count 1306
Iterating global reduction 2 with 4 rules applied. Total rules applied 447 place count 457 transition count 1306
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 451 place count 453 transition count 1298
Iterating global reduction 2 with 4 rules applied. Total rules applied 455 place count 453 transition count 1298
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 457 place count 451 transition count 1294
Iterating global reduction 2 with 2 rules applied. Total rules applied 459 place count 451 transition count 1294
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 461 place count 449 transition count 1290
Iterating global reduction 2 with 2 rules applied. Total rules applied 463 place count 449 transition count 1290
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 465 place count 447 transition count 1286
Iterating global reduction 2 with 2 rules applied. Total rules applied 467 place count 447 transition count 1286
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 469 place count 445 transition count 1282
Iterating global reduction 2 with 2 rules applied. Total rules applied 471 place count 445 transition count 1282
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 479 place count 445 transition count 1274
Applied a total of 479 rules in 585 ms. Remains 445 /678 variables (removed 233) and now considering 1274/1768 (removed 494) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 599 ms. Remains : 445/678 places, 1274/1768 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 11:42:11] [INFO ] Flow matrix only has 728 transitions (discarded 546 similar events)
// Phase 1: matrix 728 rows 445 cols
[2023-03-23 11:42:11] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-23 11:42:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 11:42:12] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 11:42:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 11:42:12] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 11:42:12] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-23 11:42:12] [INFO ] After 125ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 11:42:12] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-23 11:42:12] [INFO ] After 886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1274/1274 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 443 transition count 1270
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 443 transition count 1270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 443 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 442 transition count 1266
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 442 transition count 1266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 441 transition count 1264
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 441 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 440 transition count 1262
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 440 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 439 transition count 1260
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 439 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 438 transition count 1256
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 438 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 437 transition count 1254
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 437 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 436 transition count 1252
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 436 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 435 transition count 1250
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 435 transition count 1250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 434 transition count 1248
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 434 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 433 transition count 1246
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 433 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 432 transition count 1244
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 432 transition count 1244
Applied a total of 28 rules in 146 ms. Remains 432 /445 variables (removed 13) and now considering 1244/1274 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 432/445 places, 1244/1274 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-23 11:42:13] [INFO ] Flow matrix only has 707 transitions (discarded 537 similar events)
// Phase 1: matrix 707 rows 432 cols
[2023-03-23 11:42:13] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-23 11:42:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 11:42:13] [INFO ] After 260ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 11:42:13] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-23 11:42:13] [INFO ] After 34ms SMT Verify possible using 80 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-23 11:42:13] [INFO ] After 125ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-23 11:42:13] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1244/1244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 429 transition count 1238
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 429 transition count 1238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 429 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 426 transition count 1228
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 424 transition count 1222
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 424 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 422 transition count 1218
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 422 transition count 1218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 420 transition count 1214
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 420 transition count 1214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 418 transition count 1210
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 418 transition count 1210
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 416 transition count 1206
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 416 transition count 1206
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 414 transition count 1202
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 413 transition count 1200
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 413 transition count 1200
Applied a total of 40 rules in 191 ms. Remains 413 /432 variables (removed 19) and now considering 1200/1244 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 413/432 places, 1200/1244 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 620062 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 620062 steps, saw 380210 distinct states, run finished after 3002 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 11:42:17] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2023-03-23 11:42:17] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-23 11:42:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 11:42:17] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 11:42:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 11:42:17] [INFO ] After 50ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:42:17] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:42:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 11:42:17] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:17] [INFO ] After 32ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:17] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-23 11:42:17] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 73 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 75 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2023-03-23 11:42:17] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2023-03-23 11:42:17] [INFO ] Invariant cache hit.
[2023-03-23 11:42:18] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-23 11:42:18] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2023-03-23 11:42:18] [INFO ] Invariant cache hit.
[2023-03-23 11:42:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 11:42:19] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
[2023-03-23 11:42:19] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-23 11:42:19] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2023-03-23 11:42:19] [INFO ] Invariant cache hit.
[2023-03-23 11:42:20] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2459 ms. Remains : 413/413 places, 1200/1200 transitions.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 413 transition count 664
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 402 transition count 664
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 547 place count 402 transition count 596
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 683 place count 334 transition count 596
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 937 place count 207 transition count 469
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1001 place count 143 transition count 341
Iterating global reduction 2 with 64 rules applied. Total rules applied 1065 place count 143 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1066 place count 143 transition count 340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1066 place count 143 transition count 339
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1068 place count 142 transition count 339
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1130 place count 80 transition count 215
Iterating global reduction 3 with 62 rules applied. Total rules applied 1192 place count 80 transition count 215
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1254 place count 18 transition count 91
Iterating global reduction 3 with 62 rules applied. Total rules applied 1316 place count 18 transition count 91
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1378 place count 18 transition count 29
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 4 with 2 rules applied. Total rules applied 1380 place count 17 transition count 30
Applied a total of 1380 rules in 75 ms. Remains 17 /413 variables (removed 396) and now considering 30/1200 (removed 1170) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 17 cols
[2023-03-23 11:42:20] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 11:42:20] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned sat
[2023-03-23 11:42:20] [INFO ] After 212ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 11:42:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:42:20] [INFO ] After 57ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-23 11:42:20] [INFO ] After 120ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-23 11:42:20] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(X(G(!p0)))))))'
Support contains 1 out of 678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 678/678 places, 1768/1768 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 670 transition count 1752
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 670 transition count 1752
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 670 transition count 1744
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 664 transition count 1732
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 664 transition count 1732
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 660 transition count 1722
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 660 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 655 transition count 1706
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 655 transition count 1706
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 650 transition count 1692
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 650 transition count 1692
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 644 transition count 1676
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 644 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 638 transition count 1660
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 638 transition count 1660
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 632 transition count 1646
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 632 transition count 1646
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 626 transition count 1632
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 626 transition count 1632
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 117 place count 621 transition count 1622
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 621 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 618 transition count 1616
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 618 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 615 transition count 1610
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 613 transition count 1606
Applied a total of 138 rules in 419 ms. Remains 613 /678 variables (removed 65) and now considering 1606/1768 (removed 162) transitions.
[2023-03-23 11:42:21] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-23 11:42:21] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-23 11:42:22] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-23 11:42:22] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 11:42:22] [INFO ] Invariant cache hit.
[2023-03-23 11:42:22] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:42:23] [INFO ] Implicit Places using invariants and state equation in 1717 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2023-03-23 11:42:23] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 11:42:23] [INFO ] Invariant cache hit.
[2023-03-23 11:42:24] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/678 places, 1606/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3182 ms. Remains : 613/678 places, 1606/1768 transitions.
Stuttering acceptance computed with spot in 296 ms :[true, false, p0, p0, p0, false]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(GT 3 s533)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 932 ms.
Product exploration explored 100000 steps with 50000 reset in 802 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c008-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLCardinality-00 finished in 5433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 678 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 678/678 places, 1768/1768 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 671 transition count 1754
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 671 transition count 1754
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 22 place count 671 transition count 1746
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 665 transition count 1732
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 665 transition count 1732
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 661 transition count 1720
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 661 transition count 1720
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 656 transition count 1704
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 656 transition count 1704
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 651 transition count 1690
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 651 transition count 1690
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 645 transition count 1674
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 645 transition count 1674
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 639 transition count 1658
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 639 transition count 1658
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 633 transition count 1646
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 633 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 628 transition count 1636
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 628 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 624 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 624 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 622 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 622 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 620 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 620 transition count 1620
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 620 transition count 1616
Applied a total of 128 rules in 966 ms. Remains 620 /678 variables (removed 58) and now considering 1616/1768 (removed 152) transitions.
[2023-03-23 11:42:27] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2023-03-23 11:42:27] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-23 11:42:28] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-23 11:42:28] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-23 11:42:28] [INFO ] Invariant cache hit.
[2023-03-23 11:42:28] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 11:42:30] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2708 ms to find 0 implicit places.
[2023-03-23 11:42:30] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-23 11:42:30] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-23 11:42:30] [INFO ] Invariant cache hit.
[2023-03-23 11:42:30] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 620/678 places, 1616/1768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4310 ms. Remains : 620/678 places, 1616/1768 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s546), p0:(LEQ s518 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 462 ms.
Product exploration explored 100000 steps with 2 reset in 569 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 320069 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 320069 steps, saw 207756 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 11:42:35] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-23 11:42:35] [INFO ] Invariant cache hit.
[2023-03-23 11:42:35] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:42:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:42:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:42:36] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:42:36] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 11:42:36] [INFO ] After 101ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:42:36] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-23 11:42:36] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Graph (complete) has 2699 edges and 620 vertex of which 428 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 428 transition count 1232
Applied a total of 385 rules in 143 ms. Remains 428 /620 variables (removed 192) and now considering 1232/1616 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 428/620 places, 1232/1616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 11:42:36] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
// Phase 1: matrix 698 rows 428 cols
[2023-03-23 11:42:36] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-23 11:42:36] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:42:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 11:42:37] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-23 11:42:37] [INFO ] After 38ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:37] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-23 11:42:37] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 103 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 428/428 places, 1232/1232 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 631518 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631518 steps, saw 368402 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 11:42:40] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2023-03-23 11:42:40] [INFO ] Invariant cache hit.
[2023-03-23 11:42:40] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:42:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 11:42:40] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-23 11:42:40] [INFO ] After 36ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:40] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-23 11:42:40] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 60 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 52 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-23 11:42:41] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2023-03-23 11:42:41] [INFO ] Invariant cache hit.
[2023-03-23 11:42:41] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-23 11:42:41] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2023-03-23 11:42:41] [INFO ] Invariant cache hit.
[2023-03-23 11:42:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-23 11:42:42] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
[2023-03-23 11:42:42] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-23 11:42:42] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2023-03-23 11:42:42] [INFO ] Invariant cache hit.
[2023-03-23 11:42:42] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1799 ms. Remains : 428/428 places, 1232/1232 transitions.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 428 transition count 683
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 564 place count 413 transition count 683
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 564 place count 413 transition count 611
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 708 place count 341 transition count 611
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 964 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1028 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1092 place count 149 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1093 place count 149 transition count 354
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1156 place count 86 transition count 228
Iterating global reduction 3 with 63 rules applied. Total rules applied 1219 place count 86 transition count 228
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1282 place count 23 transition count 102
Iterating global reduction 3 with 63 rules applied. Total rules applied 1345 place count 23 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1408 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1408 place count 23 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 22 transition count 38
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 4 with 2 rules applied. Total rules applied 1412 place count 21 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1414 place count 20 transition count 37
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1416 place count 20 transition count 35
Applied a total of 1416 rules in 46 ms. Remains 20 /428 variables (removed 408) and now considering 35/1232 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 20 cols
[2023-03-23 11:42:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 11:42:42] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:42:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 11:42:42] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:42:42] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:42] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 11:42:42] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 89 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2023-03-23 11:42:43] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2023-03-23 11:42:43] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-23 11:42:43] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-23 11:42:43] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-23 11:42:43] [INFO ] Invariant cache hit.
[2023-03-23 11:42:44] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 11:42:45] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
[2023-03-23 11:42:45] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-23 11:42:45] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-23 11:42:45] [INFO ] Invariant cache hit.
[2023-03-23 11:42:46] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2994 ms. Remains : 620/620 places, 1616/1616 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 11:42:46] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-23 11:42:46] [INFO ] Invariant cache hit.
[2023-03-23 11:42:46] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:42:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 11:42:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:42:47] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:47] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 11:42:47] [INFO ] After 69ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:47] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-23 11:42:47] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Graph (complete) has 2699 edges and 620 vertex of which 428 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 428 transition count 1232
Applied a total of 385 rules in 48 ms. Remains 428 /620 variables (removed 192) and now considering 1232/1616 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 428/620 places, 1232/1616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 647025 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647025 steps, saw 377547 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 11:42:50] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
// Phase 1: matrix 698 rows 428 cols
[2023-03-23 11:42:50] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-23 11:42:50] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:42:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 11:42:50] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-23 11:42:50] [INFO ] After 40ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:50] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-23 11:42:50] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 47 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-23 11:42:50] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2023-03-23 11:42:50] [INFO ] Invariant cache hit.
[2023-03-23 11:42:51] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-23 11:42:51] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2023-03-23 11:42:51] [INFO ] Invariant cache hit.
[2023-03-23 11:42:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-23 11:42:52] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
[2023-03-23 11:42:52] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-23 11:42:52] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2023-03-23 11:42:52] [INFO ] Invariant cache hit.
[2023-03-23 11:42:52] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1770 ms. Remains : 428/428 places, 1232/1232 transitions.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 428 transition count 683
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 564 place count 413 transition count 683
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 564 place count 413 transition count 611
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 708 place count 341 transition count 611
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 964 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1028 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1092 place count 149 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1093 place count 149 transition count 354
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1156 place count 86 transition count 228
Iterating global reduction 3 with 63 rules applied. Total rules applied 1219 place count 86 transition count 228
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1282 place count 23 transition count 102
Iterating global reduction 3 with 63 rules applied. Total rules applied 1345 place count 23 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1408 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1408 place count 23 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 22 transition count 38
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 4 with 2 rules applied. Total rules applied 1412 place count 21 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1414 place count 20 transition count 37
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1416 place count 20 transition count 35
Applied a total of 1416 rules in 28 ms. Remains 20 /428 variables (removed 408) and now considering 35/1232 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 20 cols
[2023-03-23 11:42:52] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 11:42:52] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:42:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 11:42:52] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:42:52] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:42:52] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 11:42:52] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 431 ms.
Product exploration explored 100000 steps with 0 reset in 412 ms.
Built C files in :
/tmp/ltsmin10109817365404531366
[2023-03-23 11:42:54] [INFO ] Too many transitions (1616) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:42:54] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10109817365404531366
Running compilation step : cd /tmp/ltsmin10109817365404531366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2949 ms.
Running link step : cd /tmp/ltsmin10109817365404531366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10109817365404531366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6390116894929607993.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 72 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2023-03-23 11:43:09] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2023-03-23 11:43:09] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-23 11:43:09] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-23 11:43:09] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-23 11:43:09] [INFO ] Invariant cache hit.
[2023-03-23 11:43:09] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 11:43:11] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
[2023-03-23 11:43:11] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-23 11:43:11] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-23 11:43:11] [INFO ] Invariant cache hit.
[2023-03-23 11:43:11] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2776 ms. Remains : 620/620 places, 1616/1616 transitions.
Built C files in :
/tmp/ltsmin2065801503934984220
[2023-03-23 11:43:11] [INFO ] Too many transitions (1616) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:43:12] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2065801503934984220
Running compilation step : cd /tmp/ltsmin2065801503934984220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2794 ms.
Running link step : cd /tmp/ltsmin2065801503934984220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2065801503934984220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17127362435758650565.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 11:43:27] [INFO ] Flatten gal took : 90 ms
[2023-03-23 11:43:27] [INFO ] Flatten gal took : 76 ms
[2023-03-23 11:43:27] [INFO ] Time to serialize gal into /tmp/LTL8312141042383834131.gal : 35 ms
[2023-03-23 11:43:27] [INFO ] Time to serialize properties into /tmp/LTL3269572769024873421.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8312141042383834131.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8262840684996804567.hoa' '-atoms' '/tmp/LTL3269572769024873421.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3269572769024873421.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8262840684996804567.hoa
Detected timeout of ITS tools.
[2023-03-23 11:43:42] [INFO ] Flatten gal took : 126 ms
[2023-03-23 11:43:42] [INFO ] Flatten gal took : 79 ms
[2023-03-23 11:43:42] [INFO ] Time to serialize gal into /tmp/LTL4157592415946459872.gal : 20 ms
[2023-03-23 11:43:42] [INFO ] Time to serialize properties into /tmp/LTL8395333029813022777.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4157592415946459872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8395333029813022777.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(l1024<=0)")))||(G("(l1978>=3)")))))
Formula 0 simplified : G(FG!"(l1024<=0)" & F!"(l1978>=3)")
Detected timeout of ITS tools.
[2023-03-23 11:43:57] [INFO ] Flatten gal took : 76 ms
[2023-03-23 11:43:57] [INFO ] Applying decomposition
[2023-03-23 11:43:58] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15820974479858912937.txt' '-o' '/tmp/graph15820974479858912937.bin' '-w' '/tmp/graph15820974479858912937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15820974479858912937.bin' '-l' '-1' '-v' '-w' '/tmp/graph15820974479858912937.weights' '-q' '0' '-e' '0.001'
[2023-03-23 11:43:58] [INFO ] Decomposing Gal with order
[2023-03-23 11:43:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 11:43:58] [INFO ] Removed a total of 2691 redundant transitions.
[2023-03-23 11:43:58] [INFO ] Flatten gal took : 345 ms
[2023-03-23 11:43:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1089 labels/synchronizations in 183 ms.
[2023-03-23 11:43:59] [INFO ] Time to serialize gal into /tmp/LTL13318417515591348668.gal : 28 ms
[2023-03-23 11:43:59] [INFO ] Time to serialize properties into /tmp/LTL9056453772259812962.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13318417515591348668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9056453772259812962.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(i0.u150.l1024<=0)")))||(G("(i26.i1.i1.u164.l1978>=3)")))))
Formula 0 simplified : G(FG!"(i0.u150.l1024<=0)" & F!"(i26.i1.i1.u164.l1978>=3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9063805038894142545
[2023-03-23 11:44:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9063805038894142545
Running compilation step : cd /tmp/ltsmin9063805038894142545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2691 ms.
Running link step : cd /tmp/ltsmin9063805038894142545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9063805038894142545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-04 finished in 122739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0)) U (p1||F(p2))))))'
Support contains 4 out of 678 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 678/678 places, 1768/1768 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 671 transition count 1754
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 671 transition count 1754
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 671 transition count 1750
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 666 transition count 1738
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 666 transition count 1738
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 661 transition count 1724
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 661 transition count 1724
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 655 transition count 1706
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 655 transition count 1706
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 649 transition count 1690
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 649 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 69 place count 642 transition count 1672
Iterating global reduction 1 with 7 rules applied. Total rules applied 76 place count 642 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 83 place count 635 transition count 1654
Iterating global reduction 1 with 7 rules applied. Total rules applied 90 place count 635 transition count 1654
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 97 place count 628 transition count 1638
Iterating global reduction 1 with 7 rules applied. Total rules applied 104 place count 628 transition count 1638
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 622 transition count 1624
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 121 place count 617 transition count 1614
Iterating global reduction 1 with 5 rules applied. Total rules applied 126 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 614 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 135 place count 611 transition count 1602
Iterating global reduction 1 with 3 rules applied. Total rules applied 138 place count 611 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 610 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 610 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 609 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 609 transition count 1598
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 609 transition count 1596
Applied a total of 144 rules in 401 ms. Remains 609 /678 variables (removed 69) and now considering 1596/1768 (removed 172) transitions.
[2023-03-23 11:44:29] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2023-03-23 11:44:29] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-23 11:44:30] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-23 11:44:30] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2023-03-23 11:44:30] [INFO ] Invariant cache hit.
[2023-03-23 11:44:30] [INFO ] State equation strengthened by 266 read => feed constraints.
[2023-03-23 11:44:31] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2023-03-23 11:44:31] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-23 11:44:31] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2023-03-23 11:44:31] [INFO ] Invariant cache hit.
[2023-03-23 11:44:32] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 609/678 places, 1596/1768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2969 ms. Remains : 609/678 places, 1596/1768 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s41), p2:(LEQ s277 s523), p0:(LEQ 2 s522)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 405 ms.
Product exploration explored 100000 steps with 0 reset in 461 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/609 stabilizing places and 512/1596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 612 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 223213 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223213 steps, saw 144895 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 11:44:37] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2023-03-23 11:44:37] [INFO ] Invariant cache hit.
[2023-03-23 11:44:37] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 11:44:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:44:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:37] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 11:44:37] [INFO ] State equation strengthened by 266 read => feed constraints.
[2023-03-23 11:44:38] [INFO ] After 198ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 11:44:38] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-23 11:44:38] [INFO ] After 1073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Graph (complete) has 2662 edges and 609 vertex of which 420 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.0 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 420 transition count 1218
Applied a total of 379 rules in 53 ms. Remains 420 /609 variables (removed 189) and now considering 1218/1596 (removed 378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 420/609 places, 1218/1596 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 11:44:38] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
// Phase 1: matrix 691 rows 420 cols
[2023-03-23 11:44:38] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-23 11:44:38] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 11:44:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:39] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:39] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-23 11:44:39] [INFO ] After 84ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:39] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-23 11:44:39] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 420/420 places, 1218/1218 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 377328 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 377328 steps, saw 231381 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 11:44:42] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2023-03-23 11:44:42] [INFO ] Invariant cache hit.
[2023-03-23 11:44:42] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 11:44:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:42] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:42] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-23 11:44:42] [INFO ] After 74ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:42] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-23 11:44:42] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 420/420 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 49 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-23 11:44:43] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2023-03-23 11:44:43] [INFO ] Invariant cache hit.
[2023-03-23 11:44:43] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-23 11:44:43] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2023-03-23 11:44:43] [INFO ] Invariant cache hit.
[2023-03-23 11:44:43] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-23 11:44:44] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2023-03-23 11:44:44] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-23 11:44:44] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2023-03-23 11:44:44] [INFO ] Invariant cache hit.
[2023-03-23 11:44:44] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1558 ms. Remains : 420/420 places, 1218/1218 transitions.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 537 rules applied. Total rules applied 537 place count 420 transition count 681
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 548 place count 410 transition count 680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 409 transition count 680
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 549 place count 409 transition count 613
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 683 place count 342 transition count 613
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 937 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1001 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 1065 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1066 place count 151 transition count 357
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1066 place count 151 transition count 356
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1068 place count 150 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1131 place count 87 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 1194 place count 87 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1257 place count 24 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1320 place count 24 transition count 104
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 4 with 61 rules applied. Total rules applied 1381 place count 24 transition count 43
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 1383 place count 23 transition count 44
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1390 place count 23 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1391 place count 23 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1392 place count 23 transition count 36
Applied a total of 1392 rules in 25 ms. Remains 23 /420 variables (removed 397) and now considering 36/1218 (removed 1182) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 36 rows 23 cols
[2023-03-23 11:44:44] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 11:44:44] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 11:44:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:44] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:44:44] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:44] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-23 11:44:44] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 591 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 71 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2023-03-23 11:44:45] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2023-03-23 11:44:45] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-23 11:44:46] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-23 11:44:46] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2023-03-23 11:44:46] [INFO ] Invariant cache hit.
[2023-03-23 11:44:46] [INFO ] State equation strengthened by 266 read => feed constraints.
[2023-03-23 11:44:47] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 1839 ms to find 0 implicit places.
[2023-03-23 11:44:47] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-23 11:44:47] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2023-03-23 11:44:47] [INFO ] Invariant cache hit.
[2023-03-23 11:44:48] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2480 ms. Remains : 609/609 places, 1596/1596 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/609 stabilizing places and 512/1596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 457 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 11:44:48] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2023-03-23 11:44:48] [INFO ] Invariant cache hit.
[2023-03-23 11:44:48] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 11:44:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:44:49] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:49] [INFO ] State equation strengthened by 266 read => feed constraints.
[2023-03-23 11:44:49] [INFO ] After 93ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:49] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-23 11:44:49] [INFO ] After 683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Graph (complete) has 2662 edges and 609 vertex of which 420 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.1 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 420 transition count 1218
Applied a total of 379 rules in 45 ms. Remains 420 /609 variables (removed 189) and now considering 1218/1596 (removed 378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 420/609 places, 1218/1596 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 302937 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 302937 steps, saw 185769 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 11:44:52] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
// Phase 1: matrix 691 rows 420 cols
[2023-03-23 11:44:52] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-23 11:44:52] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 11:44:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:44:53] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:53] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-23 11:44:53] [INFO ] After 81ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:53] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-23 11:44:53] [INFO ] After 469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 420/420 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-23 11:44:53] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2023-03-23 11:44:53] [INFO ] Invariant cache hit.
[2023-03-23 11:44:53] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-23 11:44:53] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2023-03-23 11:44:53] [INFO ] Invariant cache hit.
[2023-03-23 11:44:53] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-23 11:44:54] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2023-03-23 11:44:54] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-23 11:44:54] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2023-03-23 11:44:54] [INFO ] Invariant cache hit.
[2023-03-23 11:44:54] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1589 ms. Remains : 420/420 places, 1218/1218 transitions.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 537 rules applied. Total rules applied 537 place count 420 transition count 681
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 548 place count 410 transition count 680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 409 transition count 680
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 549 place count 409 transition count 613
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 683 place count 342 transition count 613
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 937 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1001 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 1065 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1066 place count 151 transition count 357
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1066 place count 151 transition count 356
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1068 place count 150 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1131 place count 87 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 1194 place count 87 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1257 place count 24 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1320 place count 24 transition count 104
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 4 with 61 rules applied. Total rules applied 1381 place count 24 transition count 43
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 1383 place count 23 transition count 44
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1390 place count 23 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1391 place count 23 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1392 place count 23 transition count 36
Applied a total of 1392 rules in 23 ms. Remains 23 /420 variables (removed 397) and now considering 36/1218 (removed 1182) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 36 rows 23 cols
[2023-03-23 11:44:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 11:44:54] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 11:44:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:55] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:44:55] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:55] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 11:44:55] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 679 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 394 ms.
Product exploration explored 100000 steps with 0 reset in 422 ms.
Built C files in :
/tmp/ltsmin5058365607575558094
[2023-03-23 11:44:56] [INFO ] Too many transitions (1596) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:44:56] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5058365607575558094
Running compilation step : cd /tmp/ltsmin5058365607575558094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2743 ms.
Running link step : cd /tmp/ltsmin5058365607575558094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5058365607575558094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1860628511564553163.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 69 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2023-03-23 11:45:11] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2023-03-23 11:45:12] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 11:45:12] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-23 11:45:12] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2023-03-23 11:45:12] [INFO ] Invariant cache hit.
[2023-03-23 11:45:12] [INFO ] State equation strengthened by 266 read => feed constraints.
[2023-03-23 11:45:13] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
[2023-03-23 11:45:13] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 11:45:13] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2023-03-23 11:45:13] [INFO ] Invariant cache hit.
[2023-03-23 11:45:14] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2471 ms. Remains : 609/609 places, 1596/1596 transitions.
Built C files in :
/tmp/ltsmin9778756706943719834
[2023-03-23 11:45:14] [INFO ] Too many transitions (1596) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:45:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9778756706943719834
Running compilation step : cd /tmp/ltsmin9778756706943719834;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2735 ms.
Running link step : cd /tmp/ltsmin9778756706943719834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9778756706943719834;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14023370907118801834.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 11:45:29] [INFO ] Flatten gal took : 82 ms
[2023-03-23 11:45:29] [INFO ] Flatten gal took : 66 ms
[2023-03-23 11:45:29] [INFO ] Time to serialize gal into /tmp/LTL8197091590291414954.gal : 36 ms
[2023-03-23 11:45:29] [INFO ] Time to serialize properties into /tmp/LTL13427047660307140884.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8197091590291414954.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13322119287644682862.hoa' '-atoms' '/tmp/LTL13427047660307140884.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13427047660307140884.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13322119287644682862.hoa
Detected timeout of ITS tools.
[2023-03-23 11:45:44] [INFO ] Flatten gal took : 38 ms
[2023-03-23 11:45:44] [INFO ] Flatten gal took : 36 ms
[2023-03-23 11:45:44] [INFO ] Time to serialize gal into /tmp/LTL158324674979189410.gal : 9 ms
[2023-03-23 11:45:44] [INFO ] Time to serialize properties into /tmp/LTL7829922581319137390.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL158324674979189410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7829922581319137390.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F("(p1179>=2)")))U(("(l390>=3)")||(F("(l655<=l1199)")))))))
Formula 0 simplified : GF(XG!"(p1179>=2)" R (!"(l390>=3)" & G!"(l655<=l1199)"))
Detected timeout of ITS tools.
[2023-03-23 11:45:59] [INFO ] Flatten gal took : 33 ms
[2023-03-23 11:45:59] [INFO ] Applying decomposition
[2023-03-23 11:45:59] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18055795366852979011.txt' '-o' '/tmp/graph18055795366852979011.bin' '-w' '/tmp/graph18055795366852979011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18055795366852979011.bin' '-l' '-1' '-v' '-w' '/tmp/graph18055795366852979011.weights' '-q' '0' '-e' '0.001'
[2023-03-23 11:46:00] [INFO ] Decomposing Gal with order
[2023-03-23 11:46:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 11:46:00] [INFO ] Removed a total of 551 redundant transitions.
[2023-03-23 11:46:00] [INFO ] Flatten gal took : 80 ms
[2023-03-23 11:46:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 258 labels/synchronizations in 10 ms.
[2023-03-23 11:46:00] [INFO ] Time to serialize gal into /tmp/LTL9569005719987215552.gal : 8 ms
[2023-03-23 11:46:00] [INFO ] Time to serialize properties into /tmp/LTL16998324600284598718.ltl : 36 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9569005719987215552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16998324600284598718.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F("(gi0.gu0.p1179>=2)")))U(("(gi0.gu0.l390>=3)")||(F("(gu27.l655<=gu27.l1199)")))))))
Formula 0 simplified : GF(XG!"(gi0.gu0.p1179>=2)" R (!"(gi0.gu0.l390>=3)" & G!"(gu27.l655<=gu27.l1199)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11478282308743566417
[2023-03-23 11:46:15] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11478282308743566417
Running compilation step : cd /tmp/ltsmin11478282308743566417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2794 ms.
Running link step : cd /tmp/ltsmin11478282308743566417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11478282308743566417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp0==true))) U ((LTLAPp1==true)||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-05 finished in 121129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(!p0))))))'
Support contains 2 out of 678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 678/678 places, 1768/1768 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 671 transition count 1754
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 671 transition count 1754
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 671 transition count 1748
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 665 transition count 1734
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 665 transition count 1734
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 661 transition count 1722
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 661 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 656 transition count 1706
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 656 transition count 1706
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 651 transition count 1692
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 651 transition count 1692
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 646 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 646 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 641 transition count 1672
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 641 transition count 1672
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 635 transition count 1656
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 635 transition count 1656
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 630 transition count 1642
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 630 transition count 1642
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 626 transition count 1634
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 626 transition count 1634
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 624 transition count 1630
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 624 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 622 transition count 1626
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 622 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 620 transition count 1622
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 620 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 618 transition count 1618
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 618 transition count 1618
Applied a total of 126 rules in 221 ms. Remains 618 /678 variables (removed 60) and now considering 1618/1768 (removed 150) transitions.
[2023-03-23 11:46:30] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2023-03-23 11:46:30] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 11:46:31] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-23 11:46:31] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2023-03-23 11:46:31] [INFO ] Invariant cache hit.
[2023-03-23 11:46:31] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-23 11:46:33] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
[2023-03-23 11:46:33] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2023-03-23 11:46:33] [INFO ] Invariant cache hit.
[2023-03-23 11:46:33] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 618/678 places, 1618/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3146 ms. Remains : 618/678 places, 1618/1768 transitions.
Stuttering acceptance computed with spot in 119 ms :[false, false, p0]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s549 s519)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24999 reset in 527 ms.
Product exploration explored 100000 steps with 24970 reset in 530 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[p0, false, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 536953 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 536953 steps, saw 348514 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 11:46:38] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2023-03-23 11:46:38] [INFO ] Invariant cache hit.
[2023-03-23 11:46:38] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:46:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:46:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:46:38] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:38] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-23 11:46:38] [INFO ] After 66ms SMT Verify possible using 267 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:38] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-23 11:46:38] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1618/1618 transitions.
Graph (complete) has 2695 edges and 618 vertex of which 426 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 426 transition count 1234
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 426 transition count 1230
Applied a total of 389 rules in 87 ms. Remains 426 /618 variables (removed 192) and now considering 1230/1618 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 426/618 places, 1230/1618 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished Best-First random walk after 5959 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1489 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 110 ms :[p0, false, p0]
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1618/1618 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 618 transition count 1614
Applied a total of 4 rules in 162 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1618 (removed 4) transitions.
[2023-03-23 11:46:39] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2023-03-23 11:46:39] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 11:46:39] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-23 11:46:39] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-23 11:46:39] [INFO ] Invariant cache hit.
[2023-03-23 11:46:40] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-23 11:46:41] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1869 ms to find 0 implicit places.
[2023-03-23 11:46:41] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-23 11:46:41] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-23 11:46:41] [INFO ] Invariant cache hit.
[2023-03-23 11:46:41] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/618 places, 1614/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2602 ms. Remains : 618/618 places, 1614/1618 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[p0, false, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 119 steps, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Probabilistic random walk after 119 steps, saw 97 distinct states, run finished after 4 ms. (steps per millisecond=29 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 122 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 112 ms :[p0, false, p0]
Product exploration explored 100000 steps with 33410 reset in 562 ms.
Product exploration explored 100000 steps with 33196 reset in 565 ms.
Built C files in :
/tmp/ltsmin13526356422925718632
[2023-03-23 11:46:44] [INFO ] Too many transitions (1614) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:46:44] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13526356422925718632
Running compilation step : cd /tmp/ltsmin13526356422925718632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2924 ms.
Running link step : cd /tmp/ltsmin13526356422925718632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13526356422925718632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11028593669972978660.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Applied a total of 0 rules in 72 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2023-03-23 11:46:59] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-23 11:46:59] [INFO ] Invariant cache hit.
[2023-03-23 11:46:59] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-23 11:46:59] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-23 11:46:59] [INFO ] Invariant cache hit.
[2023-03-23 11:46:59] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-23 11:47:01] [INFO ] Implicit Places using invariants and state equation in 1773 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
[2023-03-23 11:47:01] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-23 11:47:01] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-23 11:47:01] [INFO ] Invariant cache hit.
[2023-03-23 11:47:01] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2799 ms. Remains : 618/618 places, 1614/1614 transitions.
Built C files in :
/tmp/ltsmin11827014110037113011
[2023-03-23 11:47:01] [INFO ] Too many transitions (1614) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:47:01] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11827014110037113011
Running compilation step : cd /tmp/ltsmin11827014110037113011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2891 ms.
Running link step : cd /tmp/ltsmin11827014110037113011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11827014110037113011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12295559229424662697.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 11:47:16] [INFO ] Flatten gal took : 63 ms
[2023-03-23 11:47:17] [INFO ] Flatten gal took : 59 ms
[2023-03-23 11:47:17] [INFO ] Time to serialize gal into /tmp/LTL13851033471584341036.gal : 7 ms
[2023-03-23 11:47:17] [INFO ] Time to serialize properties into /tmp/LTL11335420788397789643.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13851033471584341036.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12402654012783676076.hoa' '-atoms' '/tmp/LTL11335420788397789643.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11335420788397789643.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12402654012783676076.hoa
Detected timeout of ITS tools.
[2023-03-23 11:47:32] [INFO ] Flatten gal took : 38 ms
[2023-03-23 11:47:32] [INFO ] Flatten gal took : 39 ms
[2023-03-23 11:47:32] [INFO ] Time to serialize gal into /tmp/LTL10824702869879264164.gal : 7 ms
[2023-03-23 11:47:32] [INFO ] Time to serialize properties into /tmp/LTL14397779771283680037.ltl : 9 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10824702869879264164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14397779771283680037.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(l2303>l1034)")||(X(F("(l2303<=l1034)")))))))
Formula 0 simplified : XF(!"(l2303>l1034)" & XG!"(l2303<=l1034)")
Detected timeout of ITS tools.
[2023-03-23 11:47:47] [INFO ] Flatten gal took : 38 ms
[2023-03-23 11:47:47] [INFO ] Applying decomposition
[2023-03-23 11:47:47] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4024337935664588216.txt' '-o' '/tmp/graph4024337935664588216.bin' '-w' '/tmp/graph4024337935664588216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4024337935664588216.bin' '-l' '-1' '-v' '-w' '/tmp/graph4024337935664588216.weights' '-q' '0' '-e' '0.001'
[2023-03-23 11:47:47] [INFO ] Decomposing Gal with order
[2023-03-23 11:47:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 11:47:47] [INFO ] Removed a total of 415 redundant transitions.
[2023-03-23 11:47:47] [INFO ] Flatten gal took : 83 ms
[2023-03-23 11:47:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 8 ms.
[2023-03-23 11:47:47] [INFO ] Time to serialize gal into /tmp/LTL9333532973877817254.gal : 6 ms
[2023-03-23 11:47:47] [INFO ] Time to serialize properties into /tmp/LTL4806007492457779382.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9333532973877817254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4806007492457779382.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu47.l2303>gu47.l1034)")||(X(F("(gu47.l2303<=gu47.l1034)")))))))
Formula 0 simplified : XF(!"(gu47.l2303>gu47.l1034)" & XG!"(gu47.l2303<=gu47.l1034)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1924549804749564470
[2023-03-23 11:48:02] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1924549804749564470
Running compilation step : cd /tmp/ltsmin1924549804749564470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2841 ms.
Running link step : cd /tmp/ltsmin1924549804749564470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1924549804749564470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-07 finished in 107289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 678/678 places, 1768/1768 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 669 transition count 1750
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 669 transition count 1750
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 669 transition count 1742
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 662 transition count 1726
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 662 transition count 1726
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 657 transition count 1712
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 657 transition count 1712
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 651 transition count 1694
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 651 transition count 1694
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 645 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 645 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 638 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 638 transition count 1660
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 95 place count 631 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 102 place count 631 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 109 place count 624 transition count 1626
Iterating global reduction 1 with 7 rules applied. Total rules applied 116 place count 624 transition count 1626
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 618 transition count 1612
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 618 transition count 1612
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 133 place count 613 transition count 1602
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 613 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 141 place count 610 transition count 1596
Iterating global reduction 1 with 3 rules applied. Total rules applied 144 place count 610 transition count 1596
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 147 place count 607 transition count 1590
Iterating global reduction 1 with 3 rules applied. Total rules applied 150 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 605 transition count 1586
Applied a total of 154 rules in 200 ms. Remains 605 /678 variables (removed 73) and now considering 1586/1768 (removed 182) transitions.
[2023-03-23 11:48:18] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-23 11:48:18] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 11:48:18] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-23 11:48:18] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-23 11:48:18] [INFO ] Invariant cache hit.
[2023-03-23 11:48:18] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-23 11:48:20] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 2599 ms to find 0 implicit places.
[2023-03-23 11:48:20] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-23 11:48:20] [INFO ] Invariant cache hit.
[2023-03-23 11:48:21] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/678 places, 1586/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3318 ms. Remains : 605/678 places, 1586/1768 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s153)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 654 ms.
Product exploration explored 100000 steps with 50000 reset in 647 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1586 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c008-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLCardinality-09 finished in 4842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 678/678 places, 1768/1768 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 670 transition count 1752
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 670 transition count 1752
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 670 transition count 1744
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 664 transition count 1730
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 664 transition count 1730
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 660 transition count 1720
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 660 transition count 1720
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 655 transition count 1706
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 655 transition count 1706
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 650 transition count 1692
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 650 transition count 1692
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 644 transition count 1676
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 644 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 638 transition count 1660
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 638 transition count 1660
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 632 transition count 1646
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 632 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 627 transition count 1634
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 627 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 622 transition count 1624
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 622 transition count 1624
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 619 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 616 transition count 1612
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 614 transition count 1608
Applied a total of 136 rules in 221 ms. Remains 614 /678 variables (removed 64) and now considering 1608/1768 (removed 160) transitions.
[2023-03-23 11:48:22] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-23 11:48:22] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 11:48:23] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-23 11:48:23] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 11:48:23] [INFO ] Invariant cache hit.
[2023-03-23 11:48:23] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:48:25] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
[2023-03-23 11:48:25] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 11:48:25] [INFO ] Invariant cache hit.
[2023-03-23 11:48:25] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/678 places, 1608/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2998 ms. Remains : 614/678 places, 1608/1768 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s535 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-12 finished in 3110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(!p0)))))'
Support contains 1 out of 678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 678/678 places, 1768/1768 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 670 transition count 1752
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 670 transition count 1752
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 670 transition count 1746
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 664 transition count 1732
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 664 transition count 1732
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 660 transition count 1720
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 660 transition count 1720
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 656 transition count 1710
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 656 transition count 1710
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 652 transition count 1702
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 652 transition count 1702
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 647 transition count 1688
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 647 transition count 1688
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 642 transition count 1674
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 642 transition count 1674
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 636 transition count 1658
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 636 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 631 transition count 1644
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 631 transition count 1644
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 627 transition count 1636
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 623 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 623 transition count 1628
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 619 transition count 1620
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 615 transition count 1612
Applied a total of 132 rules in 209 ms. Remains 615 /678 variables (removed 63) and now considering 1612/1768 (removed 156) transitions.
[2023-03-23 11:48:25] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-23 11:48:25] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-23 11:48:26] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-23 11:48:26] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 11:48:26] [INFO ] Invariant cache hit.
[2023-03-23 11:48:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:48:27] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
[2023-03-23 11:48:27] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 11:48:27] [INFO ] Invariant cache hit.
[2023-03-23 11:48:28] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/678 places, 1612/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2681 ms. Remains : 615/678 places, 1612/1768 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, false, false, p0]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s544 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 651 ms.
Product exploration explored 100000 steps with 50000 reset in 665 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c008-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLCardinality-14 finished in 4224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0)) U (p1||F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(!p0))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c008-LTLCardinality-07
Stuttering acceptance computed with spot in 110 ms :[false, false, p0]
Support contains 2 out of 678 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 678/678 places, 1768/1768 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 671 transition count 1754
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 671 transition count 1754
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 671 transition count 1748
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 665 transition count 1734
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 665 transition count 1734
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 661 transition count 1722
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 661 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 656 transition count 1706
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 656 transition count 1706
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 651 transition count 1692
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 651 transition count 1692
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 646 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 646 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 641 transition count 1672
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 641 transition count 1672
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 635 transition count 1656
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 635 transition count 1656
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 630 transition count 1642
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 630 transition count 1642
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 626 transition count 1634
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 626 transition count 1634
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 624 transition count 1630
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 624 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 622 transition count 1626
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 622 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 620 transition count 1622
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 620 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 618 transition count 1618
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 618 transition count 1618
Applied a total of 126 rules in 261 ms. Remains 618 /678 variables (removed 60) and now considering 1618/1768 (removed 150) transitions.
[2023-03-23 11:48:30] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2023-03-23 11:48:30] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-23 11:48:31] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-23 11:48:31] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2023-03-23 11:48:31] [INFO ] Invariant cache hit.
[2023-03-23 11:48:31] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-23 11:48:32] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
[2023-03-23 11:48:32] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2023-03-23 11:48:32] [INFO ] Invariant cache hit.
[2023-03-23 11:48:33] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 618/678 places, 1618/1768 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2673 ms. Remains : 618/678 places, 1618/1768 transitions.
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s549 s519)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25129 reset in 529 ms.
Product exploration explored 100000 steps with 25005 reset in 530 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[p0, false, p0]
Finished random walk after 6221 steps, including 1 resets, run visited all 1 properties in 21 ms. (steps per millisecond=296 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 122 ms :[p0, false, p0]
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1618/1618 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 618 transition count 1614
Applied a total of 4 rules in 148 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1618 (removed 4) transitions.
[2023-03-23 11:48:35] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2023-03-23 11:48:35] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 11:48:35] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-23 11:48:35] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-23 11:48:35] [INFO ] Invariant cache hit.
[2023-03-23 11:48:35] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-23 11:48:37] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
[2023-03-23 11:48:37] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-23 11:48:37] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-23 11:48:37] [INFO ] Invariant cache hit.
[2023-03-23 11:48:37] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/618 places, 1614/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2630 ms. Remains : 618/618 places, 1614/1618 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[p0, false, p0]
Finished random walk after 7376 steps, including 2 resets, run visited all 1 properties in 21 ms. (steps per millisecond=351 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 100 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 96 ms :[p0, false, p0]
Product exploration explored 100000 steps with 33438 reset in 595 ms.
Product exploration explored 100000 steps with 33264 reset in 605 ms.
Built C files in :
/tmp/ltsmin15356554174446027864
[2023-03-23 11:48:39] [INFO ] Too many transitions (1614) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:48:39] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15356554174446027864
Running compilation step : cd /tmp/ltsmin15356554174446027864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2875 ms.
Running link step : cd /tmp/ltsmin15356554174446027864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15356554174446027864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1699634283509723295.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Applied a total of 0 rules in 75 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2023-03-23 11:48:54] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-23 11:48:54] [INFO ] Invariant cache hit.
[2023-03-23 11:48:55] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-23 11:48:55] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-23 11:48:55] [INFO ] Invariant cache hit.
[2023-03-23 11:48:55] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-23 11:48:56] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2023-03-23 11:48:56] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-23 11:48:56] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-23 11:48:56] [INFO ] Invariant cache hit.
[2023-03-23 11:48:57] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2456 ms. Remains : 618/618 places, 1614/1614 transitions.
Built C files in :
/tmp/ltsmin18279641389420839149
[2023-03-23 11:48:57] [INFO ] Too many transitions (1614) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:48:57] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18279641389420839149
Running compilation step : cd /tmp/ltsmin18279641389420839149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2845 ms.
Running link step : cd /tmp/ltsmin18279641389420839149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18279641389420839149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4198958811754707816.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 11:49:12] [INFO ] Flatten gal took : 33 ms
[2023-03-23 11:49:12] [INFO ] Flatten gal took : 34 ms
[2023-03-23 11:49:12] [INFO ] Time to serialize gal into /tmp/LTL1723073028148755108.gal : 6 ms
[2023-03-23 11:49:12] [INFO ] Time to serialize properties into /tmp/LTL4772718845931696251.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1723073028148755108.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4282461718940300071.hoa' '-atoms' '/tmp/LTL4772718845931696251.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4772718845931696251.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4282461718940300071.hoa
Detected timeout of ITS tools.
[2023-03-23 11:49:27] [INFO ] Flatten gal took : 34 ms
[2023-03-23 11:49:27] [INFO ] Flatten gal took : 33 ms
[2023-03-23 11:49:27] [INFO ] Time to serialize gal into /tmp/LTL1139041954725931717.gal : 5 ms
[2023-03-23 11:49:27] [INFO ] Time to serialize properties into /tmp/LTL455566008029076235.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1139041954725931717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL455566008029076235.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G(("(l2303>l1034)")||(X(F("(l2303<=l1034)")))))))
Formula 0 simplified : XF(!"(l2303>l1034)" & XG!"(l2303<=l1034)")
Detected timeout of ITS tools.
[2023-03-23 11:49:42] [INFO ] Flatten gal took : 37 ms
[2023-03-23 11:49:42] [INFO ] Applying decomposition
[2023-03-23 11:49:42] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12373187238112310944.txt' '-o' '/tmp/graph12373187238112310944.bin' '-w' '/tmp/graph12373187238112310944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12373187238112310944.bin' '-l' '-1' '-v' '-w' '/tmp/graph12373187238112310944.weights' '-q' '0' '-e' '0.001'
[2023-03-23 11:49:42] [INFO ] Decomposing Gal with order
[2023-03-23 11:49:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 11:49:42] [INFO ] Removed a total of 514 redundant transitions.
[2023-03-23 11:49:42] [INFO ] Flatten gal took : 88 ms
[2023-03-23 11:49:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 8 ms.
[2023-03-23 11:49:42] [INFO ] Time to serialize gal into /tmp/LTL1785607631480406701.gal : 6 ms
[2023-03-23 11:49:42] [INFO ] Time to serialize properties into /tmp/LTL2394656417952794029.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1785607631480406701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2394656417952794029.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu58.l2303>gu58.l1034)")||(X(F("(gu58.l2303<=gu58.l1034)")))))))
Formula 0 simplified : XF(!"(gu58.l2303>gu58.l1034)" & XG!"(gu58.l2303<=gu58.l1034)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1111462043825086532
[2023-03-23 11:49:57] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1111462043825086532
Running compilation step : cd /tmp/ltsmin1111462043825086532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2829 ms.
Running link step : cd /tmp/ltsmin1111462043825086532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1111462043825086532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-07 finished in 102734 ms.
[2023-03-23 11:50:13] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3432243215468781886
[2023-03-23 11:50:13] [INFO ] Too many transitions (1768) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:50:13] [INFO ] Applying decomposition
[2023-03-23 11:50:13] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3432243215468781886
Running compilation step : cd /tmp/ltsmin3432243215468781886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-23 11:50:13] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3004304180376698517.txt' '-o' '/tmp/graph3004304180376698517.bin' '-w' '/tmp/graph3004304180376698517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3004304180376698517.bin' '-l' '-1' '-v' '-w' '/tmp/graph3004304180376698517.weights' '-q' '0' '-e' '0.001'
[2023-03-23 11:50:13] [INFO ] Decomposing Gal with order
[2023-03-23 11:50:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 11:50:13] [INFO ] Removed a total of 589 redundant transitions.
[2023-03-23 11:50:13] [INFO ] Flatten gal took : 83 ms
[2023-03-23 11:50:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 292 labels/synchronizations in 8 ms.
[2023-03-23 11:50:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality741958062555610272.gal : 7 ms
[2023-03-23 11:50:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality7787834399228247281.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality741958062555610272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7787834399228247281.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 3 LTL properties
Checking formula 0 : !((F((G(F("(gi0.gu1.l1024<=0)")))||(G("(gi0.gu1.l1978>=3)")))))
Formula 0 simplified : G(FG!"(gi0.gu1.l1024<=0)" & F!"(gi0.gu1.l1978>=3)")
Compilation finished in 3251 ms.
Running link step : cd /tmp/ltsmin3432243215468781886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3432243215468781886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin3432243215468781886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3432243215468781886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-23 12:12:59] [INFO ] Flatten gal took : 248 ms
[2023-03-23 12:12:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality18288479003009123318.gal : 77 ms
[2023-03-23 12:12:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality13352092601259973178.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18288479003009123318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13352092601259973178.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !((F((G(F("(l1024<=0)")))||(G("(l1978>=3)")))))
Formula 0 simplified : G(FG!"(l1024<=0)" & F!"(l1978>=3)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.022: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.048: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.048: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.052: LTL layer: formula: <>([]((X(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))
pins2lts-mc-linux64( 0/ 8), 0.053: "<>([]((X(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.053: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.056: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.056: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.074: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.077: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.078: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.080: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.074: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.096: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.074: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.096: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.077: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.096: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.077: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.096: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.105: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.119: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.125: buchi has 4 states
pins2lts-mc-linux64( 2/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.130: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.133: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.420: There are 1775 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.420: State length is 679, there are 1777 groups
pins2lts-mc-linux64( 0/ 8), 1.420: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.420: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.420: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.421: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.647: [Blue] ~120 levels ~960 states ~5192 transitions
pins2lts-mc-linux64( 0/ 8), 1.942: [Blue] ~240 levels ~1920 states ~10416 transitions
pins2lts-mc-linux64( 0/ 8), 2.738: [Blue] ~480 levels ~3840 states ~21848 transitions
pins2lts-mc-linux64( 0/ 8), 3.937: [Blue] ~960 levels ~7680 states ~44704 transitions
pins2lts-mc-linux64( 0/ 8), 7.143: [Blue] ~1920 levels ~15360 states ~90400 transitions
pins2lts-mc-linux64( 0/ 8), 12.738: [Blue] ~3840 levels ~30720 states ~181952 transitions
pins2lts-mc-linux64( 0/ 8), 22.298: [Blue] ~7680 levels ~61440 states ~365056 transitions
pins2lts-mc-linux64( 1/ 8), 37.564: [Blue] ~15360 levels ~122880 states ~441632 transitions
pins2lts-mc-linux64( 1/ 8), 60.160: [Blue] ~30720 levels ~245760 states ~882560 transitions
pins2lts-mc-linux64( 1/ 8), 89.288: [Blue] ~61440 levels ~491520 states ~1764408 transitions
pins2lts-mc-linux64( 0/ 8), 138.315: [Blue] ~122880 levels ~983040 states ~5858288 transitions
pins2lts-mc-linux64( 0/ 8), 232.958: [Blue] ~245760 levels ~1966080 states ~11717568 transitions
pins2lts-mc-linux64( 0/ 8), 383.196: [Blue] ~491520 levels ~3932160 states ~23436168 transitions
pins2lts-mc-linux64( 4/ 8), 387.976: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 388.221:
pins2lts-mc-linux64( 0/ 8), 388.222: Explored 3768034 states 24894563 transitions, fanout: 6.607
pins2lts-mc-linux64( 0/ 8), 388.222: Total exploration time 386.760 sec (386.520 sec minimum, 386.631 sec on average)
pins2lts-mc-linux64( 0/ 8), 388.222: States per second: 9743, Transitions per second: 64367
pins2lts-mc-linux64( 0/ 8), 388.222:
pins2lts-mc-linux64( 0/ 8), 388.222: State space has 22899601 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 388.222: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 388.222: blue states: 3768034 (16.45%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 388.222: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 388.222: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 388.222:
pins2lts-mc-linux64( 0/ 8), 388.222: Total memory used for local state coloring: 57.5MB
pins2lts-mc-linux64( 0/ 8), 388.222:
pins2lts-mc-linux64( 0/ 8), 388.222: Queue width: 8B, total height: 3768034, memory: 28.75MB
pins2lts-mc-linux64( 0/ 8), 388.222: Tree memory: 430.7MB, 19.7 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 388.222: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 388.222: Stored 1795 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 388.222: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 388.222: Est. total memory use: 459.5MB (~1052.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3432243215468781886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3432243215468781886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-23 12:35:55] [INFO ] Flatten gal took : 454 ms
[2023-03-23 12:35:57] [INFO ] Input system was already deterministic with 1768 transitions.
[2023-03-23 12:35:57] [INFO ] Transformed 678 places.
[2023-03-23 12:35:57] [INFO ] Transformed 1768 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 12:35:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality13490273520616394573.gal : 18 ms
[2023-03-23 12:35:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality4767519543660261558.ltl : 2 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13490273520616394573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4767519543660261558.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F("(l1024<=0)")))||(G("(l1978>=3)")))))
Formula 0 simplified : G(FG!"(l1024<=0)" & F!"(l1978>=3)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7598372 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15922356 kB
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-c008"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c008, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838850800731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;