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.r417-tall-171690556700563.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 Szymanski-PT-b12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556700563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.6K 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.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717177450819

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 17:44:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 17:44:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 17:44:12] [INFO ] Load time of PNML (sax parser for PT used): 293 ms
[2024-05-31 17:44:12] [INFO ] Transformed 568 places.
[2024-05-31 17:44:12] [INFO ] Transformed 8320 transitions.
[2024-05-31 17:44:12] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 260 places in 17 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b12-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 132 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 17:44:13] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 17:44:13] [INFO ] Computed 1 invariants in 60 ms
[2024-05-31 17:44:13] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-31 17:44:13] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:44:13] [INFO ] Invariant cache hit.
[2024-05-31 17:44:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:44:17] [INFO ] Implicit Places using invariants and state equation in 3674 ms returned []
Implicit Place search using SMT with State Equation took 4286 ms to find 0 implicit places.
[2024-05-31 17:44:17] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:44:17] [INFO ] Invariant cache hit.
[2024-05-31 17:44:19] [INFO ] Dead Transitions using invariants and state equation in 1927 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6351 ms. Remains : 306/308 places, 8064/8064 transitions.
Support contains 53 out of 306 places after structural reductions.
[2024-05-31 17:44:19] [INFO ] Flatten gal took : 383 ms
[2024-05-31 17:44:20] [INFO ] Flatten gal took : 262 ms
[2024-05-31 17:44:20] [INFO ] Input system was already deterministic with 8064 transitions.
Support contains 51 out of 306 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10006 steps, including 4 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2024-05-31 17:44:21] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:44:21] [INFO ] Invariant cache hit.
[2024-05-31 17:44:21] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:44:27] [INFO ] After 5860ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:19
[2024-05-31 17:44:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:44:28] [INFO ] After 1433ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :1 sat :0 real:20
[2024-05-31 17:44:29] [INFO ] After 7634ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2024-05-31 17:44:29] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:44:36] [INFO ] After 7430ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2024-05-31 17:44:46] [INFO ] After 9648ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :20
[2024-05-31 17:44:54] [INFO ] After 17330ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-31 17:44:54] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 861 ms.
Support contains 37 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 437 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 306/306 places, 8064/8064 transitions.
Incomplete random walk after 10005 steps, including 4 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 20) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-31 17:44:55] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:44:55] [INFO ] Invariant cache hit.
[2024-05-31 17:44:55] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:45:03] [INFO ] After 7949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-31 17:45:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:45:13] [INFO ] After 10074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-31 17:45:13] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:45:28] [INFO ] After 14710ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2024-05-31 17:45:28] [INFO ] After 14711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-31 17:45:28] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 639 ms.
Support contains 35 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 255 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 306/306 places, 8064/8064 transitions.
Incomplete random walk after 10007 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 18) 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 17) 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 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) 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 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) 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 15) 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 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Running SMT prover for 14 properties.
[2024-05-31 17:45:29] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:45:29] [INFO ] Invariant cache hit.
[2024-05-31 17:45:29] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:45:34] [INFO ] After 4164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:13
[2024-05-31 17:45:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:45:34] [INFO ] After 960ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-31 17:45:34] [INFO ] After 5325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-31 17:45:35] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:45:42] [INFO ] After 7381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-31 17:45:59] [INFO ] After 17450ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-31 17:46:00] [INFO ] After 17454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-31 17:46:00] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 454 ms.
Support contains 28 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 192 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 306/306 places, 8064/8064 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=115 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) 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 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) 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 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-31 17:46:01] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:46:01] [INFO ] Invariant cache hit.
[2024-05-31 17:46:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:46:05] [INFO ] After 3929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-31 17:46:05] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:46:11] [INFO ] After 6598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-31 17:46:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:46:15] [INFO ] After 4041ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-31 17:46:21] [INFO ] After 9892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3443 ms.
[2024-05-31 17:46:25] [INFO ] After 20097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 182 ms.
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 306 transition count 8005
Applied a total of 59 rules in 215 ms. Remains 306 /306 variables (removed 0) and now considering 8005/8064 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 306/306 places, 8005/8064 transitions.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA Szymanski-PT-b12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 2432 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' '!(X(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 121 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:46:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 17:46:26] [INFO ] Computed 1 invariants in 39 ms
[2024-05-31 17:46:26] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-31 17:46:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:46:26] [INFO ] Invariant cache hit.
[2024-05-31 17:46:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:46:34] [INFO ] Implicit Places using invariants and state equation in 8294 ms returned []
Implicit Place search using SMT with State Equation took 8834 ms to find 0 implicit places.
[2024-05-31 17:46:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:46:34] [INFO ] Invariant cache hit.
[2024-05-31 17:46:36] [INFO ] Dead Transitions using invariants and state equation in 1930 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10889 ms. Remains : 305/306 places, 7936/8064 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 191 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s97 1) (GEQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Szymanski-PT-b12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-00 finished in 11160 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(p0)||X(X(G(p1)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 67 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:46:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:46:37] [INFO ] Invariant cache hit.
[2024-05-31 17:46:37] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-31 17:46:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:46:37] [INFO ] Invariant cache hit.
[2024-05-31 17:46:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:46:44] [INFO ] Implicit Places using invariants and state equation in 6635 ms returned []
Implicit Place search using SMT with State Equation took 7061 ms to find 0 implicit places.
[2024-05-31 17:46:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:46:44] [INFO ] Invariant cache hit.
[2024-05-31 17:46:46] [INFO ] Dead Transitions using invariants and state equation in 2005 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9134 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s46 1) (GEQ s259 1)), p1:(OR (LT s37 1) (LT s300 1))], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 28292 steps with 95 reset in 319 ms.
FORMULA Szymanski-PT-b12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-01 finished in 9627 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(G((X((G(p1) U G((p2 U p3))))||p0))))'
Support contains 7 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 52 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:46:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:46:46] [INFO ] Invariant cache hit.
[2024-05-31 17:46:47] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-31 17:46:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:46:47] [INFO ] Invariant cache hit.
[2024-05-31 17:46:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:46:53] [INFO ] Implicit Places using invariants and state equation in 6800 ms returned []
Implicit Place search using SMT with State Equation took 7223 ms to find 0 implicit places.
[2024-05-31 17:46:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:46:53] [INFO ] Invariant cache hit.
[2024-05-31 17:46:55] [INFO ] Dead Transitions using invariants and state equation in 1959 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9236 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(OR p3 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s277 1)), p3:(AND (GEQ s11 1) (GEQ s257 1)), p1:(OR (AND (GEQ s33 1) (GEQ s260 1)) (AND (GEQ s11 1) (GEQ s257 1))), p2:(AND (GEQ s96 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 451 ms.
Product exploration explored 100000 steps with 11 reset in 456 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), true, (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 134 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10010 steps, including 5 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) 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 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 17:46:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:46:57] [INFO ] Invariant cache hit.
[2024-05-31 17:46:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:46:59] [INFO ] After 1125ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-31 17:46:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:47:00] [INFO ] After 1665ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-31 17:47:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:47:01] [INFO ] After 1127ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-31 17:47:02] [INFO ] After 1378ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 202 ms.
[2024-05-31 17:47:02] [INFO ] After 3315ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 303 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 225813 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 225813 steps, saw 177463 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 17:47:05] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2024-05-31 17:47:05] [INFO ] Computed 1 invariants in 21 ms
[2024-05-31 17:47:05] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:47:06] [INFO ] After 1022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:47:06] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:47:08] [INFO ] After 1378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:47:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:47:09] [INFO ] After 1076ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:47:09] [INFO ] After 1259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 257 ms.
[2024-05-31 17:47:09] [INFO ] After 2954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2024-05-31 17:47:10] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:47:10] [INFO ] Invariant cache hit.
[2024-05-31 17:47:10] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-31 17:47:10] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:47:10] [INFO ] Invariant cache hit.
[2024-05-31 17:47:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:47:16] [INFO ] Implicit Places using invariants and state equation in 6465 ms returned []
Implicit Place search using SMT with State Equation took 6875 ms to find 0 implicit places.
[2024-05-31 17:47:17] [INFO ] Redundant transitions in 931 ms returned []
[2024-05-31 17:47:17] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:47:17] [INFO ] Invariant cache hit.
[2024-05-31 17:47:19] [INFO ] Dead Transitions using invariants and state equation in 1809 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9820 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 10 ms
Free SCC test removed 22 places
Drop transitions removed 2912 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 5429 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 1 rules applied. Total rules applied 2 place count 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Applied a total of 16 rules in 274 ms. Remains 276 /305 variables (removed 29) and now considering 2373/7810 (removed 5437) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2373 rows 276 cols
[2024-05-31 17:47:20] [INFO ] Computed 1 invariants in 13 ms
[2024-05-31 17:47:20] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:47:20] [INFO ] After 689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:47:20] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:47:21] [INFO ] After 687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:47:21] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 17:47:21] [INFO ] After 215ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:47:21] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-05-31 17:47:21] [INFO ] After 1219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), true, (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (G (NOT (AND p1 (NOT p3) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3) p2)), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (F (AND p1 (NOT p3) (NOT p2))), (F (OR (AND p1 p3) (AND p1 p2))), (F (AND (NOT p3) p2)), (F (NOT (AND (NOT p3) (NOT p2)))), (F (OR p3 p2))]
Knowledge based reduction with 11 factoid took 361 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 27 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 17:47:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 17:47:22] [INFO ] Computed 1 invariants in 22 ms
[2024-05-31 17:47:23] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-31 17:47:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:47:23] [INFO ] Invariant cache hit.
[2024-05-31 17:47:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:47:30] [INFO ] Implicit Places using invariants and state equation in 6861 ms returned []
Implicit Place search using SMT with State Equation took 7431 ms to find 0 implicit places.
[2024-05-31 17:47:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:47:30] [INFO ] Invariant cache hit.
[2024-05-31 17:47:32] [INFO ] Dead Transitions using invariants and state equation in 1856 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9317 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (NOT (AND p2 (NOT p3))))), true, (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND p2 (NOT p3))))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND p2 (NOT p3)) (AND (NOT p1) p3)), (NOT p3), (NOT p3)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-31 17:47:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:47:32] [INFO ] Invariant cache hit.
[2024-05-31 17:47:32] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:47:33] [INFO ] After 1155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:47:33] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:47:35] [INFO ] After 1694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:47:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:47:36] [INFO ] After 1145ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:47:37] [INFO ] After 1395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 208 ms.
[2024-05-31 17:47:37] [INFO ] After 3365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 230 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 226712 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226712 steps, saw 178135 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 17:47:40] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2024-05-31 17:47:40] [INFO ] Computed 1 invariants in 23 ms
[2024-05-31 17:47:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:47:41] [INFO ] After 1029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:47:41] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:47:43] [INFO ] After 1427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:47:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:47:44] [INFO ] After 1118ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:47:44] [INFO ] After 1305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 266 ms.
[2024-05-31 17:47:44] [INFO ] After 3077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2024-05-31 17:47:45] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:47:45] [INFO ] Invariant cache hit.
[2024-05-31 17:47:45] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-31 17:47:45] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:47:45] [INFO ] Invariant cache hit.
[2024-05-31 17:47:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:47:52] [INFO ] Implicit Places using invariants and state equation in 6649 ms returned []
Implicit Place search using SMT with State Equation took 7070 ms to find 0 implicit places.
[2024-05-31 17:47:53] [INFO ] Redundant transitions in 903 ms returned []
[2024-05-31 17:47:53] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:47:53] [INFO ] Invariant cache hit.
[2024-05-31 17:47:54] [INFO ] Dead Transitions using invariants and state equation in 1808 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9985 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions removed 2912 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 5429 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 1 rules applied. Total rules applied 2 place count 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Applied a total of 16 rules in 198 ms. Remains 276 /305 variables (removed 29) and now considering 2373/7810 (removed 5437) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2373 rows 276 cols
[2024-05-31 17:47:55] [INFO ] Computed 1 invariants in 21 ms
[2024-05-31 17:47:55] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:47:55] [INFO ] After 685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:47:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:47:56] [INFO ] After 695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:47:56] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 17:47:56] [INFO ] After 224ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:47:56] [INFO ] After 375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-31 17:47:57] [INFO ] After 1224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (NOT (AND p2 (NOT p3))))), true, (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND p2 (NOT p3))))))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (OR (AND p2 (NOT p3)) (AND p3 (NOT p1)))), (F (AND (NOT p3) p1)), (F (AND p3 p1)), (F (OR p2 p3))]
Knowledge based reduction with 9 factoid took 286 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND p2 (NOT p3)) (AND (NOT p1) p3)), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND p2 (NOT p3)) (AND (NOT p1) p3)), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND p2 (NOT p3)) (AND (NOT p1) p3)), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 28 reset in 412 ms.
Product exploration explored 100000 steps with 56 reset in 457 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND p2 (NOT p3)) (AND (NOT p1) p3)), (NOT p3), (NOT p3)]
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 403 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 17:48:00] [INFO ] Redundant transitions in 691 ms returned []
[2024-05-31 17:48:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 17:48:00] [INFO ] Computed 1 invariants in 22 ms
[2024-05-31 17:48:02] [INFO ] Dead Transitions using invariants and state equation in 1914 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3020 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin10124568818796829961
[2024-05-31 17:48:02] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10124568818796829961
Running compilation step : cd /tmp/ltsmin10124568818796829961;'/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/ltsmin10124568818796829961;'/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/ltsmin10124568818796829961;'/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 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 17:48:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:48:05] [INFO ] Invariant cache hit.
[2024-05-31 17:48:06] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-31 17:48:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:48:06] [INFO ] Invariant cache hit.
[2024-05-31 17:48:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:48:11] [INFO ] Implicit Places using invariants and state equation in 5921 ms returned []
Implicit Place search using SMT with State Equation took 6340 ms to find 0 implicit places.
[2024-05-31 17:48:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:48:11] [INFO ] Invariant cache hit.
[2024-05-31 17:48:13] [INFO ] Dead Transitions using invariants and state equation in 1819 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8192 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin15753619920239149221
[2024-05-31 17:48:13] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15753619920239149221
Running compilation step : cd /tmp/ltsmin15753619920239149221;'/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/ltsmin15753619920239149221;'/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/ltsmin15753619920239149221;'/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-31 17:48:17] [INFO ] Flatten gal took : 209 ms
[2024-05-31 17:48:17] [INFO ] Flatten gal took : 203 ms
[2024-05-31 17:48:17] [INFO ] Time to serialize gal into /tmp/LTL8002216014069276935.gal : 58 ms
[2024-05-31 17:48:17] [INFO ] Time to serialize properties into /tmp/LTL614834774908839979.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/LTL8002216014069276935.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1680000845938630896.hoa' '-atoms' '/tmp/LTL614834774908839979.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...316
Loading property file /tmp/LTL614834774908839979.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1680000845938630896.hoa
Detected timeout of ITS tools.
[2024-05-31 17:48:33] [INFO ] Flatten gal took : 214 ms
[2024-05-31 17:48:33] [INFO ] Flatten gal took : 217 ms
[2024-05-31 17:48:33] [INFO ] Time to serialize gal into /tmp/LTL4064127191364212583.gal : 29 ms
[2024-05-31 17:48:33] [INFO ] Time to serialize properties into /tmp/LTL12611772075450225312.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/LTL4064127191364212583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12611772075450225312.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(G(("((s6<1)||(l21<1))")||(X((G("(((p33>=1)&&(l4>=1))||((p11>=1)&&(l1>=1)))"))U(G(("((p96>=1)&&(l1>=1))")U("((p11>=1)&&(l1>=1))"))...162
Formula 0 simplified : XF(!"((s6<1)||(l21<1))" & X(F!"(((p33>=1)&&(l4>=1))||((p11>=1)&&(l1>=1)))" R F(!"((p96>=1)&&(l1>=1))" R !"((p11>=1)&&(l1>=1))")))
Detected timeout of ITS tools.
[2024-05-31 17:48:48] [INFO ] Flatten gal took : 188 ms
[2024-05-31 17:48:48] [INFO ] Applying decomposition
[2024-05-31 17:48:48] [INFO ] Flatten gal took : 191 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1287971282587912968.txt' '-o' '/tmp/graph1287971282587912968.bin' '-w' '/tmp/graph1287971282587912968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1287971282587912968.bin' '-l' '-1' '-v' '-w' '/tmp/graph1287971282587912968.weights' '-q' '0' '-e' '0.001'
[2024-05-31 17:48:49] [INFO ] Decomposing Gal with order
[2024-05-31 17:48:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 17:48:50] [INFO ] Removed a total of 18365 redundant transitions.
[2024-05-31 17:48:50] [INFO ] Flatten gal took : 804 ms
[2024-05-31 17:48:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1021 labels/synchronizations in 307 ms.
[2024-05-31 17:48:50] [INFO ] Time to serialize gal into /tmp/LTL11668357116348065237.gal : 30 ms
[2024-05-31 17:48:50] [INFO ] Time to serialize properties into /tmp/LTL9893230694427696335.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/LTL11668357116348065237.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9893230694427696335.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i2.i1.u1.s6<1)||(i4.u53.l21<1))")||(X((G("(((i8.u11.p33>=1)&&(i2.i1.u46.l4>=1))||((i5.u3.p11>=1)&&(i2.i0.u44.l1>=1)))"))U(G...247
Formula 0 simplified : XF(!"((i2.i1.u1.s6<1)||(i4.u53.l21<1))" & X(F!"(((i8.u11.p33>=1)&&(i2.i1.u46.l4>=1))||((i5.u3.p11>=1)&&(i2.i0.u44.l1>=1)))" R F(!"((...237
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5976827463242774301
[2024-05-31 17:49:06] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5976827463242774301
Running compilation step : cd /tmp/ltsmin5976827463242774301;'/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/ltsmin5976827463242774301;'/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/ltsmin5976827463242774301;'/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 Szymanski-PT-b12-LTLFireability-02 finished in 142506 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(((p1||X(p2)||(F(p4)&&p3))&&p0)))'
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 53 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:49:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:49:09] [INFO ] Invariant cache hit.
[2024-05-31 17:49:09] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-31 17:49:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:49:09] [INFO ] Invariant cache hit.
[2024-05-31 17:49:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:49:16] [INFO ] Implicit Places using invariants and state equation in 6404 ms returned []
Implicit Place search using SMT with State Equation took 6843 ms to find 0 implicit places.
[2024-05-31 17:49:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:49:16] [INFO ] Invariant cache hit.
[2024-05-31 17:49:17] [INFO ] Dead Transitions using invariants and state equation in 1927 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8827 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4)))]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p3 (NOT p4)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p3 (NOT p4) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p4) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p4) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p4)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p4)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s32 1) (GEQ s296 1)), p1:(AND (GEQ s31 1) (GEQ s269 1)), p3:(AND (GEQ s101 1) (GEQ s282 1)), p4:(OR (LT s32 1) (LT s296 1)), p2:(AND (GEQ s42...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 232 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-b12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-04 finished in 9046 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 U G(!p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 56 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:49:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:49:18] [INFO ] Invariant cache hit.
[2024-05-31 17:49:18] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-31 17:49:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:49:18] [INFO ] Invariant cache hit.
[2024-05-31 17:49:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:49:24] [INFO ] Implicit Places using invariants and state equation in 6336 ms returned []
Implicit Place search using SMT with State Equation took 6764 ms to find 0 implicit places.
[2024-05-31 17:49:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:49:24] [INFO ] Invariant cache hit.
[2024-05-31 17:49:26] [INFO ] Dead Transitions using invariants and state equation in 1904 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8725 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 111 ms :[p0, p0, p0, true]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s83 1) (GEQ s271 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1147 steps with 3 reset in 11 ms.
FORMULA Szymanski-PT-b12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-05 finished in 8875 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)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 177 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 17:49:27] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 17:49:27] [INFO ] Computed 1 invariants in 18 ms
[2024-05-31 17:49:27] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-31 17:49:27] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:49:27] [INFO ] Invariant cache hit.
[2024-05-31 17:49:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:49:32] [INFO ] Implicit Places using invariants and state equation in 4956 ms returned []
Implicit Place search using SMT with State Equation took 5394 ms to find 0 implicit places.
[2024-05-31 17:49:33] [INFO ] Redundant transitions in 726 ms returned []
[2024-05-31 17:49:33] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:49:33] [INFO ] Invariant cache hit.
[2024-05-31 17:49:35] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8190 ms. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s69 1) (LT s305 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 135 reset in 528 ms.
Product exploration explored 100000 steps with 78 reset in 471 ms.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10008 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 221256 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221256 steps, saw 175462 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 17:49:39] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:49:39] [INFO ] Invariant cache hit.
[2024-05-31 17:49:39] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:49:40] [INFO ] After 1348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:49:40] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:49:42] [INFO ] After 1591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:49:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:49:44] [INFO ] After 1804ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:49:45] [INFO ] After 3131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 233 ms.
[2024-05-31 17:49:45] [INFO ] After 5019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 306 transition count 7937
Applied a total of 127 rules in 198 ms. Remains 306 /306 variables (removed 0) and now considering 7937/8064 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 306/306 places, 7937/8064 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 215620 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215620 steps, saw 168154 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 17:49:49] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2024-05-31 17:49:49] [INFO ] Computed 2 invariants in 19 ms
[2024-05-31 17:49:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 17:49:50] [INFO ] After 1209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:49:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 17:49:53] [INFO ] After 2892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:49:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:49:56] [INFO ] After 3324ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:49:56] [INFO ] After 3646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2024-05-31 17:49:57] [INFO ] After 6742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 177 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 306/306 places, 7937/7937 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 174 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
[2024-05-31 17:49:57] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
[2024-05-31 17:49:57] [INFO ] Invariant cache hit.
[2024-05-31 17:49:57] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-31 17:49:57] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
[2024-05-31 17:49:57] [INFO ] Invariant cache hit.
[2024-05-31 17:49:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:50:05] [INFO ] Implicit Places using invariants and state equation in 7969 ms returned []
Implicit Place search using SMT with State Equation took 8425 ms to find 0 implicit places.
[2024-05-31 17:50:06] [INFO ] Redundant transitions in 690 ms returned []
[2024-05-31 17:50:06] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
[2024-05-31 17:50:06] [INFO ] Invariant cache hit.
[2024-05-31 17:50:08] [INFO ] Dead Transitions using invariants and state equation in 1799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11100 ms. Remains : 306/306 places, 7937/7937 transitions.
Graph (trivial) has 5200 edges and 306 vertex of which 28 / 306 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2286 transitions
Reduce isomorphic transitions removed 5366 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 1 rules applied. Total rules applied 2 place count 283 transition count 2570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2570
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 282 transition count 2567
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 279 transition count 2567
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 277 transition count 2565
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 2 with 417 rules applied. Total rules applied 430 place count 277 transition count 2148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 430 place count 277 transition count 2147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 276 transition count 2147
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 276 transition count 2146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 275 transition count 2146
Applied a total of 434 rules in 180 ms. Remains 275 /306 variables (removed 31) and now considering 2146/7937 (removed 5791) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2146 rows 275 cols
[2024-05-31 17:50:08] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 17:50:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 17:50:09] [INFO ] After 740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:50:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 17:50:10] [INFO ] After 764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:50:10] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-31 17:50:10] [INFO ] After 387ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:50:10] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 179 ms.
[2024-05-31 17:50:10] [INFO ] After 1553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 176 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 17:50:11] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 17:50:11] [INFO ] Computed 1 invariants in 23 ms
[2024-05-31 17:50:11] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-31 17:50:11] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:50:11] [INFO ] Invariant cache hit.
[2024-05-31 17:50:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:50:16] [INFO ] Implicit Places using invariants and state equation in 4479 ms returned []
Implicit Place search using SMT with State Equation took 4918 ms to find 0 implicit places.
[2024-05-31 17:50:16] [INFO ] Redundant transitions in 686 ms returned []
[2024-05-31 17:50:16] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:50:16] [INFO ] Invariant cache hit.
[2024-05-31 17:50:18] [INFO ] Dead Transitions using invariants and state equation in 1841 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7631 ms. Remains : 306/306 places, 8064/8064 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10011 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 234865 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234865 steps, saw 186651 distinct states, run finished after 3003 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 17:50:21] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:50:21] [INFO ] Invariant cache hit.
[2024-05-31 17:50:22] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:50:23] [INFO ] After 1278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:50:23] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:50:24] [INFO ] After 1558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:50:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:50:26] [INFO ] After 1761ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:50:27] [INFO ] After 3019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 231 ms.
[2024-05-31 17:50:28] [INFO ] After 4874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 306 transition count 7937
Applied a total of 127 rules in 197 ms. Remains 306 /306 variables (removed 0) and now considering 7937/8064 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 306/306 places, 7937/8064 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 224807 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224807 steps, saw 175432 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 17:50:31] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2024-05-31 17:50:31] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 17:50:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 17:50:32] [INFO ] After 1166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:50:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 17:50:35] [INFO ] After 2875ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:50:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:50:38] [INFO ] After 3289ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:50:39] [INFO ] After 3611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2024-05-31 17:50:39] [INFO ] After 6682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 174 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 306/306 places, 7937/7937 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 182 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
[2024-05-31 17:50:39] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
[2024-05-31 17:50:39] [INFO ] Invariant cache hit.
[2024-05-31 17:50:40] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-31 17:50:40] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
[2024-05-31 17:50:40] [INFO ] Invariant cache hit.
[2024-05-31 17:50:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:50:48] [INFO ] Implicit Places using invariants and state equation in 7956 ms returned []
Implicit Place search using SMT with State Equation took 8387 ms to find 0 implicit places.
[2024-05-31 17:50:48] [INFO ] Redundant transitions in 675 ms returned []
[2024-05-31 17:50:48] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
[2024-05-31 17:50:48] [INFO ] Invariant cache hit.
[2024-05-31 17:50:50] [INFO ] Dead Transitions using invariants and state equation in 1798 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11055 ms. Remains : 306/306 places, 7937/7937 transitions.
Graph (trivial) has 5200 edges and 306 vertex of which 28 / 306 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2286 transitions
Reduce isomorphic transitions removed 5366 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 1 rules applied. Total rules applied 2 place count 283 transition count 2570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2570
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 282 transition count 2567
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 279 transition count 2567
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 277 transition count 2565
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 2 with 417 rules applied. Total rules applied 430 place count 277 transition count 2148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 430 place count 277 transition count 2147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 276 transition count 2147
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 276 transition count 2146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 275 transition count 2146
Applied a total of 434 rules in 176 ms. Remains 275 /306 variables (removed 31) and now considering 2146/7937 (removed 5791) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2146 rows 275 cols
[2024-05-31 17:50:50] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 17:50:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 17:50:51] [INFO ] After 711ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:50:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 17:50:52] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:50:52] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-31 17:50:52] [INFO ] After 385ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:50:52] [INFO ] After 549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 170 ms.
[2024-05-31 17:50:52] [INFO ] After 1546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 64 reset in 411 ms.
Product exploration explored 100000 steps with 99 reset in 473 ms.
Built C files in :
/tmp/ltsmin15030185214757849466
[2024-05-31 17:50:54] [INFO ] Too many transitions (8064) to apply POR reductions. Disabling POR matrices.
[2024-05-31 17:50:54] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15030185214757849466
Running compilation step : cd /tmp/ltsmin15030185214757849466;'/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/ltsmin15030185214757849466;'/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/ltsmin15030185214757849466;'/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 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 172 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 17:50:57] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 17:50:57] [INFO ] Computed 1 invariants in 21 ms
[2024-05-31 17:50:57] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-31 17:50:57] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:50:57] [INFO ] Invariant cache hit.
[2024-05-31 17:50:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:51:02] [INFO ] Implicit Places using invariants and state equation in 4776 ms returned []
Implicit Place search using SMT with State Equation took 5205 ms to find 0 implicit places.
[2024-05-31 17:51:03] [INFO ] Redundant transitions in 686 ms returned []
[2024-05-31 17:51:03] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 17:51:03] [INFO ] Invariant cache hit.
[2024-05-31 17:51:05] [INFO ] Dead Transitions using invariants and state equation in 1827 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7895 ms. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin17588514517158926811
[2024-05-31 17:51:05] [INFO ] Too many transitions (8064) to apply POR reductions. Disabling POR matrices.
[2024-05-31 17:51:05] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17588514517158926811
Running compilation step : cd /tmp/ltsmin17588514517158926811;'/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/ltsmin17588514517158926811;'/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/ltsmin17588514517158926811;'/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-31 17:51:08] [INFO ] Flatten gal took : 190 ms
[2024-05-31 17:51:08] [INFO ] Flatten gal took : 186 ms
[2024-05-31 17:51:08] [INFO ] Time to serialize gal into /tmp/LTL8264160995586522652.gal : 25 ms
[2024-05-31 17:51:08] [INFO ] Time to serialize properties into /tmp/LTL2637142209953938439.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/LTL8264160995586522652.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7544580550895393254.hoa' '-atoms' '/tmp/LTL2637142209953938439.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/LTL2637142209953938439.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7544580550895393254.hoa
Detected timeout of ITS tools.
[2024-05-31 17:51:24] [INFO ] Flatten gal took : 175 ms
[2024-05-31 17:51:24] [INFO ] Flatten gal took : 199 ms
[2024-05-31 17:51:24] [INFO ] Time to serialize gal into /tmp/LTL16422165195613612469.gal : 23 ms
[2024-05-31 17:51:24] [INFO ] Time to serialize properties into /tmp/LTL12722434510025069595.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/LTL16422165195613612469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12722434510025069595.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 : !((G(F("((p69<1)||(l51<1))"))))
Formula 0 simplified : FG!"((p69<1)||(l51<1))"
Detected timeout of ITS tools.
[2024-05-31 17:51:39] [INFO ] Flatten gal took : 173 ms
[2024-05-31 17:51:39] [INFO ] Applying decomposition
[2024-05-31 17:51:39] [INFO ] Flatten gal took : 182 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/graph14689734986188209540.txt' '-o' '/tmp/graph14689734986188209540.bin' '-w' '/tmp/graph14689734986188209540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14689734986188209540.bin' '-l' '-1' '-v' '-w' '/tmp/graph14689734986188209540.weights' '-q' '0' '-e' '0.001'
[2024-05-31 17:51:39] [INFO ] Decomposing Gal with order
[2024-05-31 17:51:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 17:51:40] [INFO ] Removed a total of 18316 redundant transitions.
[2024-05-31 17:51:40] [INFO ] Flatten gal took : 427 ms
[2024-05-31 17:51:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 901 labels/synchronizations in 173 ms.
[2024-05-31 17:51:40] [INFO ] Time to serialize gal into /tmp/LTL16850058910009515228.gal : 25 ms
[2024-05-31 17:51:40] [INFO ] Time to serialize properties into /tmp/LTL15536041235132561036.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/LTL16850058910009515228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15536041235132561036.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i8.u24.p69<1)||(i6.u56.l51<1))"))))
Formula 0 simplified : FG!"((i8.u24.p69<1)||(i6.u56.l51<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12257673599146316296
[2024-05-31 17:51:55] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12257673599146316296
Running compilation step : cd /tmp/ltsmin12257673599146316296;'/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/ltsmin12257673599146316296;'/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/ltsmin12257673599146316296;'/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 Szymanski-PT-b12-LTLFireability-06 finished in 151905 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(G((p0 U X(p1)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 48 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:51:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 17:51:59] [INFO ] Computed 1 invariants in 20 ms
[2024-05-31 17:51:59] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-31 17:51:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:51:59] [INFO ] Invariant cache hit.
[2024-05-31 17:51:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:52:06] [INFO ] Implicit Places using invariants and state equation in 6853 ms returned []
Implicit Place search using SMT with State Equation took 7274 ms to find 0 implicit places.
[2024-05-31 17:52:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:06] [INFO ] Invariant cache hit.
[2024-05-31 17:52:08] [INFO ] Dead Transitions using invariants and state equation in 1877 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9213 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s274 1)), p1:(AND (GEQ s16 1) (GEQ s272 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 428 steps with 0 reset in 5 ms.
FORMULA Szymanski-PT-b12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-08 finished in 9342 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(G(p0)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 207 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:52:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:08] [INFO ] Invariant cache hit.
[2024-05-31 17:52:08] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-31 17:52:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:08] [INFO ] Invariant cache hit.
[2024-05-31 17:52:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:52:15] [INFO ] Implicit Places using invariants and state equation in 6625 ms returned []
Implicit Place search using SMT with State Equation took 7044 ms to find 0 implicit places.
[2024-05-31 17:52:16] [INFO ] Redundant transitions in 679 ms returned []
[2024-05-31 17:52:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:16] [INFO ] Invariant cache hit.
[2024-05-31 17:52:18] [INFO ] Dead Transitions using invariants and state equation in 1870 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9813 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s102 1) (LT s280 1)) (OR (LT s100 1) (LT s268 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13 reset in 366 ms.
Product exploration explored 100000 steps with 67 reset in 490 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249537 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249537 steps, saw 198289 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 17:52:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:22] [INFO ] Invariant cache hit.
[2024-05-31 17:52:22] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:52:23] [INFO ] After 1318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:52:23] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:52:24] [INFO ] After 1155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:52:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:52:30] [INFO ] After 6175ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:52:32] [INFO ] After 7379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 973 ms.
[2024-05-31 17:52:33] [INFO ] After 9567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 305 transition count 7872
Applied a total of 64 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7872/7936 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 305/305 places, 7872/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished Best-First random walk after 654 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=327 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 173 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 17:52:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:33] [INFO ] Invariant cache hit.
[2024-05-31 17:52:34] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-31 17:52:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:34] [INFO ] Invariant cache hit.
[2024-05-31 17:52:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:52:40] [INFO ] Implicit Places using invariants and state equation in 6098 ms returned []
Implicit Place search using SMT with State Equation took 6497 ms to find 0 implicit places.
[2024-05-31 17:52:40] [INFO ] Redundant transitions in 680 ms returned []
[2024-05-31 17:52:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:40] [INFO ] Invariant cache hit.
[2024-05-31 17:52:42] [INFO ] Dead Transitions using invariants and state equation in 1869 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9229 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished Best-First random walk after 2301 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=575 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 29 reset in 406 ms.
Product exploration explored 100000 steps with 124 reset in 494 ms.
Built C files in :
/tmp/ltsmin9527574197321491048
[2024-05-31 17:52:43] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 17:52:43] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9527574197321491048
Running compilation step : cd /tmp/ltsmin9527574197321491048;'/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/ltsmin9527574197321491048;'/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/ltsmin9527574197321491048;'/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 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 17:52:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:47] [INFO ] Invariant cache hit.
[2024-05-31 17:52:47] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-31 17:52:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:47] [INFO ] Invariant cache hit.
[2024-05-31 17:52:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:52:53] [INFO ] Implicit Places using invariants and state equation in 5749 ms returned []
Implicit Place search using SMT with State Equation took 6167 ms to find 0 implicit places.
[2024-05-31 17:52:54] [INFO ] Redundant transitions in 681 ms returned []
[2024-05-31 17:52:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:52:54] [INFO ] Invariant cache hit.
[2024-05-31 17:52:55] [INFO ] Dead Transitions using invariants and state equation in 1901 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8942 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin5648813482142197906
[2024-05-31 17:52:55] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 17:52:56] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5648813482142197906
Running compilation step : cd /tmp/ltsmin5648813482142197906;'/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/ltsmin5648813482142197906;'/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/ltsmin5648813482142197906;'/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-31 17:52:59] [INFO ] Flatten gal took : 172 ms
[2024-05-31 17:52:59] [INFO ] Flatten gal took : 176 ms
[2024-05-31 17:52:59] [INFO ] Time to serialize gal into /tmp/LTL7522745226317316501.gal : 36 ms
[2024-05-31 17:52:59] [INFO ] Time to serialize properties into /tmp/LTL5489695266166704354.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/LTL7522745226317316501.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15321880026576514413.hoa' '-atoms' '/tmp/LTL5489695266166704354.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/LTL5489695266166704354.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15321880026576514413.hoa
Detected timeout of ITS tools.
[2024-05-31 17:53:14] [INFO ] Flatten gal took : 172 ms
[2024-05-31 17:53:15] [INFO ] Flatten gal took : 186 ms
[2024-05-31 17:53:15] [INFO ] Time to serialize gal into /tmp/LTL12002174432943095404.gal : 22 ms
[2024-05-31 17:53:15] [INFO ] Time to serialize properties into /tmp/LTL2383781735982926956.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/LTL12002174432943095404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2383781735982926956.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 : !((F(G("(((p102<1)||(l24<1))&&((p100<1)||(l12<1)))"))))
Formula 0 simplified : GF!"(((p102<1)||(l24<1))&&((p100<1)||(l12<1)))"
Detected timeout of ITS tools.
[2024-05-31 17:53:30] [INFO ] Flatten gal took : 172 ms
[2024-05-31 17:53:30] [INFO ] Applying decomposition
[2024-05-31 17:53:30] [INFO ] Flatten gal took : 173 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/graph10256797355197141609.txt' '-o' '/tmp/graph10256797355197141609.bin' '-w' '/tmp/graph10256797355197141609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10256797355197141609.bin' '-l' '-1' '-v' '-w' '/tmp/graph10256797355197141609.weights' '-q' '0' '-e' '0.001'
[2024-05-31 17:53:30] [INFO ] Decomposing Gal with order
[2024-05-31 17:53:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 17:53:31] [INFO ] Removed a total of 18174 redundant transitions.
[2024-05-31 17:53:31] [INFO ] Flatten gal took : 317 ms
[2024-05-31 17:53:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 1065 labels/synchronizations in 191 ms.
[2024-05-31 17:53:31] [INFO ] Time to serialize gal into /tmp/LTL9714744567617196540.gal : 20 ms
[2024-05-31 17:53:31] [INFO ] Time to serialize properties into /tmp/LTL5068044570506934190.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/LTL9714744567617196540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5068044570506934190.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i2.i2.u34.p102<1)||(i5.u54.l24<1))&&((i2.i2.u34.p100<1)||(i3.u49.l12<1)))"))))
Formula 0 simplified : GF!"(((i2.i2.u34.p102<1)||(i5.u54.l24<1))&&((i2.i2.u34.p100<1)||(i3.u49.l12<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14887410764040875836
[2024-05-31 17:53:46] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14887410764040875836
Running compilation step : cd /tmp/ltsmin14887410764040875836;'/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/ltsmin14887410764040875836;'/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/ltsmin14887410764040875836;'/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 Szymanski-PT-b12-LTLFireability-09 finished in 101278 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((G(p0)||G((F(p1)&&F(p2))))))'
Support contains 5 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 212 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:53:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:53:49] [INFO ] Invariant cache hit.
[2024-05-31 17:53:50] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-31 17:53:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:53:50] [INFO ] Invariant cache hit.
[2024-05-31 17:53:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:53:56] [INFO ] Implicit Places using invariants and state equation in 6154 ms returned []
Implicit Place search using SMT with State Equation took 6585 ms to find 0 implicit places.
[2024-05-31 17:53:57] [INFO ] Redundant transitions in 681 ms returned []
[2024-05-31 17:53:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:53:57] [INFO ] Invariant cache hit.
[2024-05-31 17:53:58] [INFO ] Dead Transitions using invariants and state equation in 1868 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9354 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s110 1) (GEQ s264 1)), p1:(OR (LT s37 1) (LT s266 1)), p2:(OR (LT s45 1) (LT s264 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 45 reset in 408 ms.
Product exploration explored 100000 steps with 112 reset in 479 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 80 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 17:54:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:54:00] [INFO ] Invariant cache hit.
[2024-05-31 17:54:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:54:00] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2024-05-31 17:54:00] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:54:03] [INFO ] After 3019ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-31 17:54:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:54:09] [INFO ] After 5371ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-31 17:54:18] [INFO ] After 14393ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2024-05-31 17:54:18] [INFO ] After 17493ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 233650 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233650 steps, saw 183581 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 17:54:21] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 17:54:21] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 17:54:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 17:54:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:54:23] [INFO ] After 1482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:54:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 17:54:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:54:24] [INFO ] After 1522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:54:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:54:29] [INFO ] After 4754ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:54:34] [INFO ] After 9605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9043 ms.
[2024-05-31 17:54:43] [INFO ] After 20245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 170 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 169 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 17:54:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 17:54:43] [INFO ] Invariant cache hit.
[2024-05-31 17:54:44] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-31 17:54:44] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 17:54:44] [INFO ] Invariant cache hit.
[2024-05-31 17:54:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:54:51] [INFO ] Implicit Places using invariants and state equation in 7550 ms returned []
Implicit Place search using SMT with State Equation took 8003 ms to find 0 implicit places.
[2024-05-31 17:54:52] [INFO ] Redundant transitions in 655 ms returned []
[2024-05-31 17:54:52] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 17:54:52] [INFO ] Invariant cache hit.
[2024-05-31 17:54:54] [INFO ] Dead Transitions using invariants and state equation in 1891 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10738 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5160 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 113 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1947 rows 269 cols
[2024-05-31 17:54:54] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 17:54:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 17:54:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:54:55] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:54:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 17:54:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:54:55] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:54:55] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 17:54:56] [INFO ] After 666ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:54:57] [INFO ] After 1463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 622 ms.
[2024-05-31 17:54:57] [INFO ] After 2827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 162 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 172 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 17:54:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 17:54:58] [INFO ] Computed 1 invariants in 19 ms
[2024-05-31 17:54:58] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-31 17:54:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:54:58] [INFO ] Invariant cache hit.
[2024-05-31 17:54:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:55:07] [INFO ] Implicit Places using invariants and state equation in 8277 ms returned []
Implicit Place search using SMT with State Equation took 8698 ms to find 0 implicit places.
[2024-05-31 17:55:07] [INFO ] Redundant transitions in 659 ms returned []
[2024-05-31 17:55:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:55:07] [INFO ] Invariant cache hit.
[2024-05-31 17:55:09] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11460 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-31 17:55:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:55:10] [INFO ] Invariant cache hit.
[2024-05-31 17:55:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:55:11] [INFO ] After 1042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:55:11] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:55:12] [INFO ] After 1038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:55:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:55:15] [INFO ] After 2954ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:55:15] [INFO ] After 3414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1714 ms.
[2024-05-31 17:55:17] [INFO ] After 6239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 1) seen :0
Finished Best-First random walk after 876 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=438 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 44 reset in 402 ms.
Product exploration explored 100000 steps with 99 reset in 494 ms.
Built C files in :
/tmp/ltsmin12826806796144216049
[2024-05-31 17:55:18] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 17:55:19] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12826806796144216049
Running compilation step : cd /tmp/ltsmin12826806796144216049;'/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/ltsmin12826806796144216049;'/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/ltsmin12826806796144216049;'/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 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 17:55:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:55:22] [INFO ] Invariant cache hit.
[2024-05-31 17:55:22] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-31 17:55:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:55:22] [INFO ] Invariant cache hit.
[2024-05-31 17:55:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:55:28] [INFO ] Implicit Places using invariants and state equation in 5651 ms returned []
Implicit Place search using SMT with State Equation took 6067 ms to find 0 implicit places.
[2024-05-31 17:55:28] [INFO ] Redundant transitions in 670 ms returned []
[2024-05-31 17:55:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:55:28] [INFO ] Invariant cache hit.
[2024-05-31 17:55:30] [INFO ] Dead Transitions using invariants and state equation in 1879 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8810 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin5308437379378948318
[2024-05-31 17:55:30] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 17:55:30] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5308437379378948318
Running compilation step : cd /tmp/ltsmin5308437379378948318;'/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/ltsmin5308437379378948318;'/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/ltsmin5308437379378948318;'/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-31 17:55:34] [INFO ] Flatten gal took : 169 ms
[2024-05-31 17:55:34] [INFO ] Flatten gal took : 174 ms
[2024-05-31 17:55:34] [INFO ] Time to serialize gal into /tmp/LTL17511025560602456188.gal : 23 ms
[2024-05-31 17:55:34] [INFO ] Time to serialize properties into /tmp/LTL18247270771020033518.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/LTL17511025560602456188.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5894397326096801300.hoa' '-atoms' '/tmp/LTL18247270771020033518.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/LTL18247270771020033518.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5894397326096801300.hoa
Detected timeout of ITS tools.
[2024-05-31 17:55:49] [INFO ] Flatten gal took : 184 ms
[2024-05-31 17:55:49] [INFO ] Flatten gal took : 168 ms
[2024-05-31 17:55:49] [INFO ] Time to serialize gal into /tmp/LTL12408308873774775035.gal : 23 ms
[2024-05-31 17:55:49] [INFO ] Time to serialize properties into /tmp/LTL10262066728878527856.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/LTL12408308873774775035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10262066728878527856.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 : !((F((G("((p110>=1)&&(l8>=1))"))||(G((F("((p37<1)||(l10<1))"))&&(F("((p45<1)||(l8<1))")))))))
Formula 0 simplified : G(F!"((p110>=1)&&(l8>=1))" & F(G!"((p37<1)||(l10<1))" | G!"((p45<1)||(l8<1))"))
Detected timeout of ITS tools.
[2024-05-31 17:56:05] [INFO ] Flatten gal took : 175 ms
[2024-05-31 17:56:05] [INFO ] Applying decomposition
[2024-05-31 17:56:05] [INFO ] Flatten gal took : 178 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/graph15581361083068935331.txt' '-o' '/tmp/graph15581361083068935331.bin' '-w' '/tmp/graph15581361083068935331.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15581361083068935331.bin' '-l' '-1' '-v' '-w' '/tmp/graph15581361083068935331.weights' '-q' '0' '-e' '0.001'
[2024-05-31 17:56:05] [INFO ] Decomposing Gal with order
[2024-05-31 17:56:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 17:56:06] [INFO ] Removed a total of 18365 redundant transitions.
[2024-05-31 17:56:06] [INFO ] Flatten gal took : 343 ms
[2024-05-31 17:56:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1019 labels/synchronizations in 192 ms.
[2024-05-31 17:56:06] [INFO ] Time to serialize gal into /tmp/LTL2365587513071312827.gal : 28 ms
[2024-05-31 17:56:06] [INFO ] Time to serialize properties into /tmp/LTL3396996766296998377.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/LTL2365587513071312827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3396996766296998377.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((F((G("((i2.u37.p110>=1)&&(i2.u48.l8>=1))"))||(G((F("((i9.u12.p37<1)||(i2.u48.l10<1))"))&&(F("((i7.u16.p45<1)||(i2.u48.l8<1))"))))))...156
Formula 0 simplified : G(F!"((i2.u37.p110>=1)&&(i2.u48.l8>=1))" & F(G!"((i9.u12.p37<1)||(i2.u48.l10<1))" | G!"((i7.u16.p45<1)||(i2.u48.l8<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5348984651812576806
[2024-05-31 17:56:21] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5348984651812576806
Running compilation step : cd /tmp/ltsmin5348984651812576806;'/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/ltsmin5348984651812576806;'/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/ltsmin5348984651812576806;'/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 Szymanski-PT-b12-LTLFireability-10 finished in 154959 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(G((p0||X(X(p1))))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 48 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:56:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:24] [INFO ] Invariant cache hit.
[2024-05-31 17:56:24] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-31 17:56:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:24] [INFO ] Invariant cache hit.
[2024-05-31 17:56:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:56:30] [INFO ] Implicit Places using invariants and state equation in 5867 ms returned []
Implicit Place search using SMT with State Equation took 6270 ms to find 0 implicit places.
[2024-05-31 17:56:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:30] [INFO ] Invariant cache hit.
[2024-05-31 17:56:32] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8224 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s40 1) (GEQ s290 1)), p1:(AND (GEQ s103 1) (GEQ s278 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 312 steps with 0 reset in 7 ms.
FORMULA Szymanski-PT-b12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-11 finished in 8355 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(G(p0))&&F(p1)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 53 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:56:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:32] [INFO ] Invariant cache hit.
[2024-05-31 17:56:33] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-31 17:56:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:33] [INFO ] Invariant cache hit.
[2024-05-31 17:56:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:56:39] [INFO ] Implicit Places using invariants and state equation in 6526 ms returned []
Implicit Place search using SMT with State Equation took 6928 ms to find 0 implicit places.
[2024-05-31 17:56:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:39] [INFO ] Invariant cache hit.
[2024-05-31 17:56:41] [INFO ] Dead Transitions using invariants and state equation in 1891 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8880 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s15 1) (GEQ s258 1)), p1:(AND (GEQ s98 1) (GEQ s278 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-12 finished in 9021 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 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 51 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:56:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:41] [INFO ] Invariant cache hit.
[2024-05-31 17:56:42] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-31 17:56:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:42] [INFO ] Invariant cache hit.
[2024-05-31 17:56:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:56:48] [INFO ] Implicit Places using invariants and state equation in 6464 ms returned []
Implicit Place search using SMT with State Equation took 6888 ms to find 0 implicit places.
[2024-05-31 17:56:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:48] [INFO ] Invariant cache hit.
[2024-05-31 17:56:50] [INFO ] Dead Transitions using invariants and state equation in 1836 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8782 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-13 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:(AND (GEQ s56 1) (GEQ s267 1))], 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 Szymanski-PT-b12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-13 finished in 8929 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(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 54 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:56:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:50] [INFO ] Invariant cache hit.
[2024-05-31 17:56:51] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-31 17:56:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:51] [INFO ] Invariant cache hit.
[2024-05-31 17:56:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:56:57] [INFO ] Implicit Places using invariants and state equation in 5891 ms returned []
Implicit Place search using SMT with State Equation took 6299 ms to find 0 implicit places.
[2024-05-31 17:56:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:56:57] [INFO ] Invariant cache hit.
[2024-05-31 17:56:59] [INFO ] Dead Transitions using invariants and state equation in 1893 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8247 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s75 1) (LT s281 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 674 ms.
Product exploration explored 100000 steps with 50000 reset in 737 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b12-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b12-LTLFireability-14 finished in 9778 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(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 52 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:57:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:57:00] [INFO ] Invariant cache hit.
[2024-05-31 17:57:01] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-31 17:57:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:57:01] [INFO ] Invariant cache hit.
[2024-05-31 17:57:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:57:07] [INFO ] Implicit Places using invariants and state equation in 6088 ms returned []
Implicit Place search using SMT with State Equation took 6511 ms to find 0 implicit places.
[2024-05-31 17:57:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:57:07] [INFO ] Invariant cache hit.
[2024-05-31 17:57:09] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8442 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s90 1) (LT s283 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 664 ms.
Product exploration explored 100000 steps with 50000 reset in 671 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b12-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b12-LTLFireability-15 finished in 9885 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(G((X((G(p1) U G((p2 U p3))))||p0))))'
Found a Lengthening insensitive property : Szymanski-PT-b12-LTLFireability-02
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (NOT p3), (NOT p3), (NOT p3)]
Support contains 7 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 74 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 17:57:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:57:10] [INFO ] Invariant cache hit.
[2024-05-31 17:57:11] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-31 17:57:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:57:11] [INFO ] Invariant cache hit.
[2024-05-31 17:57:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:57:18] [INFO ] Implicit Places using invariants and state equation in 6730 ms returned []
Implicit Place search using SMT with State Equation took 7128 ms to find 0 implicit places.
[2024-05-31 17:57:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:57:18] [INFO ] Invariant cache hit.
[2024-05-31 17:57:20] [INFO ] Dead Transitions using invariants and state equation in 1939 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9147 ms. Remains : 305/306 places, 7936/8064 transitions.
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(OR p3 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s277 1)), p3:(AND (GEQ s11 1) (GEQ s257 1)), p1:(OR (AND (GEQ s33 1) (GEQ s260 1)) (AND (GEQ s11 1) (GEQ s257 1))), p2:(AND (GEQ s96 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 90 reset in 454 ms.
Product exploration explored 100000 steps with 172 reset in 520 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), true, (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 125 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 17:57:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:57:21] [INFO ] Invariant cache hit.
[2024-05-31 17:57:21] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:57:22] [INFO ] After 1087ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-31 17:57:22] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:57:24] [INFO ] After 1658ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-31 17:57:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:57:25] [INFO ] After 1115ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-31 17:57:25] [INFO ] After 1360ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 212 ms.
[2024-05-31 17:57:25] [INFO ] After 3292ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 236300 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236300 steps, saw 185690 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 17:57:29] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2024-05-31 17:57:29] [INFO ] Computed 1 invariants in 23 ms
[2024-05-31 17:57:29] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:57:30] [INFO ] After 1020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:57:30] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:57:31] [INFO ] After 1361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:57:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:57:32] [INFO ] After 1066ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:57:32] [INFO ] After 1244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 254 ms.
[2024-05-31 17:57:33] [INFO ] After 2918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 174 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 170 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2024-05-31 17:57:33] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:57:33] [INFO ] Invariant cache hit.
[2024-05-31 17:57:33] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-31 17:57:33] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:57:33] [INFO ] Invariant cache hit.
[2024-05-31 17:57:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:57:40] [INFO ] Implicit Places using invariants and state equation in 6355 ms returned []
Implicit Place search using SMT with State Equation took 6761 ms to find 0 implicit places.
[2024-05-31 17:57:40] [INFO ] Redundant transitions in 657 ms returned []
[2024-05-31 17:57:40] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:57:40] [INFO ] Invariant cache hit.
[2024-05-31 17:57:42] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9432 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 2912 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 5429 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 1 rules applied. Total rules applied 2 place count 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Applied a total of 16 rules in 171 ms. Remains 276 /305 variables (removed 29) and now considering 2373/7810 (removed 5437) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2373 rows 276 cols
[2024-05-31 17:57:42] [INFO ] Computed 1 invariants in 16 ms
[2024-05-31 17:57:43] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:57:43] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:57:43] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:57:44] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:57:44] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 17:57:44] [INFO ] After 215ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:57:44] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-31 17:57:44] [INFO ] After 1186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), true, (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (G (NOT (AND p1 (NOT p3) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3) p2)), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (F (AND p1 (NOT p3) (NOT p2))), (F (OR (AND p1 p3) (AND p1 p2))), (F (AND (NOT p3) p2)), (F (NOT (AND (NOT p3) (NOT p2)))), (F (OR p3 p2))]
Knowledge based reduction with 11 factoid took 364 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 17:57:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 17:57:45] [INFO ] Computed 1 invariants in 25 ms
[2024-05-31 17:57:46] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-31 17:57:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:57:46] [INFO ] Invariant cache hit.
[2024-05-31 17:57:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:57:51] [INFO ] Implicit Places using invariants and state equation in 5772 ms returned []
Implicit Place search using SMT with State Equation took 6200 ms to find 0 implicit places.
[2024-05-31 17:57:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:57:51] [INFO ] Invariant cache hit.
[2024-05-31 17:57:53] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8127 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (NOT (AND p2 (NOT p3))))), true, (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND p2 (NOT p3))))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND p2 (NOT p3)) (AND (NOT p1) p3)), (NOT p3), (NOT p3)]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) 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 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 17:57:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:57:54] [INFO ] Invariant cache hit.
[2024-05-31 17:57:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:57:56] [INFO ] After 2148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 17:57:56] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:58:02] [INFO ] After 6043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 17:58:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:58:13] [INFO ] After 11157ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:58:15] [INFO ] After 12624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-31 17:58:15] [INFO ] After 18818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 305 transition count 7813
Applied a total of 123 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7936 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 305/305 places, 7813/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) 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 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 :1
Running SMT prover for 1 properties.
[2024-05-31 17:58:15] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
// Phase 1: matrix 2609 rows 305 cols
[2024-05-31 17:58:15] [INFO ] Computed 1 invariants in 22 ms
[2024-05-31 17:58:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:58:16] [INFO ] After 898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:58:16] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:58:17] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:58:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:58:19] [INFO ] After 1775ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:58:19] [INFO ] After 2059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-31 17:58:19] [INFO ] After 2991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 305 transition count 7810
Applied a total of 3 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7813 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 305/305 places, 7810/7813 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222571 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222571 steps, saw 174948 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 17:58:22] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2024-05-31 17:58:22] [INFO ] Computed 1 invariants in 22 ms
[2024-05-31 17:58:22] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:58:23] [INFO ] After 1046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:58:23] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 17:58:25] [INFO ] After 1386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:58:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:58:26] [INFO ] After 1109ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:58:26] [INFO ] After 1297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 268 ms.
[2024-05-31 17:58:26] [INFO ] After 3015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2024-05-31 17:58:27] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:58:27] [INFO ] Invariant cache hit.
[2024-05-31 17:58:27] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-31 17:58:27] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:58:27] [INFO ] Invariant cache hit.
[2024-05-31 17:58:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:58:34] [INFO ] Implicit Places using invariants and state equation in 6953 ms returned []
Implicit Place search using SMT with State Equation took 7377 ms to find 0 implicit places.
[2024-05-31 17:58:35] [INFO ] Redundant transitions in 680 ms returned []
[2024-05-31 17:58:35] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 17:58:35] [INFO ] Invariant cache hit.
[2024-05-31 17:58:37] [INFO ] Dead Transitions using invariants and state equation in 1853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10094 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 2912 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 5429 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 1 rules applied. Total rules applied 2 place count 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Applied a total of 16 rules in 178 ms. Remains 276 /305 variables (removed 29) and now considering 2373/7810 (removed 5437) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2373 rows 276 cols
[2024-05-31 17:58:37] [INFO ] Computed 1 invariants in 16 ms
[2024-05-31 17:58:37] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:58:38] [INFO ] After 688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 17:58:38] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 17:58:38] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 17:58:38] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 17:58:39] [INFO ] After 218ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 17:58:39] [INFO ] After 370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-31 17:58:39] [INFO ] After 1226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (NOT (AND p2 (NOT p3))))), true, (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND p2 (NOT p3))))))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (OR (AND p2 (NOT p3)) (AND p3 (NOT p1)))), (F (AND (NOT p3) p1)), (F (AND p3 p1)), (F (OR p2 p3))]
Knowledge based reduction with 9 factoid took 265 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND p2 (NOT p3)) (AND (NOT p1) p3)), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND p2 (NOT p3)) (AND (NOT p1) p3)), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND p2 (NOT p3)) (AND (NOT p1) p3)), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 45 reset in 421 ms.
Product exploration explored 100000 steps with 8 reset in 387 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND p2 (NOT p3)) (AND (NOT p1) p3)), (NOT p3), (NOT p3)]
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 17:58:42] [INFO ] Redundant transitions in 675 ms returned []
[2024-05-31 17:58:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 17:58:42] [INFO ] Computed 1 invariants in 18 ms
[2024-05-31 17:58:44] [INFO ] Dead Transitions using invariants and state equation in 1923 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2780 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin15467014715358831179
[2024-05-31 17:58:44] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15467014715358831179
Running compilation step : cd /tmp/ltsmin15467014715358831179;'/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/ltsmin15467014715358831179;'/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/ltsmin15467014715358831179;'/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 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 17:58:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:58:47] [INFO ] Invariant cache hit.
[2024-05-31 17:58:47] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-31 17:58:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:58:47] [INFO ] Invariant cache hit.
[2024-05-31 17:58:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 17:58:53] [INFO ] Implicit Places using invariants and state equation in 5970 ms returned []
Implicit Place search using SMT with State Equation took 6376 ms to find 0 implicit places.
[2024-05-31 17:58:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 17:58:53] [INFO ] Invariant cache hit.
[2024-05-31 17:58:55] [INFO ] Dead Transitions using invariants and state equation in 2049 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8457 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin7410915622823654096
[2024-05-31 17:58:55] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7410915622823654096
Running compilation step : cd /tmp/ltsmin7410915622823654096;'/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/ltsmin7410915622823654096;'/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/ltsmin7410915622823654096;'/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-31 17:58:59] [INFO ] Flatten gal took : 174 ms
[2024-05-31 17:58:59] [INFO ] Flatten gal took : 183 ms
[2024-05-31 17:58:59] [INFO ] Time to serialize gal into /tmp/LTL1160729133016385132.gal : 24 ms
[2024-05-31 17:58:59] [INFO ] Time to serialize properties into /tmp/LTL14233098076494639983.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/LTL1160729133016385132.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5524400912657929915.hoa' '-atoms' '/tmp/LTL14233098076494639983.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/LTL14233098076494639983.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5524400912657929915.hoa
Detected timeout of ITS tools.
[2024-05-31 17:59:14] [INFO ] Flatten gal took : 174 ms
[2024-05-31 17:59:14] [INFO ] Flatten gal took : 181 ms
[2024-05-31 17:59:14] [INFO ] Time to serialize gal into /tmp/LTL2276789199094758072.gal : 24 ms
[2024-05-31 17:59:14] [INFO ] Time to serialize properties into /tmp/LTL12031123856706765294.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/LTL2276789199094758072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12031123856706765294.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(G(("((s6<1)||(l21<1))")||(X((G("(((p33>=1)&&(l4>=1))||((p11>=1)&&(l1>=1)))"))U(G(("((p96>=1)&&(l1>=1))")U("((p11>=1)&&(l1>=1))"))...162
Formula 0 simplified : XF(!"((s6<1)||(l21<1))" & X(F!"(((p33>=1)&&(l4>=1))||((p11>=1)&&(l1>=1)))" R F(!"((p96>=1)&&(l1>=1))" R !"((p11>=1)&&(l1>=1))")))
Detected timeout of ITS tools.
[2024-05-31 17:59:30] [INFO ] Flatten gal took : 181 ms
[2024-05-31 17:59:30] [INFO ] Applying decomposition
[2024-05-31 17:59:30] [INFO ] Flatten gal took : 184 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/graph4924447445438268064.txt' '-o' '/tmp/graph4924447445438268064.bin' '-w' '/tmp/graph4924447445438268064.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4924447445438268064.bin' '-l' '-1' '-v' '-w' '/tmp/graph4924447445438268064.weights' '-q' '0' '-e' '0.001'
[2024-05-31 17:59:30] [INFO ] Decomposing Gal with order
[2024-05-31 17:59:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 17:59:30] [INFO ] Removed a total of 18174 redundant transitions.
[2024-05-31 17:59:30] [INFO ] Flatten gal took : 312 ms
[2024-05-31 17:59:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 1025 labels/synchronizations in 185 ms.
[2024-05-31 17:59:31] [INFO ] Time to serialize gal into /tmp/LTL11644749495501919399.gal : 19 ms
[2024-05-31 17:59:31] [INFO ] Time to serialize properties into /tmp/LTL15904370868523247636.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/LTL11644749495501919399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15904370868523247636.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i3.i0.u1.s6<1)||(i2.u53.l21<1))")||(X((G("(((i3.i1.u11.p33>=1)&&(i3.i2.u46.l4>=1))||((i4.u3.p11>=1)&&(i3.i1.u44.l1>=1)))"))...250
Formula 0 simplified : XF(!"((i3.i0.u1.s6<1)||(i2.u53.l21<1))" & X(F!"(((i3.i1.u11.p33>=1)&&(i3.i2.u46.l4>=1))||((i4.u3.p11>=1)&&(i3.i1.u44.l1>=1)))" R F(!...240
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7857821280487360578
[2024-05-31 17:59:46] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7857821280487360578
Running compilation step : cd /tmp/ltsmin7857821280487360578;'/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/ltsmin7857821280487360578;'/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/ltsmin7857821280487360578;'/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 Szymanski-PT-b12-LTLFireability-02 finished in 158872 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)))'
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(G(p0)))'
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((G(p0)||G((F(p1)&&F(p2))))))'
[2024-05-31 17:59:49] [INFO ] Flatten gal took : 190 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13491232033842961525
[2024-05-31 17:59:49] [INFO ] Too many transitions (8064) to apply POR reductions. Disabling POR matrices.
[2024-05-31 17:59:49] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13491232033842961525
Running compilation step : cd /tmp/ltsmin13491232033842961525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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-31 17:59:49] [INFO ] Applying decomposition
[2024-05-31 17:59:50] [INFO ] Flatten gal took : 191 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18014060389882551738.txt' '-o' '/tmp/graph18014060389882551738.bin' '-w' '/tmp/graph18014060389882551738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18014060389882551738.bin' '-l' '-1' '-v' '-w' '/tmp/graph18014060389882551738.weights' '-q' '0' '-e' '0.001'
[2024-05-31 17:59:50] [INFO ] Decomposing Gal with order
[2024-05-31 17:59:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 17:59:50] [INFO ] Removed a total of 18652 redundant transitions.
[2024-05-31 17:59:50] [INFO ] Flatten gal took : 316 ms
[2024-05-31 17:59:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1053 labels/synchronizations in 186 ms.
[2024-05-31 17:59:51] [INFO ] Time to serialize gal into /tmp/LTLFireability1596074254001739477.gal : 20 ms
[2024-05-31 17:59:51] [INFO ] Time to serialize properties into /tmp/LTLFireability7358107207919098875.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/LTLFireability1596074254001739477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7358107207919098875.ltl' '-c' '-stutter-deadlock'

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 4 LTL properties
Checking formula 0 : !((X(G(("((i0.i1.u1.s6<1)||(i3.u54.l21<1))")||(X((G("(((i0.i1.u11.p33>=1)&&(i0.i1.u46.l4>=1))||((i1.u3.p11>=1)&&(i0.i0.u44.l1>=1)))"))...250
Formula 0 simplified : XF(!"((i0.i1.u1.s6<1)||(i3.u54.l21<1))" & X(F!"(((i0.i1.u11.p33>=1)&&(i0.i1.u46.l4>=1))||((i1.u3.p11>=1)&&(i0.i0.u44.l1>=1)))" R F(!...240
Compilation finished in 32046 ms.
Running link step : cd /tmp/ltsmin13491232033842961525;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin13491232033842961525;'/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(([]((LTLAPp1==true)) U [](((LTLAPp2==true) U (LTLAPp3==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13491232033842961525;'/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(([]((LTLAPp1==true)) U [](((LTLAPp2==true) U (LTLAPp3==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13491232033842961525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-31 18:25:04] [INFO ] Flatten gal took : 444 ms
[2024-05-31 18:25:04] [INFO ] Time to serialize gal into /tmp/LTLFireability4636770142187068979.gal : 79 ms
[2024-05-31 18:25:04] [INFO ] Time to serialize properties into /tmp/LTLFireability17713497325647894427.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/LTLFireability4636770142187068979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17713497325647894427.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...298
Read 4 LTL properties
Checking formula 0 : !((X(G(("((s6<1)||(l21<1))")||(X((G("(((p33>=1)&&(l4>=1))||((p11>=1)&&(l1>=1)))"))U(G(("((p96>=1)&&(l1>=1))")U("((p11>=1)&&(l1>=1))"))...162
Formula 0 simplified : XF(!"((s6<1)||(l21<1))" & X(F!"(((p33>=1)&&(l4>=1))||((p11>=1)&&(l1>=1)))" R F(!"((p96>=1)&&(l1>=1))" R !"((p11>=1)&&(l1>=1))")))
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13491232033842961525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13491232033842961525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3624936 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16034908 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-b12"
export BK_EXAMINATION="LTLFireability"
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 Szymanski-PT-b12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556700563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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