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.r087-tall-171620521500082.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 gold2023
Input is CANInsertWithFailure-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521500082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 16M 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-050-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716231273946

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 18:54:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 18:54:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 18:54:35] [INFO ] Load time of PNML (sax parser for PT used): 447 ms
[2024-05-20 18:54:35] [INFO ] Transformed 5604 places.
[2024-05-20 18:54:36] [INFO ] Transformed 15300 transitions.
[2024-05-20 18:54:36] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 588 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 5604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5603 transition count 15300
Applied a total of 1 rules in 1032 ms. Remains 5603 /5604 variables (removed 1) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-20 18:54:39] [INFO ] Computed 52 invariants in 1382 ms
[2024-05-20 18:54:40] [INFO ] Implicit Places using invariants in 2639 ms returned []
Implicit Place search using SMT only with invariants took 2996 ms to find 0 implicit places.
[2024-05-20 18:54:40] [INFO ] Invariant cache hit.
[2024-05-20 18:54:49] [INFO ] Dead Transitions using invariants and state equation in 8779 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5603/5604 places, 15300/15300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12820 ms. Remains : 5603/5604 places, 15300/15300 transitions.
Support contains 48 out of 5603 places after structural reductions.
[2024-05-20 18:54:50] [INFO ] Flatten gal took : 606 ms
[2024-05-20 18:54:50] [INFO ] Flatten gal took : 389 ms
[2024-05-20 18:54:51] [INFO ] Input system was already deterministic with 15300 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 35) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2024-05-20 18:54:52] [INFO ] Invariant cache hit.
[2024-05-20 18:54:54] [INFO ] [Real]Absence check using 50 positive place invariants in 57 ms returned sat
[2024-05-20 18:54:54] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-20 18:54:54] [INFO ] After 2865ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2024-05-20 18:54:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2024-05-20 18:54:57] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 70 ms returned sat
[2024-05-20 18:55:18] [INFO ] After 19025ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :26
[2024-05-20 18:55:18] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 18:55:20] [INFO ] After 1723ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :2 sat :25
[2024-05-20 18:55:20] [INFO ] After 1724ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :25
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-20 18:55:20] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :25
Fused 28 Parikh solutions to 25 different solutions.
Parikh walk visited 1 properties in 1887 ms.
Support contains 32 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 5603 transition count 14953
Reduce places removed 347 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 348 rules applied. Total rules applied 695 place count 5256 transition count 14952
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 696 place count 5255 transition count 14951
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2336 Post agglomeration using F-continuation condition.Transition count delta: 2336
Deduced a syphon composed of 2336 places in 16 ms
Reduce places removed 2336 places and 0 transitions.
Iterating global reduction 3 with 4672 rules applied. Total rules applied 5370 place count 2918 transition count 12615
Drop transitions removed 2242 transitions
Redundant transition composition rules discarded 2242 transitions
Iterating global reduction 3 with 2242 rules applied. Total rules applied 7612 place count 2918 transition count 10373
Partial Free-agglomeration rule applied 2780 times.
Drop transitions removed 2780 transitions
Iterating global reduction 3 with 2780 rules applied. Total rules applied 10392 place count 2918 transition count 10373
Partial Free-agglomeration rule applied 52 times.
Drop transitions removed 52 transitions
Iterating global reduction 3 with 52 rules applied. Total rules applied 10444 place count 2918 transition count 10373
Applied a total of 10444 rules in 3693 ms. Remains 2918 /5603 variables (removed 2685) and now considering 10373/15300 (removed 4927) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3695 ms. Remains : 2918/5603 places, 10373/15300 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 66644 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66644 steps, saw 30943 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 10373 rows 2918 cols
[2024-05-20 18:55:29] [INFO ] Computed 52 invariants in 403 ms
[2024-05-20 18:55:30] [INFO ] [Real]Absence check using 50 positive place invariants in 31 ms returned sat
[2024-05-20 18:55:30] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-20 18:55:33] [INFO ] After 2928ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:22
[2024-05-20 18:55:34] [INFO ] State equation strengthened by 10009 read => feed constraints.
[2024-05-20 18:55:36] [INFO ] After 2919ms SMT Verify possible using 10009 Read/Feed constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-20 18:55:36] [INFO ] After 7325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-20 18:55:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 28 ms returned sat
[2024-05-20 18:55:38] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2024-05-20 18:55:47] [INFO ] After 7955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2024-05-20 18:56:00] [INFO ] After 13881ms SMT Verify possible using 10009 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2024-05-20 18:56:02] [INFO ] After 14955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 18:56:02] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 1 properties in 593 ms.
Support contains 28 out of 2918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2918/2918 places, 10373/10373 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2917 transition count 10372
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 2917 transition count 10372
Applied a total of 6 rules in 1075 ms. Remains 2917 /2918 variables (removed 1) and now considering 10372/10373 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1076 ms. Remains : 2917/2918 places, 10372/10373 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 68376 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68376 steps, saw 31144 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 10372 rows 2917 cols
[2024-05-20 18:56:07] [INFO ] Computed 52 invariants in 390 ms
[2024-05-20 18:56:08] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2024-05-20 18:56:08] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-20 18:56:12] [INFO ] After 3197ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:20
[2024-05-20 18:56:12] [INFO ] State equation strengthened by 10015 read => feed constraints.
[2024-05-20 18:56:14] [INFO ] After 1957ms SMT Verify possible using 10015 Read/Feed constraints in real domain returned unsat :0 sat :0 real:21
[2024-05-20 18:56:14] [INFO ] After 6460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2024-05-20 18:56:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 18:56:15] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-20 18:56:24] [INFO ] After 8117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2024-05-20 18:56:37] [INFO ] After 12898ms SMT Verify possible using 10015 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2024-05-20 18:56:39] [INFO ] After 15014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 18:56:39] [INFO ] After 25086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 603 ms.
Support contains 26 out of 2917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2917/2917 places, 10372/10372 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2916 transition count 10371
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 2916 transition count 10371
Applied a total of 3 rules in 1039 ms. Remains 2916 /2917 variables (removed 1) and now considering 10371/10372 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1040 ms. Remains : 2916/2917 places, 10371/10372 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 202 stabilizing places and 350 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F(p1)&&F(!p0)))))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 476 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-20 18:56:42] [INFO ] Computed 52 invariants in 998 ms
[2024-05-20 18:56:43] [INFO ] Implicit Places using invariants in 1981 ms returned []
Implicit Place search using SMT only with invariants took 1981 ms to find 0 implicit places.
[2024-05-20 18:56:43] [INFO ] Invariant cache hit.
[2024-05-20 18:56:52] [INFO ] Dead Transitions using invariants and state equation in 8735 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11197 ms. Remains : 5603/5603 places, 15300/15300 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 291 ms :[(NOT p1), p0, (AND (NOT p1) (NOT p0)), (OR (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GT 2 s1581) (LEQ 3 s420)), p0:(LEQ 2 s1581)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1226 steps with 0 reset in 29 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-00 finished in 11604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))&&(p1||X(G(p2)))))))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 477 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2024-05-20 18:56:53] [INFO ] Invariant cache hit.
[2024-05-20 18:56:54] [INFO ] Implicit Places using invariants in 940 ms returned []
Implicit Place search using SMT only with invariants took 942 ms to find 0 implicit places.
[2024-05-20 18:56:54] [INFO ] Invariant cache hit.
[2024-05-20 18:57:02] [INFO ] Dead Transitions using invariants and state equation in 8607 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10030 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s4119 s4362), p1:(AND (LEQ 2 s2938) (LEQ 2 s5361)), p2:(GT 3 s3722)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 80 reset in 1127 ms.
Product exploration explored 100000 steps with 85 reset in 1149 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), false, false, false, false]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 67296 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{0=1}
Probabilistic random walk after 67296 steps, saw 59124 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :1
Running SMT prover for 6 properties.
[2024-05-20 18:57:09] [INFO ] Invariant cache hit.
[2024-05-20 18:57:10] [INFO ] [Real]Absence check using 50 positive place invariants in 50 ms returned sat
[2024-05-20 18:57:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-20 18:57:10] [INFO ] After 1100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:57:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-20 18:57:11] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 71 ms returned sat
[2024-05-20 18:57:23] [INFO ] After 12135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:57:23] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 18:57:35] [INFO ] After 11532ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 18:57:35] [INFO ] After 11533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-20 18:57:35] [INFO ] After 25104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 167 ms.
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2447 Post agglomeration using F-continuation condition.Transition count delta: 2447
Deduced a syphon composed of 2447 places in 4 ms
Reduce places removed 2447 places and 0 transitions.
Iterating global reduction 2 with 4894 rules applied. Total rules applied 5594 place count 2806 transition count 12503
Drop transitions removed 2349 transitions
Redundant transition composition rules discarded 2349 transitions
Iterating global reduction 2 with 2349 rules applied. Total rules applied 7943 place count 2806 transition count 10154
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7944 place count 2806 transition count 10153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7945 place count 2805 transition count 10153
Partial Free-agglomeration rule applied 2549 times.
Drop transitions removed 2549 transitions
Iterating global reduction 3 with 2549 rules applied. Total rules applied 10494 place count 2805 transition count 10153
Applied a total of 10494 rules in 2567 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10153/15300 (removed 5147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2567 ms. Remains : 2805/5603 places, 10153/15300 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 65055 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65055 steps, saw 26723 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10153 rows 2805 cols
[2024-05-20 18:57:41] [INFO ] Computed 52 invariants in 309 ms
[2024-05-20 18:57:42] [INFO ] [Real]Absence check using 50 positive place invariants in 28 ms returned sat
[2024-05-20 18:57:42] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-20 18:57:42] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:57:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 30 ms returned sat
[2024-05-20 18:57:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 18:57:47] [INFO ] After 4439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:57:47] [INFO ] State equation strengthened by 9993 read => feed constraints.
[2024-05-20 18:57:50] [INFO ] After 2938ms SMT Verify possible using 9993 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 18:57:52] [INFO ] After 5188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1548 ms.
[2024-05-20 18:57:54] [INFO ] After 11977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 38 ms.
Support contains 5 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10153/10153 transitions.
Applied a total of 0 rules in 384 ms. Remains 2805 /2805 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 2805/2805 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10153/10153 transitions.
Applied a total of 0 rules in 370 ms. Remains 2805 /2805 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2024-05-20 18:57:55] [INFO ] Invariant cache hit.
[2024-05-20 18:57:58] [INFO ] Implicit Places using invariants in 3475 ms returned []
Implicit Place search using SMT only with invariants took 3477 ms to find 0 implicit places.
[2024-05-20 18:57:58] [INFO ] Invariant cache hit.
[2024-05-20 18:58:03] [INFO ] Dead Transitions using invariants and state equation in 4775 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8636 ms. Remains : 2805/2805 places, 10153/10153 transitions.
Graph (trivial) has 9834 edges and 2805 vertex of which 2597 / 2805 are part of one of the 2 SCC in 11 ms
Free SCC test removed 2595 places
Drop transitions removed 7390 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9932 transitions.
Graph (complete) has 523 edges and 210 vertex of which 59 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 59 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 58 transition count 70
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 10 transition count 22
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 10 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 10 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 10 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 9 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 8 transition count 17
Applied a total of 207 rules in 42 ms. Remains 8 /2805 variables (removed 2797) and now considering 17/10153 (removed 10136) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 17 rows 8 cols
[2024-05-20 18:58:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 18:58:03] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:58:03] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:58:03] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-20 18:58:03] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 131 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter insensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), false, false, false, false]
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2447 Post agglomeration using F-continuation condition.Transition count delta: 2447
Deduced a syphon composed of 2447 places in 4 ms
Reduce places removed 2447 places and 0 transitions.
Iterating global reduction 2 with 4894 rules applied. Total rules applied 5594 place count 2806 transition count 12503
Drop transitions removed 2349 transitions
Redundant transition composition rules discarded 2349 transitions
Iterating global reduction 2 with 2349 rules applied. Total rules applied 7943 place count 2806 transition count 10154
Applied a total of 7943 rules in 2240 ms. Remains 2806 /5603 variables (removed 2797) and now considering 10154/15300 (removed 5146) transitions.
// Phase 1: matrix 10154 rows 2806 cols
[2024-05-20 18:58:06] [INFO ] Computed 52 invariants in 294 ms
[2024-05-20 18:58:09] [INFO ] Implicit Places using invariants in 2344 ms returned []
Implicit Place search using SMT only with invariants took 2345 ms to find 0 implicit places.
[2024-05-20 18:58:09] [INFO ] Invariant cache hit.
[2024-05-20 18:58:14] [INFO ] Dead Transitions using invariants and state equation in 5103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2806/5603 places, 10154/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9695 ms. Remains : 2806/5603 places, 10154/15300 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND p2 p1 p0)))), true, (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X p0)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 143 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter insensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 68455 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68455 steps, saw 29418 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-20 18:58:18] [INFO ] Invariant cache hit.
[2024-05-20 18:58:18] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 18:58:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 25 ms returned sat
[2024-05-20 18:58:19] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-20 18:58:23] [INFO ] After 4200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 18:58:23] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2024-05-20 18:58:29] [INFO ] After 5730ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-20 18:58:32] [INFO ] After 9240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1897 ms.
[2024-05-20 18:58:34] [INFO ] After 16162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 82 ms.
Support contains 5 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2806 transition count 10153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2805 transition count 10153
Partial Free-agglomeration rule applied 2549 times.
Drop transitions removed 2549 transitions
Iterating global reduction 1 with 2549 rules applied. Total rules applied 2551 place count 2805 transition count 10153
Applied a total of 2551 rules in 1285 ms. Remains 2805 /2806 variables (removed 1) and now considering 10153/10154 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1286 ms. Remains : 2805/2806 places, 10153/10154 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 61486 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61486 steps, saw 26331 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10153 rows 2805 cols
[2024-05-20 18:58:39] [INFO ] Computed 52 invariants in 299 ms
[2024-05-20 18:58:40] [INFO ] [Real]Absence check using 50 positive place invariants in 29 ms returned sat
[2024-05-20 18:58:40] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 18:58:43] [INFO ] After 3556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 18:58:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 18:58:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-20 18:58:49] [INFO ] After 4846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 18:58:49] [INFO ] State equation strengthened by 9993 read => feed constraints.
[2024-05-20 18:58:54] [INFO ] After 4859ms SMT Verify possible using 9993 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-20 18:58:57] [INFO ] After 7824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1910 ms.
[2024-05-20 18:58:58] [INFO ] After 15548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 1 properties in 47 ms.
Support contains 5 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10153/10153 transitions.
Applied a total of 0 rules in 391 ms. Remains 2805 /2805 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 2805/2805 places, 10153/10153 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 65850 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65850 steps, saw 26864 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 18:59:02] [INFO ] Invariant cache hit.
[2024-05-20 18:59:03] [INFO ] [Real]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 18:59:03] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 18:59:06] [INFO ] After 4126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:59:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 18:59:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 18:59:12] [INFO ] After 4576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:59:12] [INFO ] State equation strengthened by 9993 read => feed constraints.
[2024-05-20 18:59:16] [INFO ] After 4685ms SMT Verify possible using 9993 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 18:59:19] [INFO ] After 7079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1864 ms.
[2024-05-20 18:59:21] [INFO ] After 14317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 68 ms.
Support contains 5 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10153/10153 transitions.
Applied a total of 0 rules in 382 ms. Remains 2805 /2805 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 2805/2805 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10153/10153 transitions.
Applied a total of 0 rules in 389 ms. Remains 2805 /2805 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2024-05-20 18:59:22] [INFO ] Invariant cache hit.
[2024-05-20 18:59:25] [INFO ] Implicit Places using invariants in 3594 ms returned []
Implicit Place search using SMT only with invariants took 3597 ms to find 0 implicit places.
[2024-05-20 18:59:25] [INFO ] Invariant cache hit.
[2024-05-20 18:59:30] [INFO ] Dead Transitions using invariants and state equation in 5273 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9264 ms. Remains : 2805/2805 places, 10153/10153 transitions.
Graph (trivial) has 9834 edges and 2805 vertex of which 2597 / 2805 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2595 places
Drop transitions removed 7390 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9932 transitions.
Graph (complete) has 523 edges and 210 vertex of which 59 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 59 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 58 transition count 70
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 10 transition count 22
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 10 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 10 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 10 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 9 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 8 transition count 17
Applied a total of 207 rules in 20 ms. Remains 8 /2805 variables (removed 2797) and now considering 17/10153 (removed 10136) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 17 rows 8 cols
[2024-05-20 18:59:30] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 18:59:30] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:59:30] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:59:30] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-20 18:59:30] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND p2 p1 p0)))), true, (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X p0)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 16 factoid took 172 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter insensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 867 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 400 reset in 1232 ms.
Product exploration explored 100000 steps with 396 reset in 1291 ms.
Built C files in :
/tmp/ltsmin13835163090268004985
[2024-05-20 18:59:35] [INFO ] Too many transitions (10154) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:59:35] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13835163090268004985
Running compilation step : cd /tmp/ltsmin13835163090268004985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13835163090268004985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13835163090268004985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 2806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 335 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
// Phase 1: matrix 10154 rows 2806 cols
[2024-05-20 18:59:39] [INFO ] Computed 52 invariants in 302 ms
[2024-05-20 18:59:41] [INFO ] Implicit Places using invariants in 2571 ms returned []
Implicit Place search using SMT only with invariants took 2571 ms to find 0 implicit places.
[2024-05-20 18:59:41] [INFO ] Invariant cache hit.
[2024-05-20 18:59:46] [INFO ] Dead Transitions using invariants and state equation in 5397 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8306 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Built C files in :
/tmp/ltsmin14235955916705216664
[2024-05-20 18:59:46] [INFO ] Too many transitions (10154) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:59:46] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14235955916705216664
Running compilation step : cd /tmp/ltsmin14235955916705216664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14235955916705216664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14235955916705216664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 18:59:50] [INFO ] Flatten gal took : 218 ms
[2024-05-20 18:59:50] [INFO ] Flatten gal took : 226 ms
[2024-05-20 18:59:50] [INFO ] Time to serialize gal into /tmp/LTL2273768016378706941.gal : 62 ms
[2024-05-20 18:59:50] [INFO ] Time to serialize properties into /tmp/LTL6543877750786487900.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2273768016378706941.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7132183899189316465.hoa' '-atoms' '/tmp/LTL6543877750786487900.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6543877750786487900.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7132183899189316465.hoa
Detected timeout of ITS tools.
[2024-05-20 19:00:06] [INFO ] Flatten gal took : 168 ms
[2024-05-20 19:00:06] [INFO ] Flatten gal took : 172 ms
[2024-05-20 19:00:06] [INFO ] Time to serialize gal into /tmp/LTL4005932921699458031.gal : 33 ms
[2024-05-20 19:00:06] [INFO ] Time to serialize properties into /tmp/LTL10169333895653808413.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4005932921699458031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10169333895653808413.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(Node34requestsent43<=Node37GiveAnswer16)")))&&((X(G("(Node30GiveAnswer40<3)")))||("((Node22GiveAnswer40>=2)&&(Node47requ...176
Formula 0 simplified : X(FG!"(Node34requestsent43<=Node37GiveAnswer16)" | G(!"((Node22GiveAnswer40>=2)&&(Node47requestsent26>=2))" & F!"(Node30GiveAnswer40...161
Detected timeout of ITS tools.
[2024-05-20 19:00:21] [INFO ] Flatten gal took : 163 ms
[2024-05-20 19:00:21] [INFO ] Applying decomposition
[2024-05-20 19:00:21] [INFO ] Flatten gal took : 167 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3917993434604955784.txt' '-o' '/tmp/graph3917993434604955784.bin' '-w' '/tmp/graph3917993434604955784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3917993434604955784.bin' '-l' '-1' '-v' '-w' '/tmp/graph3917993434604955784.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:00:23] [INFO ] Decomposing Gal with order
[2024-05-20 19:00:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:00:24] [INFO ] Removed a total of 7523 redundant transitions.
[2024-05-20 19:00:24] [INFO ] Flatten gal took : 1209 ms
[2024-05-20 19:00:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4899 labels/synchronizations in 614 ms.
[2024-05-20 19:00:26] [INFO ] Time to serialize gal into /tmp/LTL6762568425309675815.gal : 57 ms
[2024-05-20 19:00:26] [INFO ] Time to serialize properties into /tmp/LTL18062333770135960787.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6762568425309675815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18062333770135960787.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(gu51.Node34requestsent43<=gu51.Node37GiveAnswer16)")))&&((X(G("(gi0.gu41.Node30GiveAnswer40<3)")))||("((gi0.gu41.Node22G...213
Formula 0 simplified : X(FG!"(gu51.Node34requestsent43<=gu51.Node37GiveAnswer16)" | G(!"((gi0.gu41.Node22GiveAnswer40>=2)&&(gi0.gu48.Node47requestsent26>=2...198
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16633788529581607935
[2024-05-20 19:00:41] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16633788529581607935
Running compilation step : cd /tmp/ltsmin16633788529581607935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16633788529581607935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16633788529581607935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-01 finished in 231450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 470 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-20 19:00:45] [INFO ] Computed 52 invariants in 1000 ms
[2024-05-20 19:00:46] [INFO ] Implicit Places using invariants in 1996 ms returned []
Implicit Place search using SMT only with invariants took 1998 ms to find 0 implicit places.
[2024-05-20 19:00:46] [INFO ] Invariant cache hit.
[2024-05-20 19:00:55] [INFO ] Dead Transitions using invariants and state equation in 9141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11610 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LEQ 1 s2434) (GT s1570 s631))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1320 steps with 0 reset in 16 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-02 finished in 11774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&F(p2)&&p0)))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 5603 transition count 14953
Reduce places removed 347 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 348 rules applied. Total rules applied 695 place count 5256 transition count 14952
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 696 place count 5255 transition count 14951
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 4 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 3 with 4898 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 3 with 2352 rules applied. Total rules applied 7948 place count 2805 transition count 10150
Applied a total of 7948 rules in 1936 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2805 cols
[2024-05-20 19:00:58] [INFO ] Computed 52 invariants in 299 ms
[2024-05-20 19:01:00] [INFO ] Implicit Places using invariants in 2443 ms returned []
Implicit Place search using SMT only with invariants took 2444 ms to find 0 implicit places.
[2024-05-20 19:01:00] [INFO ] Invariant cache hit.
[2024-05-20 19:01:05] [INFO ] Dead Transitions using invariants and state equation in 5026 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9407 ms. Remains : 2805/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ 3 s353) (LEQ s1832 s96)), p1:(LEQ 2 s2138), p2:(LEQ s1832 s96)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 246 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-03 finished in 9559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 476 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-20 19:01:06] [INFO ] Computed 52 invariants in 980 ms
[2024-05-20 19:01:07] [INFO ] Implicit Places using invariants in 1943 ms returned []
Implicit Place search using SMT only with invariants took 1943 ms to find 0 implicit places.
[2024-05-20 19:01:07] [INFO ] Invariant cache hit.
[2024-05-20 19:01:17] [INFO ] Dead Transitions using invariants and state equation in 9211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11642 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 3 s4337)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-04 finished in 11789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 2 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Applied a total of 7949 rules in 1783 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2804 cols
[2024-05-20 19:01:19] [INFO ] Computed 52 invariants in 283 ms
[2024-05-20 19:01:21] [INFO ] Implicit Places using invariants in 2317 ms returned []
Implicit Place search using SMT only with invariants took 2318 ms to find 0 implicit places.
[2024-05-20 19:01:21] [INFO ] Invariant cache hit.
[2024-05-20 19:01:26] [INFO ] Dead Transitions using invariants and state equation in 5213 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9319 ms. Remains : 2804/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s1951), p1:(LEQ 2 s453)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 246 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-05 finished in 9446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 474 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-20 19:01:28] [INFO ] Computed 52 invariants in 978 ms
[2024-05-20 19:01:29] [INFO ] Implicit Places using invariants in 1956 ms returned []
Implicit Place search using SMT only with invariants took 1957 ms to find 0 implicit places.
[2024-05-20 19:01:29] [INFO ] Invariant cache hit.
[2024-05-20 19:01:37] [INFO ] Dead Transitions using invariants and state equation in 8558 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10990 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT 3 s1828), p0:(GT s944 s4481)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 85 reset in 992 ms.
Product exploration explored 100000 steps with 83 reset in 1016 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 70688 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70688 steps, saw 60211 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 19:01:43] [INFO ] Invariant cache hit.
[2024-05-20 19:01:44] [INFO ] [Real]Absence check using 50 positive place invariants in 51 ms returned sat
[2024-05-20 19:01:44] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-20 19:01:52] [INFO ] After 8901ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:01:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-20 19:01:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-20 19:02:02] [INFO ] After 9247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:02:02] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 19:02:17] [INFO ] After 14956ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-20 19:02:17] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 38 ms.
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 4 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 2 with 4896 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 2 with 2350 rules applied. Total rules applied 7946 place count 2805 transition count 10152
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7947 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7948 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 3 with 2550 rules applied. Total rules applied 10498 place count 2804 transition count 10151
Applied a total of 10498 rules in 2475 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10151/15300 (removed 5149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2475 ms. Remains : 2804/5603 places, 10151/15300 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10151 rows 2804 cols
[2024-05-20 19:02:20] [INFO ] Computed 52 invariants in 329 ms
[2024-05-20 19:02:20] [INFO ] [Real]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 19:02:20] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:02:24] [INFO ] After 3652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:02:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 19:02:24] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-20 19:02:27] [INFO ] After 3282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:02:27] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2024-05-20 19:02:30] [INFO ] After 2535ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:02:30] [INFO ] After 2928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 259 ms.
[2024-05-20 19:02:31] [INFO ] After 6906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 10151/10151 transitions.
Applied a total of 0 rules in 367 ms. Remains 2804 /2804 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 2804/2804 places, 10151/10151 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 72254 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72254 steps, saw 27653 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:02:34] [INFO ] Invariant cache hit.
[2024-05-20 19:02:34] [INFO ] [Real]Absence check using 50 positive place invariants in 28 ms returned sat
[2024-05-20 19:02:34] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 40 ms returned sat
[2024-05-20 19:02:37] [INFO ] After 3315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:02:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 19:02:38] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:02:41] [INFO ] After 3188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:02:41] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2024-05-20 19:02:45] [INFO ] After 4086ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:02:46] [INFO ] After 4492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 333 ms.
[2024-05-20 19:02:46] [INFO ] After 8450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 10151/10151 transitions.
Applied a total of 0 rules in 385 ms. Remains 2804 /2804 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 2804/2804 places, 10151/10151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 10151/10151 transitions.
Applied a total of 0 rules in 385 ms. Remains 2804 /2804 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
[2024-05-20 19:02:47] [INFO ] Invariant cache hit.
[2024-05-20 19:02:50] [INFO ] Implicit Places using invariants in 3649 ms returned []
Implicit Place search using SMT only with invariants took 3664 ms to find 0 implicit places.
[2024-05-20 19:02:50] [INFO ] Invariant cache hit.
[2024-05-20 19:02:55] [INFO ] Dead Transitions using invariants and state equation in 5108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9160 ms. Remains : 2804/2804 places, 10151/10151 transitions.
Graph (trivial) has 9840 edges and 2804 vertex of which 2598 / 2804 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2596 places
Drop transitions removed 7394 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9936 transitions.
Graph (complete) has 517 edges and 208 vertex of which 57 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 57 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 56 transition count 64
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 8 transition count 16
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 6 transition count 11
Applied a total of 207 rules in 17 ms. Remains 6 /2804 variables (removed 2798) and now considering 11/10151 (removed 10140) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 6 cols
[2024-05-20 19:02:55] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:02:56] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:02:56] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:02:56] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 19:02:56] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 470 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-20 19:02:57] [INFO ] Computed 52 invariants in 975 ms
[2024-05-20 19:02:58] [INFO ] Implicit Places using invariants in 1921 ms returned []
Implicit Place search using SMT only with invariants took 1921 ms to find 0 implicit places.
[2024-05-20 19:02:58] [INFO ] Invariant cache hit.
[2024-05-20 19:03:07] [INFO ] Dead Transitions using invariants and state equation in 8559 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10951 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 69935 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69935 steps, saw 59972 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 19:03:10] [INFO ] Invariant cache hit.
[2024-05-20 19:03:11] [INFO ] [Real]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-20 19:03:11] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 70 ms returned sat
[2024-05-20 19:03:19] [INFO ] After 8357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:03:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 49 ms returned sat
[2024-05-20 19:03:19] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-20 19:03:30] [INFO ] After 10104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:03:30] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 19:03:44] [INFO ] After 14088ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-20 19:03:44] [INFO ] After 25080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 31 ms.
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 4 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 2 with 4896 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 2 with 2350 rules applied. Total rules applied 7946 place count 2805 transition count 10152
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7947 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7948 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 3 with 2550 rules applied. Total rules applied 10498 place count 2804 transition count 10151
Applied a total of 10498 rules in 2548 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10151/15300 (removed 5149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2549 ms. Remains : 2804/5603 places, 10151/15300 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 67535 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67535 steps, saw 27089 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10151 rows 2804 cols
[2024-05-20 19:03:50] [INFO ] Computed 52 invariants in 316 ms
[2024-05-20 19:03:50] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:03:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:03:51] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:03:54] [INFO ] After 3409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:03:54] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2024-05-20 19:03:57] [INFO ] After 3342ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 19:03:58] [INFO ] After 4268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 560 ms.
[2024-05-20 19:03:59] [INFO ] After 8748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 10151/10151 transitions.
Applied a total of 0 rules in 363 ms. Remains 2804 /2804 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 2804/2804 places, 10151/10151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 10151/10151 transitions.
Applied a total of 0 rules in 366 ms. Remains 2804 /2804 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
[2024-05-20 19:04:00] [INFO ] Invariant cache hit.
[2024-05-20 19:04:03] [INFO ] Implicit Places using invariants in 3539 ms returned []
Implicit Place search using SMT only with invariants took 3541 ms to find 0 implicit places.
[2024-05-20 19:04:03] [INFO ] Invariant cache hit.
[2024-05-20 19:04:08] [INFO ] Dead Transitions using invariants and state equation in 4995 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8908 ms. Remains : 2804/2804 places, 10151/10151 transitions.
Graph (trivial) has 9840 edges and 2804 vertex of which 2598 / 2804 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2596 places
Drop transitions removed 7394 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9936 transitions.
Graph (complete) has 517 edges and 208 vertex of which 57 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 57 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 56 transition count 64
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 8 transition count 16
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 6 transition count 11
Applied a total of 207 rules in 19 ms. Remains 6 /2804 variables (removed 2798) and now considering 11/10151 (removed 10140) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 6 cols
[2024-05-20 19:04:08] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:04:08] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:04:08] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:04:08] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 19:04:08] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 81 reset in 951 ms.
Product exploration explored 100000 steps with 84 reset in 994 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 5603 transition count 15300
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 250 place count 5603 transition count 15300
Deduced a syphon composed of 300 places in 3 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 300 place count 5603 transition count 15300
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 400 place count 5503 transition count 15200
Deduced a syphon composed of 200 places in 3 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 500 place count 5503 transition count 15200
Performed 2498 Post agglomeration using F-continuation condition.Transition count delta: -4796
Deduced a syphon composed of 2698 places in 4 ms
Iterating global reduction 1 with 2498 rules applied. Total rules applied 2998 place count 5503 transition count 19996
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 3198 place count 5303 transition count 19796
Deduced a syphon composed of 2498 places in 3 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 3398 place count 5303 transition count 19796
Deduced a syphon composed of 2498 places in 2 ms
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 1 with 2350 rules applied. Total rules applied 5748 place count 5303 transition count 17446
Deduced a syphon composed of 2498 places in 2 ms
Applied a total of 5748 rules in 5210 ms. Remains 5303 /5603 variables (removed 300) and now considering 17446/15300 (removed -2146) transitions.
// Phase 1: matrix 17446 rows 5303 cols
[2024-05-20 19:04:17] [INFO ] Computed 52 invariants in 1077 ms
[2024-05-20 19:04:27] [INFO ] Dead Transitions using invariants and state equation in 10741 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5303/5603 places, 17446/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15953 ms. Remains : 5303/5603 places, 17446/15300 transitions.
Built C files in :
/tmp/ltsmin5480624737358184810
[2024-05-20 19:04:27] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5480624737358184810
Running compilation step : cd /tmp/ltsmin5480624737358184810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5480624737358184810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5480624737358184810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 708 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-20 19:04:32] [INFO ] Computed 52 invariants in 988 ms
[2024-05-20 19:04:33] [INFO ] Implicit Places using invariants in 1972 ms returned []
Implicit Place search using SMT only with invariants took 1972 ms to find 0 implicit places.
[2024-05-20 19:04:33] [INFO ] Invariant cache hit.
[2024-05-20 19:04:41] [INFO ] Dead Transitions using invariants and state equation in 8767 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11451 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Built C files in :
/tmp/ltsmin14403261588246936391
[2024-05-20 19:04:42] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14403261588246936391
Running compilation step : cd /tmp/ltsmin14403261588246936391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14403261588246936391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14403261588246936391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:04:45] [INFO ] Flatten gal took : 441 ms
[2024-05-20 19:04:46] [INFO ] Flatten gal took : 318 ms
[2024-05-20 19:04:46] [INFO ] Time to serialize gal into /tmp/LTL6622635268649263759.gal : 49 ms
[2024-05-20 19:04:46] [INFO ] Time to serialize properties into /tmp/LTL16278733677183246226.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6622635268649263759.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8428242207939411566.hoa' '-atoms' '/tmp/LTL16278733677183246226.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16278733677183246226.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8428242207939411566.hoa
Detected timeout of ITS tools.
[2024-05-20 19:05:01] [INFO ] Flatten gal took : 277 ms
[2024-05-20 19:05:01] [INFO ] Flatten gal took : 295 ms
[2024-05-20 19:05:01] [INFO ] Time to serialize gal into /tmp/LTL17981600009635034875.gal : 48 ms
[2024-05-20 19:05:01] [INFO ] Time to serialize properties into /tmp/LTL11160707744904953307.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17981600009635034875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11160707744904953307.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(Node2GiveAnswer23>Node38requestsent27)")||(G("(Node11GiveAnswer24<3)")))))))
Formula 0 simplified : XXG(!"(Node2GiveAnswer23>Node38requestsent27)" & F!"(Node11GiveAnswer24<3)")
Detected timeout of ITS tools.
[2024-05-20 19:05:17] [INFO ] Flatten gal took : 281 ms
[2024-05-20 19:05:17] [INFO ] Applying decomposition
[2024-05-20 19:05:17] [INFO ] Flatten gal took : 291 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6815147122058994714.txt' '-o' '/tmp/graph6815147122058994714.bin' '-w' '/tmp/graph6815147122058994714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6815147122058994714.bin' '-l' '-1' '-v' '-w' '/tmp/graph6815147122058994714.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:05:18] [INFO ] Decomposing Gal with order
[2024-05-20 19:05:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:05:19] [INFO ] Removed a total of 7530 redundant transitions.
[2024-05-20 19:05:19] [INFO ] Flatten gal took : 840 ms
[2024-05-20 19:05:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 4798 labels/synchronizations in 518 ms.
[2024-05-20 19:05:20] [INFO ] Time to serialize gal into /tmp/LTL16275806045107989080.gal : 73 ms
[2024-05-20 19:05:20] [INFO ] Time to serialize properties into /tmp/LTL5746943363596824099.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16275806045107989080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5746943363596824099.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(gu200.Node2GiveAnswer23>gu200.Node38requestsent27)")||(G("(gi1.gu99.Node11GiveAnswer24<3)")))))))
Formula 0 simplified : XXG(!"(gu200.Node2GiveAnswer23>gu200.Node38requestsent27)" & F!"(gi1.gu99.Node11GiveAnswer24<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3604345311140792450
[2024-05-20 19:05:35] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3604345311140792450
Running compilation step : cd /tmp/ltsmin3604345311140792450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3604345311140792450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3604345311140792450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-06 finished in 252162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1&&X(G(p0)))))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 740 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2024-05-20 19:05:39] [INFO ] Invariant cache hit.
[2024-05-20 19:05:40] [INFO ] Implicit Places using invariants in 963 ms returned []
Implicit Place search using SMT only with invariants took 964 ms to find 0 implicit places.
[2024-05-20 19:05:40] [INFO ] Invariant cache hit.
[2024-05-20 19:05:50] [INFO ] Dead Transitions using invariants and state equation in 9797 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11503 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ 2 s5395), p0:(LEQ s228 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-07 finished in 11721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&(p1 U G(p2))) U (p1&&F(p3))))'
Support contains 6 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 675 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2024-05-20 19:05:51] [INFO ] Invariant cache hit.
[2024-05-20 19:05:51] [INFO ] Implicit Places using invariants in 617 ms returned []
Implicit Place search using SMT only with invariants took 618 ms to find 0 implicit places.
[2024-05-20 19:05:51] [INFO ] Invariant cache hit.
[2024-05-20 19:06:00] [INFO ] Dead Transitions using invariants and state equation in 9035 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10330 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p3)), true, (AND p2 (NOT p0)), (NOT p2), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 3 s3912), p2:(LEQ s452 s1672), p3:(GT s1567 s3914), p0:(AND (LEQ 3 s3912) (LEQ 1 s2508))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1318 steps with 1 reset in 38 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-08 finished in 10624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U (p1||G((p2||G(p3))))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 3 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5600 place count 2803 transition count 12500
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7952 place count 2803 transition count 10148
Applied a total of 7952 rules in 2283 ms. Remains 2803 /5603 variables (removed 2800) and now considering 10148/15300 (removed 5152) transitions.
// Phase 1: matrix 10148 rows 2803 cols
[2024-05-20 19:06:03] [INFO ] Computed 52 invariants in 299 ms
[2024-05-20 19:06:05] [INFO ] Implicit Places using invariants in 2384 ms returned []
Implicit Place search using SMT only with invariants took 2385 ms to find 0 implicit places.
[2024-05-20 19:06:05] [INFO ] Invariant cache hit.
[2024-05-20 19:06:10] [INFO ] Dead Transitions using invariants and state equation in 4980 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5603 places, 10148/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9649 ms. Remains : 2803/5603 places, 10148/15300 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), p0, p0, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=0 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s752), p2:(LEQ 1 s390), p3:(LEQ s1032 s1038), p0:(OR (LEQ 3 s752) (LEQ s1032 s1038))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8584 steps with 32 reset in 105 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-09 finished in 10045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&G(F(p2)))))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 665 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-20 19:06:12] [INFO ] Computed 52 invariants in 962 ms
[2024-05-20 19:06:13] [INFO ] Implicit Places using invariants in 1932 ms returned []
Implicit Place search using SMT only with invariants took 1935 ms to find 0 implicit places.
[2024-05-20 19:06:13] [INFO ] Invariant cache hit.
[2024-05-20 19:06:22] [INFO ] Dead Transitions using invariants and state equation in 8984 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11587 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s5562 s3176), p1:(GT s5436 s3995), p2:(LEQ 3 s5473)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1139 steps with 0 reset in 12 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-10 finished in 11846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1&&X((p1 U (p2||G(p1)))))||p0)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 672 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2024-05-20 19:06:23] [INFO ] Invariant cache hit.
[2024-05-20 19:06:24] [INFO ] Implicit Places using invariants in 968 ms returned []
Implicit Place search using SMT only with invariants took 969 ms to find 0 implicit places.
[2024-05-20 19:06:24] [INFO ] Invariant cache hit.
[2024-05-20 19:06:33] [INFO ] Dead Transitions using invariants and state equation in 9063 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10706 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (GT s336 s4662) (GT 2 s1128)), p1:(GT 3 s3110), p2:(GT 2 s1128)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 83 reset in 958 ms.
Product exploration explored 100000 steps with 81 reset in 1006 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 69282 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69282 steps, saw 59754 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 19:06:39] [INFO ] Invariant cache hit.
[2024-05-20 19:06:40] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-20 19:06:40] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-20 19:06:50] [INFO ] After 11086ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:06:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-20 19:06:51] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-20 19:07:05] [INFO ] After 12920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:07:05] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 19:07:15] [INFO ] After 10752ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 19:07:15] [INFO ] After 10753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 19:07:15] [INFO ] After 25087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 93 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 4 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7798 place count 2855 transition count 10250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2854 transition count 10250
Partial Free-agglomeration rule applied 2649 times.
Drop transitions removed 2649 transitions
Iterating global reduction 3 with 2649 rules applied. Total rules applied 10448 place count 2854 transition count 10250
Applied a total of 10448 rules in 3288 ms. Remains 2854 /5603 variables (removed 2749) and now considering 10250/15300 (removed 5050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3288 ms. Remains : 2854/5603 places, 10250/15300 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 68204 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68204 steps, saw 28342 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10250 rows 2854 cols
[2024-05-20 19:07:23] [INFO ] Computed 52 invariants in 405 ms
[2024-05-20 19:07:23] [INFO ] [Real]Absence check using 50 positive place invariants in 28 ms returned sat
[2024-05-20 19:07:23] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-20 19:07:26] [INFO ] After 3649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:07:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:07:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:07:31] [INFO ] After 4351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:07:31] [INFO ] State equation strengthened by 10043 read => feed constraints.
[2024-05-20 19:07:35] [INFO ] After 3996ms SMT Verify possible using 10043 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:07:38] [INFO ] After 6860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1818 ms.
[2024-05-20 19:07:40] [INFO ] After 13840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 2854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 515 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 523 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
[2024-05-20 19:07:41] [INFO ] Invariant cache hit.
[2024-05-20 19:07:45] [INFO ] Implicit Places using invariants in 3592 ms returned []
Implicit Place search using SMT only with invariants took 3593 ms to find 0 implicit places.
[2024-05-20 19:07:45] [INFO ] Invariant cache hit.
[2024-05-20 19:07:50] [INFO ] Dead Transitions using invariants and state equation in 5251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9369 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Graph (trivial) has 9890 edges and 2854 vertex of which 2648 / 2854 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2646 places
Drop transitions removed 7493 transitions
Ensure Unique test removed 2541 transitions
Reduce isomorphic transitions removed 10034 transitions.
Graph (complete) has 517 edges and 208 vertex of which 59 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 59 transition count 67
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 58 transition count 66
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 152 place count 11 transition count 19
Iterating global reduction 2 with 47 rules applied. Total rules applied 199 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 8 transition count 13
Applied a total of 206 rules in 18 ms. Remains 8 /2854 variables (removed 2846) and now considering 13/10250 (removed 10237) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2024-05-20 19:07:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:07:50] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:07:50] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:07:50] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-20 19:07:50] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 588 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-20 19:07:52] [INFO ] Computed 52 invariants in 946 ms
[2024-05-20 19:07:53] [INFO ] Implicit Places using invariants in 1927 ms returned []
Implicit Place search using SMT only with invariants took 1928 ms to find 0 implicit places.
[2024-05-20 19:07:53] [INFO ] Invariant cache hit.
[2024-05-20 19:08:02] [INFO ] Dead Transitions using invariants and state equation in 8952 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11478 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 69321 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69321 steps, saw 59763 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 19:08:06] [INFO ] Invariant cache hit.
[2024-05-20 19:08:07] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-20 19:08:07] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 72 ms returned sat
[2024-05-20 19:08:17] [INFO ] After 11131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:08:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-20 19:08:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 76 ms returned sat
[2024-05-20 19:08:31] [INFO ] After 12963ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:08:31] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 19:08:42] [INFO ] After 10664ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 19:08:42] [INFO ] After 10665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-20 19:08:42] [INFO ] After 25092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 93 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 4 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7798 place count 2855 transition count 10250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2854 transition count 10250
Partial Free-agglomeration rule applied 2649 times.
Drop transitions removed 2649 transitions
Iterating global reduction 3 with 2649 rules applied. Total rules applied 10448 place count 2854 transition count 10250
Applied a total of 10448 rules in 2828 ms. Remains 2854 /5603 variables (removed 2749) and now considering 10250/15300 (removed 5050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2829 ms. Remains : 2854/5603 places, 10250/15300 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 66129 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66129 steps, saw 28049 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10250 rows 2854 cols
[2024-05-20 19:08:49] [INFO ] Computed 52 invariants in 419 ms
[2024-05-20 19:08:49] [INFO ] [Real]Absence check using 50 positive place invariants in 28 ms returned sat
[2024-05-20 19:08:49] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 40 ms returned sat
[2024-05-20 19:08:52] [INFO ] After 3706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:08:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:08:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-20 19:08:57] [INFO ] After 4269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:08:57] [INFO ] State equation strengthened by 10043 read => feed constraints.
[2024-05-20 19:09:01] [INFO ] After 3793ms SMT Verify possible using 10043 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:09:04] [INFO ] After 6636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1817 ms.
[2024-05-20 19:09:06] [INFO ] After 13544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 2854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 430 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 513 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
[2024-05-20 19:09:07] [INFO ] Invariant cache hit.
[2024-05-20 19:09:11] [INFO ] Implicit Places using invariants in 3716 ms returned []
Implicit Place search using SMT only with invariants took 3717 ms to find 0 implicit places.
[2024-05-20 19:09:11] [INFO ] Invariant cache hit.
[2024-05-20 19:09:16] [INFO ] Dead Transitions using invariants and state equation in 5065 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9297 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Graph (trivial) has 9890 edges and 2854 vertex of which 2648 / 2854 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2646 places
Drop transitions removed 7493 transitions
Ensure Unique test removed 2541 transitions
Reduce isomorphic transitions removed 10034 transitions.
Graph (complete) has 517 edges and 208 vertex of which 59 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.1 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 59 transition count 67
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 58 transition count 66
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 152 place count 11 transition count 19
Iterating global reduction 2 with 47 rules applied. Total rules applied 199 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 8 transition count 13
Applied a total of 206 rules in 18 ms. Remains 8 /2854 variables (removed 2846) and now considering 13/10250 (removed 10237) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2024-05-20 19:09:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 19:09:16] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:09:16] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:09:16] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-20 19:09:16] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 81 reset in 961 ms.
Product exploration explored 100000 steps with 82 reset in 1021 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 5603 transition count 15300
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 250 place count 5603 transition count 15300
Deduced a syphon composed of 300 places in 3 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 300 place count 5603 transition count 15300
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 400 place count 5503 transition count 15200
Deduced a syphon composed of 200 places in 4 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 500 place count 5503 transition count 15200
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: -4696
Deduced a syphon composed of 2648 places in 3 ms
Iterating global reduction 1 with 2448 rules applied. Total rules applied 2948 place count 5503 transition count 19896
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 3148 place count 5303 transition count 19696
Deduced a syphon composed of 2448 places in 2 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 3348 place count 5303 transition count 19696
Deduced a syphon composed of 2448 places in 2 ms
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 1 with 2301 rules applied. Total rules applied 5649 place count 5303 transition count 17395
Deduced a syphon composed of 2448 places in 2 ms
Applied a total of 5649 rules in 4724 ms. Remains 5303 /5603 variables (removed 300) and now considering 17395/15300 (removed -2095) transitions.
// Phase 1: matrix 17395 rows 5303 cols
[2024-05-20 19:09:24] [INFO ] Computed 52 invariants in 1040 ms
[2024-05-20 19:09:33] [INFO ] Dead Transitions using invariants and state equation in 10009 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5303/5603 places, 17395/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14734 ms. Remains : 5303/5603 places, 17395/15300 transitions.
Built C files in :
/tmp/ltsmin12203608232402799794
[2024-05-20 19:09:33] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12203608232402799794
Running compilation step : cd /tmp/ltsmin12203608232402799794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12203608232402799794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12203608232402799794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 743 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-20 19:09:38] [INFO ] Computed 52 invariants in 947 ms
[2024-05-20 19:09:39] [INFO ] Implicit Places using invariants in 1931 ms returned []
Implicit Place search using SMT only with invariants took 1946 ms to find 0 implicit places.
[2024-05-20 19:09:39] [INFO ] Invariant cache hit.
[2024-05-20 19:09:47] [INFO ] Dead Transitions using invariants and state equation in 8307 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10996 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Built C files in :
/tmp/ltsmin5904927642299158000
[2024-05-20 19:09:48] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5904927642299158000
Running compilation step : cd /tmp/ltsmin5904927642299158000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5904927642299158000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5904927642299158000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:09:51] [INFO ] Flatten gal took : 274 ms
[2024-05-20 19:09:51] [INFO ] Flatten gal took : 286 ms
[2024-05-20 19:09:51] [INFO ] Time to serialize gal into /tmp/LTL1754821861863113267.gal : 41 ms
[2024-05-20 19:09:51] [INFO ] Time to serialize properties into /tmp/LTL14509733756767981774.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1754821861863113267.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17518568394747269081.hoa' '-atoms' '/tmp/LTL14509733756767981774.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14509733756767981774.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17518568394747269081.hoa
Detected timeout of ITS tools.
[2024-05-20 19:10:07] [INFO ] Flatten gal took : 271 ms
[2024-05-20 19:10:07] [INFO ] Flatten gal took : 290 ms
[2024-05-20 19:10:07] [INFO ] Time to serialize gal into /tmp/LTL9980872855338682183.gal : 44 ms
[2024-05-20 19:10:07] [INFO ] Time to serialize properties into /tmp/LTL9703779765238367661.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9980872855338682183.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9703779765238367661.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((Node23OKshare>Node40GiveAnswer19)||(Node4GiveAnswer17<2))")||(("(Node24GiveAnswer28<3)")&&(X(("(Node24GiveAnswer28<3)")U(...220
Formula 0 simplified : XXF(!"((Node23OKshare>Node40GiveAnswer19)||(Node4GiveAnswer17<2))" & (!"(Node24GiveAnswer28<3)" | X(!"(Node24GiveAnswer28<3)" M !"(N...178
Detected timeout of ITS tools.
[2024-05-20 19:10:22] [INFO ] Flatten gal took : 268 ms
[2024-05-20 19:10:22] [INFO ] Applying decomposition
[2024-05-20 19:10:23] [INFO ] Flatten gal took : 287 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12467929971702056468.txt' '-o' '/tmp/graph12467929971702056468.bin' '-w' '/tmp/graph12467929971702056468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12467929971702056468.bin' '-l' '-1' '-v' '-w' '/tmp/graph12467929971702056468.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:10:23] [INFO ] Decomposing Gal with order
[2024-05-20 19:10:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:10:24] [INFO ] Removed a total of 7623 redundant transitions.
[2024-05-20 19:10:24] [INFO ] Flatten gal took : 778 ms
[2024-05-20 19:10:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4954 labels/synchronizations in 479 ms.
[2024-05-20 19:10:26] [INFO ] Time to serialize gal into /tmp/LTL217412391555957950.gal : 61 ms
[2024-05-20 19:10:26] [INFO ] Time to serialize properties into /tmp/LTL5379178052983044561.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL217412391555957950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5379178052983044561.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((gu94.Node23OKshare>gu94.Node40GiveAnswer19)||(gi0.gi1.gi23.gu71.Node4GiveAnswer17<2))")||(("(gi0.gi1.gi23.gu115.Node24Giv...323
Formula 0 simplified : XXF(!"((gu94.Node23OKshare>gu94.Node40GiveAnswer19)||(gi0.gi1.gi23.gu71.Node4GiveAnswer17<2))" & (!"(gi0.gi1.gi23.gu115.Node24GiveAn...262
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3446534460015478493
[2024-05-20 19:10:41] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3446534460015478493
Running compilation step : cd /tmp/ltsmin3446534460015478493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3446534460015478493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3446534460015478493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-11 finished in 261612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1||F(G(p1)))))))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 658 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2024-05-20 19:10:45] [INFO ] Invariant cache hit.
[2024-05-20 19:10:46] [INFO ] Implicit Places using invariants in 961 ms returned []
Implicit Place search using SMT only with invariants took 961 ms to find 0 implicit places.
[2024-05-20 19:10:46] [INFO ] Invariant cache hit.
[2024-05-20 19:10:54] [INFO ] Dead Transitions using invariants and state equation in 8371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9994 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 2 s3626), p1:(LEQ 1 s2753)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1046 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-12 finished in 10230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))&&(p1||X(G(p2)))))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-050-LTLCardinality-01
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2447 Post agglomeration using F-continuation condition.Transition count delta: 2447
Deduced a syphon composed of 2447 places in 4 ms
Reduce places removed 2447 places and 0 transitions.
Iterating global reduction 2 with 4894 rules applied. Total rules applied 5594 place count 2806 transition count 12503
Drop transitions removed 2349 transitions
Redundant transition composition rules discarded 2349 transitions
Iterating global reduction 2 with 2349 rules applied. Total rules applied 7943 place count 2806 transition count 10154
Applied a total of 7943 rules in 2007 ms. Remains 2806 /5603 variables (removed 2797) and now considering 10154/15300 (removed 5146) transitions.
// Phase 1: matrix 10154 rows 2806 cols
[2024-05-20 19:10:57] [INFO ] Computed 52 invariants in 280 ms
[2024-05-20 19:10:59] [INFO ] Implicit Places using invariants in 2373 ms returned []
Implicit Place search using SMT only with invariants took 2374 ms to find 0 implicit places.
[2024-05-20 19:10:59] [INFO ] Invariant cache hit.
[2024-05-20 19:11:04] [INFO ] Dead Transitions using invariants and state equation in 5206 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2806/5603 places, 10154/15300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9588 ms. Remains : 2806/5603 places, 10154/15300 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s2047 s2172), p1:(AND (LEQ 2 s1443) (LEQ 2 s2682)), p2:(GT 3 s1844)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 394 reset in 1162 ms.
Product exploration explored 100000 steps with 398 reset in 1220 ms.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), false, false, false, false]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-20 19:11:08] [INFO ] Invariant cache hit.
[2024-05-20 19:11:08] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:11:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 25 ms returned sat
[2024-05-20 19:11:09] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-20 19:11:13] [INFO ] After 3976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:11:13] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2024-05-20 19:11:17] [INFO ] After 4197ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:11:19] [INFO ] After 6547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1452 ms.
[2024-05-20 19:11:21] [INFO ] After 12778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 31 ms.
Support contains 5 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2806 transition count 10153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2805 transition count 10153
Partial Free-agglomeration rule applied 2549 times.
Drop transitions removed 2549 transitions
Iterating global reduction 1 with 2549 rules applied. Total rules applied 2551 place count 2805 transition count 10153
Applied a total of 2551 rules in 1434 ms. Remains 2805 /2806 variables (removed 1) and now considering 10153/10154 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1436 ms. Remains : 2805/2806 places, 10153/10154 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 66357 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66357 steps, saw 26934 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10153 rows 2805 cols
[2024-05-20 19:11:26] [INFO ] Computed 52 invariants in 297 ms
[2024-05-20 19:11:26] [INFO ] [Real]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 19:11:27] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 38 ms returned sat
[2024-05-20 19:11:27] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:11:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 19:11:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:11:32] [INFO ] After 4436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:11:32] [INFO ] State equation strengthened by 9993 read => feed constraints.
[2024-05-20 19:11:35] [INFO ] After 2958ms SMT Verify possible using 9993 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:11:37] [INFO ] After 5271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1535 ms.
[2024-05-20 19:11:39] [INFO ] After 12049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 32 ms.
Support contains 5 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10153/10153 transitions.
Applied a total of 0 rules in 484 ms. Remains 2805 /2805 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 2805/2805 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10153/10153 transitions.
Applied a total of 0 rules in 487 ms. Remains 2805 /2805 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2024-05-20 19:11:40] [INFO ] Invariant cache hit.
[2024-05-20 19:11:43] [INFO ] Implicit Places using invariants in 3521 ms returned []
Implicit Place search using SMT only with invariants took 3521 ms to find 0 implicit places.
[2024-05-20 19:11:43] [INFO ] Invariant cache hit.
[2024-05-20 19:11:48] [INFO ] Dead Transitions using invariants and state equation in 4975 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8985 ms. Remains : 2805/2805 places, 10153/10153 transitions.
Graph (trivial) has 9834 edges and 2805 vertex of which 2597 / 2805 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2595 places
Drop transitions removed 7390 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9932 transitions.
Graph (complete) has 523 edges and 210 vertex of which 59 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 59 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 58 transition count 70
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 10 transition count 22
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 10 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 10 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 10 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 9 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 8 transition count 17
Applied a total of 207 rules in 18 ms. Remains 8 /2805 variables (removed 2797) and now considering 17/10153 (removed 10136) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 17 rows 8 cols
[2024-05-20 19:11:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:11:48] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:11:48] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:11:48] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-20 19:11:48] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 105 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter insensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), false, false, false, false]
Support contains 5 out of 2806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 436 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
// Phase 1: matrix 10154 rows 2806 cols
[2024-05-20 19:11:50] [INFO ] Computed 52 invariants in 280 ms
[2024-05-20 19:11:52] [INFO ] Implicit Places using invariants in 2356 ms returned []
Implicit Place search using SMT only with invariants took 2357 ms to find 0 implicit places.
[2024-05-20 19:11:52] [INFO ] Invariant cache hit.
[2024-05-20 19:11:57] [INFO ] Dead Transitions using invariants and state equation in 4914 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7707 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND p2 p1 p0)))), true, (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X p0)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 151 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter insensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-20 19:11:57] [INFO ] Invariant cache hit.
[2024-05-20 19:11:58] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:11:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 19:11:58] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-20 19:12:02] [INFO ] After 3761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:12:03] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2024-05-20 19:12:09] [INFO ] After 6029ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:12:11] [INFO ] After 8356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1534 ms.
[2024-05-20 19:12:12] [INFO ] After 14439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 88 ms.
Support contains 5 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2806 transition count 10153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2805 transition count 10153
Partial Free-agglomeration rule applied 2549 times.
Drop transitions removed 2549 transitions
Iterating global reduction 1 with 2549 rules applied. Total rules applied 2551 place count 2805 transition count 10153
Applied a total of 2551 rules in 1415 ms. Remains 2805 /2806 variables (removed 1) and now considering 10153/10154 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1415 ms. Remains : 2805/2806 places, 10153/10154 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 67198 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67198 steps, saw 27045 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10153 rows 2805 cols
[2024-05-20 19:12:18] [INFO ] Computed 52 invariants in 300 ms
[2024-05-20 19:12:18] [INFO ] [Real]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 19:12:18] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:12:21] [INFO ] After 3344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:12:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:12:21] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-20 19:12:26] [INFO ] After 4104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:12:26] [INFO ] State equation strengthened by 9993 read => feed constraints.
[2024-05-20 19:12:29] [INFO ] After 3573ms SMT Verify possible using 9993 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:12:32] [INFO ] After 5927ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1666 ms.
[2024-05-20 19:12:33] [INFO ] After 12507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 51 ms.
Support contains 5 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10153/10153 transitions.
Applied a total of 0 rules in 485 ms. Remains 2805 /2805 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 2805/2805 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10153/10153 transitions.
Applied a total of 0 rules in 495 ms. Remains 2805 /2805 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2024-05-20 19:12:34] [INFO ] Invariant cache hit.
[2024-05-20 19:12:38] [INFO ] Implicit Places using invariants in 3522 ms returned []
Implicit Place search using SMT only with invariants took 3522 ms to find 0 implicit places.
[2024-05-20 19:12:38] [INFO ] Invariant cache hit.
[2024-05-20 19:12:43] [INFO ] Dead Transitions using invariants and state equation in 4881 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8901 ms. Remains : 2805/2805 places, 10153/10153 transitions.
Graph (trivial) has 9834 edges and 2805 vertex of which 2597 / 2805 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2595 places
Drop transitions removed 7390 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9932 transitions.
Graph (complete) has 523 edges and 210 vertex of which 59 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 59 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 58 transition count 70
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 10 transition count 22
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 10 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 10 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 10 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 9 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 8 transition count 17
Applied a total of 207 rules in 16 ms. Remains 8 /2805 variables (removed 2797) and now considering 17/10153 (removed 10136) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 17 rows 8 cols
[2024-05-20 19:12:43] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:12:43] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:12:43] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:12:43] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-20 19:12:43] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND p2 p1 p0)))), true, (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X p0)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 16 factoid took 186 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter insensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 392 reset in 1185 ms.
Product exploration explored 100000 steps with 396 reset in 1255 ms.
Built C files in :
/tmp/ltsmin4907736588061153613
[2024-05-20 19:12:47] [INFO ] Too many transitions (10154) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:12:47] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4907736588061153613
Running compilation step : cd /tmp/ltsmin4907736588061153613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4907736588061153613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4907736588061153613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 2806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 459 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
// Phase 1: matrix 10154 rows 2806 cols
[2024-05-20 19:12:50] [INFO ] Computed 52 invariants in 291 ms
[2024-05-20 19:12:52] [INFO ] Implicit Places using invariants in 2443 ms returned []
Implicit Place search using SMT only with invariants took 2444 ms to find 0 implicit places.
[2024-05-20 19:12:53] [INFO ] Invariant cache hit.
[2024-05-20 19:12:58] [INFO ] Dead Transitions using invariants and state equation in 5330 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8234 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Built C files in :
/tmp/ltsmin17307627375131299982
[2024-05-20 19:12:58] [INFO ] Too many transitions (10154) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:12:58] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17307627375131299982
Running compilation step : cd /tmp/ltsmin17307627375131299982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17307627375131299982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17307627375131299982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:13:01] [INFO ] Flatten gal took : 167 ms
[2024-05-20 19:13:01] [INFO ] Flatten gal took : 183 ms
[2024-05-20 19:13:01] [INFO ] Time to serialize gal into /tmp/LTL13714796332269610002.gal : 49 ms
[2024-05-20 19:13:01] [INFO ] Time to serialize properties into /tmp/LTL8777573446167651366.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13714796332269610002.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5734942454000181176.hoa' '-atoms' '/tmp/LTL8777573446167651366.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8777573446167651366.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5734942454000181176.hoa
Detected timeout of ITS tools.
[2024-05-20 19:13:17] [INFO ] Flatten gal took : 204 ms
[2024-05-20 19:13:17] [INFO ] Flatten gal took : 174 ms
[2024-05-20 19:13:17] [INFO ] Time to serialize gal into /tmp/LTL17905202311896079859.gal : 31 ms
[2024-05-20 19:13:17] [INFO ] Time to serialize properties into /tmp/LTL7059980421142121297.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17905202311896079859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7059980421142121297.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(Node34requestsent43<=Node37GiveAnswer16)")))&&((X(G("(Node30GiveAnswer40<3)")))||("((Node22GiveAnswer40>=2)&&(Node47requ...176
Formula 0 simplified : X(FG!"(Node34requestsent43<=Node37GiveAnswer16)" | G(!"((Node22GiveAnswer40>=2)&&(Node47requestsent26>=2))" & F!"(Node30GiveAnswer40...161
Detected timeout of ITS tools.
[2024-05-20 19:13:32] [INFO ] Flatten gal took : 167 ms
[2024-05-20 19:13:32] [INFO ] Applying decomposition
[2024-05-20 19:13:32] [INFO ] Flatten gal took : 176 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16494045832846004835.txt' '-o' '/tmp/graph16494045832846004835.bin' '-w' '/tmp/graph16494045832846004835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16494045832846004835.bin' '-l' '-1' '-v' '-w' '/tmp/graph16494045832846004835.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:13:33] [INFO ] Decomposing Gal with order
[2024-05-20 19:13:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:13:34] [INFO ] Removed a total of 7517 redundant transitions.
[2024-05-20 19:13:34] [INFO ] Flatten gal took : 693 ms
[2024-05-20 19:13:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 4899 labels/synchronizations in 471 ms.
[2024-05-20 19:13:35] [INFO ] Time to serialize gal into /tmp/LTL12433922532818897544.gal : 34 ms
[2024-05-20 19:13:35] [INFO ] Time to serialize properties into /tmp/LTL1970450108705905109.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12433922532818897544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1970450108705905109.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(gu51.Node34requestsent43<=gu51.Node37GiveAnswer16)")))&&((X(G("(gi0.gu41.Node30GiveAnswer40<3)")))||("((gi0.gu41.Node22G...213
Formula 0 simplified : X(FG!"(gu51.Node34requestsent43<=gu51.Node37GiveAnswer16)" | G(!"((gi0.gu41.Node22GiveAnswer40>=2)&&(gi0.gu48.Node47requestsent26>=2...198
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin126654711779442426
[2024-05-20 19:13:50] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin126654711779442426
Running compilation step : cd /tmp/ltsmin126654711779442426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin126654711779442426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin126654711779442426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-01 finished in 178238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-050-LTLCardinality-06
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 4 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 2 with 4896 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 2 with 2350 rules applied. Total rules applied 7946 place count 2805 transition count 10152
Applied a total of 7946 rules in 2084 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10152/15300 (removed 5148) transitions.
// Phase 1: matrix 10152 rows 2805 cols
[2024-05-20 19:13:55] [INFO ] Computed 52 invariants in 274 ms
[2024-05-20 19:13:57] [INFO ] Implicit Places using invariants in 2463 ms returned []
Implicit Place search using SMT only with invariants took 2464 ms to find 0 implicit places.
[2024-05-20 19:13:57] [INFO ] Invariant cache hit.
[2024-05-20 19:14:03] [INFO ] Dead Transitions using invariants and state equation in 5259 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2805/5603 places, 10152/15300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9808 ms. Remains : 2805/5603 places, 10152/15300 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT 3 s878), p0:(GT s426 s2232)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 397 reset in 1201 ms.
Product exploration explored 100000 steps with 397 reset in 1246 ms.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:14:06] [INFO ] Invariant cache hit.
[2024-05-20 19:14:06] [INFO ] [Real]Absence check using 50 positive place invariants in 25 ms returned sat
[2024-05-20 19:14:06] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-20 19:14:09] [INFO ] After 3309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:14:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:14:09] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-20 19:14:12] [INFO ] After 2962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:14:12] [INFO ] State equation strengthened by 7446 read => feed constraints.
[2024-05-20 19:14:16] [INFO ] After 3352ms SMT Verify possible using 7446 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:14:16] [INFO ] After 3796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 277 ms.
[2024-05-20 19:14:16] [INFO ] After 7458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 1 with 2550 rules applied. Total rules applied 2552 place count 2804 transition count 10151
Applied a total of 2552 rules in 1435 ms. Remains 2804 /2805 variables (removed 1) and now considering 10151/10152 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1435 ms. Remains : 2804/2805 places, 10151/10152 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 70834 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70834 steps, saw 27488 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10151 rows 2804 cols
[2024-05-20 19:14:21] [INFO ] Computed 52 invariants in 318 ms
[2024-05-20 19:14:22] [INFO ] [Real]Absence check using 50 positive place invariants in 28 ms returned sat
[2024-05-20 19:14:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-20 19:14:25] [INFO ] After 3942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:14:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 33 ms returned sat
[2024-05-20 19:14:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:14:29] [INFO ] After 3456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:14:29] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2024-05-20 19:14:32] [INFO ] After 2666ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:14:32] [INFO ] After 3081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 264 ms.
[2024-05-20 19:14:32] [INFO ] After 7255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 10151/10151 transitions.
Applied a total of 0 rules in 511 ms. Remains 2804 /2804 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 2804/2804 places, 10151/10151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 10151/10151 transitions.
Applied a total of 0 rules in 494 ms. Remains 2804 /2804 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
[2024-05-20 19:14:33] [INFO ] Invariant cache hit.
[2024-05-20 19:14:37] [INFO ] Implicit Places using invariants in 3698 ms returned []
Implicit Place search using SMT only with invariants took 3698 ms to find 0 implicit places.
[2024-05-20 19:14:37] [INFO ] Invariant cache hit.
[2024-05-20 19:14:42] [INFO ] Dead Transitions using invariants and state equation in 4989 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9182 ms. Remains : 2804/2804 places, 10151/10151 transitions.
Graph (trivial) has 9840 edges and 2804 vertex of which 2598 / 2804 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2596 places
Drop transitions removed 7394 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9936 transitions.
Graph (complete) has 517 edges and 208 vertex of which 57 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.1 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 57 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 56 transition count 64
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 8 transition count 16
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 6 transition count 11
Applied a total of 207 rules in 16 ms. Remains 6 /2804 variables (removed 2798) and now considering 11/10151 (removed 10140) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 6 cols
[2024-05-20 19:14:42] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:14:42] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:14:42] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:14:42] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 19:14:42] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Applied a total of 0 rules in 345 ms. Remains 2805 /2805 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
// Phase 1: matrix 10152 rows 2805 cols
[2024-05-20 19:14:43] [INFO ] Computed 52 invariants in 294 ms
[2024-05-20 19:14:45] [INFO ] Implicit Places using invariants in 2483 ms returned []
Implicit Place search using SMT only with invariants took 2483 ms to find 0 implicit places.
[2024-05-20 19:14:45] [INFO ] Invariant cache hit.
[2024-05-20 19:14:51] [INFO ] Dead Transitions using invariants and state equation in 5041 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7871 ms. Remains : 2805/2805 places, 10152/10152 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:14:51] [INFO ] Invariant cache hit.
[2024-05-20 19:14:51] [INFO ] [Real]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 19:14:51] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-20 19:14:54] [INFO ] After 3245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:14:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 25 ms returned sat
[2024-05-20 19:14:54] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-20 19:14:57] [INFO ] After 2836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:14:57] [INFO ] State equation strengthened by 7446 read => feed constraints.
[2024-05-20 19:15:01] [INFO ] After 3343ms SMT Verify possible using 7446 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:15:01] [INFO ] After 3796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 277 ms.
[2024-05-20 19:15:01] [INFO ] After 7325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 1 with 2550 rules applied. Total rules applied 2552 place count 2804 transition count 10151
Applied a total of 2552 rules in 1449 ms. Remains 2804 /2805 variables (removed 1) and now considering 10151/10152 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1449 ms. Remains : 2804/2805 places, 10151/10152 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 71487 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71487 steps, saw 27564 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10151 rows 2804 cols
[2024-05-20 19:15:06] [INFO ] Computed 52 invariants in 320 ms
[2024-05-20 19:15:07] [INFO ] [Real]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:15:07] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-20 19:15:10] [INFO ] After 3929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:15:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:15:11] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-20 19:15:14] [INFO ] After 3389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:15:14] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2024-05-20 19:15:17] [INFO ] After 2653ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:15:17] [INFO ] After 3068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 269 ms.
[2024-05-20 19:15:18] [INFO ] After 7170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 10151/10151 transitions.
Applied a total of 0 rules in 500 ms. Remains 2804 /2804 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 2804/2804 places, 10151/10151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 10151/10151 transitions.
Applied a total of 0 rules in 519 ms. Remains 2804 /2804 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
[2024-05-20 19:15:19] [INFO ] Invariant cache hit.
[2024-05-20 19:15:22] [INFO ] Implicit Places using invariants in 3636 ms returned []
Implicit Place search using SMT only with invariants took 3637 ms to find 0 implicit places.
[2024-05-20 19:15:22] [INFO ] Invariant cache hit.
[2024-05-20 19:15:27] [INFO ] Dead Transitions using invariants and state equation in 5106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9264 ms. Remains : 2804/2804 places, 10151/10151 transitions.
Graph (trivial) has 9840 edges and 2804 vertex of which 2598 / 2804 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2596 places
Drop transitions removed 7394 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9936 transitions.
Graph (complete) has 517 edges and 208 vertex of which 57 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 57 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 56 transition count 64
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 8 transition count 16
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 6 transition count 11
Applied a total of 207 rules in 20 ms. Remains 6 /2804 variables (removed 2798) and now considering 11/10151 (removed 10140) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 6 cols
[2024-05-20 19:15:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:15:27] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:15:27] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:15:27] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 19:15:27] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 397 reset in 1206 ms.
Product exploration explored 100000 steps with 395 reset in 1256 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Applied a total of 0 rules in 455 ms. Remains 2805 /2805 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
// Phase 1: matrix 10152 rows 2805 cols
[2024-05-20 19:15:31] [INFO ] Computed 52 invariants in 276 ms
[2024-05-20 19:15:37] [INFO ] Dead Transitions using invariants and state equation in 5748 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6204 ms. Remains : 2805/2805 places, 10152/10152 transitions.
Built C files in :
/tmp/ltsmin4488649068112649027
[2024-05-20 19:15:37] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4488649068112649027
Running compilation step : cd /tmp/ltsmin4488649068112649027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4488649068112649027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4488649068112649027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Applied a total of 0 rules in 336 ms. Remains 2805 /2805 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2024-05-20 19:15:40] [INFO ] Invariant cache hit.
[2024-05-20 19:15:42] [INFO ] Implicit Places using invariants in 2209 ms returned []
Implicit Place search using SMT only with invariants took 2210 ms to find 0 implicit places.
[2024-05-20 19:15:42] [INFO ] Invariant cache hit.
[2024-05-20 19:15:48] [INFO ] Dead Transitions using invariants and state equation in 5393 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7939 ms. Remains : 2805/2805 places, 10152/10152 transitions.
Built C files in :
/tmp/ltsmin10083275601865175123
[2024-05-20 19:15:48] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10083275601865175123
Running compilation step : cd /tmp/ltsmin10083275601865175123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10083275601865175123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10083275601865175123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:15:51] [INFO ] Flatten gal took : 174 ms
[2024-05-20 19:15:51] [INFO ] Flatten gal took : 178 ms
[2024-05-20 19:15:51] [INFO ] Time to serialize gal into /tmp/LTL14403498464373049428.gal : 28 ms
[2024-05-20 19:15:51] [INFO ] Time to serialize properties into /tmp/LTL10207606999832986410.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14403498464373049428.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1755123317645450580.hoa' '-atoms' '/tmp/LTL10207606999832986410.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10207606999832986410.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1755123317645450580.hoa
Detected timeout of ITS tools.
[2024-05-20 19:16:07] [INFO ] Flatten gal took : 167 ms
[2024-05-20 19:16:07] [INFO ] Flatten gal took : 179 ms
[2024-05-20 19:16:07] [INFO ] Time to serialize gal into /tmp/LTL17778272861556642896.gal : 33 ms
[2024-05-20 19:16:07] [INFO ] Time to serialize properties into /tmp/LTL6201444752138909525.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17778272861556642896.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6201444752138909525.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(Node2GiveAnswer23>Node38requestsent27)")||(G("(Node11GiveAnswer24<3)")))))))
Formula 0 simplified : XXG(!"(Node2GiveAnswer23>Node38requestsent27)" & F!"(Node11GiveAnswer24<3)")
Detected timeout of ITS tools.
[2024-05-20 19:16:22] [INFO ] Flatten gal took : 165 ms
[2024-05-20 19:16:22] [INFO ] Applying decomposition
[2024-05-20 19:16:22] [INFO ] Flatten gal took : 176 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18244087051543753763.txt' '-o' '/tmp/graph18244087051543753763.bin' '-w' '/tmp/graph18244087051543753763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18244087051543753763.bin' '-l' '-1' '-v' '-w' '/tmp/graph18244087051543753763.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:16:23] [INFO ] Decomposing Gal with order
[2024-05-20 19:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:16:23] [INFO ] Removed a total of 7517 redundant transitions.
[2024-05-20 19:16:24] [INFO ] Flatten gal took : 694 ms
[2024-05-20 19:16:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4901 labels/synchronizations in 459 ms.
[2024-05-20 19:16:24] [INFO ] Time to serialize gal into /tmp/LTL14987755313852164065.gal : 38 ms
[2024-05-20 19:16:24] [INFO ] Time to serialize properties into /tmp/LTL18351988240014611323.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14987755313852164065.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18351988240014611323.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(gu51.Node2GiveAnswer23>gu51.Node38requestsent27)")||(G("(gi0.gu25.Node11GiveAnswer24<3)")))))))
Formula 0 simplified : XXG(!"(gu51.Node2GiveAnswer23>gu51.Node38requestsent27)" & F!"(gi0.gu25.Node11GiveAnswer24<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2861380652759002176
[2024-05-20 19:16:40] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2861380652759002176
Running compilation step : cd /tmp/ltsmin2861380652759002176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2861380652759002176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2861380652759002176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-06 finished in 169845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1&&X((p1 U (p2||G(p1)))))||p0)))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-050-LTLCardinality-11
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 4 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Partial Post-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 2 with 98 rules applied. Total rules applied 7895 place count 2855 transition count 10251
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 7943 place count 2807 transition count 10203
Iterating global reduction 2 with 48 rules applied. Total rules applied 7991 place count 2807 transition count 10203
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 2 with 48 rules applied. Total rules applied 8039 place count 2807 transition count 10155
Applied a total of 8039 rules in 3045 ms. Remains 2807 /5603 variables (removed 2796) and now considering 10155/15300 (removed 5145) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2024-05-20 19:16:46] [INFO ] Computed 52 invariants in 279 ms
[2024-05-20 19:16:48] [INFO ] Implicit Places using invariants in 2421 ms returned []
Implicit Place search using SMT only with invariants took 2421 ms to find 0 implicit places.
[2024-05-20 19:16:48] [INFO ] Invariant cache hit.
[2024-05-20 19:16:53] [INFO ] Dead Transitions using invariants and state equation in 5126 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2807/5603 places, 10155/15300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10593 ms. Remains : 2807/5603 places, 10155/15300 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (GT s145 s2326) (GT 2 s521)), p1:(GT 3 s1533), p2:(GT 2 s521)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 392 reset in 1230 ms.
Product exploration explored 100000 steps with 391 reset in 1265 ms.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 65588 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65588 steps, saw 28922 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 19:17:00] [INFO ] Invariant cache hit.
[2024-05-20 19:17:00] [INFO ] [Real]Absence check using 50 positive place invariants in 25 ms returned sat
[2024-05-20 19:17:00] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:17:03] [INFO ] After 3441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:17:04] [INFO ] [Nat]Absence check using 50 positive place invariants in 34 ms returned sat
[2024-05-20 19:17:04] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:17:07] [INFO ] After 3691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:17:08] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2024-05-20 19:17:12] [INFO ] After 4466ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:17:14] [INFO ] After 6912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1647 ms.
[2024-05-20 19:17:16] [INFO ] After 13036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2807 transition count 10154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2806 transition count 10154
Partial Free-agglomeration rule applied 2551 times.
Drop transitions removed 2551 transitions
Iterating global reduction 1 with 2551 rules applied. Total rules applied 2553 place count 2806 transition count 10154
Applied a total of 2553 rules in 1244 ms. Remains 2806 /2807 variables (removed 1) and now considering 10154/10155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1244 ms. Remains : 2806/2807 places, 10154/10155 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 64418 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64418 steps, saw 26554 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10154 rows 2806 cols
[2024-05-20 19:17:21] [INFO ] Computed 52 invariants in 309 ms
[2024-05-20 19:17:22] [INFO ] [Real]Absence check using 50 positive place invariants in 30 ms returned sat
[2024-05-20 19:17:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-20 19:17:25] [INFO ] After 4308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:17:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:17:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:17:31] [INFO ] After 4593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:17:31] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2024-05-20 19:17:34] [INFO ] After 3335ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:17:37] [INFO ] After 5820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1933 ms.
[2024-05-20 19:17:39] [INFO ] After 13167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 469 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 466 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2024-05-20 19:17:40] [INFO ] Invariant cache hit.
[2024-05-20 19:17:43] [INFO ] Implicit Places using invariants in 3675 ms returned []
Implicit Place search using SMT only with invariants took 3689 ms to find 0 implicit places.
[2024-05-20 19:17:43] [INFO ] Invariant cache hit.
[2024-05-20 19:17:48] [INFO ] Dead Transitions using invariants and state equation in 4994 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9150 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Graph (trivial) has 9842 edges and 2806 vertex of which 2599 / 2806 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2597 places
Drop transitions removed 7396 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9938 transitions.
Graph (complete) has 518 edges and 209 vertex of which 60 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.1 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 59 transition count 67
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 151 place count 12 transition count 20
Iterating global reduction 2 with 47 rules applied. Total rules applied 198 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 12 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 8 transition count 13
Applied a total of 207 rules in 17 ms. Remains 8 /2806 variables (removed 2798) and now considering 13/10154 (removed 10141) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2024-05-20 19:17:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:17:48] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:17:48] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:17:48] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-20 19:17:48] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 282 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2024-05-20 19:17:49] [INFO ] Computed 52 invariants in 279 ms
[2024-05-20 19:17:52] [INFO ] Implicit Places using invariants in 2458 ms returned []
Implicit Place search using SMT only with invariants took 2458 ms to find 0 implicit places.
[2024-05-20 19:17:52] [INFO ] Invariant cache hit.
[2024-05-20 19:17:57] [INFO ] Dead Transitions using invariants and state equation in 5383 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8124 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 66080 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66080 steps, saw 28978 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 19:18:01] [INFO ] Invariant cache hit.
[2024-05-20 19:18:01] [INFO ] [Real]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:18:01] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-20 19:18:04] [INFO ] After 3618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:18:05] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:18:05] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-20 19:18:09] [INFO ] After 3904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:18:09] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2024-05-20 19:18:13] [INFO ] After 4496ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:18:16] [INFO ] After 6955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1655 ms.
[2024-05-20 19:18:18] [INFO ] After 13312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2807 transition count 10154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2806 transition count 10154
Partial Free-agglomeration rule applied 2551 times.
Drop transitions removed 2551 transitions
Iterating global reduction 1 with 2551 rules applied. Total rules applied 2553 place count 2806 transition count 10154
Applied a total of 2553 rules in 1298 ms. Remains 2806 /2807 variables (removed 1) and now considering 10154/10155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1298 ms. Remains : 2806/2807 places, 10154/10155 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 62735 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62735 steps, saw 26364 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10154 rows 2806 cols
[2024-05-20 19:18:23] [INFO ] Computed 52 invariants in 312 ms
[2024-05-20 19:18:23] [INFO ] [Real]Absence check using 50 positive place invariants in 27 ms returned sat
[2024-05-20 19:18:23] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-20 19:18:27] [INFO ] After 4336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:18:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2024-05-20 19:18:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 38 ms returned sat
[2024-05-20 19:18:32] [INFO ] After 4613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:18:32] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2024-05-20 19:18:36] [INFO ] After 3403ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:18:38] [INFO ] After 5891ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1922 ms.
[2024-05-20 19:18:40] [INFO ] After 13260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 465 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 467 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 463 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2024-05-20 19:18:41] [INFO ] Invariant cache hit.
[2024-05-20 19:18:45] [INFO ] Implicit Places using invariants in 3658 ms returned []
Implicit Place search using SMT only with invariants took 3669 ms to find 0 implicit places.
[2024-05-20 19:18:45] [INFO ] Invariant cache hit.
[2024-05-20 19:18:50] [INFO ] Dead Transitions using invariants and state equation in 5233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9366 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Graph (trivial) has 9842 edges and 2806 vertex of which 2599 / 2806 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2597 places
Drop transitions removed 7396 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9938 transitions.
Graph (complete) has 518 edges and 209 vertex of which 60 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 59 transition count 67
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 151 place count 12 transition count 20
Iterating global reduction 2 with 47 rules applied. Total rules applied 198 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 12 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 8 transition count 13
Applied a total of 207 rules in 19 ms. Remains 8 /2806 variables (removed 2798) and now considering 13/10154 (removed 10141) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2024-05-20 19:18:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:18:50] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:18:50] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:18:50] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-20 19:18:50] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 390 reset in 1207 ms.
Product exploration explored 100000 steps with 394 reset in 1253 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 404 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2024-05-20 19:18:54] [INFO ] Computed 52 invariants in 280 ms
[2024-05-20 19:19:00] [INFO ] Dead Transitions using invariants and state equation in 5701 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6107 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Built C files in :
/tmp/ltsmin14053944524498705855
[2024-05-20 19:19:00] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14053944524498705855
Running compilation step : cd /tmp/ltsmin14053944524498705855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14053944524498705855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14053944524498705855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 302 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
[2024-05-20 19:19:03] [INFO ] Invariant cache hit.
[2024-05-20 19:19:05] [INFO ] Implicit Places using invariants in 2156 ms returned []
Implicit Place search using SMT only with invariants took 2173 ms to find 0 implicit places.
[2024-05-20 19:19:05] [INFO ] Invariant cache hit.
[2024-05-20 19:19:11] [INFO ] Dead Transitions using invariants and state equation in 5406 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7882 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Built C files in :
/tmp/ltsmin10675707619071202157
[2024-05-20 19:19:11] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10675707619071202157
Running compilation step : cd /tmp/ltsmin10675707619071202157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10675707619071202157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10675707619071202157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:19:14] [INFO ] Flatten gal took : 166 ms
[2024-05-20 19:19:14] [INFO ] Flatten gal took : 174 ms
[2024-05-20 19:19:14] [INFO ] Time to serialize gal into /tmp/LTL5448788892835867024.gal : 33 ms
[2024-05-20 19:19:14] [INFO ] Time to serialize properties into /tmp/LTL3769672198435553767.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5448788892835867024.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6554103250211292431.hoa' '-atoms' '/tmp/LTL3769672198435553767.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3769672198435553767.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6554103250211292431.hoa
Detected timeout of ITS tools.
[2024-05-20 19:19:30] [INFO ] Flatten gal took : 162 ms
[2024-05-20 19:19:30] [INFO ] Flatten gal took : 172 ms
[2024-05-20 19:19:30] [INFO ] Time to serialize gal into /tmp/LTL14024235879672051264.gal : 38 ms
[2024-05-20 19:19:30] [INFO ] Time to serialize properties into /tmp/LTL12634597556661167096.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14024235879672051264.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12634597556661167096.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((Node23OKshare>Node40GiveAnswer19)||(Node4GiveAnswer17<2))")||(("(Node24GiveAnswer28<3)")&&(X(("(Node24GiveAnswer28<3)")U(...220
Formula 0 simplified : XXF(!"((Node23OKshare>Node40GiveAnswer19)||(Node4GiveAnswer17<2))" & (!"(Node24GiveAnswer28<3)" | X(!"(Node24GiveAnswer28<3)" M !"(N...178
Detected timeout of ITS tools.
[2024-05-20 19:19:45] [INFO ] Flatten gal took : 161 ms
[2024-05-20 19:19:45] [INFO ] Applying decomposition
[2024-05-20 19:19:45] [INFO ] Flatten gal took : 167 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6607812896546930659.txt' '-o' '/tmp/graph6607812896546930659.bin' '-w' '/tmp/graph6607812896546930659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6607812896546930659.bin' '-l' '-1' '-v' '-w' '/tmp/graph6607812896546930659.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:19:45] [INFO ] Decomposing Gal with order
[2024-05-20 19:19:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:19:46] [INFO ] Removed a total of 7514 redundant transitions.
[2024-05-20 19:19:46] [INFO ] Flatten gal took : 671 ms
[2024-05-20 19:19:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4902 labels/synchronizations in 439 ms.
[2024-05-20 19:19:47] [INFO ] Time to serialize gal into /tmp/LTL9171467910530242385.gal : 35 ms
[2024-05-20 19:19:47] [INFO ] Time to serialize properties into /tmp/LTL2778768169912735586.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9171467910530242385.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2778768169912735586.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((gu51.Node23OKshare>gu51.Node40GiveAnswer19)||(gi0.gu18.Node4GiveAnswer17<2))")||(("(gi0.gu29.Node24GiveAnswer28<3)")&&(X(...275
Formula 0 simplified : XXF(!"((gu51.Node23OKshare>gu51.Node40GiveAnswer19)||(gi0.gu18.Node4GiveAnswer17<2))" & (!"(gi0.gu29.Node24GiveAnswer28<3)" | X(!"(g...224
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13902700329087755479
[2024-05-20 19:20:02] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13902700329087755479
Running compilation step : cd /tmp/ltsmin13902700329087755479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13902700329087755479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13902700329087755479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-11 finished in 202705 ms.
[2024-05-20 19:20:06] [INFO ] Flatten gal took : 267 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8147942674995499920
[2024-05-20 19:20:06] [INFO ] Too many transitions (15300) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:20:06] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8147942674995499920
Running compilation step : cd /tmp/ltsmin8147942674995499920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 19:20:06] [INFO ] Applying decomposition
[2024-05-20 19:20:06] [INFO ] Flatten gal took : 269 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13969386247955166463.txt' '-o' '/tmp/graph13969386247955166463.bin' '-w' '/tmp/graph13969386247955166463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13969386247955166463.bin' '-l' '-1' '-v' '-w' '/tmp/graph13969386247955166463.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:20:07] [INFO ] Decomposing Gal with order
[2024-05-20 19:20:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:20:08] [INFO ] Removed a total of 7627 redundant transitions.
[2024-05-20 19:20:08] [INFO ] Flatten gal took : 788 ms
[2024-05-20 19:20:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 4902 labels/synchronizations in 481 ms.
[2024-05-20 19:20:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality695482216481099045.gal : 55 ms
[2024-05-20 19:20:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality8594197718312270482.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality695482216481099045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8594197718312270482.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 3 LTL properties
Checking formula 0 : !((X(F((G(F("(gu200.Node34requestsent43<=gu200.Node37GiveAnswer16)")))&&(("((gi0.gi19.gu160.Node22GiveAnswer40>=2)&&(gi0.gi19.gu189.No...233
Formula 0 simplified : X(FG!"(gu200.Node34requestsent43<=gu200.Node37GiveAnswer16)" | G(!"((gi0.gi19.gu160.Node22GiveAnswer40>=2)&&(gi0.gi19.gu189.Node47re...218
Compilation finished in 122051 ms.
Running link step : cd /tmp/ltsmin8147942674995499920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 141 ms.
Running LTSmin : cd /tmp/ltsmin8147942674995499920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp0==true)))&&((LTLAPp1==true)||X([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8147942674995499920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp0==true)))&&((LTLAPp1==true)||X([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8147942674995499920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp3==true)||[]((LTLAPp4==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-20 19:47:24] [INFO ] Flatten gal took : 2215 ms
[2024-05-20 19:47:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality10547468494941302645.gal : 250 ms
[2024-05-20 19:47:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality17367469131146709003.ltl : 10 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10547468494941302645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17367469131146709003.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !((X(F((G(F("(Node34requestsent43<=Node37GiveAnswer16)")))&&(("((Node22GiveAnswer40>=2)&&(Node47requestsent26>=2))")||(X(G("(Node30Giv...176
Formula 0 simplified : X(FG!"(Node34requestsent43<=Node37GiveAnswer16)" | G(!"((Node22GiveAnswer40>=2)&&(Node47requestsent26>=2))" & F!"(Node30GiveAnswer40...161
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12626388 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15982280 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is CANInsertWithFailure-PT-050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521500082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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