Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690700660.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANConstruction-PT-060, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690700660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 22:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 25 22:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 219K Feb 25 22:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.4M 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 CANConstruction-PT-060-LTLFireability-00
FORMULA_NAME CANConstruction-PT-060-LTLFireability-01
FORMULA_NAME CANConstruction-PT-060-LTLFireability-02
FORMULA_NAME CANConstruction-PT-060-LTLFireability-03
FORMULA_NAME CANConstruction-PT-060-LTLFireability-04
FORMULA_NAME CANConstruction-PT-060-LTLFireability-05
FORMULA_NAME CANConstruction-PT-060-LTLFireability-06
FORMULA_NAME CANConstruction-PT-060-LTLFireability-07
FORMULA_NAME CANConstruction-PT-060-LTLFireability-08
FORMULA_NAME CANConstruction-PT-060-LTLFireability-09
FORMULA_NAME CANConstruction-PT-060-LTLFireability-10
FORMULA_NAME CANConstruction-PT-060-LTLFireability-11
FORMULA_NAME CANConstruction-PT-060-LTLFireability-12
FORMULA_NAME CANConstruction-PT-060-LTLFireability-13
FORMULA_NAME CANConstruction-PT-060-LTLFireability-14
FORMULA_NAME CANConstruction-PT-060-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678369159572

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 13:39:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 13:39:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:39:21] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2023-03-09 13:39:21] [INFO ] Transformed 7922 places.
[2023-03-09 13:39:21] [INFO ] Transformed 14880 transitions.
[2023-03-09 13:39:21] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-060-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 7922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Discarding 3466 places :
Symmetric choice reduction at 0 with 3466 rule applications. Total rules 3466 place count 4456 transition count 7948
Iterating global reduction 0 with 3466 rules applied. Total rules applied 6932 place count 4456 transition count 7948
Applied a total of 6932 rules in 2530 ms. Remains 4456 /7922 variables (removed 3466) and now considering 7948/14880 (removed 6932) transitions.
// Phase 1: matrix 7948 rows 4456 cols
[2023-03-09 13:39:25] [INFO ] Computed 121 place invariants in 216 ms
[2023-03-09 13:39:28] [INFO ] Implicit Places using invariants in 3472 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698, 712, 726, 740, 754, 768, 782, 796, 810, 824, 838]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 3544 ms to find 60 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4396/7922 places, 7948/14880 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 4336 transition count 7888
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 4336 transition count 7888
Applied a total of 120 rules in 902 ms. Remains 4336 /4396 variables (removed 60) and now considering 7888/7948 (removed 60) transitions.
// Phase 1: matrix 7888 rows 4336 cols
[2023-03-09 13:39:29] [INFO ] Computed 61 place invariants in 114 ms
[2023-03-09 13:39:32] [INFO ] Implicit Places using invariants in 3018 ms returned []
[2023-03-09 13:39:32] [INFO ] Invariant cache hit.
[2023-03-09 13:39:33] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 4390 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4336/7922 places, 7888/14880 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11370 ms. Remains : 4336/7922 places, 7888/14880 transitions.
Support contains 48 out of 4336 places after structural reductions.
[2023-03-09 13:39:34] [INFO ] Flatten gal took : 465 ms
[2023-03-09 13:39:34] [INFO ] Flatten gal took : 276 ms
[2023-03-09 13:39:35] [INFO ] Input system was already deterministic with 7888 transitions.
Support contains 45 out of 4336 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 30) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-09 13:39:36] [INFO ] Invariant cache hit.
[2023-03-09 13:39:37] [INFO ] [Real]Absence check using 61 positive place invariants in 109 ms returned sat
[2023-03-09 13:39:41] [INFO ] After 3507ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:8
[2023-03-09 13:39:41] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:39:42] [INFO ] After 1452ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 13:39:42] [INFO ] After 6516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 13:39:44] [INFO ] [Nat]Absence check using 61 positive place invariants in 125 ms returned sat
[2023-03-09 13:39:49] [INFO ] After 5092ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 13:39:55] [INFO ] After 5982ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-09 13:40:00] [INFO ] After 10924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3603 ms.
[2023-03-09 13:40:04] [INFO ] After 21681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 100 ms.
Support contains 12 out of 4336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 4336 transition count 7480
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 3928 transition count 7480
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 816 place count 3928 transition count 7420
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 936 place count 3868 transition count 7420
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 942 place count 3862 transition count 7408
Iterating global reduction 2 with 6 rules applied. Total rules applied 948 place count 3862 transition count 7408
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 953 place count 3862 transition count 7403
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 958 place count 3857 transition count 7403
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 4 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 1088 place count 3792 transition count 7338
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1090 place count 3792 transition count 7336
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1092 place count 3790 transition count 7336
Applied a total of 1092 rules in 2091 ms. Remains 3790 /4336 variables (removed 546) and now considering 7336/7888 (removed 552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2093 ms. Remains : 3790/4336 places, 7336/7888 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) 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
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 :1
Running SMT prover for 3 properties.
// Phase 1: matrix 7336 rows 3790 cols
[2023-03-09 13:40:07] [INFO ] Computed 61 place invariants in 117 ms
[2023-03-09 13:40:07] [INFO ] [Real]Absence check using 61 positive place invariants in 73 ms returned sat
[2023-03-09 13:40:10] [INFO ] After 2848ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-09 13:40:10] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:40:12] [INFO ] After 1367ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 13:40:12] [INFO ] After 4940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 13:40:12] [INFO ] [Nat]Absence check using 61 positive place invariants in 84 ms returned sat
[2023-03-09 13:40:15] [INFO ] After 2697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 13:40:17] [INFO ] After 1644ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 13:40:18] [INFO ] After 2969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 900 ms.
[2023-03-09 13:40:19] [INFO ] After 7370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 16 ms.
Support contains 1 out of 3790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3790/3790 places, 7336/7336 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3783 transition count 7322
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3783 transition count 7322
Applied a total of 14 rules in 1443 ms. Remains 3783 /3790 variables (removed 7) and now considering 7322/7336 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1444 ms. Remains : 3783/3790 places, 7322/7336 transitions.
Finished random walk after 9586 steps, including 22 resets, run visited all 1 properties in 177 ms. (steps per millisecond=54 )
FORMULA CANConstruction-PT-060-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 181 stabilizing places and 240 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 U (p1 U p0))||G(!X(X(p1))))) U p1))'
Support contains 3 out of 4336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4323 transition count 7862
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4323 transition count 7862
Applied a total of 26 rules in 1125 ms. Remains 4323 /4336 variables (removed 13) and now considering 7862/7888 (removed 26) transitions.
// Phase 1: matrix 7862 rows 4323 cols
[2023-03-09 13:40:22] [INFO ] Computed 61 place invariants in 83 ms
[2023-03-09 13:40:25] [INFO ] Implicit Places using invariants in 2497 ms returned []
[2023-03-09 13:40:25] [INFO ] Invariant cache hit.
[2023-03-09 13:40:27] [INFO ] Implicit Places using invariants and state equation in 2544 ms returned []
Implicit Place search using SMT with State Equation took 5048 ms to find 0 implicit places.
[2023-03-09 13:40:27] [INFO ] Invariant cache hit.
[2023-03-09 13:40:32] [INFO ] Dead Transitions using invariants and state equation in 4453 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4323/4336 places, 7862/7888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10632 ms. Remains : 4323/4336 places, 7862/7888 transitions.
Stuttering acceptance computed with spot in 491 ms :[p1, true, (AND p1 p0), p0, (NOT p1), false, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s30 1) (GEQ s83 1)), p0:(GEQ s3515 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2819 ms.
Product exploration explored 100000 steps with 33333 reset in 2350 ms.
Computed a total of 181 stabilizing places and 240 stable transitions
Computed a total of 181 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 12 factoid took 394 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-060-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-060-LTLFireability-01 finished in 16850 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(p0))'
Support contains 2 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 4336 transition count 7480
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 3928 transition count 7480
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 816 place count 3928 transition count 7420
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 936 place count 3868 transition count 7420
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 950 place count 3854 transition count 7392
Iterating global reduction 2 with 14 rules applied. Total rules applied 964 place count 3854 transition count 7392
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 976 place count 3854 transition count 7380
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 988 place count 3842 transition count 7380
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1106 place count 3783 transition count 7321
Applied a total of 1106 rules in 2017 ms. Remains 3783 /4336 variables (removed 553) and now considering 7321/7888 (removed 567) transitions.
// Phase 1: matrix 7321 rows 3783 cols
[2023-03-09 13:40:40] [INFO ] Computed 61 place invariants in 138 ms
[2023-03-09 13:40:44] [INFO ] Implicit Places using invariants in 4182 ms returned []
[2023-03-09 13:40:44] [INFO ] Invariant cache hit.
[2023-03-09 13:40:45] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:40:46] [INFO ] Implicit Places using invariants and state equation in 1855 ms returned []
Implicit Place search using SMT with State Equation took 6042 ms to find 0 implicit places.
[2023-03-09 13:40:47] [INFO ] Redundant transitions in 1094 ms returned []
[2023-03-09 13:40:47] [INFO ] Invariant cache hit.
[2023-03-09 13:40:51] [INFO ] Dead Transitions using invariants and state equation in 3758 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3783/4336 places, 7321/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12923 ms. Remains : 3783/4336 places, 7321/7888 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s76 1) (GEQ s2627 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 418 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-060-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-02 finished in 12993 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(p1))||p0) U p2))'
Support contains 5 out of 4336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 4325 transition count 7866
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 4325 transition count 7866
Applied a total of 22 rules in 1006 ms. Remains 4325 /4336 variables (removed 11) and now considering 7866/7888 (removed 22) transitions.
// Phase 1: matrix 7866 rows 4325 cols
[2023-03-09 13:40:52] [INFO ] Computed 61 place invariants in 103 ms
[2023-03-09 13:40:55] [INFO ] Implicit Places using invariants in 3588 ms returned []
[2023-03-09 13:40:55] [INFO ] Invariant cache hit.
[2023-03-09 13:41:03] [INFO ] Implicit Places using invariants and state equation in 7382 ms returned []
Implicit Place search using SMT with State Equation took 10990 ms to find 0 implicit places.
[2023-03-09 13:41:03] [INFO ] Invariant cache hit.
[2023-03-09 13:41:07] [INFO ] Dead Transitions using invariants and state equation in 4677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4325/4336 places, 7866/7888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16678 ms. Remains : 4325/4336 places, 7866/7888 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p2), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GEQ s875 1) (GEQ s1795 1)), p0:(OR (GEQ s1873 1) (AND (GEQ s527 1) (GEQ s558 1))), p1:(GEQ s875 1)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-060-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-03 finished in 16814 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(p0)||G(p1))))'
Support contains 4 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 406 rules applied. Total rules applied 406 place count 4336 transition count 7482
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 1 with 406 rules applied. Total rules applied 812 place count 3930 transition count 7482
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 812 place count 3930 transition count 7422
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 932 place count 3870 transition count 7422
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 946 place count 3856 transition count 7394
Iterating global reduction 2 with 14 rules applied. Total rules applied 960 place count 3856 transition count 7394
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 972 place count 3856 transition count 7382
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 984 place count 3844 transition count 7382
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1100 place count 3786 transition count 7324
Applied a total of 1100 rules in 1454 ms. Remains 3786 /4336 variables (removed 550) and now considering 7324/7888 (removed 564) transitions.
// Phase 1: matrix 7324 rows 3786 cols
[2023-03-09 13:41:09] [INFO ] Computed 61 place invariants in 82 ms
[2023-03-09 13:41:11] [INFO ] Implicit Places using invariants in 2404 ms returned []
[2023-03-09 13:41:12] [INFO ] Invariant cache hit.
[2023-03-09 13:41:13] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:41:14] [INFO ] Implicit Places using invariants and state equation in 2575 ms returned []
Implicit Place search using SMT with State Equation took 4994 ms to find 0 implicit places.
[2023-03-09 13:41:15] [INFO ] Redundant transitions in 442 ms returned []
[2023-03-09 13:41:15] [INFO ] Invariant cache hit.
[2023-03-09 13:41:18] [INFO ] Dead Transitions using invariants and state equation in 3673 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3786/4336 places, 7324/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10579 ms. Remains : 3786/4336 places, 7324/7888 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s15 1)), p1:(OR (LT s90 1) (LT s143 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 238 reset in 1336 ms.
Stack based approach found an accepted trace after 5902 steps with 13 reset with depth 391 and stack size 390 in 141 ms.
FORMULA CANConstruction-PT-060-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-04 finished in 12144 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((p1&&F(p2)))))))'
Support contains 4 out of 4336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4324 transition count 7864
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4324 transition count 7864
Applied a total of 24 rules in 953 ms. Remains 4324 /4336 variables (removed 12) and now considering 7864/7888 (removed 24) transitions.
// Phase 1: matrix 7864 rows 4324 cols
[2023-03-09 13:41:21] [INFO ] Computed 61 place invariants in 129 ms
[2023-03-09 13:41:25] [INFO ] Implicit Places using invariants in 4135 ms returned []
[2023-03-09 13:41:25] [INFO ] Invariant cache hit.
[2023-03-09 13:41:27] [INFO ] Implicit Places using invariants and state equation in 2432 ms returned []
Implicit Place search using SMT with State Equation took 6584 ms to find 0 implicit places.
[2023-03-09 13:41:27] [INFO ] Invariant cache hit.
[2023-03-09 13:41:32] [INFO ] Dead Transitions using invariants and state equation in 4185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4324/4336 places, 7864/7888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11725 ms. Remains : 4324/4336 places, 7864/7888 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s1228 1), p1:(OR (LT s35 1) (LT s114 1)), p2:(LT s2137 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3590 ms.
Product exploration explored 100000 steps with 50000 reset in 3669 ms.
Computed a total of 181 stabilizing places and 240 stable transitions
Computed a total of 181 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-060-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-060-LTLFireability-06 finished in 19439 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(p0))'
Support contains 1 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 4336 transition count 7480
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 3928 transition count 7480
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 816 place count 3928 transition count 7420
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 936 place count 3868 transition count 7420
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 949 place count 3855 transition count 7394
Iterating global reduction 2 with 13 rules applied. Total rules applied 962 place count 3855 transition count 7394
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 973 place count 3855 transition count 7383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 984 place count 3844 transition count 7383
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 1106 place count 3783 transition count 7322
Applied a total of 1106 rules in 1698 ms. Remains 3783 /4336 variables (removed 553) and now considering 7322/7888 (removed 566) transitions.
// Phase 1: matrix 7322 rows 3783 cols
[2023-03-09 13:41:41] [INFO ] Computed 61 place invariants in 142 ms
[2023-03-09 13:41:44] [INFO ] Implicit Places using invariants in 2723 ms returned []
[2023-03-09 13:41:44] [INFO ] Invariant cache hit.
[2023-03-09 13:41:48] [INFO ] Implicit Places using invariants and state equation in 4511 ms returned []
Implicit Place search using SMT with State Equation took 7239 ms to find 0 implicit places.
[2023-03-09 13:41:49] [INFO ] Redundant transitions in 588 ms returned []
[2023-03-09 13:41:49] [INFO ] Invariant cache hit.
[2023-03-09 13:41:52] [INFO ] Dead Transitions using invariants and state equation in 3148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3783/4336 places, 7322/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12699 ms. Remains : 3783/4336 places, 7322/7888 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3493 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 369 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-060-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-07 finished in 12765 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' '!(G((F((p1||(p2&&G(p3))))||p0)))'
Support contains 6 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 406 rules applied. Total rules applied 406 place count 4336 transition count 7482
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 1 with 406 rules applied. Total rules applied 812 place count 3930 transition count 7482
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 812 place count 3930 transition count 7422
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 932 place count 3870 transition count 7422
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 944 place count 3858 transition count 7398
Iterating global reduction 2 with 12 rules applied. Total rules applied 956 place count 3858 transition count 7398
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 966 place count 3858 transition count 7388
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 976 place count 3848 transition count 7388
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 1096 place count 3788 transition count 7328
Applied a total of 1096 rules in 1636 ms. Remains 3788 /4336 variables (removed 548) and now considering 7328/7888 (removed 560) transitions.
// Phase 1: matrix 7328 rows 3788 cols
[2023-03-09 13:41:54] [INFO ] Computed 61 place invariants in 138 ms
[2023-03-09 13:41:56] [INFO ] Implicit Places using invariants in 2401 ms returned []
[2023-03-09 13:41:56] [INFO ] Invariant cache hit.
[2023-03-09 13:41:57] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:41:58] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 4182 ms to find 0 implicit places.
[2023-03-09 13:41:59] [INFO ] Redundant transitions in 822 ms returned []
[2023-03-09 13:41:59] [INFO ] Invariant cache hit.
[2023-03-09 13:42:02] [INFO ] Dead Transitions using invariants and state equation in 3179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3788/4336 places, 7328/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9835 ms. Remains : 3788/4336 places, 7328/7888 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s20 1) (LT s81 1)), p1:(GEQ s1626 1), p2:(GEQ s1374 1), p3:(OR (LT s60 1) (LT s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3868 steps with 8 reset in 44 ms.
FORMULA CANConstruction-PT-060-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-08 finished in 10078 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' '!(G((G((p0||F(p1)))||F(p2))))'
Support contains 5 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 4336 transition count 7481
Reduce places removed 407 places and 0 transitions.
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 3929 transition count 7481
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 814 place count 3929 transition count 7421
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 934 place count 3869 transition count 7421
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 947 place count 3856 transition count 7395
Iterating global reduction 2 with 13 rules applied. Total rules applied 960 place count 3856 transition count 7395
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 971 place count 3856 transition count 7384
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 982 place count 3845 transition count 7384
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 3 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1100 place count 3786 transition count 7325
Applied a total of 1100 rules in 1561 ms. Remains 3786 /4336 variables (removed 550) and now considering 7325/7888 (removed 563) transitions.
// Phase 1: matrix 7325 rows 3786 cols
[2023-03-09 13:42:04] [INFO ] Computed 61 place invariants in 137 ms
[2023-03-09 13:42:06] [INFO ] Implicit Places using invariants in 2638 ms returned []
[2023-03-09 13:42:06] [INFO ] Invariant cache hit.
[2023-03-09 13:42:08] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:42:08] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 4399 ms to find 0 implicit places.
[2023-03-09 13:42:09] [INFO ] Redundant transitions in 470 ms returned []
[2023-03-09 13:42:09] [INFO ] Invariant cache hit.
[2023-03-09 13:42:12] [INFO ] Dead Transitions using invariants and state equation in 3294 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3786/4336 places, 7325/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9746 ms. Remains : 3786/4336 places, 7325/7888 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s120 1) (GEQ s2288 1)), p1:(AND (GEQ s13 1) (GEQ s36 1)), p2:(GEQ s2404 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 480 steps with 0 reset in 6 ms.
FORMULA CANConstruction-PT-060-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-09 finished in 9862 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(((F(p0) U !p1)&&(p0||(F(p2) U p3)))))'
Support contains 7 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 406 rules applied. Total rules applied 406 place count 4336 transition count 7482
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 1 with 406 rules applied. Total rules applied 812 place count 3930 transition count 7482
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 812 place count 3930 transition count 7422
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 932 place count 3870 transition count 7422
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 945 place count 3857 transition count 7396
Iterating global reduction 2 with 13 rules applied. Total rules applied 958 place count 3857 transition count 7396
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 969 place count 3857 transition count 7385
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 980 place count 3846 transition count 7385
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1096 place count 3788 transition count 7327
Applied a total of 1096 rules in 1302 ms. Remains 3788 /4336 variables (removed 548) and now considering 7327/7888 (removed 561) transitions.
// Phase 1: matrix 7327 rows 3788 cols
[2023-03-09 13:42:13] [INFO ] Computed 61 place invariants in 124 ms
[2023-03-09 13:42:15] [INFO ] Implicit Places using invariants in 2221 ms returned []
[2023-03-09 13:42:15] [INFO ] Invariant cache hit.
[2023-03-09 13:42:18] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned []
Implicit Place search using SMT with State Equation took 4335 ms to find 0 implicit places.
[2023-03-09 13:42:18] [INFO ] Redundant transitions in 443 ms returned []
[2023-03-09 13:42:18] [INFO ] Invariant cache hit.
[2023-03-09 13:42:21] [INFO ] Dead Transitions using invariants and state equation in 3179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3788/4336 places, 7327/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9285 ms. Remains : 3788/4336 places, 7327/7888 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR p1 (AND (NOT p0) (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), p1, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p1 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GEQ s2241 1), p3:(AND (GEQ s17 1) (GEQ s68 1)), p2:(AND (GEQ s21 1) (GEQ s132 1)), p1:(AND (GEQ s7 1) (GEQ s543 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 33250 reset in 2756 ms.
Product exploration explored 100000 steps with 33399 reset in 2730 ms.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 p0 (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (OR (AND p1 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 1766 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter insensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 13:42:30] [INFO ] Invariant cache hit.
[2023-03-09 13:42:30] [INFO ] [Real]Absence check using 61 positive place invariants in 56 ms returned sat
[2023-03-09 13:42:30] [INFO ] After 691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 13:42:31] [INFO ] [Nat]Absence check using 61 positive place invariants in 110 ms returned sat
[2023-03-09 13:42:34] [INFO ] After 2858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 13:42:34] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:42:36] [INFO ] After 2112ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 13:42:38] [INFO ] After 3809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1236 ms.
[2023-03-09 13:42:39] [INFO ] After 8766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 85 steps, including 1 resets, run visited all 4 properties in 5 ms. (steps per millisecond=17 )
Parikh walk visited 4 properties in 10 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 p0 (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (OR (AND p1 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p3) (NOT p0) p1 (NOT p2))), (F (AND (NOT p3) p0 p1 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0)))), (F (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p3) p0 p1)), (F (AND p3 (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F (AND p3 p1 (NOT p2))), (F (AND (NOT p3) p1)), (F (AND (NOT p3) p1 (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 2578 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 453 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 425 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
[2023-03-09 13:42:43] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 7 out of 3788 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3788/3788 places, 7327/7327 transitions.
Applied a total of 0 rules in 487 ms. Remains 3788 /3788 variables (removed 0) and now considering 7327/7327 (removed 0) transitions.
[2023-03-09 13:42:58] [INFO ] Invariant cache hit.
[2023-03-09 13:43:01] [INFO ] Implicit Places using invariants in 2331 ms returned []
[2023-03-09 13:43:01] [INFO ] Invariant cache hit.
[2023-03-09 13:43:02] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:43:02] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 3706 ms to find 0 implicit places.
[2023-03-09 13:43:02] [INFO ] Invariant cache hit.
[2023-03-09 13:43:05] [INFO ] Dead Transitions using invariants and state equation in 3294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7488 ms. Remains : 3788/3788 places, 7327/7327 transitions.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) p0 p1))), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1495 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 13) seen :9
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 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 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 13:43:08] [INFO ] Invariant cache hit.
[2023-03-09 13:43:09] [INFO ] [Real]Absence check using 61 positive place invariants in 87 ms returned sat
[2023-03-09 13:43:09] [INFO ] After 909ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 13:43:10] [INFO ] [Nat]Absence check using 61 positive place invariants in 115 ms returned sat
[2023-03-09 13:43:13] [INFO ] After 2999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 13:43:13] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:43:15] [INFO ] After 2060ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 13:43:17] [INFO ] After 3846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1235 ms.
[2023-03-09 13:43:18] [INFO ] After 9201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 85 steps, including 1 resets, run visited all 4 properties in 5 ms. (steps per millisecond=17 )
Parikh walk visited 4 properties in 7 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) p0 p1))), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0) (NOT p3))), (F (AND p1 (NOT p2) p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (AND p1 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) (NOT p3))))), (F (AND p1 (NOT p0) (NOT p3))), (F (AND p1 p0 (NOT p3))), (F (AND p1 (NOT p2) (NOT p0) p3)), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2) p3)), (F (AND p1 (NOT p3))), (F (AND p1 (NOT p2) (NOT p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1799 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 419 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
[2023-03-09 13:43:21] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 517 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 33425 reset in 3193 ms.
Product exploration explored 100000 steps with 33297 reset in 2724 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 431 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 7 out of 3788 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3788/3788 places, 7327/7327 transitions.
Applied a total of 0 rules in 1081 ms. Remains 3788 /3788 variables (removed 0) and now considering 7327/7327 (removed 0) transitions.
[2023-03-09 13:43:44] [INFO ] Redundant transitions in 478 ms returned []
[2023-03-09 13:43:44] [INFO ] Invariant cache hit.
[2023-03-09 13:43:48] [INFO ] Dead Transitions using invariants and state equation in 3814 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5396 ms. Remains : 3788/3788 places, 7327/7327 transitions.
Built C files in :
/tmp/ltsmin3981339519675467072
[2023-03-09 13:43:48] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3981339519675467072
Running compilation step : cd /tmp/ltsmin3981339519675467072;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3981339519675467072;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3981339519675467072;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 7 out of 3788 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3788/3788 places, 7327/7327 transitions.
Applied a total of 0 rules in 452 ms. Remains 3788 /3788 variables (removed 0) and now considering 7327/7327 (removed 0) transitions.
[2023-03-09 13:43:52] [INFO ] Invariant cache hit.
[2023-03-09 13:43:54] [INFO ] Implicit Places using invariants in 2514 ms returned []
[2023-03-09 13:43:54] [INFO ] Invariant cache hit.
[2023-03-09 13:43:56] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:43:56] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 4211 ms to find 0 implicit places.
[2023-03-09 13:43:56] [INFO ] Invariant cache hit.
[2023-03-09 13:44:00] [INFO ] Dead Transitions using invariants and state equation in 3582 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8253 ms. Remains : 3788/3788 places, 7327/7327 transitions.
Built C files in :
/tmp/ltsmin4656239263750547249
[2023-03-09 13:44:00] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4656239263750547249
Running compilation step : cd /tmp/ltsmin4656239263750547249;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4656239263750547249;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4656239263750547249;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 13:44:03] [INFO ] Flatten gal took : 196 ms
[2023-03-09 13:44:03] [INFO ] Flatten gal took : 186 ms
[2023-03-09 13:44:04] [INFO ] Time to serialize gal into /tmp/LTL11457996976115172188.gal : 42 ms
[2023-03-09 13:44:04] [INFO ] Time to serialize properties into /tmp/LTL10795184596609814782.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/LTL11457996976115172188.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2785025012371262600.hoa' '-atoms' '/tmp/LTL10795184596609814782.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/LTL10795184596609814782.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2785025012371262600.hoa
Detected timeout of ITS tools.
[2023-03-09 13:44:19] [INFO ] Flatten gal took : 227 ms
[2023-03-09 13:44:19] [INFO ] Flatten gal took : 227 ms
[2023-03-09 13:44:19] [INFO ] Time to serialize gal into /tmp/LTL17663583692683015746.gal : 43 ms
[2023-03-09 13:44:19] [INFO ] Time to serialize properties into /tmp/LTL7027951394824452788.ltl : 3 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/LTL17663583692683015746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7027951394824452788.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(((F("(Node33GiveAnswer47>=1)"))U(!("((Node1IsInserted>=1)&&(Node5requestsent1>=1))")))&&(("(Node33GiveAnswer47>=1)")||((F("((Node...246
Formula 0 simplified : G((G!"(Node33GiveAnswer47>=1)" R "((Node1IsInserted>=1)&&(Node5requestsent1>=1))") | (!"(Node33GiveAnswer47>=1)" & (G!"((Node5IsInse...236
Detected timeout of ITS tools.
[2023-03-09 13:44:34] [INFO ] Flatten gal took : 153 ms
[2023-03-09 13:44:34] [INFO ] Applying decomposition
[2023-03-09 13:44:35] [INFO ] Flatten gal took : 159 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/graph1936331135048738895.txt' '-o' '/tmp/graph1936331135048738895.bin' '-w' '/tmp/graph1936331135048738895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1936331135048738895.bin' '-l' '-1' '-v' '-w' '/tmp/graph1936331135048738895.weights' '-q' '0' '-e' '0.001'
[2023-03-09 13:44:35] [INFO ] Decomposing Gal with order
[2023-03-09 13:44:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 13:44:36] [INFO ] Removed a total of 7129 redundant transitions.
[2023-03-09 13:44:37] [INFO ] Flatten gal took : 1139 ms
[2023-03-09 13:44:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 7080 labels/synchronizations in 571 ms.
[2023-03-09 13:44:37] [INFO ] Time to serialize gal into /tmp/LTL11461721800251640095.gal : 49 ms
[2023-03-09 13:44:37] [INFO ] Time to serialize properties into /tmp/LTL3363183428240405818.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/LTL11461721800251640095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3363183428240405818.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(((F("(u47.Node33GiveAnswer47>=1)"))U(!("((u30.Node1IsInserted>=1)&&(u6.Node5requestsent1>=1))")))&&(("(u47.Node33GiveAnswer47>=1)...279
Formula 0 simplified : G((G!"(u47.Node33GiveAnswer47>=1)" R "((u30.Node1IsInserted>=1)&&(u6.Node5requestsent1>=1))") | (!"(u47.Node33GiveAnswer47>=1)" & (G...269
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16637356501992398468
[2023-03-09 13:44:53] [INFO ] Built C files in 190ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16637356501992398468
Running compilation step : cd /tmp/ltsmin16637356501992398468;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16637356501992398468;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16637356501992398468;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-060-LTLFireability-10 finished in 163746 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(p0)))'
Support contains 2 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 4336 transition count 7481
Reduce places removed 407 places and 0 transitions.
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 3929 transition count 7481
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 814 place count 3929 transition count 7421
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 934 place count 3869 transition count 7421
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 948 place count 3855 transition count 7393
Iterating global reduction 2 with 14 rules applied. Total rules applied 962 place count 3855 transition count 7393
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 974 place count 3855 transition count 7381
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 986 place count 3843 transition count 7381
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1104 place count 3784 transition count 7322
Applied a total of 1104 rules in 2080 ms. Remains 3784 /4336 variables (removed 552) and now considering 7322/7888 (removed 566) transitions.
// Phase 1: matrix 7322 rows 3784 cols
[2023-03-09 13:44:58] [INFO ] Computed 61 place invariants in 156 ms
[2023-03-09 13:45:00] [INFO ] Implicit Places using invariants in 2631 ms returned []
[2023-03-09 13:45:00] [INFO ] Invariant cache hit.
[2023-03-09 13:45:02] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:45:02] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 4442 ms to find 0 implicit places.
[2023-03-09 13:45:03] [INFO ] Redundant transitions in 544 ms returned []
[2023-03-09 13:45:03] [INFO ] Invariant cache hit.
[2023-03-09 13:45:07] [INFO ] Dead Transitions using invariants and state equation in 3807 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3784/4336 places, 7322/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10894 ms. Remains : 3784/4336 places, 7322/7888 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s55 1) (LT s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 239 reset in 1220 ms.
Stack based approach found an accepted trace after 9941 steps with 22 reset with depth 418 and stack size 418 in 121 ms.
FORMULA CANConstruction-PT-060-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-13 finished in 12339 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' '!(G(((p0 U p1)||F(((p3 U (p4||G(p3)))&&p2)))))'
Support contains 6 out of 4336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4336/4336 places, 7888/7888 transitions.
Drop transitions removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 4336 transition count 7481
Reduce places removed 407 places and 0 transitions.
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 3929 transition count 7481
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 814 place count 3929 transition count 7421
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 934 place count 3869 transition count 7421
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 946 place count 3857 transition count 7397
Iterating global reduction 2 with 12 rules applied. Total rules applied 958 place count 3857 transition count 7397
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 968 place count 3857 transition count 7387
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 978 place count 3847 transition count 7387
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 1098 place count 3787 transition count 7327
Applied a total of 1098 rules in 1605 ms. Remains 3787 /4336 variables (removed 549) and now considering 7327/7888 (removed 561) transitions.
// Phase 1: matrix 7327 rows 3787 cols
[2023-03-09 13:45:10] [INFO ] Computed 61 place invariants in 153 ms
[2023-03-09 13:45:12] [INFO ] Implicit Places using invariants in 2472 ms returned []
[2023-03-09 13:45:12] [INFO ] Invariant cache hit.
[2023-03-09 13:45:18] [INFO ] Implicit Places using invariants and state equation in 5533 ms returned []
Implicit Place search using SMT with State Equation took 8007 ms to find 0 implicit places.
[2023-03-09 13:45:18] [INFO ] Redundant transitions in 626 ms returned []
[2023-03-09 13:45:18] [INFO ] Invariant cache hit.
[2023-03-09 13:45:22] [INFO ] Dead Transitions using invariants and state equation in 4133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3787/4336 places, 7327/7888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14400 ms. Remains : 3787/4336 places, 7327/7888 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p4) p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s2070 1), p0:(AND (GEQ s92 1) (GEQ s128 1)), p2:(AND (OR (LT s144 1) (LT s3715 1)) (LT s1975 1)), p4:(AND (GEQ s144 1) (GEQ s3715 1) (LT s1975 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 241 reset in 1548 ms.
Product exploration explored 100000 steps with 238 reset in 1379 ms.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), (X (NOT (AND (NOT p1) p0 p2 (NOT p4) p3))), (X (NOT (OR (NOT p2) (AND (NOT p4) (NOT p3))))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3))))), (X (AND p2 (NOT p4) p3)), (X (NOT (AND (NOT p4) (NOT p3)))), (X (AND (NOT p4) p3)), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))))), (X (AND (NOT p1) (NOT p0) p2 (NOT p4) p3)), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p4) p3))), (X (X (NOT (OR (NOT p2) (AND (NOT p4) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) p3)))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3)))))), (X (X (AND p2 (NOT p4) p3))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (AND (NOT p4) p3))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0) p2 (NOT p4) p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1968 ms. Reduced automaton from 5 states, 16 edges and 5 AP (stutter insensitive) to 5 states, 16 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 433 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 790 ms. (steps per millisecond=12 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-09 13:45:29] [INFO ] Invariant cache hit.
[2023-03-09 13:45:30] [INFO ] [Real]Absence check using 61 positive place invariants in 86 ms returned sat
[2023-03-09 13:45:33] [INFO ] After 2673ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2023-03-09 13:45:33] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:45:34] [INFO ] After 822ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-09 13:45:34] [INFO ] After 4564ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-09 13:45:35] [INFO ] [Nat]Absence check using 61 positive place invariants in 88 ms returned sat
[2023-03-09 13:45:39] [INFO ] After 4206ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-09 13:45:43] [INFO ] After 3234ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-03-09 13:45:46] [INFO ] After 6390ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 2264 ms.
[2023-03-09 13:45:48] [INFO ] After 14343ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 6 properties in 9 ms.
Support contains 6 out of 3787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3787/3787 places, 7327/7327 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3787 transition count 7325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 3785 transition count 7325
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 3785 transition count 7325
Applied a total of 5 rules in 1917 ms. Remains 3785 /3787 variables (removed 2) and now considering 7325/7327 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1919 ms. Remains : 3785/3787 places, 7325/7327 transitions.
Finished random walk after 7725 steps, including 18 resets, run visited all 1 properties in 121 ms. (steps per millisecond=63 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), (X (NOT (AND (NOT p1) p0 p2 (NOT p4) p3))), (X (NOT (OR (NOT p2) (AND (NOT p4) (NOT p3))))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3))))), (X (AND p2 (NOT p4) p3)), (X (NOT (AND (NOT p4) (NOT p3)))), (X (AND (NOT p4) p3)), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))))), (X (AND (NOT p1) (NOT p0) p2 (NOT p4) p3)), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p4) p3))), (X (X (NOT (OR (NOT p2) (AND (NOT p4) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) p3)))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3)))))), (X (X (AND p2 (NOT p4) p3))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (AND (NOT p4) p3))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0) p2 (NOT p4) p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p3) p0 (NOT p4))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4))), (F (NOT (AND p3 (NOT p4)))), (F (NOT (AND p3 (NOT p4) p2))), (F (OR (AND (NOT p3) (NOT p4)) (NOT p2))), (F (AND (NOT p3) (NOT p4))), (F (AND (NOT p1) p3 p0 (NOT p4) p2)), (F (OR (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) p3 (NOT p0) (NOT p4) p2))), (F (OR (AND (NOT p1) (NOT p3) p0 (NOT p4)) (AND (NOT p1) p0 (NOT p2)))), (F (AND (NOT p1) p3 p0 (NOT p4))), (F (NOT (AND (NOT p1) p3 (NOT p0) (NOT p4))))]
Knowledge based reduction with 22 factoid took 2187 ms. Reduced automaton from 5 states, 16 edges and 5 AP (stutter insensitive) to 5 states, 15 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 373 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 454 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Support contains 6 out of 3787 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3787/3787 places, 7327/7327 transitions.
Applied a total of 0 rules in 715 ms. Remains 3787 /3787 variables (removed 0) and now considering 7327/7327 (removed 0) transitions.
[2023-03-09 13:45:54] [INFO ] Invariant cache hit.
[2023-03-09 13:46:09] [INFO ] Implicit Places using invariants in 14546 ms returned []
[2023-03-09 13:46:09] [INFO ] Invariant cache hit.
[2023-03-09 13:46:13] [INFO ] Implicit Places using invariants and state equation in 4186 ms returned []
Implicit Place search using SMT with State Equation took 18737 ms to find 0 implicit places.
[2023-03-09 13:46:13] [INFO ] Redundant transitions in 468 ms returned []
[2023-03-09 13:46:13] [INFO ] Invariant cache hit.
[2023-03-09 13:46:20] [INFO ] Dead Transitions using invariants and state equation in 6649 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26602 ms. Remains : 3787/3787 places, 7327/7327 transitions.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 p3 (NOT p4)), (X (NOT (OR (AND (NOT p3) (NOT p4)) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4))))), (X (AND (NOT p1) (NOT p0) p3 (NOT p4) p2)), (X (AND p3 (NOT p4))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p3 (NOT p4) p2))), (X (AND p3 (NOT p4) p2)), (X (NOT (AND (NOT p3) (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4)))), (X (X (NOT (OR (AND (NOT p3) (NOT p4)) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4)))))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4) p2))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4) p2)))), (X (X (AND p3 (NOT p4) p2))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p4)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1729 ms. Reduced automaton from 5 states, 15 edges and 5 AP (stutter insensitive) to 5 states, 15 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 758 ms. (steps per millisecond=13 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-09 13:46:23] [INFO ] Invariant cache hit.
[2023-03-09 13:46:24] [INFO ] [Real]Absence check using 61 positive place invariants in 64 ms returned sat
[2023-03-09 13:46:27] [INFO ] After 3922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 13:46:28] [INFO ] [Nat]Absence check using 61 positive place invariants in 98 ms returned sat
[2023-03-09 13:46:32] [INFO ] After 3994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 13:46:33] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 13:46:36] [INFO ] After 3317ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-09 13:46:40] [INFO ] After 7223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2536 ms.
[2023-03-09 13:46:42] [INFO ] After 15347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 58 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=19 )
Parikh walk visited 8 properties in 17 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 p3 (NOT p4)), (X (NOT (OR (AND (NOT p3) (NOT p4)) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4))))), (X (AND (NOT p1) (NOT p0) p3 (NOT p4) p2)), (X (AND p3 (NOT p4))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p3 (NOT p4) p2))), (X (AND p3 (NOT p4) p2)), (X (NOT (AND (NOT p3) (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4)))), (X (X (NOT (OR (AND (NOT p3) (NOT p4)) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4)))))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4) p2))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4) p2)))), (X (X (AND p3 (NOT p4) p2))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p4)))))]
False Knowledge obtained : [(F (NOT (AND p3 (NOT p4)))), (F (AND (NOT p3) (NOT p4))), (F (AND (NOT p1) (NOT p3) (NOT p4))), (F (NOT (AND p3 (NOT p4) p2))), (F (OR (AND (NOT p3) (NOT p4)) (NOT p2))), (F (AND (NOT p1) p0 p3 (NOT p4) p2)), (F (AND (NOT p1) p0 (NOT p2))), (F (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p1) (NOT p0) p3 (NOT p4) p2))), (F (OR (AND (NOT p1) p0 p3 (NOT p2)) (AND (NOT p1) p0 p4 (NOT p2)))), (F (AND (NOT p1) p0 p3 (NOT p4))), (F (NOT (AND (NOT p1) (NOT p0) p3 (NOT p4))))]
Knowledge based reduction with 20 factoid took 1915 ms. Reduced automaton from 5 states, 15 edges and 5 AP (stutter insensitive) to 5 states, 15 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 400 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Product exploration explored 100000 steps with 242 reset in 1553 ms.
Product exploration explored 100000 steps with 241 reset in 1605 ms.
Built C files in :
/tmp/ltsmin12556227174693586973
[2023-03-09 13:46:49] [INFO ] Too many transitions (7327) to apply POR reductions. Disabling POR matrices.
[2023-03-09 13:46:49] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12556227174693586973
Running compilation step : cd /tmp/ltsmin12556227174693586973;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12556227174693586973;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12556227174693586973;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 3787 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3787/3787 places, 7327/7327 transitions.
Applied a total of 0 rules in 448 ms. Remains 3787 /3787 variables (removed 0) and now considering 7327/7327 (removed 0) transitions.
[2023-03-09 13:46:52] [INFO ] Invariant cache hit.
[2023-03-09 13:46:56] [INFO ] Implicit Places using invariants in 3404 ms returned []
[2023-03-09 13:46:56] [INFO ] Invariant cache hit.
[2023-03-09 13:47:01] [INFO ] Implicit Places using invariants and state equation in 5260 ms returned []
Implicit Place search using SMT with State Equation took 8666 ms to find 0 implicit places.
[2023-03-09 13:47:01] [INFO ] Redundant transitions in 409 ms returned []
[2023-03-09 13:47:01] [INFO ] Invariant cache hit.
[2023-03-09 13:47:05] [INFO ] Dead Transitions using invariants and state equation in 4030 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13565 ms. Remains : 3787/3787 places, 7327/7327 transitions.
Built C files in :
/tmp/ltsmin10757787319945344292
[2023-03-09 13:47:05] [INFO ] Too many transitions (7327) to apply POR reductions. Disabling POR matrices.
[2023-03-09 13:47:05] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10757787319945344292
Running compilation step : cd /tmp/ltsmin10757787319945344292;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10757787319945344292;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10757787319945344292;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 13:47:09] [INFO ] Flatten gal took : 213 ms
[2023-03-09 13:47:09] [INFO ] Flatten gal took : 219 ms
[2023-03-09 13:47:09] [INFO ] Time to serialize gal into /tmp/LTL11947523366940176865.gal : 33 ms
[2023-03-09 13:47:09] [INFO ] Time to serialize properties into /tmp/LTL18204107680715797364.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/LTL11947523366940176865.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3459298357563031508.hoa' '-atoms' '/tmp/LTL18204107680715797364.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/LTL18204107680715797364.prop.
Loaded 5 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3459298357563031508.hoa
Detected timeout of ITS tools.
[2023-03-09 13:47:25] [INFO ] Flatten gal took : 186 ms
[2023-03-09 13:47:25] [INFO ] Flatten gal took : 194 ms
[2023-03-09 13:47:25] [INFO ] Time to serialize gal into /tmp/LTL17369958093570829636.gal : 32 ms
[2023-03-09 13:47:25] [INFO ] Time to serialize properties into /tmp/LTL9527856612024337772.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/LTL17369958093570829636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9527856612024337772.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 : !((G((("((Node29Request>=1)&&(Node41IsInserted>=1))")U("(Node30GiveAnswer54>=1)"))||(F(("(((Node46IsInserted<1)||(Node58requestsent46<...333
Formula 0 simplified : F((!"((Node29Request>=1)&&(Node41IsInserted>=1))" R !"(Node30GiveAnswer54>=1)") & G(!"(((Node46IsInserted<1)||(Node58requestsent46<1...296
Detected timeout of ITS tools.
[2023-03-09 13:47:40] [INFO ] Flatten gal took : 241 ms
[2023-03-09 13:47:40] [INFO ] Applying decomposition
[2023-03-09 13:47:40] [INFO ] Flatten gal took : 270 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/graph18396766533842477720.txt' '-o' '/tmp/graph18396766533842477720.bin' '-w' '/tmp/graph18396766533842477720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18396766533842477720.bin' '-l' '-1' '-v' '-w' '/tmp/graph18396766533842477720.weights' '-q' '0' '-e' '0.001'
[2023-03-09 13:47:41] [INFO ] Decomposing Gal with order
[2023-03-09 13:47:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 13:47:42] [INFO ] Removed a total of 7133 redundant transitions.
[2023-03-09 13:47:42] [INFO ] Flatten gal took : 712 ms
[2023-03-09 13:47:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 7084 labels/synchronizations in 491 ms.
[2023-03-09 13:47:43] [INFO ] Time to serialize gal into /tmp/LTL2999285050233523052.gal : 63 ms
[2023-03-09 13:47:43] [INFO ] Time to serialize properties into /tmp/LTL10717204121861711230.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/LTL2999285050233523052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10717204121861711230.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 : !((G((("((u30.Node29Request>=1)&&(u37.Node41IsInserted>=1))")U("(u54.Node30GiveAnswer54>=1)"))||(F(("(((u38.Node46IsInserted<1)||(u58....377
Formula 0 simplified : F((!"((u30.Node29Request>=1)&&(u37.Node41IsInserted>=1))" R !"(u54.Node30GiveAnswer54>=1)") & G(!"(((u38.Node46IsInserted<1)||(u58.N...336
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4530373348015576254
[2023-03-09 13:47:58] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4530373348015576254
Running compilation step : cd /tmp/ltsmin4530373348015576254;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4530373348015576254;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4530373348015576254;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-060-LTLFireability-15 finished in 172736 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(((F(p0) U !p1)&&(p0||(F(p2) U p3)))))'
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' '!(G(((p0 U p1)||F(((p3 U (p4||G(p3)))&&p2)))))'
[2023-03-09 13:48:01] [INFO ] Flatten gal took : 251 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2819278992225690857
[2023-03-09 13:48:01] [INFO ] Too many transitions (7888) to apply POR reductions. Disabling POR matrices.
[2023-03-09 13:48:02] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2819278992225690857
Running compilation step : cd /tmp/ltsmin2819278992225690857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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-09 13:48:02] [INFO ] Applying decomposition
[2023-03-09 13:48:02] [INFO ] Flatten gal took : 191 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/graph5678251722749422041.txt' '-o' '/tmp/graph5678251722749422041.bin' '-w' '/tmp/graph5678251722749422041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5678251722749422041.bin' '-l' '-1' '-v' '-w' '/tmp/graph5678251722749422041.weights' '-q' '0' '-e' '0.001'
[2023-03-09 13:48:02] [INFO ] Decomposing Gal with order
[2023-03-09 13:48:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 13:48:03] [INFO ] Removed a total of 7245 redundant transitions.
[2023-03-09 13:48:03] [INFO ] Flatten gal took : 653 ms
[2023-03-09 13:48:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 14316 labels/synchronizations in 637 ms.
[2023-03-09 13:48:04] [INFO ] Time to serialize gal into /tmp/LTLFireability4362244416616068211.gal : 39 ms
[2023-03-09 13:48:04] [INFO ] Time to serialize properties into /tmp/LTLFireability396739974062250727.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/LTLFireability4362244416616068211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability396739974062250727.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...275
Read 2 LTL properties
Checking formula 0 : !((F(((F("(i46.u214.Node33GiveAnswer47>=1)"))U(!("((i4.u157.Node1IsInserted>=1)&&(i5.u24.Node5requestsent1>=1))")))&&(("(i46.u214.Node...311
Formula 0 simplified : G((G!"(i46.u214.Node33GiveAnswer47>=1)" R "((i4.u157.Node1IsInserted>=1)&&(i5.u24.Node5requestsent1>=1))") | (!"(i46.u214.Node33Give...301
Compilation finished in 33792 ms.
Running link step : cd /tmp/ltsmin2819278992225690857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 137 ms.
Running LTSmin : cd /tmp/ltsmin2819278992225690857;'/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)) U !(LTLAPp1==true))&&((LTLAPp0==true)||(<>((LTLAPp2==true)) U (LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 14:10:59] [INFO ] Flatten gal took : 607 ms
[2023-03-09 14:10:59] [INFO ] Time to serialize gal into /tmp/LTLFireability15559327935289709149.gal : 78 ms
[2023-03-09 14:10:59] [INFO ] Time to serialize properties into /tmp/LTLFireability10179622541116950606.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/LTLFireability15559327935289709149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10179622541116950606.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 2 LTL properties
Checking formula 0 : !((F(((F("(Node33GiveAnswer47>=1)"))U(!("((Node1IsInserted>=1)&&(Node5requestsent1>=1))")))&&(("(Node33GiveAnswer47>=1)")||((F("((Node...246
Formula 0 simplified : G((G!"(Node33GiveAnswer47>=1)" R "((Node1IsInserted>=1)&&(Node5requestsent1>=1))") | (!"(Node33GiveAnswer47>=1)" & (G!"((Node5IsInse...236
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin2819278992225690857;'/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)) U !(LTLAPp1==true))&&((LTLAPp0==true)||(<>((LTLAPp2==true)) U (LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2819278992225690857;'/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' '[]((((LTLAPp4==true) U (LTLAPp5==true))||<>((((LTLAPp7==true) U ((LTLAPp8==true)||[]((LTLAPp7==true))))&&(LTLAPp6==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 14:33:53] [INFO ] Flatten gal took : 499 ms
[2023-03-09 14:33:54] [INFO ] Input system was already deterministic with 7888 transitions.
[2023-03-09 14:33:54] [INFO ] Transformed 4336 places.
[2023-03-09 14:33:54] [INFO ] Transformed 7888 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-09 14:34:07] [INFO ] Time to serialize gal into /tmp/LTLFireability8327522761861555726.gal : 44 ms
[2023-03-09 14:34:07] [INFO ] Time to serialize properties into /tmp/LTLFireability1000547368484171402.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/LTLFireability8327522761861555726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1000547368484171402.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...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((F("(Node33GiveAnswer47>=1)"))U(!("((Node1IsInserted>=1)&&(Node5requestsent1>=1))")))&&(("(Node33GiveAnswer47>=1)")||((F("((Node...246
Formula 0 simplified : G((G!"(Node33GiveAnswer47>=1)" R "((Node1IsInserted>=1)&&(Node5requestsent1>=1))") | (!"(Node33GiveAnswer47>=1)" & (G!"((Node5IsInse...236
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11948624 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16027120 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="CANConstruction-PT-060"
export BK_EXAMINATION="LTLFireability"
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 CANConstruction-PT-060, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690700660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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