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.r070-tall-171620505200148.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 CANInsertWithFailure-PT-070, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505200148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 30M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716256042270

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 01:47:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 01:47:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 01:47:24] [INFO ] Load time of PNML (sax parser for PT used): 755 ms
[2024-05-21 01:47:24] [INFO ] Transformed 10644 places.
[2024-05-21 01:47:24] [INFO ] Transformed 29820 transitions.
[2024-05-21 01:47:24] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 973 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 10644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10643 transition count 29820
Applied a total of 1 rules in 2760 ms. Remains 10643 /10644 variables (removed 1) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-21 01:47:33] [INFO ] Computed 72 invariants in 5764 ms
[2024-05-21 01:47:45] [INFO ] Implicit Places using invariants in 17920 ms returned []
Implicit Place search using SMT only with invariants took 17964 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-21 01:47:46] [INFO ] Invariant cache hit.
[2024-05-21 01:47:46] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 125552ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 125881ms
Starting structural reductions in LTL mode, iteration 1 : 10643/10644 places, 29820/29820 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146721 ms. Remains : 10643/10644 places, 29820/29820 transitions.
Support contains 35 out of 10643 places after structural reductions.
[2024-05-21 01:49:53] [INFO ] Flatten gal took : 990 ms
[2024-05-21 01:49:53] [INFO ] Flatten gal took : 602 ms
[2024-05-21 01:49:55] [INFO ] Input system was already deterministic with 29820 transitions.
RANDOM walk for 40000 steps (22 resets) in 4473 ms. (8 steps per ms) remains 12/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
[2024-05-21 01:49:57] [INFO ] Invariant cache hit.
[2024-05-21 01:49:57] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 10492/10511 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10511 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 128/10639 variables, 64/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10639 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/10641 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10641/40463 variables, and 72 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 10492/10511 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-21 01:50:04] [INFO ] Deduced a trap composed of 5 places in 510 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10511 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10511/40463 variables, and 7 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5095 ms.
Refiners :[Positive P Invariants (semi-flows): 6/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 10362ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 485 transitions
Trivial Post-agglo rules discarded 485 transitions
Performed 485 trivial Post agglomeration. Transition count delta: 485
Iterating post reduction 0 with 485 rules applied. Total rules applied 485 place count 10643 transition count 29335
Reduce places removed 485 places and 0 transitions.
Iterating post reduction 1 with 485 rules applied. Total rules applied 970 place count 10158 transition count 29335
Performed 4823 Post agglomeration using F-continuation condition.Transition count delta: 4823
Deduced a syphon composed of 4823 places in 10 ms
Reduce places removed 4823 places and 0 transitions.
Iterating global reduction 2 with 9646 rules applied. Total rules applied 10616 place count 5335 transition count 24512
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10622 place count 5335 transition count 24506
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 10628 place count 5329 transition count 24506
Partial Free-agglomeration rule applied 4964 times.
Drop transitions (Partial Free agglomeration) removed 4964 transitions
Iterating global reduction 3 with 4964 rules applied. Total rules applied 15592 place count 5329 transition count 24506
Applied a total of 15592 rules in 8711 ms. Remains 5329 /10643 variables (removed 5314) and now considering 24506/29820 (removed 5314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8716 ms. Remains : 5329/10643 places, 24506/29820 transitions.
RANDOM walk for 40000 steps (93 resets) in 2754 ms. (14 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
[2024-05-21 01:50:17] [INFO ] Flow matrix only has 24499 transitions (discarded 7 similar events)
// Phase 1: matrix 24499 rows 5329 cols
[2024-05-21 01:50:18] [INFO ] Computed 72 invariants in 1302 ms
[2024-05-21 01:50:18] [INFO ] State equation strengthened by 24262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5185/5189 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:50:19] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 4 ms to minimize.
[2024-05-21 01:50:20] [INFO ] Deduced a trap composed of 2 places in 192 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5189 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5189 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 136/5325 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5325 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/5327 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:50:31] [INFO ] Deduced a trap composed of 123 places in 9666 ms of which 44 ms to minimize.
[2024-05-21 01:50:40] [INFO ] Deduced a trap composed of 100 places in 9464 ms of which 36 ms to minimize.
[2024-05-21 01:50:49] [INFO ] Deduced a trap composed of 95 places in 9145 ms of which 33 ms to minimize.
[2024-05-21 01:50:59] [INFO ] Deduced a trap composed of 87 places in 9129 ms of which 33 ms to minimize.
[2024-05-21 01:51:08] [INFO ] Deduced a trap composed of 114 places in 8906 ms of which 33 ms to minimize.
SMT process timed out in 50662ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 5329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5329/5329 places, 24506/24506 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 5324 transition count 24501
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 5324 transition count 24501
Applied a total of 16 rules in 3591 ms. Remains 5324 /5329 variables (removed 5) and now considering 24501/24506 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3591 ms. Remains : 5324/5329 places, 24501/24506 transitions.
RANDOM walk for 40000 steps (92 resets) in 1904 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 66444 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 66444 steps, saw 52110 distinct states, run finished after 3005 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-21 01:51:15] [INFO ] Flow matrix only has 24500 transitions (discarded 1 similar events)
// Phase 1: matrix 24500 rows 5324 cols
[2024-05-21 01:51:16] [INFO ] Computed 72 invariants in 1269 ms
[2024-05-21 01:51:16] [INFO ] State equation strengthened by 24284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:51:17] [INFO ] Deduced a trap composed of 2 places in 157 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 136/5320 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5320 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/5322 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:51:27] [INFO ] Deduced a trap composed of 106 places in 8910 ms of which 36 ms to minimize.
[2024-05-21 01:51:37] [INFO ] Deduced a trap composed of 107 places in 9425 ms of which 31 ms to minimize.
[2024-05-21 01:51:46] [INFO ] Deduced a trap composed of 105 places in 9390 ms of which 36 ms to minimize.
[2024-05-21 01:51:56] [INFO ] Deduced a trap composed of 85 places in 9336 ms of which 32 ms to minimize.
[2024-05-21 01:52:05] [INFO ] Deduced a trap composed of 83 places in 9257 ms of which 38 ms to minimize.
[2024-05-21 01:52:15] [INFO ] Deduced a trap composed of 143 places in 9637 ms of which 34 ms to minimize.
[2024-05-21 01:52:24] [INFO ] Deduced a trap composed of 126 places in 9351 ms of which 36 ms to minimize.
[2024-05-21 01:52:34] [INFO ] Deduced a trap composed of 81 places in 9388 ms of which 34 ms to minimize.
SMT process timed out in 78834ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 5324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1174 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1174 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1179 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2024-05-21 01:52:36] [INFO ] Flow matrix only has 24500 transitions (discarded 1 similar events)
[2024-05-21 01:52:36] [INFO ] Invariant cache hit.
[2024-05-21 01:52:47] [INFO ] Implicit Places using invariants in 11031 ms returned []
Implicit Place search using SMT only with invariants took 11034 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-21 01:52:47] [INFO ] Flow matrix only has 24500 transitions (discarded 1 similar events)
[2024-05-21 01:52:47] [INFO ] Invariant cache hit.
[2024-05-21 01:52:48] [INFO ] State equation strengthened by 24284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 99652ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 99911ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112191 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Computed a total of 282 stabilizing places and 490 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((p0||X((X((p1&&X(p2))) U (p0&&X((p1&&X(p2)))))))))'
Support contains 1 out of 10643 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 11 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 5215 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-21 01:54:33] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2024-05-21 01:54:35] [INFO ] Computed 72 invariants in 2166 ms
[2024-05-21 01:54:42] [INFO ] Implicit Places using invariants in 9336 ms returned []
Implicit Place search using SMT only with invariants took 9337 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-21 01:54:42] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-21 01:54:42] [INFO ] Invariant cache hit.
[2024-05-21 01:54:42] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 87448ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 87684ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102301 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-00
Stuttering criterion allowed to conclude after 362 steps with 0 reset in 28 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-00 finished in 102622 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&&(p1 U (G(p1)||(p1&&(p2||(!p0 U (p3||G(!p0)))))))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1887 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-21 01:56:17] [INFO ] Computed 72 invariants in 5345 ms
[2024-05-21 01:56:30] [INFO ] Implicit Places using invariants in 18272 ms returned []
Implicit Place search using SMT only with invariants took 18273 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-21 01:56:30] [INFO ] Invariant cache hit.
[2024-05-21 01:56:31] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 146826ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 147084ms
Finished structural reductions in LTL mode , in 1 iterations and 167287 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-04
Entered a terminal (fully accepting) state of product in 911 steps with 0 reset in 27 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-04 finished in 167549 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&&F((F((p1||X(p1)))&&X(p0)))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1892 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-21 01:58:59] [INFO ] Invariant cache hit.
[2024-05-21 01:59:13] [INFO ] Implicit Places using invariants in 13539 ms returned []
Implicit Place search using SMT only with invariants took 13540 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-21 01:59:13] [INFO ] Invariant cache hit.
[2024-05-21 01:59:13] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 126180ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 126409ms
Finished structural reductions in LTL mode , in 1 iterations and 141877 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 2969 ms.
Product exploration explored 100000 steps with 33333 reset in 2739 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-070-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-05 finished in 147920 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 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 11 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Applied a total of 10636 rules in 5137 ms. Remains 5325 /10643 variables (removed 5318) and now considering 24502/29820 (removed 5318) transitions.
[2024-05-21 02:01:31] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2024-05-21 02:01:32] [INFO ] Computed 72 invariants in 1692 ms
[2024-05-21 02:01:39] [INFO ] Implicit Places using invariants in 8740 ms returned []
Implicit Place search using SMT only with invariants took 8753 ms to find 0 implicit places.
Running 24432 sub problems to find dead transitions.
[2024-05-21 02:01:40] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-21 02:01:40] [INFO ] Invariant cache hit.
[2024-05-21 02:01:40] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5324 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24432 unsolved
SMT process timed out in 87153ms, After SMT, problems are : Problem set: 0 solved, 24432 unsolved
Search for dead transitions found 0 dead transitions in 87356ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5325/10643 places, 24502/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101276 ms. Remains : 5325/10643 places, 24502/29820 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-07
Product exploration explored 100000 steps with 280 reset in 2507 ms.
Product exploration explored 100000 steps with 283 reset in 2513 ms.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 44 ms :[(NOT p0)]
RANDOM walk for 40000 steps (110 resets) in 1015 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 53778 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 1
Probabilistic random walk after 53778 steps, saw 38933 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-21 02:03:15] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-21 02:03:15] [INFO ] Invariant cache hit.
[2024-05-21 02:03:16] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5182/5185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:03:16] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-21 02:03:17] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-21 02:03:17] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-21 02:03:17] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-21 02:03:17] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-21 02:03:18] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-21 02:03:18] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 02:03:18] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
[2024-05-21 02:03:18] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 2 ms to minimize.
[2024-05-21 02:03:19] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-21 02:03:19] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-21 02:03:19] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-21 02:03:19] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-21 02:03:20] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-21 02:03:20] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-21 02:03:20] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-21 02:03:20] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 2 ms to minimize.
[2024-05-21 02:03:21] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 4 ms to minimize.
[2024-05-21 02:03:21] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
SMT process timed out in 5393ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5325 transition count 24500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4970 times.
Drop transitions (Partial Free agglomeration) removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4974 place count 5323 transition count 24500
Applied a total of 4974 rules in 3192 ms. Remains 5323 /5325 variables (removed 2) and now considering 24500/24502 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3192 ms. Remains : 5323/5325 places, 24500/24502 transitions.
RANDOM walk for 40000 steps (93 resets) in 1223 ms. (32 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 66304 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66304 steps, saw 52098 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-21 02:03:27] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2024-05-21 02:03:29] [INFO ] Computed 72 invariants in 1255 ms
[2024-05-21 02:03:29] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:03:30] [INFO ] Deduced a trap composed of 2 places in 139 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5183 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 136/5319 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5319 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5321 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:03:40] [INFO ] Deduced a trap composed of 138 places in 9738 ms of which 30 ms to minimize.
[2024-05-21 02:03:49] [INFO ] Deduced a trap composed of 80 places in 9031 ms of which 35 ms to minimize.
[2024-05-21 02:03:59] [INFO ] Deduced a trap composed of 110 places in 9301 ms of which 33 ms to minimize.
[2024-05-21 02:04:08] [INFO ] Deduced a trap composed of 121 places in 9430 ms of which 37 ms to minimize.
[2024-05-21 02:04:17] [INFO ] Deduced a trap composed of 132 places in 9196 ms of which 35 ms to minimize.
SMT process timed out in 49969ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1260 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1260 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1176 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-21 02:04:20] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-21 02:04:20] [INFO ] Invariant cache hit.
[2024-05-21 02:04:31] [INFO ] Implicit Places using invariants in 10958 ms returned []
Implicit Place search using SMT only with invariants took 10959 ms to find 0 implicit places.
Running 24430 sub problems to find dead transitions.
[2024-05-21 02:04:31] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-21 02:04:31] [INFO ] Invariant cache hit.
[2024-05-21 02:04:31] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5322 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24430 unsolved
SMT process timed out in 94840ms, After SMT, problems are : Problem set: 0 solved, 24430 unsolved
Search for dead transitions found 0 dead transitions in 95080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107257 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Knowledge obtained : [p0, (X p0), (X (X 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 995 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
[2024-05-21 02:06:07] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2024-05-21 02:06:09] [INFO ] Computed 72 invariants in 1601 ms
[2024-05-21 02:06:16] [INFO ] Implicit Places using invariants in 8637 ms returned []
Implicit Place search using SMT only with invariants took 8638 ms to find 0 implicit places.
Running 24432 sub problems to find dead transitions.
[2024-05-21 02:06:16] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-21 02:06:16] [INFO ] Invariant cache hit.
[2024-05-21 02:06:16] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5324 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24432 unsolved
SMT process timed out in 84470ms, After SMT, problems are : Problem set: 0 solved, 24432 unsolved
Search for dead transitions found 0 dead transitions in 84700ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94372 ms. Remains : 5325/5325 places, 24502/24502 transitions.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 40000 steps (112 resets) in 1015 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 53266 steps, run timeout after 3146 ms. (steps per millisecond=16 ) properties seen :0 out of 1
Probabilistic random walk after 53266 steps, saw 38862 distinct states, run finished after 3147 ms. (steps per millisecond=16 ) properties seen :0
[2024-05-21 02:07:44] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-21 02:07:44] [INFO ] Invariant cache hit.
[2024-05-21 02:07:44] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5182/5185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:07:45] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-21 02:07:45] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-21 02:07:46] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-21 02:07:46] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-21 02:07:46] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-21 02:07:46] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 2 ms to minimize.
[2024-05-21 02:07:47] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 1 ms to minimize.
[2024-05-21 02:07:47] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 2 ms to minimize.
[2024-05-21 02:07:47] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 2 ms to minimize.
[2024-05-21 02:07:47] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 1 ms to minimize.
[2024-05-21 02:07:48] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-21 02:07:48] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 1 ms to minimize.
[2024-05-21 02:07:48] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-21 02:07:48] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 6 ms to minimize.
[2024-05-21 02:07:49] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 2 ms to minimize.
[2024-05-21 02:07:49] [INFO ] Deduced a trap composed of 2 places in 191 ms of which 1 ms to minimize.
[2024-05-21 02:07:49] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 02:07:49] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-21 02:07:50] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
SMT process timed out in 5316ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5325 transition count 24500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4970 times.
Drop transitions (Partial Free agglomeration) removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4974 place count 5323 transition count 24500
Applied a total of 4974 rules in 3206 ms. Remains 5323 /5325 variables (removed 2) and now considering 24500/24502 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3208 ms. Remains : 5323/5325 places, 24500/24502 transitions.
RANDOM walk for 40000 steps (92 resets) in 1191 ms. (33 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 66250 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66250 steps, saw 52084 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-21 02:07:56] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2024-05-21 02:07:57] [INFO ] Computed 72 invariants in 1296 ms
[2024-05-21 02:07:58] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:07:58] [INFO ] Deduced a trap composed of 2 places in 139 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5183 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 136/5319 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5319 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5321 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:08:09] [INFO ] Deduced a trap composed of 138 places in 9895 ms of which 32 ms to minimize.
[2024-05-21 02:08:19] [INFO ] Deduced a trap composed of 80 places in 9608 ms of which 35 ms to minimize.
[2024-05-21 02:08:29] [INFO ] Deduced a trap composed of 110 places in 9743 ms of which 33 ms to minimize.
[2024-05-21 02:08:38] [INFO ] Deduced a trap composed of 121 places in 9356 ms of which 34 ms to minimize.
[2024-05-21 02:08:47] [INFO ] Deduced a trap composed of 132 places in 9179 ms of which 33 ms to minimize.
SMT process timed out in 51124ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1247 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1248 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1215 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-21 02:08:50] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-21 02:08:50] [INFO ] Invariant cache hit.
[2024-05-21 02:09:01] [INFO ] Implicit Places using invariants in 10911 ms returned []
Implicit Place search using SMT only with invariants took 10915 ms to find 0 implicit places.
Running 24430 sub problems to find dead transitions.
[2024-05-21 02:09:01] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-21 02:09:01] [INFO ] Invariant cache hit.
[2024-05-21 02:09:01] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5322 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24430 unsolved
SMT process timed out in 93019ms, After SMT, problems are : Problem set: 0 solved, 24430 unsolved
Search for dead transitions found 0 dead transitions in 93225ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105393 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 282 reset in 2373 ms.
Product exploration explored 100000 steps with 283 reset in 2514 ms.
Built C files in :
/tmp/ltsmin11360239287347941306
[2024-05-21 02:10:39] [INFO ] Too many transitions (24502) to apply POR reductions. Disabling POR matrices.
[2024-05-21 02:10:39] [INFO ] Built C files in 231ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11360239287347941306
Running compilation step : cd /tmp/ltsmin11360239287347941306;'/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/ltsmin11360239287347941306;'/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/ltsmin11360239287347941306;'/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 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 1015 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
[2024-05-21 02:10:43] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2024-05-21 02:10:45] [INFO ] Computed 72 invariants in 1609 ms
[2024-05-21 02:10:52] [INFO ] Implicit Places using invariants in 8734 ms returned []
Implicit Place search using SMT only with invariants took 8737 ms to find 0 implicit places.
Running 24432 sub problems to find dead transitions.
[2024-05-21 02:10:52] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-21 02:10:52] [INFO ] Invariant cache hit.
[2024-05-21 02:10:53] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5324 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24432 unsolved
SMT process timed out in 91029ms, After SMT, problems are : Problem set: 0 solved, 24432 unsolved
Search for dead transitions found 0 dead transitions in 91225ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 101006 ms. Remains : 5325/5325 places, 24502/24502 transitions.
Built C files in :
/tmp/ltsmin6480834197393343879
[2024-05-21 02:12:23] [INFO ] Too many transitions (24502) to apply POR reductions. Disabling POR matrices.
[2024-05-21 02:12:24] [INFO ] Built C files in 191ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6480834197393343879
Running compilation step : cd /tmp/ltsmin6480834197393343879;'/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/ltsmin6480834197393343879;'/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/ltsmin6480834197393343879;'/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-21 02:12:28] [INFO ] Flatten gal took : 438 ms
[2024-05-21 02:12:28] [INFO ] Flatten gal took : 413 ms
[2024-05-21 02:12:28] [INFO ] Time to serialize gal into /tmp/LTL1043372663424720920.gal : 114 ms
[2024-05-21 02:12:28] [INFO ] Time to serialize properties into /tmp/LTL6781450569486325656.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/LTL1043372663424720920.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12805194356882831820.hoa' '-atoms' '/tmp/LTL6781450569486325656.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/LTL6781450569486325656.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12805194356882831820.hoa
Detected timeout of ITS tools.
[2024-05-21 02:12:44] [INFO ] Flatten gal took : 380 ms
[2024-05-21 02:12:45] [INFO ] Flatten gal took : 403 ms
[2024-05-21 02:12:45] [INFO ] Time to serialize gal into /tmp/LTL15878122351121151244.gal : 85 ms
[2024-05-21 02:12:45] [INFO ] Time to serialize properties into /tmp/LTL9845453935637031885.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15878122351121151244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9845453935637031885.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((Node13GiveAnswer2<1)||(Node37IsInserted<1))||(Node63requestsent37<1))"))))
Formula 0 simplified : GF!"(((Node13GiveAnswer2<1)||(Node37IsInserted<1))||(Node63requestsent37<1))"
Detected timeout of ITS tools.
[2024-05-21 02:13:00] [INFO ] Flatten gal took : 379 ms
[2024-05-21 02:13:00] [INFO ] Applying decomposition
[2024-05-21 02:13:00] [INFO ] Flatten gal took : 394 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/graph6319314258564685288.txt' '-o' '/tmp/graph6319314258564685288.bin' '-w' '/tmp/graph6319314258564685288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6319314258564685288.bin' '-l' '-1' '-v' '-w' '/tmp/graph6319314258564685288.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:13:01] [INFO ] Decomposing Gal with order
[2024-05-21 02:13:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:13:05] [INFO ] Removed a total of 19432 redundant transitions.
[2024-05-21 02:13:05] [INFO ] Flatten gal took : 3127 ms
[2024-05-21 02:13:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 14352 labels/synchronizations in 3930 ms.
[2024-05-21 02:13:10] [INFO ] Time to serialize gal into /tmp/LTL10855277811779974352.gal : 151 ms
[2024-05-21 02:13:10] [INFO ] Time to serialize properties into /tmp/LTL5145161555047234274.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/LTL10855277811779974352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5145161555047234274.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((u3.Node13GiveAnswer2<1)||(u38.Node37IsInserted<1))||(u64.Node63requestsent37<1))"))))
Formula 0 simplified : GF!"(((u3.Node13GiveAnswer2<1)||(u38.Node37IsInserted<1))||(u64.Node63requestsent37<1))"
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-07 finished in 719380 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(G((p0||X(F(p1)))))))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2058 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-21 02:13:32] [INFO ] Computed 72 invariants in 5271 ms
[2024-05-21 02:13:46] [INFO ] Implicit Places using invariants in 18650 ms returned []
Implicit Place search using SMT only with invariants took 18666 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-21 02:13:46] [INFO ] Invariant cache hit.
[2024-05-21 02:13:46] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 131550ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 131821ms
Finished structural reductions in LTL mode , in 1 iterations and 152589 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-08
Product exploration explored 100000 steps with 14239 reset in 2986 ms.
Product exploration explored 100000 steps with 14277 reset in 2643 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 35604 steps (19 resets) in 1229 ms. (28 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1835 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-21 02:16:07] [INFO ] Invariant cache hit.
[2024-05-21 02:16:20] [INFO ] Implicit Places using invariants in 13326 ms returned []
Implicit Place search using SMT only with invariants took 13326 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-21 02:16:20] [INFO ] Invariant cache hit.
[2024-05-21 02:16:20] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 132526ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 132771ms
Finished structural reductions in LTL mode , in 1 iterations and 147974 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 27047 steps (14 resets) in 604 ms. (44 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 14270 reset in 2665 ms.
Product exploration explored 100000 steps with 14283 reset in 2751 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 10643 transition count 29820
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 346 place count 10643 transition count 29820
Deduced a syphon composed of 420 places in 8 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 420 place count 10643 transition count 29820
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 560 place count 10503 transition count 29680
Deduced a syphon composed of 280 places in 8 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 700 place count 10503 transition count 29680
Performed 4896 Post agglomeration using F-continuation condition.Transition count delta: -9520
Deduced a syphon composed of 5176 places in 11 ms
Iterating global reduction 1 with 4896 rules applied. Total rules applied 5596 place count 10503 transition count 39200
Discarding 272 places :
Symmetric choice reduction at 1 with 272 rule applications. Total rules 5868 place count 10231 transition count 38928
Deduced a syphon composed of 4904 places in 6 ms
Iterating global reduction 1 with 272 rules applied. Total rules applied 6140 place count 10231 transition count 38928
Deduced a syphon composed of 4904 places in 6 ms
Applied a total of 6140 rules in 13461 ms. Remains 10231 /10643 variables (removed 412) and now considering 38928/29820 (removed -9108) transitions.
Running 38858 sub problems to find dead transitions.
[2024-05-21 02:18:54] [INFO ] Flow matrix only has 34236 transitions (discarded 4692 similar events)
// Phase 1: matrix 34236 rows 10231 cols
[2024-05-21 02:19:00] [INFO ] Computed 72 invariants in 6063 ms
[2024-05-21 02:19:00] [INFO ] State equation strengthened by 14626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10230 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 38858 unsolved
SMT process timed out in 186660ms, After SMT, problems are : Problem set: 0 solved, 38858 unsolved
Search for dead transitions found 0 dead transitions in 187003ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10231/10643 places, 38928/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200519 ms. Remains : 10231/10643 places, 38928/29820 transitions.
Built C files in :
/tmp/ltsmin3920247535305888439
[2024-05-21 02:22:01] [INFO ] Built C files in 222ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3920247535305888439
Running compilation step : cd /tmp/ltsmin3920247535305888439;'/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/ltsmin3920247535305888439;'/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/ltsmin3920247535305888439;'/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 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2517 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-21 02:22:12] [INFO ] Computed 72 invariants in 5263 ms
[2024-05-21 02:22:25] [INFO ] Implicit Places using invariants in 18636 ms returned []
Implicit Place search using SMT only with invariants took 18637 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-21 02:22:26] [INFO ] Invariant cache hit.
[2024-05-21 02:22:26] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 144432ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 144720ms
Finished structural reductions in LTL mode , in 1 iterations and 165921 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Built C files in :
/tmp/ltsmin873222450571784740
[2024-05-21 02:24:50] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin873222450571784740
Running compilation step : cd /tmp/ltsmin873222450571784740;'/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/ltsmin873222450571784740;'/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/ltsmin873222450571784740;'/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-21 02:24:54] [INFO ] Flatten gal took : 548 ms
[2024-05-21 02:24:55] [INFO ] Flatten gal took : 602 ms
[2024-05-21 02:24:55] [INFO ] Time to serialize gal into /tmp/LTL9265262267248957527.gal : 99 ms
[2024-05-21 02:24:55] [INFO ] Time to serialize properties into /tmp/LTL7708783173807998695.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/LTL9265262267248957527.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10834280539820592927.hoa' '-atoms' '/tmp/LTL7708783173807998695.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/LTL7708783173807998695.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10834280539820592927.hoa
Detected timeout of ITS tools.
[2024-05-21 02:25:11] [INFO ] Flatten gal took : 490 ms
[2024-05-21 02:25:11] [INFO ] Flatten gal took : 642 ms
[2024-05-21 02:25:12] [INFO ] Time to serialize gal into /tmp/LTL5660374785763365754.gal : 88 ms
[2024-05-21 02:25:12] [INFO ] Time to serialize properties into /tmp/LTL6074984466460902224.ltl : 6 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/LTL5660374785763365754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6074984466460902224.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 : !((X(X(X(X(G((X(F("((Node56IsInserted<1)||(Node57Request<1))")))||("((Node31Request>=1)&&(Node32IsInserted>=1))"))))))))
Formula 0 simplified : XXXXF(!"((Node31Request>=1)&&(Node32IsInserted>=1))" & XG!"((Node56IsInserted<1)||(Node57Request<1))")
Detected timeout of ITS tools.
[2024-05-21 02:25:27] [INFO ] Flatten gal took : 492 ms
[2024-05-21 02:25:27] [INFO ] Applying decomposition
[2024-05-21 02:25:28] [INFO ] Flatten gal took : 547 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/graph17180289987630678783.txt' '-o' '/tmp/graph17180289987630678783.bin' '-w' '/tmp/graph17180289987630678783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17180289987630678783.bin' '-l' '-1' '-v' '-w' '/tmp/graph17180289987630678783.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:25:29] [INFO ] Decomposing Gal with order
[2024-05-21 02:25:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:25:32] [INFO ] Removed a total of 14739 redundant transitions.
[2024-05-21 02:25:33] [INFO ] Flatten gal took : 1849 ms
[2024-05-21 02:25:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 19402 labels/synchronizations in 2072 ms.
[2024-05-21 02:25:35] [INFO ] Time to serialize gal into /tmp/LTL8091996592312875197.gal : 178 ms
[2024-05-21 02:25:35] [INFO ] Time to serialize properties into /tmp/LTL8876064593489302013.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/LTL8091996592312875197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8876064593489302013.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G((X(F("((i4.u224.Node56IsInserted<1)||(i58.u231.Node57Request<1))")))||("((i32.u127.Node31Request>=1)&&(i33.u128.Node32IsI...176
Formula 0 simplified : XXXXF(!"((i32.u127.Node31Request>=1)&&(i33.u128.Node32IsInserted>=1))" & XG!"((i4.u224.Node56IsInserted<1)||(i58.u231.Node57Request<...160
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-08 finished in 745621 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 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4830 Post agglomeration using F-continuation condition.Transition count delta: 4830
Deduced a syphon composed of 4830 places in 11 ms
Reduce places removed 4830 places and 0 transitions.
Iterating global reduction 2 with 9660 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 6095 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-21 02:25:57] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
// Phase 1: matrix 19809 rows 5324 cols
[2024-05-21 02:25:58] [INFO ] Computed 72 invariants in 1752 ms
[2024-05-21 02:26:05] [INFO ] Implicit Places using invariants in 8913 ms returned []
Implicit Place search using SMT only with invariants took 8927 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-21 02:26:06] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-21 02:26:06] [INFO ] Invariant cache hit.
[2024-05-21 02:26:06] [INFO ] State equation strengthened by 14628 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 88384ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 88610ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103676 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-09
Product exploration explored 100000 steps with 284 reset in 2850 ms.
Product exploration explored 100000 steps with 283 reset in 2923 ms.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 45 ms :[(NOT p0)]
RANDOM walk for 33491 steps (92 resets) in 1639 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1364 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2024-05-21 02:27:42] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-21 02:27:42] [INFO ] Invariant cache hit.
[2024-05-21 02:27:50] [INFO ] Implicit Places using invariants in 7204 ms returned []
Implicit Place search using SMT only with invariants took 7204 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-21 02:27:50] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-21 02:27:50] [INFO ] Invariant cache hit.
[2024-05-21 02:27:50] [INFO ] State equation strengthened by 14628 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 87339ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 87556ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 96162 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 35 ms :[(NOT p0)]
RANDOM walk for 16948 steps (46 resets) in 634 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 282 reset in 2575 ms.
Product exploration explored 100000 steps with 283 reset in 2414 ms.
Built C files in :
/tmp/ltsmin5719683955419207174
[2024-05-21 02:29:23] [INFO ] Too many transitions (24501) to apply POR reductions. Disabling POR matrices.
[2024-05-21 02:29:23] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5719683955419207174
Running compilation step : cd /tmp/ltsmin5719683955419207174;'/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/ltsmin5719683955419207174;'/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/ltsmin5719683955419207174;'/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 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1315 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2024-05-21 02:29:27] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-21 02:29:27] [INFO ] Invariant cache hit.
[2024-05-21 02:29:34] [INFO ] Implicit Places using invariants in 6861 ms returned []
Implicit Place search using SMT only with invariants took 6863 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-21 02:29:35] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-21 02:29:35] [INFO ] Invariant cache hit.
[2024-05-21 02:29:35] [INFO ] State equation strengthened by 14628 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 84337ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 84576ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92789 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Built C files in :
/tmp/ltsmin16937336218394123474
[2024-05-21 02:30:59] [INFO ] Too many transitions (24501) to apply POR reductions. Disabling POR matrices.
[2024-05-21 02:30:59] [INFO ] Built C files in 137ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16937336218394123474
Running compilation step : cd /tmp/ltsmin16937336218394123474;'/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/ltsmin16937336218394123474;'/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/ltsmin16937336218394123474;'/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-21 02:31:03] [INFO ] Flatten gal took : 435 ms
[2024-05-21 02:31:03] [INFO ] Flatten gal took : 456 ms
[2024-05-21 02:31:03] [INFO ] Time to serialize gal into /tmp/LTL18295211050284512293.gal : 91 ms
[2024-05-21 02:31:03] [INFO ] Time to serialize properties into /tmp/LTL9064819615060385779.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/LTL18295211050284512293.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9350261292620037633.hoa' '-atoms' '/tmp/LTL9064819615060385779.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/LTL9064819615060385779.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9350261292620037633.hoa
Detected timeout of ITS tools.
[2024-05-21 02:31:19] [INFO ] Flatten gal took : 412 ms
[2024-05-21 02:31:20] [INFO ] Flatten gal took : 458 ms
[2024-05-21 02:31:20] [INFO ] Time to serialize gal into /tmp/LTL15874506436916441063.gal : 88 ms
[2024-05-21 02:31:20] [INFO ] Time to serialize properties into /tmp/LTL11475139440347211366.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/LTL15874506436916441063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11475139440347211366.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("((Node16IsInserted<1)||(Node51requestsent16<1))"))))
Formula 0 simplified : GF!"((Node16IsInserted<1)||(Node51requestsent16<1))"
Detected timeout of ITS tools.
[2024-05-21 02:31:35] [INFO ] Flatten gal took : 425 ms
[2024-05-21 02:31:35] [INFO ] Applying decomposition
[2024-05-21 02:31:36] [INFO ] Flatten gal took : 510 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/graph17765552374528044131.txt' '-o' '/tmp/graph17765552374528044131.bin' '-w' '/tmp/graph17765552374528044131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17765552374528044131.bin' '-l' '-1' '-v' '-w' '/tmp/graph17765552374528044131.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:31:37] [INFO ] Decomposing Gal with order
[2024-05-21 02:31:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:31:40] [INFO ] Removed a total of 19430 redundant transitions.
[2024-05-21 02:31:40] [INFO ] Flatten gal took : 2609 ms
[2024-05-21 02:31:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 14353 labels/synchronizations in 3900 ms.
[2024-05-21 02:31:44] [INFO ] Time to serialize gal into /tmp/LTL4753789169780385987.gal : 119 ms
[2024-05-21 02:31:44] [INFO ] Time to serialize properties into /tmp/LTL8352914803230078920.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/LTL4753789169780385987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8352914803230078920.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((u17.Node16IsInserted<1)||(u52.Node51requestsent16<1))"))))
Formula 0 simplified : GF!"((u17.Node16IsInserted<1)||(u52.Node51requestsent16<1))"
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-09 finished in 368869 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 U (p1||G(p0))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 11 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Applied a total of 10636 rules in 6107 ms. Remains 5325 /10643 variables (removed 5318) and now considering 24502/29820 (removed 5318) transitions.
[2024-05-21 02:32:05] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2024-05-21 02:32:07] [INFO ] Computed 72 invariants in 1731 ms
[2024-05-21 02:32:14] [INFO ] Implicit Places using invariants in 8760 ms returned []
Implicit Place search using SMT only with invariants took 8762 ms to find 0 implicit places.
Running 24432 sub problems to find dead transitions.
[2024-05-21 02:32:15] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-21 02:32:15] [INFO ] Invariant cache hit.
[2024-05-21 02:32:15] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5324 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24432 unsolved
SMT process timed out in 85628ms, After SMT, problems are : Problem set: 0 solved, 24432 unsolved
Search for dead transitions found 0 dead transitions in 85936ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5325/10643 places, 24502/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100837 ms. Remains : 5325/10643 places, 24502/29820 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-11
Stuttering criterion allowed to conclude after 377 steps with 0 reset in 10 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-11 finished in 101004 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 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4830 Post agglomeration using F-continuation condition.Transition count delta: 4830
Deduced a syphon composed of 4830 places in 10 ms
Reduce places removed 4830 places and 0 transitions.
Iterating global reduction 2 with 9660 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 6181 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-21 02:33:47] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
// Phase 1: matrix 19809 rows 5324 cols
[2024-05-21 02:33:48] [INFO ] Computed 72 invariants in 1675 ms
[2024-05-21 02:33:55] [INFO ] Implicit Places using invariants in 8757 ms returned []
Implicit Place search using SMT only with invariants took 8758 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-21 02:33:56] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-21 02:33:56] [INFO ] Invariant cache hit.
[2024-05-21 02:33:56] [INFO ] State equation strengthened by 14628 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 87732ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 88010ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102986 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-12
Stuttering criterion allowed to conclude after 350 steps with 0 reset in 10 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-12 finished in 103095 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(p0)||(!p0 U (G(!p0)||(G(!p2)&&X(p3)&&p1)))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2612 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-21 02:35:31] [INFO ] Computed 72 invariants in 5317 ms
[2024-05-21 02:35:45] [INFO ] Implicit Places using invariants in 18787 ms returned []
Implicit Place search using SMT only with invariants took 18790 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-21 02:35:45] [INFO ] Invariant cache hit.
[2024-05-21 02:35:45] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 128739ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 129015ms
Finished structural reductions in LTL mode , in 1 iterations and 150453 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 539 ms :[true, false, p2, (OR (NOT p3) p2), (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND p0 p2), (AND p2 (NOT p0)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)) (AND p0 p2)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-13
Entered a terminal (fully accepting) state of product in 17141 steps with 9 reset in 433 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-13 finished in 151504 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)&&F(G(p1)))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 976 place count 10155 transition count 29331
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4828 Post agglomeration using F-continuation condition.Transition count delta: 4828
Deduced a syphon composed of 4828 places in 10 ms
Reduce places removed 4828 places and 0 transitions.
Iterating global reduction 2 with 9656 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Applied a total of 10634 rules in 6278 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
[2024-05-21 02:38:01] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
// Phase 1: matrix 19812 rows 5326 cols
[2024-05-21 02:38:03] [INFO ] Computed 72 invariants in 1739 ms
[2024-05-21 02:38:10] [INFO ] Implicit Places using invariants in 8942 ms returned []
Implicit Place search using SMT only with invariants took 8945 ms to find 0 implicit places.
Running 24433 sub problems to find dead transitions.
[2024-05-21 02:38:10] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
[2024-05-21 02:38:10] [INFO ] Invariant cache hit.
[2024-05-21 02:38:11] [INFO ] State equation strengthened by 14626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5325 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24433 unsolved
SMT process timed out in 87007ms, After SMT, problems are : Problem set: 0 solved, 24433 unsolved
Search for dead transitions found 0 dead transitions in 87241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5326/10643 places, 24503/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102513 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-15
Product exploration explored 100000 steps with 281 reset in 2444 ms.
Stack based approach found an accepted trace after 45957 steps with 127 reset with depth 336 and stack size 335 in 1067 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-15 finished in 106218 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' '!(X(X(X(X(G((p0||X(F(p1)))))))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-070-LTLFireability-08
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 486 rules applied. Total rules applied 486 place count 10643 transition count 29334
Reduce places removed 486 places and 0 transitions.
Iterating post reduction 1 with 486 rules applied. Total rules applied 972 place count 10157 transition count 29334
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 972 place count 10157 transition count 29332
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 4828 Post agglomeration using F-continuation condition.Transition count delta: 4828
Deduced a syphon composed of 4828 places in 12 ms
Reduce places removed 4828 places and 0 transitions.
Iterating global reduction 2 with 9656 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Applied a total of 10632 rules in 6152 ms. Remains 5327 /10643 variables (removed 5316) and now considering 24504/29820 (removed 5316) transitions.
[2024-05-21 02:39:48] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
// Phase 1: matrix 19812 rows 5327 cols
[2024-05-21 02:39:50] [INFO ] Computed 72 invariants in 1745 ms
[2024-05-21 02:39:56] [INFO ] Implicit Places using invariants in 8636 ms returned []
Implicit Place search using SMT only with invariants took 8639 ms to find 0 implicit places.
Running 24434 sub problems to find dead transitions.
[2024-05-21 02:39:57] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2024-05-21 02:39:57] [INFO ] Invariant cache hit.
[2024-05-21 02:39:57] [INFO ] State equation strengthened by 14626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5326 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24434 unsolved
SMT process timed out in 83006ms, After SMT, problems are : Problem set: 0 solved, 24434 unsolved
Search for dead transitions found 0 dead transitions in 83212ms
Starting structural reductions in LI_LTL mode, iteration 1 : 5327/10643 places, 24504/29820 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 98040 ms. Remains : 5327/10643 places, 24504/29820 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-08
Product exploration explored 100000 steps with 14267 reset in 3037 ms.
Product exploration explored 100000 steps with 14293 reset in 2434 ms.
Computed a total of 210 stabilizing places and 350 stable transitions
Computed a total of 210 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 11057 steps (28 resets) in 455 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 5327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5327/5327 places, 24504/24504 transitions.
Applied a total of 0 rules in 1291 ms. Remains 5327 /5327 variables (removed 0) and now considering 24504/24504 (removed 0) transitions.
[2024-05-21 02:41:28] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2024-05-21 02:41:28] [INFO ] Invariant cache hit.
[2024-05-21 02:41:35] [INFO ] Implicit Places using invariants in 6923 ms returned []
Implicit Place search using SMT only with invariants took 6927 ms to find 0 implicit places.
Running 24434 sub problems to find dead transitions.
[2024-05-21 02:41:35] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2024-05-21 02:41:35] [INFO ] Invariant cache hit.
[2024-05-21 02:41:35] [INFO ] State equation strengthened by 14626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5326 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24434 unsolved
SMT process timed out in 85931ms, After SMT, problems are : Problem set: 0 solved, 24434 unsolved
Search for dead transitions found 0 dead transitions in 86136ms
Finished structural reductions in LTL mode , in 1 iterations and 94385 ms. Remains : 5327/5327 places, 24504/24504 transitions.
Computed a total of 210 stabilizing places and 350 stable transitions
Computed a total of 210 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 5506 steps (13 resets) in 200 ms. (27 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 14292 reset in 2558 ms.
Product exploration explored 100000 steps with 14287 reset in 2557 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 5327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5327/5327 places, 24504/24504 transitions.
Applied a total of 0 rules in 1383 ms. Remains 5327 /5327 variables (removed 0) and now considering 24504/24504 (removed 0) transitions.
Running 24434 sub problems to find dead transitions.
[2024-05-21 02:43:09] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2024-05-21 02:43:09] [INFO ] Invariant cache hit.
[2024-05-21 02:43:10] [INFO ] State equation strengthened by 14626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5326 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24434 unsolved
SMT process timed out in 87371ms, After SMT, problems are : Problem set: 0 solved, 24434 unsolved
Search for dead transitions found 0 dead transitions in 87572ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 88986 ms. Remains : 5327/5327 places, 24504/24504 transitions.
Built C files in :
/tmp/ltsmin8093494437921987561
[2024-05-21 02:44:37] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8093494437921987561
Running compilation step : cd /tmp/ltsmin8093494437921987561;'/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/ltsmin8093494437921987561;'/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/ltsmin8093494437921987561;'/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 4 out of 5327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5327/5327 places, 24504/24504 transitions.
Applied a total of 0 rules in 1299 ms. Remains 5327 /5327 variables (removed 0) and now considering 24504/24504 (removed 0) transitions.
[2024-05-21 02:44:41] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2024-05-21 02:44:41] [INFO ] Invariant cache hit.
[2024-05-21 02:44:48] [INFO ] Implicit Places using invariants in 6770 ms returned []
Implicit Place search using SMT only with invariants took 6770 ms to find 0 implicit places.
Running 24434 sub problems to find dead transitions.
[2024-05-21 02:44:48] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2024-05-21 02:44:48] [INFO ] Invariant cache hit.
[2024-05-21 02:44:49] [INFO ] State equation strengthened by 14626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5326 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24434 unsolved
SMT process timed out in 86625ms, After SMT, problems are : Problem set: 0 solved, 24434 unsolved
Search for dead transitions found 0 dead transitions in 86836ms
Finished structural reductions in LTL mode , in 1 iterations and 94937 ms. Remains : 5327/5327 places, 24504/24504 transitions.
Built C files in :
/tmp/ltsmin638115082108603526
[2024-05-21 02:46:15] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin638115082108603526
Running compilation step : cd /tmp/ltsmin638115082108603526;'/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/ltsmin638115082108603526;'/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/ltsmin638115082108603526;'/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-21 02:46:19] [INFO ] Flatten gal took : 389 ms
[2024-05-21 02:46:19] [INFO ] Flatten gal took : 390 ms
[2024-05-21 02:46:19] [INFO ] Time to serialize gal into /tmp/LTL8222792955343673858.gal : 76 ms
[2024-05-21 02:46:19] [INFO ] Time to serialize properties into /tmp/LTL10083793408837126077.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/LTL8222792955343673858.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2858880765102811072.hoa' '-atoms' '/tmp/LTL10083793408837126077.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/LTL10083793408837126077.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2858880765102811072.hoa
Detected timeout of ITS tools.
[2024-05-21 02:46:35] [INFO ] Flatten gal took : 367 ms
[2024-05-21 02:46:35] [INFO ] Flatten gal took : 391 ms
[2024-05-21 02:46:36] [INFO ] Time to serialize gal into /tmp/LTL13846780610478638510.gal : 82 ms
[2024-05-21 02:46:36] [INFO ] Time to serialize properties into /tmp/LTL14513811361352985718.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/LTL13846780610478638510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14513811361352985718.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 : !((X(X(X(X(G((X(F("((Node56IsInserted<1)||(Node57Request<1))")))||("((Node31Request>=1)&&(Node32IsInserted>=1))"))))))))
Formula 0 simplified : XXXXF(!"((Node31Request>=1)&&(Node32IsInserted>=1))" & XG!"((Node56IsInserted<1)||(Node57Request<1))")
Detected timeout of ITS tools.
[2024-05-21 02:46:51] [INFO ] Flatten gal took : 373 ms
[2024-05-21 02:46:51] [INFO ] Applying decomposition
[2024-05-21 02:46:51] [INFO ] Flatten gal took : 391 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/graph2430425813848460909.txt' '-o' '/tmp/graph2430425813848460909.bin' '-w' '/tmp/graph2430425813848460909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2430425813848460909.bin' '-l' '-1' '-v' '-w' '/tmp/graph2430425813848460909.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:46:52] [INFO ] Decomposing Gal with order
[2024-05-21 02:46:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:46:55] [INFO ] Removed a total of 19424 redundant transitions.
[2024-05-21 02:46:56] [INFO ] Flatten gal took : 2594 ms
[2024-05-21 02:47:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 14766 labels/synchronizations in 3886 ms.
[2024-05-21 02:47:00] [INFO ] Time to serialize gal into /tmp/LTL14715914996556715916.gal : 118 ms
[2024-05-21 02:47:00] [INFO ] Time to serialize properties into /tmp/LTL8304099699994894634.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/LTL14715914996556715916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8304099699994894634.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G((X(F("((u58.Node56IsInserted<1)||(i58.u60.Node57Request<1))")))||("((i32.u33.Node31Request>=1)&&(u34.Node32IsInserted>=1)...165
Formula 0 simplified : XXXXF(!"((i32.u33.Node31Request>=1)&&(u34.Node32IsInserted>=1))" & XG!"((u58.Node56IsInserted<1)||(i58.u60.Node57Request<1))")
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-08 finished in 453407 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)))'
[2024-05-21 02:47:15] [INFO ] Flatten gal took : 494 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13122278899806052546
[2024-05-21 02:47:16] [INFO ] Too many transitions (29820) to apply POR reductions. Disabling POR matrices.
[2024-05-21 02:47:16] [INFO ] Built C files in 197ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13122278899806052546
Running compilation step : cd /tmp/ltsmin13122278899806052546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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-21 02:47:16] [INFO ] Applying decomposition
[2024-05-21 02:47:17] [INFO ] Flatten gal took : 600 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/graph13574355240852529509.txt' '-o' '/tmp/graph13574355240852529509.bin' '-w' '/tmp/graph13574355240852529509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13574355240852529509.bin' '-l' '-1' '-v' '-w' '/tmp/graph13574355240852529509.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:47:18] [INFO ] Decomposing Gal with order
[2024-05-21 02:47:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:47:21] [INFO ] Removed a total of 14736 redundant transitions.
[2024-05-21 02:47:21] [INFO ] Flatten gal took : 1854 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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