MCC'2024- Execution of r334-tall-171679080300427

About the Execution of ITS-Tools for SafeBus-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16206.004	3600000.00	12668097.00	5418.20	?FF?FFTFFFFFFFTF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679080300427.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SafeBus-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080300427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 21K Apr 12 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 145K Apr 12 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 605K Apr 12 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 79K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Apr 12 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 989K Apr 12 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 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 SafeBus-PT-10-LTLCardinality-00
FORMULA_NAME SafeBus-PT-10-LTLCardinality-01
FORMULA_NAME SafeBus-PT-10-LTLCardinality-02
FORMULA_NAME SafeBus-PT-10-LTLCardinality-03
FORMULA_NAME SafeBus-PT-10-LTLCardinality-04
FORMULA_NAME SafeBus-PT-10-LTLCardinality-05
FORMULA_NAME SafeBus-PT-10-LTLCardinality-06
FORMULA_NAME SafeBus-PT-10-LTLCardinality-07
FORMULA_NAME SafeBus-PT-10-LTLCardinality-08
FORMULA_NAME SafeBus-PT-10-LTLCardinality-09
FORMULA_NAME SafeBus-PT-10-LTLCardinality-10
FORMULA_NAME SafeBus-PT-10-LTLCardinality-11
FORMULA_NAME SafeBus-PT-10-LTLCardinality-12
FORMULA_NAME SafeBus-PT-10-LTLCardinality-13
FORMULA_NAME SafeBus-PT-10-LTLCardinality-14
FORMULA_NAME SafeBus-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716830434271

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-27 17:20:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 17:20:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 17:20:35] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-27 17:20:35] [INFO ] Transformed 316 places.
[2024-05-27 17:20:35] [INFO ] Transformed 1631 transitions.
[2024-05-27 17:20:35] [INFO ] Found NUPN structural information;
[2024-05-27 17:20:35] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA SafeBus-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 121 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 44 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:20:35] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 17:20:35] [INFO ] Computed 45 invariants in 38 ms
[2024-05-27 17:20:36] [INFO ] Implicit Places using invariants in 1060 ms returned [266, 267, 269, 270, 271, 272, 273, 274, 275]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1090 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 13 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1161 ms. Remains : 297/306 places, 1631/1631 transitions.
Support contains 121 out of 297 places after structural reductions.
[2024-05-27 17:20:37] [INFO ] Flatten gal took : 167 ms
[2024-05-27 17:20:37] [INFO ] Flatten gal took : 105 ms
[2024-05-27 17:20:37] [INFO ] Input system was already deterministic with 1631 transitions.
RANDOM walk for 1203 steps (0 resets) in 143 ms. (8 steps per ms) remains 0/12 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 110 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 260 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:20:38] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 297 cols
[2024-05-27 17:20:38] [INFO ] Computed 36 invariants in 15 ms
[2024-05-27 17:20:39] [INFO ] Implicit Places using invariants in 964 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 969 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 128 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1358 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 905 ms.
Product exploration explored 100000 steps with 0 reset in 870 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 75 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-05-27 17:20:41] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 17:20:41] [INFO ] Computed 35 invariants in 12 ms
[2024-05-27 17:20:44] [INFO ] [Real]Absence check using 14 positive place invariants in 32 ms returned sat
[2024-05-27 17:20:44] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 137 ms returned sat
[2024-05-27 17:20:45] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2024-05-27 17:20:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:20:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-05-27 17:20:49] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 68 ms returned sat
[2024-05-27 17:20:50] [INFO ] [Nat]Absence check using state equation in 1436 ms returned sat
[2024-05-27 17:20:50] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:20:50] [INFO ] [Nat]Added 111 Read/Feed constraints in 105 ms returned sat
[2024-05-27 17:20:50] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 106 ms.
[2024-05-27 17:20:50] [INFO ] Added : 2 causal constraints over 2 iterations in 299 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 110 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 111 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:20:51] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:20:51] [INFO ] Invariant cache hit.
[2024-05-27 17:20:51] [INFO ] Implicit Places using invariants in 929 ms returned []
[2024-05-27 17:20:51] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:20:51] [INFO ] Invariant cache hit.
[2024-05-27 17:20:52] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:20:54] [INFO ] Implicit Places using invariants and state equation in 2146 ms returned []
Implicit Place search using SMT with State Equation took 3088 ms to find 0 implicit places.
[2024-05-27 17:20:54] [INFO ] Redundant transitions in 106 ms returned []
Running 1621 sub problems to find dead transitions.
[2024-05-27 17:20:54] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:20:54] [INFO ] Invariant cache hit.
[2024-05-27 17:20:54] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 17:21:08] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 18 ms to minimize.
[2024-05-27 17:21:11] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 3 ms to minimize.
[2024-05-27 17:21:17] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:21:17] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:21:17] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:21:18] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 3 ms to minimize.
[2024-05-27 17:21:18] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 2 ms to minimize.
[2024-05-27 17:21:18] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:21:19] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-27 17:21:19] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 4 ms to minimize.
[2024-05-27 17:21:20] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 1 ms to minimize.
[2024-05-27 17:21:20] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 3 ms to minimize.
[2024-05-27 17:21:20] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 2 ms to minimize.
[2024-05-27 17:21:20] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:21:20] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-27 17:21:23] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 2 ms to minimize.
[2024-05-27 17:21:23] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 2 ms to minimize.
[2024-05-27 17:21:24] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 2 ms to minimize.
[2024-05-27 17:21:24] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 2 ms to minimize.
[2024-05-27 17:21:24] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30081 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 17:21:43] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 2 ms to minimize.
[2024-05-27 17:21:43] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 2 ms to minimize.
[2024-05-27 17:21:46] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:21:54] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-27 17:21:56] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2024-05-27 17:21:57] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-27 17:21:58] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-27 17:21:58] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 359 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30034 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 28/28 constraints]
After SMT, in 64389ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64417ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 296/296 places, 1531/1631 transitions.
Applied a total of 0 rules in 93 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:21:58] [INFO ] Redundant transitions in 28 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 67880 ms. Remains : 296/296 places, 1531/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 79 steps (0 resets) in 7 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-27 17:21:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 17:21:59] [INFO ] Computed 35 invariants in 13 ms
[2024-05-27 17:22:02] [INFO ] [Real]Absence check using 14 positive place invariants in 55 ms returned sat
[2024-05-27 17:22:02] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 164 ms returned sat
[2024-05-27 17:22:03] [INFO ] [Real]Absence check using state equation in 1320 ms returned sat
[2024-05-27 17:22:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:22:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2024-05-27 17:22:06] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 54 ms returned sat
[2024-05-27 17:22:09] [INFO ] [Nat]Absence check using state equation in 2511 ms returned sat
[2024-05-27 17:22:09] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:22:10] [INFO ] [Nat]Added 111 Read/Feed constraints in 1309 ms returned sat
[2024-05-27 17:22:10] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 59 ms.
[2024-05-27 17:22:10] [INFO ] Added : 0 causal constraints over 0 iterations in 138 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 731 ms.
Product exploration explored 100000 steps with 0 reset in 800 ms.
Built C files in :
/tmp/ltsmin2929192747691646332
[2024-05-27 17:22:12] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:22:12] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2929192747691646332
Running compilation step : cd /tmp/ltsmin2929192747691646332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2929192747691646332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2929192747691646332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 110 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 97 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:22:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:22:15] [INFO ] Invariant cache hit.
[2024-05-27 17:22:16] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2024-05-27 17:22:16] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:22:16] [INFO ] Invariant cache hit.
[2024-05-27 17:22:16] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:22:18] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 2960 ms to find 0 implicit places.
[2024-05-27 17:22:18] [INFO ] Redundant transitions in 20 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:22:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:22:18] [INFO ] Invariant cache hit.
[2024-05-27 17:22:18] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 17:22:31] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 3 ms to minimize.
[2024-05-27 17:22:31] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 2 ms to minimize.
[2024-05-27 17:22:31] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 2 ms to minimize.
[2024-05-27 17:22:32] [INFO ] Deduced a trap composed of 74 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:22:32] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2024-05-27 17:22:41] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:22:41] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 2 ms to minimize.
[2024-05-27 17:22:41] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-05-27 17:22:41] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:22:42] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 2 ms to minimize.
[2024-05-27 17:22:43] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 1 ms to minimize.
[2024-05-27 17:22:43] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:22:43] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:22:43] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:22:44] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:22:46] [INFO ] Deduced a trap composed of 38 places in 348 ms of which 2 ms to minimize.
[2024-05-27 17:22:47] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 2 ms to minimize.
[2024-05-27 17:22:47] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 2 ms to minimize.
[2024-05-27 17:22:47] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 2 ms to minimize.
[2024-05-27 17:22:47] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30037 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 20/20 constraints]
After SMT, in 63972ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63989ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67086 ms. Remains : 296/296 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin12829175199239082396
[2024-05-27 17:23:22] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:23:22] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12829175199239082396
Running compilation step : cd /tmp/ltsmin12829175199239082396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin12829175199239082396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12829175199239082396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 17:23:25] [INFO ] Flatten gal took : 78 ms
[2024-05-27 17:23:25] [INFO ] Flatten gal took : 75 ms
[2024-05-27 17:23:25] [INFO ] Time to serialize gal into /tmp/LTL14445946251802217718.gal : 23 ms
[2024-05-27 17:23:25] [INFO ] Time to serialize properties into /tmp/LTL8878651877978075979.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14445946251802217718.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4201619192718326045.hoa' '-atoms' '/tmp/LTL8878651877978075979.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8878651877978075979.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4201619192718326045.hoa
Detected timeout of ITS tools.
[2024-05-27 17:23:41] [INFO ] Flatten gal took : 65 ms
[2024-05-27 17:23:41] [INFO ] Flatten gal took : 63 ms
[2024-05-27 17:23:41] [INFO ] Time to serialize gal into /tmp/LTL3873343251477417787.gal : 11 ms
[2024-05-27 17:23:41] [INFO ] Time to serialize properties into /tmp/LTL2507703355896006752.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3873343251477417787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2507703355896006752.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((wait_msg_1+wait_msg_2)+(wait_msg_3+wait_msg_4))+((wait_msg_5+wait_msg_6)+(wait_msg_7+wait_msg_8)))+(wait_msg_9+wait_msg_...1616
Formula 0 simplified : GF!"((((((wait_msg_1+wait_msg_2)+(wait_msg_3+wait_msg_4))+((wait_msg_5+wait_msg_6)+(wait_msg_7+wait_msg_8)))+(wait_msg_9+wait_msg_10...1610
Detected timeout of ITS tools.
[2024-05-27 17:23:56] [INFO ] Flatten gal took : 60 ms
[2024-05-27 17:23:56] [INFO ] Applying decomposition
[2024-05-27 17:23:56] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4953384650853151927.txt' '-o' '/tmp/graph4953384650853151927.bin' '-w' '/tmp/graph4953384650853151927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4953384650853151927.bin' '-l' '-1' '-v' '-w' '/tmp/graph4953384650853151927.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:23:56] [INFO ] Decomposing Gal with order
[2024-05-27 17:23:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:23:57] [INFO ] Removed a total of 698 redundant transitions.
[2024-05-27 17:23:57] [INFO ] Flatten gal took : 432 ms
[2024-05-27 17:23:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 593 labels/synchronizations in 31 ms.
[2024-05-27 17:23:57] [INFO ] Time to serialize gal into /tmp/LTL16100417935275776846.gal : 12 ms
[2024-05-27 17:23:57] [INFO ] Time to serialize properties into /tmp/LTL17701135787454195617.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16100417935275776846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17701135787454195617.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((gu3.wait_msg_1+gu3.wait_msg_2)+(gu3.wait_msg_3+gu3.wait_msg_4))+((gu3.wait_msg_5+gu3.wait_msg_6)+(gu3.wait_msg_7+gu3.wai...2136
Formula 0 simplified : GF!"((((((gu3.wait_msg_1+gu3.wait_msg_2)+(gu3.wait_msg_3+gu3.wait_msg_4))+((gu3.wait_msg_5+gu3.wait_msg_6)+(gu3.wait_msg_7+gu3.wait_...2130
Detected timeout of ITS tools.
Treatment of property SafeBus-PT-10-LTLCardinality-00 finished in 214503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 53 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:24:12] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 297 cols
[2024-05-27 17:24:12] [INFO ] Computed 36 invariants in 4 ms
[2024-05-27 17:24:13] [INFO ] Implicit Places using invariants in 916 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 918 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 9 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 981 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-02 finished in 1110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 107 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:24:13] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:24:13] [INFO ] Invariant cache hit.
[2024-05-27 17:24:14] [INFO ] Implicit Places using invariants in 863 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 866 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 104 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1079 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-03
Product exploration explored 100000 steps with 5458 reset in 430 ms.
Product exploration explored 100000 steps with 6489 reset in 383 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 45 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2024-05-27 17:24:16] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 17:24:16] [INFO ] Computed 35 invariants in 6 ms
[2024-05-27 17:24:16] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-27 17:24:16] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 86 ms returned sat
[2024-05-27 17:24:18] [INFO ] [Real]Absence check using state equation in 1351 ms returned sat
[2024-05-27 17:24:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:24:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 17:24:18] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 207 ms returned sat
[2024-05-27 17:24:19] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2024-05-27 17:24:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:24:19] [INFO ] [Nat]Added 111 Read/Feed constraints in 77 ms returned sat
[2024-05-27 17:24:19] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 66 ms.
[2024-05-27 17:24:19] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 98 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:24:19] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:24:19] [INFO ] Invariant cache hit.
[2024-05-27 17:24:20] [INFO ] Implicit Places using invariants in 860 ms returned []
[2024-05-27 17:24:20] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:24:20] [INFO ] Invariant cache hit.
[2024-05-27 17:24:20] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:24:22] [INFO ] Implicit Places using invariants and state equation in 1971 ms returned []
Implicit Place search using SMT with State Equation took 2833 ms to find 0 implicit places.
[2024-05-27 17:24:22] [INFO ] Redundant transitions in 28 ms returned []
Running 1621 sub problems to find dead transitions.
[2024-05-27 17:24:22] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:24:22] [INFO ] Invariant cache hit.
[2024-05-27 17:24:22] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 17:24:36] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 3 ms to minimize.
[2024-05-27 17:24:39] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:24:45] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:24:45] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:24:45] [INFO ] Deduced a trap composed of 69 places in 199 ms of which 2 ms to minimize.
[2024-05-27 17:24:46] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 1 ms to minimize.
[2024-05-27 17:24:46] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:24:46] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 2 ms to minimize.
[2024-05-27 17:24:47] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2024-05-27 17:24:47] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2024-05-27 17:24:48] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-27 17:24:48] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
[2024-05-27 17:24:48] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 1 ms to minimize.
[2024-05-27 17:24:48] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:24:48] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:24:51] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 1 ms to minimize.
[2024-05-27 17:24:51] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 2 ms to minimize.
[2024-05-27 17:24:52] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 2 ms to minimize.
[2024-05-27 17:24:52] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:24:52] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30042 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 17:25:10] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:25:11] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 2 ms to minimize.
[2024-05-27 17:25:14] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 3 ms to minimize.
[2024-05-27 17:25:21] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 1 ms to minimize.
[2024-05-27 17:25:23] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-05-27 17:25:24] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-05-27 17:25:25] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-05-27 17:25:25] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 359 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30027 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 28/28 constraints]
After SMT, in 64393ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64413ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 296/296 places, 1531/1631 transitions.
Applied a total of 0 rules in 82 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:25:26] [INFO ] Redundant transitions in 21 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 67498 ms. Remains : 296/296 places, 1531/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 47 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-05-27 17:25:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 17:25:27] [INFO ] Computed 35 invariants in 13 ms
[2024-05-27 17:25:28] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-27 17:25:28] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 293 ms returned sat
[2024-05-27 17:25:29] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2024-05-27 17:25:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:25:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 17:25:30] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 141 ms returned sat
[2024-05-27 17:25:30] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2024-05-27 17:25:30] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:25:30] [INFO ] [Nat]Added 111 Read/Feed constraints in 89 ms returned sat
[2024-05-27 17:25:30] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 56 ms.
[2024-05-27 17:25:30] [INFO ] Added : 1 causal constraints over 1 iterations in 165 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1263 reset in 478 ms.
Product exploration explored 100000 steps with 5141 reset in 399 ms.
Built C files in :
/tmp/ltsmin17588155275461719306
[2024-05-27 17:25:31] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:25:31] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17588155275461719306
Running compilation step : cd /tmp/ltsmin17588155275461719306;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin17588155275461719306;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17588155275461719306;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 80 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:25:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:25:35] [INFO ] Invariant cache hit.
[2024-05-27 17:25:36] [INFO ] Implicit Places using invariants in 957 ms returned []
[2024-05-27 17:25:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:25:36] [INFO ] Invariant cache hit.
[2024-05-27 17:25:36] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:25:38] [INFO ] Implicit Places using invariants and state equation in 2239 ms returned []
Implicit Place search using SMT with State Equation took 3200 ms to find 0 implicit places.
[2024-05-27 17:25:38] [INFO ] Redundant transitions in 24 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:25:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:25:38] [INFO ] Invariant cache hit.
[2024-05-27 17:25:38] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 17:25:50] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:25:51] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 2 ms to minimize.
[2024-05-27 17:25:51] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 2 ms to minimize.
[2024-05-27 17:25:51] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 1 ms to minimize.
[2024-05-27 17:25:51] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2024-05-27 17:25:59] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:26:00] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 2 ms to minimize.
[2024-05-27 17:26:00] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 2 ms to minimize.
[2024-05-27 17:26:00] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:26:01] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 2 ms to minimize.
[2024-05-27 17:26:01] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 2 ms to minimize.
[2024-05-27 17:26:02] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 2 ms to minimize.
[2024-05-27 17:26:02] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 1 ms to minimize.
[2024-05-27 17:26:02] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 1 ms to minimize.
[2024-05-27 17:26:02] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2024-05-27 17:26:05] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 2 ms to minimize.
[2024-05-27 17:26:05] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:26:06] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 2 ms to minimize.
[2024-05-27 17:26:06] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 1 ms to minimize.
[2024-05-27 17:26:06] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 17:26:42] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 2 ms to minimize.
SMT process timed out in 64136ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64157ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67474 ms. Remains : 296/296 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin7830600507007882419
[2024-05-27 17:26:42] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:26:42] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7830600507007882419
Running compilation step : cd /tmp/ltsmin7830600507007882419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin7830600507007882419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7830600507007882419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 17:26:45] [INFO ] Flatten gal took : 69 ms
[2024-05-27 17:26:45] [INFO ] Flatten gal took : 69 ms
[2024-05-27 17:26:45] [INFO ] Time to serialize gal into /tmp/LTL18352077276457160676.gal : 8 ms
[2024-05-27 17:26:45] [INFO ] Time to serialize properties into /tmp/LTL13613537101672346299.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18352077276457160676.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9278139971435461380.hoa' '-atoms' '/tmp/LTL13613537101672346299.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13613537101672346299.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9278139971435461380.hoa
Detected timeout of ITS tools.
[2024-05-27 17:27:00] [INFO ] Flatten gal took : 51 ms
[2024-05-27 17:27:00] [INFO ] Flatten gal took : 51 ms
[2024-05-27 17:27:00] [INFO ] Time to serialize gal into /tmp/LTL7799888393310053192.gal : 8 ms
[2024-05-27 17:27:00] [INFO ] Time to serialize properties into /tmp/LTL1712828670643273090.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7799888393310053192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1712828670643273090.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(FMCb<=((((wait_msg_1+wait_msg_2)+(wait_msg_3+wait_msg_4))+((wait_msg_5+wait_msg_6)+(wait_msg_7+wait_msg_8)))+(wait_msg_9+wait...170
Formula 0 simplified : FG!"(FMCb<=((((wait_msg_1+wait_msg_2)+(wait_msg_3+wait_msg_4))+((wait_msg_5+wait_msg_6)+(wait_msg_7+wait_msg_8)))+(wait_msg_9+wait_m...164
Detected timeout of ITS tools.
[2024-05-27 17:27:15] [INFO ] Flatten gal took : 54 ms
[2024-05-27 17:27:15] [INFO ] Applying decomposition
[2024-05-27 17:27:16] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4767162095694496729.txt' '-o' '/tmp/graph4767162095694496729.bin' '-w' '/tmp/graph4767162095694496729.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4767162095694496729.bin' '-l' '-1' '-v' '-w' '/tmp/graph4767162095694496729.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:27:16] [INFO ] Decomposing Gal with order
[2024-05-27 17:27:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:27:16] [INFO ] Removed a total of 1560 redundant transitions.
[2024-05-27 17:27:16] [INFO ] Flatten gal took : 712 ms
[2024-05-27 17:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 3503 labels/synchronizations in 132 ms.
[2024-05-27 17:27:17] [INFO ] Time to serialize gal into /tmp/LTL16822160331265750364.gal : 8 ms
[2024-05-27 17:27:17] [INFO ] Time to serialize properties into /tmp/LTL818536184147623128.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16822160331265750364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL818536184147623128.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu9.FMCb<=((((gu9.wait_msg_1+gu9.wait_msg_2)+(gu9.wait_msg_3+gu9.wait_msg_4))+((gu9.wait_msg_5+gu9.wait_msg_6)+(gu9.wait_msg_...214
Formula 0 simplified : FG!"(gu9.FMCb<=((((gu9.wait_msg_1+gu9.wait_msg_2)+(gu9.wait_msg_3+gu9.wait_msg_4))+((gu9.wait_msg_5+gu9.wait_msg_6)+(gu9.wait_msg_7+...208
Detected timeout of ITS tools.
Treatment of property SafeBus-PT-10-LTLCardinality-03 finished in 198682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 13 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:27:32] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 297 cols
[2024-05-27 17:27:32] [INFO ] Computed 36 invariants in 9 ms
[2024-05-27 17:27:33] [INFO ] Implicit Places using invariants in 961 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 964 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 984 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-04 finished in 1110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 297 transition count 1622
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 288 transition count 1622
Applied a total of 18 rules in 127 ms. Remains 288 /297 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
[2024-05-27 17:27:33] [INFO ] Flow matrix only has 633 transitions (discarded 989 similar events)
// Phase 1: matrix 633 rows 288 cols
[2024-05-27 17:27:33] [INFO ] Computed 36 invariants in 7 ms
[2024-05-27 17:27:34] [INFO ] Implicit Places using invariants in 1082 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1084 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 287/297 places, 1622/1631 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 287 transition count 1621
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 286 transition count 1621
Applied a total of 2 rules in 97 ms. Remains 286 /287 variables (removed 1) and now considering 1621/1622 (removed 1) transitions.
[2024-05-27 17:27:34] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 17:27:34] [INFO ] Computed 35 invariants in 12 ms
[2024-05-27 17:27:35] [INFO ] Implicit Places using invariants in 914 ms returned []
[2024-05-27 17:27:35] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-05-27 17:27:35] [INFO ] Invariant cache hit.
[2024-05-27 17:27:35] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:27:38] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 3426 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/297 places, 1621/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4734 ms. Remains : 286/297 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 536 ms.
Stack based approach found an accepted trace after 209 steps with 0 reset with depth 210 and stack size 210 in 1 ms.
FORMULA SafeBus-PT-10-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-07 finished in 5319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)&&G(!p1))))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 9 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:27:38] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 297 cols
[2024-05-27 17:27:38] [INFO ] Computed 36 invariants in 4 ms
[2024-05-27 17:27:39] [INFO ] Implicit Places using invariants in 853 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 855 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 871 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 147 ms :[p1, (OR p1 p0), true, (OR p0 p1)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 2 ms.
FORMULA SafeBus-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-11 finished in 1043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:27:39] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:27:39] [INFO ] Invariant cache hit.
[2024-05-27 17:27:40] [INFO ] Implicit Places using invariants in 925 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 931 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 946 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-12
Product exploration explored 100000 steps with 484 reset in 488 ms.
Stack based approach found an accepted trace after 1938 steps with 7 reset with depth 330 and stack size 330 in 10 ms.
FORMULA SafeBus-PT-10-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-12 finished in 1619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 6 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:27:41] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:27:41] [INFO ] Invariant cache hit.
[2024-05-27 17:27:42] [INFO ] Implicit Places using invariants in 987 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 989 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1002 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-13 finished in 1188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 11 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:27:42] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:27:42] [INFO ] Invariant cache hit.
[2024-05-27 17:27:43] [INFO ] Implicit Places using invariants in 1055 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1057 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1076 ms. Remains : 296/297 places, 1631/1631 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLCardinality-14 finished in 1729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (G(F(p1))||(!p1&&X(p1)))))'
Support contains 3 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 1631/1631 transitions.
Applied a total of 0 rules in 14 ms. Remains 297 /297 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:27:44] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:27:44] [INFO ] Invariant cache hit.
[2024-05-27 17:27:45] [INFO ] Implicit Places using invariants in 937 ms returned []
[2024-05-27 17:27:45] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:27:45] [INFO ] Invariant cache hit.
[2024-05-27 17:27:45] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:27:47] [INFO ] Implicit Places using invariants and state equation in 2422 ms returned []
Implicit Place search using SMT with State Equation took 3360 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-05-27 17:27:47] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:27:47] [INFO ] Invariant cache hit.
[2024-05-27 17:27:47] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 22/333 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 17:28:01] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:28:01] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:28:01] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 2 ms to minimize.
[2024-05-27 17:28:10] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 2 ms to minimize.
[2024-05-27 17:28:10] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 2 ms to minimize.
[2024-05-27 17:28:11] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 2 ms to minimize.
[2024-05-27 17:28:11] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 2 ms to minimize.
[2024-05-27 17:28:11] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 2 ms to minimize.
[2024-05-27 17:28:11] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:28:11] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 2 ms to minimize.
[2024-05-27 17:28:12] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 2 ms to minimize.
[2024-05-27 17:28:12] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 2 ms to minimize.
[2024-05-27 17:28:13] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:28:13] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:28:13] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-05-27 17:28:14] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:28:16] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 2 ms to minimize.
[2024-05-27 17:28:17] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:28:17] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 2 ms to minimize.
[2024-05-27 17:28:17] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/353 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/939 variables, and 353 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30029 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/297 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 14/311 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 22/333 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/353 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 17:28:24] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 1 ms to minimize.
[2024-05-27 17:28:24] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 2 ms to minimize.
[2024-05-27 17:28:33] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
[2024-05-27 17:28:33] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 1 ms to minimize.
[2024-05-27 17:28:33] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-05-27 17:28:33] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 2 ms to minimize.
[2024-05-27 17:28:34] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-05-27 17:28:36] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 2 ms to minimize.
[2024-05-27 17:28:36] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 2 ms to minimize.
[2024-05-27 17:28:36] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 2 ms to minimize.
[2024-05-27 17:28:36] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 1 ms to minimize.
[2024-05-27 17:28:36] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:28:37] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 1 ms to minimize.
[2024-05-27 17:28:37] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 2 ms to minimize.
[2024-05-27 17:28:40] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:28:40] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:28:40] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 1 ms to minimize.
[2024-05-27 17:28:41] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:28:41] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:28:41] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/373 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/939 variables, and 373 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30033 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/297 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 40/40 constraints]
After SMT, in 64539ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64557ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 297/297 places, 1531/1631 transitions.
Applied a total of 0 rules in 5 ms. Remains 297 /297 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67942 ms. Remains : 297/297 places, 1531/1631 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-15
Product exploration explored 100000 steps with 2595 reset in 428 ms.
Product exploration explored 100000 steps with 2708 reset in 422 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false]
RANDOM walk for 270 steps (0 resets) in 12 ms. (20 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 243 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-27 17:28:54] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 297 cols
[2024-05-27 17:28:54] [INFO ] Computed 36 invariants in 5 ms
[2024-05-27 17:28:54] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 17:28:57] [INFO ] [Real]Absence check using 14 positive and 22 generalized place invariants in 2700 ms returned sat
[2024-05-27 17:28:57] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2024-05-27 17:28:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:28:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-27 17:28:58] [INFO ] [Nat]Absence check using 14 positive and 22 generalized place invariants in 213 ms returned sat
[2024-05-27 17:28:59] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2024-05-27 17:28:59] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:28:59] [INFO ] [Nat]Added 111 Read/Feed constraints in 74 ms returned sat
[2024-05-27 17:28:59] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-05-27 17:28:59] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:29:00] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:29:00] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-27 17:29:00] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-05-27 17:29:00] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-05-27 17:29:00] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-27 17:29:00] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-05-27 17:29:00] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-27 17:29:00] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-05-27 17:29:01] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2024-05-27 17:29:01] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-05-27 17:29:01] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:29:01] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-27 17:29:01] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-27 17:29:01] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-27 17:29:01] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:29:01] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:29:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 3864 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 9 factoid took 320 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLCardinality-15 finished in 79137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-27 17:29:03] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3500538074181631534
[2024-05-27 17:29:03] [INFO ] Too many transitions (1631) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:29:03] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3500538074181631534
Running compilation step : cd /tmp/ltsmin3500538074181631534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 17:29:03] [INFO ] Applying decomposition
[2024-05-27 17:29:03] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6980891119737331550.txt' '-o' '/tmp/graph6980891119737331550.bin' '-w' '/tmp/graph6980891119737331550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6980891119737331550.bin' '-l' '-1' '-v' '-w' '/tmp/graph6980891119737331550.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:29:04] [INFO ] Decomposing Gal with order
[2024-05-27 17:29:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:29:04] [INFO ] Removed a total of 622 redundant transitions.
[2024-05-27 17:29:04] [INFO ] Flatten gal took : 123 ms
[2024-05-27 17:29:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 556 labels/synchronizations in 14 ms.
[2024-05-27 17:29:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality10329272292391214037.gal : 9 ms
[2024-05-27 17:29:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality13748772884666425739.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10329272292391214037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13748772884666425739.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((F(G("((((((gi1.gu3.wait_msg_1+gi1.gu3.wait_msg_2)+(gi1.gu3.wait_msg_3+gi1.gu3.wait_msg_4))+((gi1.gu3.wait_msg_5+gi1.gu3.wait_msg_6)...2136
Formula 0 simplified : GF!"((((((gi1.gu3.wait_msg_1+gi1.gu3.wait_msg_2)+(gi1.gu3.wait_msg_3+gi1.gu3.wait_msg_4))+((gi1.gu3.wait_msg_5+gi1.gu3.wait_msg_6)+(...2130
Compilation finished in 4190 ms.
Running link step : cd /tmp/ltsmin3500538074181631534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin3500538074181631534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin3500538074181631534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3500538074181631534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-27 17:48:54] [INFO ] Applying decomposition
[2024-05-27 17:48:54] [INFO ] Flatten gal took : 123 ms
[2024-05-27 17:48:54] [INFO ] Decomposing Gal with order
[2024-05-27 17:48:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:48:55] [INFO ] Removed a total of 4933 redundant transitions.
[2024-05-27 17:48:55] [INFO ] Flatten gal took : 415 ms
[2024-05-27 17:48:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 121 ms.
[2024-05-27 17:48:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality3659449744674030705.gal : 12 ms
[2024-05-27 17:48:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality18051622399212078705.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3659449744674030705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18051622399212078705.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F(G("((((((gu3.wait_msg_1+gu5.wait_msg_2)+(gu2.wait_msg_3+gu4.wait_msg_4))+((gu8.wait_msg_5+gu7.wait_msg_6)+(gu9.wait_msg_7+gu6.wai...2058
Formula 0 simplified : GF!"((((((gu3.wait_msg_1+gu5.wait_msg_2)+(gu2.wait_msg_3+gu4.wait_msg_4))+((gu8.wait_msg_5+gu7.wait_msg_6)+(gu9.wait_msg_7+gu6.wait_...2052
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin3500538074181631534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin3500538074181631534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-27 18:08:15] [INFO ] Flatten gal took : 232 ms
[2024-05-27 18:08:15] [INFO ] Input system was already deterministic with 1631 transitions.
[2024-05-27 18:08:15] [INFO ] Transformed 297 places.
[2024-05-27 18:08:15] [INFO ] Transformed 1631 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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
[2024-05-27 18:08:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality10835400044881932037.gal : 24 ms
[2024-05-27 18:08:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality16112966738083172320.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10835400044881932037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16112966738083172320.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((((((wait_msg_1+wait_msg_2)+(wait_msg_3+wait_msg_4))+((wait_msg_5+wait_msg_6)+(wait_msg_7+wait_msg_8)))+(wait_msg_9+wait_msg_...1616
Formula 0 simplified : GF!"((((((wait_msg_1+wait_msg_2)+(wait_msg_3+wait_msg_4))+((wait_msg_5+wait_msg_6)+(wait_msg_7+wait_msg_8)))+(wait_msg_9+wait_msg_10...1610

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SafeBus-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r334-tall-171679080300427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-10.tgz
mv SafeBus-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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