Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r623-tall-171774435600133.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 BlocksWorld-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r623-tall-171774435600133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 292K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 356K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 31K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 230K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 933K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 599K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.1M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:26 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 BlocksWorld-PT-07-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717780478694

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=BlocksWorld-PT-07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-07 17:14:40] [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-06-07 17:14:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 17:14:40] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-06-07 17:14:40] [INFO ] Transformed 1559 places.
[2024-06-07 17:14:40] [INFO ] Transformed 2965 transitions.
[2024-06-07 17:14:40] [INFO ] Found NUPN structural information;
[2024-06-07 17:14:40] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37]
[2024-06-07 17:14:40] [INFO ] Parsed PT model containing 1559 places and 2965 transitions and 14810 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BlocksWorld-PT-07-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-07-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1524 out of 1559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 2965/2965 transitions.
Applied a total of 0 rules in 32 ms. Remains 1559 /1559 variables (removed 0) and now considering 2965/2965 (removed 0) transitions.
// Phase 1: matrix 2965 rows 1559 cols
[2024-06-07 17:14:41] [INFO ] Computed 77 invariants in 62 ms
[2024-06-07 17:14:41] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-06-07 17:14:41] [INFO ] Invariant cache hit.
[2024-06-07 17:14:42] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-07 17:14:43] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 2767 ms to find 0 implicit places.
[2024-06-07 17:14:43] [INFO ] Invariant cache hit.
[2024-06-07 17:14:45] [INFO ] Dead Transitions using invariants and state equation in 1446 ms found 76 transitions.
Found 76 dead transitions using SMT.
Drop transitions removed 76 transitions
Dead transitions reduction (with SMT) removed 76 transitions
Starting structural reductions in LTL mode, iteration 1 : 1559/1559 places, 2889/2965 transitions.
Deduced a syphon composed of 38 places in 3 ms
Applied a total of 0 rules in 17 ms. Remains 1559 /1559 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4277 ms. Remains : 1559/1559 places, 2889/2965 transitions.
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Support contains 1486 out of 1521 places after structural reductions.
[2024-06-07 17:14:46] [INFO ] Flatten gal took : 336 ms
[2024-06-07 17:14:46] [INFO ] Flatten gal took : 210 ms
[2024-06-07 17:14:47] [INFO ] Input system was already deterministic with 2889 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 931 ms. (steps per millisecond=10 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1416 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2889 rows 1521 cols
[2024-06-07 17:14:49] [INFO ] Computed 77 invariants in 39 ms
[2024-06-07 17:14:53] [INFO ] [Real]Absence check using 77 positive place invariants in 33 ms returned sat
[2024-06-07 17:14:54] [INFO ] After 1720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-07 17:14:54] [INFO ] [Nat]Absence check using 77 positive place invariants in 41 ms returned sat
[2024-06-07 17:14:56] [INFO ] After 1219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 17:14:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:14:56] [INFO ] After 305ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-07 17:14:57] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 4 ms to minimize.
[2024-06-07 17:14:57] [INFO ] Deduced a trap composed of 231 places in 248 ms of which 1 ms to minimize.
[2024-06-07 17:14:57] [INFO ] Deduced a trap composed of 279 places in 265 ms of which 1 ms to minimize.
[2024-06-07 17:14:58] [INFO ] Deduced a trap composed of 336 places in 375 ms of which 2 ms to minimize.
[2024-06-07 17:14:59] [INFO ] Deduced a trap composed of 396 places in 569 ms of which 1 ms to minimize.
[2024-06-07 17:14:59] [INFO ] Deduced a trap composed of 396 places in 795 ms of which 7 ms to minimize.
[2024-06-07 17:15:00] [INFO ] Deduced a trap composed of 391 places in 795 ms of which 2 ms to minimize.
[2024-06-07 17:15:01] [INFO ] Deduced a trap composed of 364 places in 897 ms of which 2 ms to minimize.
[2024-06-07 17:15:02] [INFO ] Deduced a trap composed of 351 places in 835 ms of which 1 ms to minimize.
[2024-06-07 17:15:03] [INFO ] Deduced a trap composed of 336 places in 947 ms of which 2 ms to minimize.
[2024-06-07 17:15:04] [INFO ] Deduced a trap composed of 319 places in 889 ms of which 1 ms to minimize.
[2024-06-07 17:15:05] [INFO ] Deduced a trap composed of 300 places in 960 ms of which 2 ms to minimize.
[2024-06-07 17:15:07] [INFO ] Deduced a trap composed of 279 places in 974 ms of which 1 ms to minimize.
[2024-06-07 17:15:08] [INFO ] Deduced a trap composed of 231 places in 1063 ms of which 2 ms to minimize.
[2024-06-07 17:15:09] [INFO ] Deduced a trap composed of 204 places in 1086 ms of which 2 ms to minimize.
[2024-06-07 17:15:10] [INFO ] Deduced a trap composed of 175 places in 1059 ms of which 3 ms to minimize.
[2024-06-07 17:15:11] [INFO ] Deduced a trap composed of 144 places in 1122 ms of which 1 ms to minimize.
[2024-06-07 17:15:13] [INFO ] Deduced a trap composed of 111 places in 1086 ms of which 4 ms to minimize.
[2024-06-07 17:15:14] [INFO ] Deduced a trap composed of 76 places in 1086 ms of which 2 ms to minimize.
[2024-06-07 17:15:15] [INFO ] Deduced a trap composed of 111 places in 1073 ms of which 2 ms to minimize.
[2024-06-07 17:15:16] [INFO ] Deduced a trap composed of 76 places in 1160 ms of which 1 ms to minimize.
[2024-06-07 17:15:17] [INFO ] Deduced a trap composed of 76 places in 1090 ms of which 1 ms to minimize.
[2024-06-07 17:15:19] [INFO ] Deduced a trap composed of 76 places in 1030 ms of which 2 ms to minimize.
[2024-06-07 17:15:20] [INFO ] Deduced a trap composed of 175 places in 1074 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 17:15:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 17:15:20] [INFO ] After 25691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 1483 out of 1521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1521 transition count 2888
Applied a total of 1 rules in 480 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2889 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 1521/1521 places, 2888/2889 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1706 ms. (steps per millisecond=5 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 201529 steps, run timeout after 6001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 201529 steps, saw 169331 distinct states, run finished after 6006 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2888 rows 1521 cols
[2024-06-07 17:15:29] [INFO ] Computed 77 invariants in 28 ms
[2024-06-07 17:15:32] [INFO ] [Real]Absence check using 77 positive place invariants in 34 ms returned sat
[2024-06-07 17:15:34] [INFO ] After 1798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-07 17:15:34] [INFO ] [Nat]Absence check using 77 positive place invariants in 54 ms returned sat
[2024-06-07 17:15:36] [INFO ] After 1255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 17:15:36] [INFO ] Deduced a trap composed of 111 places in 101 ms of which 1 ms to minimize.
[2024-06-07 17:15:37] [INFO ] Deduced a trap composed of 76 places in 373 ms of which 0 ms to minimize.
[2024-06-07 17:15:37] [INFO ] Deduced a trap composed of 111 places in 422 ms of which 1 ms to minimize.
[2024-06-07 17:15:38] [INFO ] Deduced a trap composed of 300 places in 539 ms of which 1 ms to minimize.
[2024-06-07 17:15:38] [INFO ] Deduced a trap composed of 384 places in 511 ms of which 1 ms to minimize.
[2024-06-07 17:15:39] [INFO ] Deduced a trap composed of 399 places in 727 ms of which 1 ms to minimize.
[2024-06-07 17:15:40] [INFO ] Deduced a trap composed of 364 places in 894 ms of which 1 ms to minimize.
[2024-06-07 17:15:41] [INFO ] Deduced a trap composed of 336 places in 928 ms of which 1 ms to minimize.
[2024-06-07 17:15:43] [INFO ] Deduced a trap composed of 279 places in 1015 ms of which 1 ms to minimize.
[2024-06-07 17:15:44] [INFO ] Deduced a trap composed of 204 places in 1018 ms of which 2 ms to minimize.
[2024-06-07 17:15:45] [INFO ] Deduced a trap composed of 111 places in 1146 ms of which 2 ms to minimize.
[2024-06-07 17:15:46] [INFO ] Deduced a trap composed of 76 places in 1119 ms of which 2 ms to minimize.
[2024-06-07 17:15:47] [INFO ] Deduced a trap composed of 256 places in 1153 ms of which 1 ms to minimize.
[2024-06-07 17:15:49] [INFO ] Deduced a trap composed of 111 places in 1102 ms of which 2 ms to minimize.
[2024-06-07 17:15:50] [INFO ] Deduced a trap composed of 144 places in 1142 ms of which 2 ms to minimize.
[2024-06-07 17:15:51] [INFO ] Deduced a trap composed of 175 places in 1124 ms of which 2 ms to minimize.
[2024-06-07 17:15:52] [INFO ] Deduced a trap composed of 111 places in 1103 ms of which 2 ms to minimize.
[2024-06-07 17:15:54] [INFO ] Deduced a trap composed of 144 places in 1055 ms of which 2 ms to minimize.
[2024-06-07 17:15:55] [INFO ] Deduced a trap composed of 144 places in 1098 ms of which 2 ms to minimize.
[2024-06-07 17:15:56] [INFO ] Deduced a trap composed of 76 places in 1078 ms of which 1 ms to minimize.
[2024-06-07 17:15:57] [INFO ] Deduced a trap composed of 76 places in 1129 ms of which 2 ms to minimize.
[2024-06-07 17:15:59] [INFO ] Deduced a trap composed of 111 places in 1119 ms of which 2 ms to minimize.
[2024-06-07 17:16:00] [INFO ] Deduced a trap composed of 144 places in 1079 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 17:16:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 17:16:00] [INFO ] After 26024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 1483 out of 1521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1521/1521 places, 2888/2888 transitions.
Applied a total of 0 rules in 287 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 1521/1521 places, 2888/2888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1521/1521 places, 2888/2888 transitions.
Applied a total of 0 rules in 342 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2888 (removed 0) transitions.
[2024-06-07 17:16:01] [INFO ] Invariant cache hit.
[2024-06-07 17:16:01] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-07 17:16:01] [INFO ] Invariant cache hit.
[2024-06-07 17:16:02] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
[2024-06-07 17:16:02] [INFO ] Redundant transitions in 154 ms returned []
[2024-06-07 17:16:02] [INFO ] Invariant cache hit.
[2024-06-07 17:16:03] [INFO ] Dead Transitions using invariants and state equation in 1297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3098 ms. Remains : 1521/1521 places, 2888/2888 transitions.
Applied a total of 0 rules in 259 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2888 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-06-07 17:16:04] [INFO ] Invariant cache hit.
[2024-06-07 17:16:07] [INFO ] [Real]Absence check using 77 positive place invariants in 34 ms returned sat
[2024-06-07 17:16:08] [INFO ] After 1696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-07 17:16:08] [INFO ] [Nat]Absence check using 77 positive place invariants in 33 ms returned sat
[2024-06-07 17:16:10] [INFO ] After 1447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 17:16:11] [INFO ] Deduced a trap composed of 256 places in 222 ms of which 0 ms to minimize.
[2024-06-07 17:16:11] [INFO ] Deduced a trap composed of 336 places in 348 ms of which 1 ms to minimize.
[2024-06-07 17:16:12] [INFO ] Deduced a trap composed of 364 places in 421 ms of which 1 ms to minimize.
[2024-06-07 17:16:12] [INFO ] Deduced a trap composed of 375 places in 491 ms of which 2 ms to minimize.
[2024-06-07 17:16:13] [INFO ] Deduced a trap composed of 399 places in 656 ms of which 1 ms to minimize.
[2024-06-07 17:16:14] [INFO ] Deduced a trap composed of 384 places in 848 ms of which 1 ms to minimize.
[2024-06-07 17:16:15] [INFO ] Deduced a trap composed of 76 places in 941 ms of which 1 ms to minimize.
[2024-06-07 17:16:16] [INFO ] Deduced a trap composed of 111 places in 996 ms of which 2 ms to minimize.
[2024-06-07 17:16:17] [INFO ] Deduced a trap composed of 175 places in 997 ms of which 2 ms to minimize.
[2024-06-07 17:16:18] [INFO ] Deduced a trap composed of 256 places in 1066 ms of which 5 ms to minimize.
[2024-06-07 17:16:20] [INFO ] Deduced a trap composed of 256 places in 1038 ms of which 1 ms to minimize.
[2024-06-07 17:16:21] [INFO ] Deduced a trap composed of 364 places in 1104 ms of which 2 ms to minimize.
[2024-06-07 17:16:22] [INFO ] Deduced a trap composed of 175 places in 1074 ms of which 2 ms to minimize.
[2024-06-07 17:16:24] [INFO ] Deduced a trap composed of 144 places in 1067 ms of which 1 ms to minimize.
[2024-06-07 17:16:25] [INFO ] Deduced a trap composed of 144 places in 1174 ms of which 2 ms to minimize.
[2024-06-07 17:16:26] [INFO ] Deduced a trap composed of 111 places in 1050 ms of which 2 ms to minimize.
[2024-06-07 17:16:27] [INFO ] Deduced a trap composed of 76 places in 1102 ms of which 2 ms to minimize.
[2024-06-07 17:16:28] [INFO ] Deduced a trap composed of 111 places in 1087 ms of which 3 ms to minimize.
[2024-06-07 17:16:30] [INFO ] Deduced a trap composed of 111 places in 1108 ms of which 1 ms to minimize.
[2024-06-07 17:16:31] [INFO ] Deduced a trap composed of 375 places in 1087 ms of which 3 ms to minimize.
[2024-06-07 17:16:32] [INFO ] Deduced a trap composed of 144 places in 1135 ms of which 4 ms to minimize.
[2024-06-07 17:16:33] [INFO ] Deduced a trap composed of 204 places in 1149 ms of which 2 ms to minimize.
[2024-06-07 17:16:35] [INFO ] Deduced a trap composed of 111 places in 1142 ms of which 2 ms to minimize.
[2024-06-07 17:16:36] [INFO ] Deduced a trap composed of 76 places in 1126 ms of which 2 ms to minimize.
[2024-06-07 17:16:37] [INFO ] Deduced a trap composed of 76 places in 1117 ms of which 1 ms to minimize.
[2024-06-07 17:16:38] [INFO ] Deduced a trap composed of 111 places in 1127 ms of which 1 ms to minimize.
[2024-06-07 17:16:40] [INFO ] Deduced a trap composed of 144 places in 1102 ms of which 2 ms to minimize.
[2024-06-07 17:16:41] [INFO ] Deduced a trap composed of 144 places in 1136 ms of which 2 ms to minimize.
[2024-06-07 17:16:42] [INFO ] Deduced a trap composed of 175 places in 1052 ms of which 3 ms to minimize.
[2024-06-07 17:16:43] [INFO ] Deduced a trap composed of 144 places in 1140 ms of which 2 ms to minimize.
[2024-06-07 17:16:45] [INFO ] Deduced a trap composed of 175 places in 1150 ms of which 1 ms to minimize.
[2024-06-07 17:16:46] [INFO ] Deduced a trap composed of 111 places in 1165 ms of which 2 ms to minimize.
[2024-06-07 17:16:47] [INFO ] Deduced a trap composed of 76 places in 1103 ms of which 2 ms to minimize.
[2024-06-07 17:16:48] [INFO ] Deduced a trap composed of 144 places in 1131 ms of which 1 ms to minimize.
[2024-06-07 17:16:50] [INFO ] Deduced a trap composed of 76 places in 1140 ms of which 2 ms to minimize.
[2024-06-07 17:16:51] [INFO ] Deduced a trap composed of 400 places in 1115 ms of which 2 ms to minimize.
[2024-06-07 17:16:52] [INFO ] Deduced a trap composed of 144 places in 1129 ms of which 1 ms to minimize.
[2024-06-07 17:16:53] [INFO ] Deduced a trap composed of 175 places in 1127 ms of which 1 ms to minimize.
[2024-06-07 17:16:55] [INFO ] Deduced a trap composed of 231 places in 1055 ms of which 2 ms to minimize.
[2024-06-07 17:16:56] [INFO ] Deduced a trap composed of 300 places in 1148 ms of which 1 ms to minimize.
[2024-06-07 17:16:57] [INFO ] Deduced a trap composed of 364 places in 1130 ms of which 2 ms to minimize.
[2024-06-07 17:16:58] [INFO ] Deduced a trap composed of 175 places in 1088 ms of which 1 ms to minimize.
[2024-06-07 17:17:00] [INFO ] Deduced a trap composed of 111 places in 1049 ms of which 1 ms to minimize.
[2024-06-07 17:17:01] [INFO ] Deduced a trap composed of 144 places in 1094 ms of which 2 ms to minimize.
[2024-06-07 17:17:02] [INFO ] Deduced a trap composed of 111 places in 1019 ms of which 1 ms to minimize.
[2024-06-07 17:17:03] [INFO ] Deduced a trap composed of 144 places in 1141 ms of which 2 ms to minimize.
[2024-06-07 17:17:05] [INFO ] Deduced a trap composed of 144 places in 1071 ms of which 1 ms to minimize.
[2024-06-07 17:17:06] [INFO ] Deduced a trap composed of 76 places in 1142 ms of which 2 ms to minimize.
[2024-06-07 17:17:07] [INFO ] Deduced a trap composed of 144 places in 1063 ms of which 1 ms to minimize.
[2024-06-07 17:17:08] [INFO ] Deduced a trap composed of 175 places in 1075 ms of which 1 ms to minimize.
[2024-06-07 17:17:09] [INFO ] Deduced a trap composed of 175 places in 1070 ms of which 1 ms to minimize.
[2024-06-07 17:17:11] [INFO ] Deduced a trap composed of 175 places in 1119 ms of which 1 ms to minimize.
[2024-06-07 17:17:12] [INFO ] Deduced a trap composed of 175 places in 1134 ms of which 2 ms to minimize.
[2024-06-07 17:17:13] [INFO ] Deduced a trap composed of 204 places in 1104 ms of which 2 ms to minimize.
[2024-06-07 17:17:14] [INFO ] Deduced a trap composed of 76 places in 1119 ms of which 1 ms to minimize.
[2024-06-07 17:17:16] [INFO ] Deduced a trap composed of 76 places in 1134 ms of which 2 ms to minimize.
[2024-06-07 17:17:17] [INFO ] Deduced a trap composed of 76 places in 1001 ms of which 1 ms to minimize.
[2024-06-07 17:17:18] [INFO ] Deduced a trap composed of 111 places in 1089 ms of which 2 ms to minimize.
[2024-06-07 17:17:20] [INFO ] Deduced a trap composed of 175 places in 1143 ms of which 1 ms to minimize.
[2024-06-07 17:17:21] [INFO ] Deduced a trap composed of 111 places in 1091 ms of which 1 ms to minimize.
[2024-06-07 17:17:22] [INFO ] Deduced a trap composed of 144 places in 1061 ms of which 1 ms to minimize.
[2024-06-07 17:17:23] [INFO ] Deduced a trap composed of 111 places in 1113 ms of which 1 ms to minimize.
[2024-06-07 17:17:25] [INFO ] Deduced a trap composed of 76 places in 1084 ms of which 1 ms to minimize.
[2024-06-07 17:17:26] [INFO ] Deduced a trap composed of 375 places in 1125 ms of which 2 ms to minimize.
[2024-06-07 17:17:27] [INFO ] Deduced a trap composed of 76 places in 1073 ms of which 1 ms to minimize.
[2024-06-07 17:17:28] [INFO ] Deduced a trap composed of 76 places in 1091 ms of which 1 ms to minimize.
[2024-06-07 17:17:29] [INFO ] Deduced a trap composed of 111 places in 1107 ms of which 2 ms to minimize.
[2024-06-07 17:17:31] [INFO ] Deduced a trap composed of 144 places in 1124 ms of which 1 ms to minimize.
[2024-06-07 17:17:32] [INFO ] Deduced a trap composed of 279 places in 990 ms of which 2 ms to minimize.
[2024-06-07 17:17:33] [INFO ] Deduced a trap composed of 144 places in 1075 ms of which 2 ms to minimize.
[2024-06-07 17:17:34] [INFO ] Deduced a trap composed of 76 places in 1107 ms of which 5 ms to minimize.
[2024-06-07 17:17:35] [INFO ] Deduced a trap composed of 144 places in 1134 ms of which 2 ms to minimize.
[2024-06-07 17:17:37] [INFO ] Deduced a trap composed of 175 places in 1119 ms of which 2 ms to minimize.
[2024-06-07 17:17:38] [INFO ] Deduced a trap composed of 144 places in 1073 ms of which 2 ms to minimize.
[2024-06-07 17:17:39] [INFO ] Deduced a trap composed of 175 places in 1131 ms of which 1 ms to minimize.
[2024-06-07 17:17:40] [INFO ] Deduced a trap composed of 76 places in 1143 ms of which 2 ms to minimize.
[2024-06-07 17:17:42] [INFO ] Deduced a trap composed of 204 places in 1143 ms of which 2 ms to minimize.
[2024-06-07 17:17:43] [INFO ] Deduced a trap composed of 175 places in 1125 ms of which 2 ms to minimize.
[2024-06-07 17:17:44] [INFO ] Deduced a trap composed of 144 places in 1075 ms of which 1 ms to minimize.
[2024-06-07 17:17:45] [INFO ] Deduced a trap composed of 76 places in 1079 ms of which 1 ms to minimize.
[2024-06-07 17:17:47] [INFO ] Deduced a trap composed of 175 places in 1060 ms of which 1 ms to minimize.
[2024-06-07 17:17:48] [INFO ] Deduced a trap composed of 364 places in 1046 ms of which 1 ms to minimize.
[2024-06-07 17:17:49] [INFO ] Deduced a trap composed of 256 places in 1042 ms of which 2 ms to minimize.
[2024-06-07 17:17:50] [INFO ] Deduced a trap composed of 144 places in 1082 ms of which 5 ms to minimize.
[2024-06-07 17:17:51] [INFO ] Deduced a trap composed of 204 places in 1099 ms of which 1 ms to minimize.
[2024-06-07 17:17:53] [INFO ] Deduced a trap composed of 144 places in 1091 ms of which 2 ms to minimize.
[2024-06-07 17:17:54] [INFO ] Deduced a trap composed of 175 places in 1111 ms of which 2 ms to minimize.
[2024-06-07 17:17:55] [INFO ] Deduced a trap composed of 231 places in 1118 ms of which 2 ms to minimize.
[2024-06-07 17:17:56] [INFO ] Deduced a trap composed of 144 places in 1120 ms of which 1 ms to minimize.
[2024-06-07 17:17:58] [INFO ] Deduced a trap composed of 144 places in 1100 ms of which 2 ms to minimize.
[2024-06-07 17:17:59] [INFO ] Deduced a trap composed of 111 places in 1016 ms of which 1 ms to minimize.
[2024-06-07 17:18:00] [INFO ] Deduced a trap composed of 204 places in 1003 ms of which 2 ms to minimize.
[2024-06-07 17:18:01] [INFO ] Deduced a trap composed of 144 places in 1100 ms of which 2 ms to minimize.
[2024-06-07 17:18:02] [INFO ] Deduced a trap composed of 391 places in 1103 ms of which 2 ms to minimize.
[2024-06-07 17:18:04] [INFO ] Deduced a trap composed of 175 places in 1086 ms of which 2 ms to minimize.
[2024-06-07 17:18:05] [INFO ] Deduced a trap composed of 175 places in 1103 ms of which 4 ms to minimize.
[2024-06-07 17:18:06] [INFO ] Deduced a trap composed of 144 places in 1118 ms of which 2 ms to minimize.
[2024-06-07 17:18:07] [INFO ] Deduced a trap composed of 256 places in 1111 ms of which 1 ms to minimize.
[2024-06-07 17:18:09] [INFO ] Deduced a trap composed of 256 places in 1053 ms of which 1 ms to minimize.
[2024-06-07 17:18:10] [INFO ] Deduced a trap composed of 175 places in 1023 ms of which 2 ms to minimize.
[2024-06-07 17:18:11] [INFO ] Deduced a trap composed of 76 places in 1057 ms of which 1 ms to minimize.
[2024-06-07 17:18:12] [INFO ] Deduced a trap composed of 144 places in 1041 ms of which 2 ms to minimize.
[2024-06-07 17:18:13] [INFO ] Deduced a trap composed of 175 places in 1049 ms of which 2 ms to minimize.
[2024-06-07 17:18:14] [INFO ] Deduced a trap composed of 175 places in 1072 ms of which 1 ms to minimize.
[2024-06-07 17:18:16] [INFO ] Deduced a trap composed of 76 places in 1059 ms of which 1 ms to minimize.
[2024-06-07 17:18:17] [INFO ] Deduced a trap composed of 204 places in 1030 ms of which 1 ms to minimize.
[2024-06-07 17:18:18] [INFO ] Deduced a trap composed of 144 places in 1077 ms of which 1 ms to minimize.
[2024-06-07 17:18:19] [INFO ] Deduced a trap composed of 111 places in 1137 ms of which 1 ms to minimize.
[2024-06-07 17:18:21] [INFO ] Deduced a trap composed of 144 places in 1133 ms of which 1 ms to minimize.
[2024-06-07 17:18:22] [INFO ] Deduced a trap composed of 111 places in 1121 ms of which 1 ms to minimize.
[2024-06-07 17:18:23] [INFO ] Deduced a trap composed of 144 places in 1057 ms of which 1 ms to minimize.
[2024-06-07 17:18:24] [INFO ] Deduced a trap composed of 300 places in 1072 ms of which 2 ms to minimize.
[2024-06-07 17:18:25] [INFO ] Deduced a trap composed of 144 places in 1123 ms of which 2 ms to minimize.
[2024-06-07 17:18:27] [INFO ] Deduced a trap composed of 76 places in 1041 ms of which 2 ms to minimize.
[2024-06-07 17:18:28] [INFO ] Deduced a trap composed of 175 places in 1056 ms of which 2 ms to minimize.
[2024-06-07 17:18:29] [INFO ] Deduced a trap composed of 111 places in 1113 ms of which 2 ms to minimize.
[2024-06-07 17:18:30] [INFO ] Deduced a trap composed of 76 places in 1084 ms of which 1 ms to minimize.
[2024-06-07 17:18:31] [INFO ] Deduced a trap composed of 231 places in 1082 ms of which 2 ms to minimize.
[2024-06-07 17:18:33] [INFO ] Deduced a trap composed of 76 places in 1099 ms of which 1 ms to minimize.
[2024-06-07 17:18:34] [INFO ] Deduced a trap composed of 144 places in 1086 ms of which 1 ms to minimize.
[2024-06-07 17:18:35] [INFO ] Deduced a trap composed of 175 places in 1099 ms of which 2 ms to minimize.
[2024-06-07 17:18:36] [INFO ] Deduced a trap composed of 175 places in 1097 ms of which 3 ms to minimize.
[2024-06-07 17:18:38] [INFO ] Deduced a trap composed of 279 places in 1081 ms of which 2 ms to minimize.
[2024-06-07 17:18:39] [INFO ] Deduced a trap composed of 319 places in 1000 ms of which 1 ms to minimize.
[2024-06-07 17:18:40] [INFO ] Deduced a trap composed of 399 places in 1008 ms of which 2 ms to minimize.
[2024-06-07 17:18:41] [INFO ] Deduced a trap composed of 204 places in 985 ms of which 2 ms to minimize.
[2024-06-07 17:18:42] [INFO ] Deduced a trap composed of 231 places in 1133 ms of which 1 ms to minimize.
[2024-06-07 17:18:44] [INFO ] Deduced a trap composed of 144 places in 1115 ms of which 1 ms to minimize.
[2024-06-07 17:18:45] [INFO ] Deduced a trap composed of 111 places in 1045 ms of which 2 ms to minimize.
[2024-06-07 17:18:46] [INFO ] Deduced a trap composed of 175 places in 1092 ms of which 2 ms to minimize.
[2024-06-07 17:18:47] [INFO ] Deduced a trap composed of 111 places in 1061 ms of which 1 ms to minimize.
[2024-06-07 17:18:49] [INFO ] Deduced a trap composed of 175 places in 1043 ms of which 2 ms to minimize.
[2024-06-07 17:18:50] [INFO ] Deduced a trap composed of 144 places in 1065 ms of which 1 ms to minimize.
[2024-06-07 17:18:51] [INFO ] Deduced a trap composed of 396 places in 1016 ms of which 2 ms to minimize.
[2024-06-07 17:18:52] [INFO ] Deduced a trap composed of 391 places in 1061 ms of which 1 ms to minimize.
[2024-06-07 17:18:54] [INFO ] Deduced a trap composed of 319 places in 1105 ms of which 1 ms to minimize.
[2024-06-07 17:18:55] [INFO ] Deduced a trap composed of 175 places in 1109 ms of which 1 ms to minimize.
[2024-06-07 17:18:56] [INFO ] Deduced a trap composed of 204 places in 1096 ms of which 1 ms to minimize.
[2024-06-07 17:18:57] [INFO ] Deduced a trap composed of 175 places in 1056 ms of which 1 ms to minimize.
[2024-06-07 17:18:58] [INFO ] Deduced a trap composed of 175 places in 1055 ms of which 2 ms to minimize.
[2024-06-07 17:19:00] [INFO ] Deduced a trap composed of 76 places in 1128 ms of which 2 ms to minimize.
[2024-06-07 17:19:01] [INFO ] Deduced a trap composed of 111 places in 1130 ms of which 2 ms to minimize.
[2024-06-07 17:19:02] [INFO ] Deduced a trap composed of 111 places in 1101 ms of which 1 ms to minimize.
[2024-06-07 17:19:04] [INFO ] Deduced a trap composed of 144 places in 1058 ms of which 1 ms to minimize.
[2024-06-07 17:19:05] [INFO ] Deduced a trap composed of 204 places in 1074 ms of which 2 ms to minimize.
[2024-06-07 17:19:06] [INFO ] Deduced a trap composed of 175 places in 1034 ms of which 2 ms to minimize.
[2024-06-07 17:19:07] [INFO ] Deduced a trap composed of 144 places in 1065 ms of which 1 ms to minimize.
[2024-06-07 17:19:08] [INFO ] Deduced a trap composed of 111 places in 1073 ms of which 1 ms to minimize.
[2024-06-07 17:19:10] [INFO ] Deduced a trap composed of 144 places in 1033 ms of which 2 ms to minimize.
[2024-06-07 17:19:11] [INFO ] Deduced a trap composed of 231 places in 1063 ms of which 1 ms to minimize.
[2024-06-07 17:19:12] [INFO ] Deduced a trap composed of 256 places in 1070 ms of which 2 ms to minimize.
[2024-06-07 17:19:13] [INFO ] Deduced a trap composed of 144 places in 1107 ms of which 2 ms to minimize.
[2024-06-07 17:19:15] [INFO ] Deduced a trap composed of 175 places in 1095 ms of which 1 ms to minimize.
[2024-06-07 17:19:16] [INFO ] Deduced a trap composed of 76 places in 1059 ms of which 1 ms to minimize.
[2024-06-07 17:19:17] [INFO ] Deduced a trap composed of 76 places in 1057 ms of which 1 ms to minimize.
[2024-06-07 17:19:18] [INFO ] Deduced a trap composed of 144 places in 1080 ms of which 2 ms to minimize.
[2024-06-07 17:19:19] [INFO ] Deduced a trap composed of 175 places in 1086 ms of which 2 ms to minimize.
[2024-06-07 17:19:21] [INFO ] Deduced a trap composed of 144 places in 1123 ms of which 2 ms to minimize.
[2024-06-07 17:19:22] [INFO ] Deduced a trap composed of 175 places in 1104 ms of which 1 ms to minimize.
[2024-06-07 17:19:23] [INFO ] Deduced a trap composed of 204 places in 1095 ms of which 1 ms to minimize.
[2024-06-07 17:19:24] [INFO ] Deduced a trap composed of 175 places in 1079 ms of which 2 ms to minimize.
[2024-06-07 17:19:26] [INFO ] Deduced a trap composed of 231 places in 1101 ms of which 1 ms to minimize.
[2024-06-07 17:19:27] [INFO ] Deduced a trap composed of 144 places in 1116 ms of which 2 ms to minimize.
[2024-06-07 17:19:28] [INFO ] Deduced a trap composed of 144 places in 1112 ms of which 2 ms to minimize.
[2024-06-07 17:19:29] [INFO ] Deduced a trap composed of 175 places in 1088 ms of which 1 ms to minimize.
[2024-06-07 17:19:31] [INFO ] Deduced a trap composed of 175 places in 1092 ms of which 2 ms to minimize.
[2024-06-07 17:19:32] [INFO ] Deduced a trap composed of 175 places in 1093 ms of which 5 ms to minimize.
[2024-06-07 17:19:33] [INFO ] Deduced a trap composed of 204 places in 1064 ms of which 2 ms to minimize.
[2024-06-07 17:19:34] [INFO ] Deduced a trap composed of 175 places in 1078 ms of which 2 ms to minimize.
[2024-06-07 17:19:36] [INFO ] Deduced a trap composed of 204 places in 1084 ms of which 1 ms to minimize.
[2024-06-07 17:19:37] [INFO ] Deduced a trap composed of 204 places in 1042 ms of which 1 ms to minimize.
[2024-06-07 17:19:38] [INFO ] Deduced a trap composed of 175 places in 1070 ms of which 1 ms to minimize.
[2024-06-07 17:19:39] [INFO ] Deduced a trap composed of 111 places in 1111 ms of which 1 ms to minimize.
[2024-06-07 17:19:40] [INFO ] Deduced a trap composed of 204 places in 1093 ms of which 2 ms to minimize.
[2024-06-07 17:19:42] [INFO ] Deduced a trap composed of 76 places in 1059 ms of which 1 ms to minimize.
[2024-06-07 17:19:43] [INFO ] Deduced a trap composed of 351 places in 1104 ms of which 1 ms to minimize.
[2024-06-07 17:19:44] [INFO ] Deduced a trap composed of 231 places in 1121 ms of which 1 ms to minimize.
[2024-06-07 17:19:46] [INFO ] Deduced a trap composed of 144 places in 1118 ms of which 2 ms to minimize.
[2024-06-07 17:19:47] [INFO ] Deduced a trap composed of 175 places in 1092 ms of which 2 ms to minimize.
[2024-06-07 17:19:48] [INFO ] Deduced a trap composed of 204 places in 1122 ms of which 2 ms to minimize.
[2024-06-07 17:19:49] [INFO ] Deduced a trap composed of 144 places in 1118 ms of which 1 ms to minimize.
[2024-06-07 17:19:51] [INFO ] Deduced a trap composed of 175 places in 1116 ms of which 1 ms to minimize.
[2024-06-07 17:19:52] [INFO ] Deduced a trap composed of 175 places in 1049 ms of which 2 ms to minimize.
[2024-06-07 17:19:53] [INFO ] Deduced a trap composed of 175 places in 1108 ms of which 1 ms to minimize.
[2024-06-07 17:19:53] [INFO ] Trap strengthening (SAT) tested/added 184/184 trap constraints in 222791 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 17:19:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 17:19:53] [INFO ] After 225019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 1445 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 14 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
// Phase 1: matrix 2889 rows 1521 cols
[2024-06-07 17:19:54] [INFO ] Computed 77 invariants in 21 ms
[2024-06-07 17:19:54] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-07 17:19:54] [INFO ] Invariant cache hit.
[2024-06-07 17:19:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:19:55] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
[2024-06-07 17:19:55] [INFO ] Invariant cache hit.
[2024-06-07 17:19:57] [INFO ] Dead Transitions using invariants and state equation in 1369 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2839 ms. Remains : 1521/1521 places, 2889/2889 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 198 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s141 1) (GEQ s152 1) (GEQ s216 1) (GEQ s232 1) (GEQ s280 1) (GEQ s321 1) (GEQ s382 1) (GEQ s434 1) (GEQ s481 1) (GEQ s507 1) (GEQ s542 1) (GE...], 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][false, false]]
Product exploration explored 100000 steps with 0 reset in 3774 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-00 finished in 6897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0 U (p1||G(!p0)))))))'
Support contains 1483 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 21 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:20:01] [INFO ] Invariant cache hit.
[2024-06-07 17:20:01] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-07 17:20:01] [INFO ] Invariant cache hit.
[2024-06-07 17:20:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:20:02] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2024-06-07 17:20:02] [INFO ] Invariant cache hit.
[2024-06-07 17:20:03] [INFO ] Dead Transitions using invariants and state equation in 1373 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2799 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NOT (OR (AND (GEQ s2 1) (GEQ s64 1) (GEQ s927 1)) (AND (GEQ s2 1) (GEQ s37 1) (GEQ s574 1)) (AND (GEQ s2 1) (GEQ s43 1) (GEQ s656 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 91960 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-04 finished in 12968 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(X((F(p0)&&X(G(p1)))))))'
Support contains 71 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 147 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:20:14] [INFO ] Invariant cache hit.
[2024-06-07 17:20:15] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2024-06-07 17:20:15] [INFO ] Invariant cache hit.
[2024-06-07 17:20:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:20:17] [INFO ] Implicit Places using invariants and state equation in 2587 ms returned []
Implicit Place search using SMT with State Equation took 3634 ms to find 0 implicit places.
[2024-06-07 17:20:17] [INFO ] Invariant cache hit.
[2024-06-07 17:20:19] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5019 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p1:(OR (LT s141 1) (LT s152 1) (LT s216 1) (LT s232 1) (LT s280 1) (LT s321 1) (LT s382 1) (LT s434 1) (LT s481 1) (LT s507 1) (LT s542 1) (LT s574 1) (LT...], 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3559 ms.
Product exploration explored 100000 steps with 0 reset in 3723 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-07 17:20:27] [INFO ] Invariant cache hit.
[2024-06-07 17:20:27] [INFO ] [Real]Absence check using 77 positive place invariants in 34 ms returned sat
[2024-06-07 17:20:28] [INFO ] After 1025ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 17:20:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:20:29] [INFO ] After 86ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-06-07 17:20:29] [INFO ] After 241ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-06-07 17:20:29] [INFO ] After 1590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 33 out of 1521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1521 transition count 2888
Applied a total of 1 rules in 7433 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2889 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7435 ms. Remains : 1521/1521 places, 2888/2889 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 397577 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 397577 steps, saw 345720 distinct states, run finished after 3003 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2888 rows 1521 cols
[2024-06-07 17:20:40] [INFO ] Computed 77 invariants in 20 ms
[2024-06-07 17:20:40] [INFO ] [Real]Absence check using 77 positive place invariants in 32 ms returned sat
[2024-06-07 17:20:41] [INFO ] After 1242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 17:20:41] [INFO ] [Nat]Absence check using 77 positive place invariants in 46 ms returned sat
[2024-06-07 17:20:42] [INFO ] After 973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 17:20:42] [INFO ] After 1110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-06-07 17:20:42] [INFO ] After 1433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 33 out of 1521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1521/1521 places, 2888/2888 transitions.
Applied a total of 0 rules in 5330 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5332 ms. Remains : 1521/1521 places, 2888/2888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1521/1521 places, 2888/2888 transitions.
Applied a total of 0 rules in 5288 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2888 (removed 0) transitions.
[2024-06-07 17:20:53] [INFO ] Invariant cache hit.
[2024-06-07 17:20:54] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-06-07 17:20:54] [INFO ] Invariant cache hit.
[2024-06-07 17:20:56] [INFO ] Implicit Places using invariants and state equation in 2371 ms returned []
Implicit Place search using SMT with State Equation took 3345 ms to find 0 implicit places.
[2024-06-07 17:20:57] [INFO ] Redundant transitions in 147 ms returned []
[2024-06-07 17:20:57] [INFO ] Invariant cache hit.
[2024-06-07 17:20:58] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10047 ms. Remains : 1521/1521 places, 2888/2888 transitions.
Applied a total of 0 rules in 5309 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2888 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-07 17:21:03] [INFO ] Invariant cache hit.
[2024-06-07 17:21:03] [INFO ] [Real]Absence check using 77 positive place invariants in 31 ms returned sat
[2024-06-07 17:21:04] [INFO ] After 1057ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 17:21:05] [INFO ] After 1202ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-06-07 17:21:05] [INFO ] After 1518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F p0)]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 2889 rows 1521 cols
[2024-06-07 17:21:06] [INFO ] Computed 77 invariants in 22 ms
[2024-06-07 17:21:07] [INFO ] [Real]Absence check using 77 positive place invariants in 198 ms returned sat
[2024-06-07 17:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-07 17:21:16] [INFO ] [Real]Absence check using state equation in 9305 ms returned sat
[2024-06-07 17:21:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 17:21:18] [INFO ] [Nat]Absence check using 77 positive place invariants in 219 ms returned sat
[2024-06-07 17:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-07 17:21:28] [INFO ] [Nat]Absence check using state equation in 10293 ms returned sat
[2024-06-07 17:21:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:21:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 39 ms returned sat
[2024-06-07 17:21:29] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 1 ms to minimize.
[2024-06-07 17:21:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2024-06-07 17:21:29] [INFO ] Computed and/alt/rep : 259/259/259 causal constraints (skipped 2623 transitions) in 352 ms.
[2024-06-07 17:21:29] [INFO ] Added : 0 causal constraints over 0 iterations in 607 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 71 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 48 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:21:29] [INFO ] Invariant cache hit.
[2024-06-07 17:21:30] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2024-06-07 17:21:30] [INFO ] Invariant cache hit.
[2024-06-07 17:21:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:21:33] [INFO ] Implicit Places using invariants and state equation in 2487 ms returned []
Implicit Place search using SMT with State Equation took 3487 ms to find 0 implicit places.
[2024-06-07 17:21:33] [INFO ] Invariant cache hit.
[2024-06-07 17:21:34] [INFO ] Dead Transitions using invariants and state equation in 1267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4812 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-07 17:21:35] [INFO ] Invariant cache hit.
[2024-06-07 17:21:35] [INFO ] [Real]Absence check using 77 positive place invariants in 35 ms returned sat
[2024-06-07 17:21:36] [INFO ] After 1033ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 17:21:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:21:36] [INFO ] After 85ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-06-07 17:21:36] [INFO ] After 231ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-06-07 17:21:37] [INFO ] After 1598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 33 out of 1521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1521 transition count 2888
Applied a total of 1 rules in 7012 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2889 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7013 ms. Remains : 1521/1521 places, 2888/2889 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 389360 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 389360 steps, saw 338315 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2888 rows 1521 cols
[2024-06-07 17:21:47] [INFO ] Computed 77 invariants in 23 ms
[2024-06-07 17:21:47] [INFO ] [Real]Absence check using 77 positive place invariants in 36 ms returned sat
[2024-06-07 17:21:48] [INFO ] After 1281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 17:21:49] [INFO ] [Nat]Absence check using 77 positive place invariants in 34 ms returned sat
[2024-06-07 17:21:50] [INFO ] After 1034ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 17:21:50] [INFO ] After 1194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-06-07 17:21:50] [INFO ] After 1538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 33 out of 1521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1521/1521 places, 2888/2888 transitions.
Applied a total of 0 rules in 5326 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5326 ms. Remains : 1521/1521 places, 2888/2888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1521/1521 places, 2888/2888 transitions.
Applied a total of 0 rules in 5304 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2888 (removed 0) transitions.
[2024-06-07 17:22:01] [INFO ] Invariant cache hit.
[2024-06-07 17:22:02] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-06-07 17:22:02] [INFO ] Invariant cache hit.
[2024-06-07 17:22:04] [INFO ] Implicit Places using invariants and state equation in 2368 ms returned []
Implicit Place search using SMT with State Equation took 3377 ms to find 0 implicit places.
[2024-06-07 17:22:04] [INFO ] Redundant transitions in 76 ms returned []
[2024-06-07 17:22:04] [INFO ] Invariant cache hit.
[2024-06-07 17:22:05] [INFO ] Dead Transitions using invariants and state equation in 1267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10031 ms. Remains : 1521/1521 places, 2888/2888 transitions.
Applied a total of 0 rules in 5262 ms. Remains 1521 /1521 variables (removed 0) and now considering 2888/2888 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-07 17:22:11] [INFO ] Invariant cache hit.
[2024-06-07 17:22:11] [INFO ] [Real]Absence check using 77 positive place invariants in 36 ms returned sat
[2024-06-07 17:22:12] [INFO ] After 1041ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 17:22:12] [INFO ] After 1188ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-06-07 17:22:12] [INFO ] After 1508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F p0)]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 308 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 2889 rows 1521 cols
[2024-06-07 17:22:13] [INFO ] Computed 77 invariants in 23 ms
[2024-06-07 17:22:14] [INFO ] [Real]Absence check using 77 positive place invariants in 191 ms returned sat
[2024-06-07 17:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-07 17:22:24] [INFO ] [Real]Absence check using state equation in 9235 ms returned sat
[2024-06-07 17:22:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 17:22:25] [INFO ] [Nat]Absence check using 77 positive place invariants in 228 ms returned sat
[2024-06-07 17:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-07 17:22:36] [INFO ] [Nat]Absence check using state equation in 10520 ms returned sat
[2024-06-07 17:22:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:22:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 39 ms returned sat
[2024-06-07 17:22:36] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 0 ms to minimize.
[2024-06-07 17:22:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2024-06-07 17:22:36] [INFO ] Computed and/alt/rep : 259/259/259 causal constraints (skipped 2623 transitions) in 201 ms.
[2024-06-07 17:22:37] [INFO ] Added : 0 causal constraints over 0 iterations in 446 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 3411 ms.
Product exploration explored 100000 steps with 0 reset in 3585 ms.
Applying partial POR strategy [true, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Support contains 71 out of 1521 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 737 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:22:45] [INFO ] Redundant transitions in 78 ms returned []
[2024-06-07 17:22:45] [INFO ] Invariant cache hit.
[2024-06-07 17:22:47] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2163 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Built C files in :
/tmp/ltsmin16751122462528668961
[2024-06-07 17:22:47] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16751122462528668961
Running compilation step : cd /tmp/ltsmin16751122462528668961;'/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/ltsmin16751122462528668961;'/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/ltsmin16751122462528668961;'/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 71 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 52 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:22:50] [INFO ] Invariant cache hit.
[2024-06-07 17:22:51] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-06-07 17:22:51] [INFO ] Invariant cache hit.
[2024-06-07 17:22:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:22:53] [INFO ] Implicit Places using invariants and state equation in 2427 ms returned []
Implicit Place search using SMT with State Equation took 3402 ms to find 0 implicit places.
[2024-06-07 17:22:53] [INFO ] Invariant cache hit.
[2024-06-07 17:22:54] [INFO ] Dead Transitions using invariants and state equation in 1288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4746 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Built C files in :
/tmp/ltsmin4118040634437573251
[2024-06-07 17:22:54] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4118040634437573251
Running compilation step : cd /tmp/ltsmin4118040634437573251;'/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/ltsmin4118040634437573251;'/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/ltsmin4118040634437573251;'/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-06-07 17:22:58] [INFO ] Flatten gal took : 141 ms
[2024-06-07 17:22:58] [INFO ] Flatten gal took : 132 ms
[2024-06-07 17:22:58] [INFO ] Time to serialize gal into /tmp/LTL7712341458496687604.gal : 30 ms
[2024-06-07 17:22:58] [INFO ] Time to serialize properties into /tmp/LTL8226107240824585256.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/LTL7712341458496687604.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13653198669296020690.hoa' '-atoms' '/tmp/LTL8226107240824585256.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/LTL8226107240824585256.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13653198669296020690.hoa
Detected timeout of ITS tools.
[2024-06-07 17:23:13] [INFO ] Flatten gal took : 192 ms
[2024-06-07 17:23:14] [INFO ] Flatten gal took : 224 ms
[2024-06-07 17:23:14] [INFO ] Time to serialize gal into /tmp/LTL15342844472056367716.gal : 37 ms
[2024-06-07 17:23:14] [INFO ] Time to serialize properties into /tmp/LTL12419134949723805005.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/LTL15342844472056367716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12419134949723805005.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(((((((pred_holding_0>=1)||(pred_holding_21>=1))||((pred_holding_22>=1)||(pred_holding_1>=1)))||(((pred_holding_2>=1)||(p...1583
Formula 0 simplified : XXX(G!"(((((((pred_holding_0>=1)||(pred_holding_21>=1))||((pred_holding_22>=1)||(pred_holding_1>=1)))||(((pred_holding_2>=1)||(pred_...1569
Detected timeout of ITS tools.
[2024-06-07 17:23:29] [INFO ] Flatten gal took : 104 ms
[2024-06-07 17:23:29] [INFO ] Applying decomposition
[2024-06-07 17:23:29] [INFO ] Flatten gal took : 107 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/graph5082723481448795607.txt' '-o' '/tmp/graph5082723481448795607.bin' '-w' '/tmp/graph5082723481448795607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5082723481448795607.bin' '-l' '-1' '-v' '-w' '/tmp/graph5082723481448795607.weights' '-q' '0' '-e' '0.001'
[2024-06-07 17:23:30] [INFO ] Decomposing Gal with order
[2024-06-07 17:23:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 17:23:30] [INFO ] Removed a total of 5396 redundant transitions.
[2024-06-07 17:23:30] [INFO ] Flatten gal took : 580 ms
[2024-06-07 17:23:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 51 ms.
[2024-06-07 17:23:30] [INFO ] Time to serialize gal into /tmp/LTL10676339563827002635.gal : 28 ms
[2024-06-07 17:23:30] [INFO ] Time to serialize properties into /tmp/LTL697996181144172157.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/LTL10676339563827002635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL697996181144172157.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 : !((X(X(X((F("(((((((u0.pred_holding_0>=1)||(u21.pred_holding_21>=1))||((u22.pred_holding_22>=1)||(u1.pred_holding_1>=1)))||(((u2.pred_...1876
Formula 0 simplified : XXX(G!"(((((((u0.pred_holding_0>=1)||(u21.pred_holding_21>=1))||((u22.pred_holding_22>=1)||(u1.pred_holding_1>=1)))||(((u2.pred_hold...1862
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4136719420133608755
[2024-06-07 17:23:45] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4136719420133608755
Running compilation step : cd /tmp/ltsmin4136719420133608755;'/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/ltsmin4136719420133608755;'/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/ltsmin4136719420133608755;'/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 BlocksWorld-PT-07-LTLFireability-05 finished in 214887 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(!p1)||p0)))'
Support contains 71 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 47 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:23:49] [INFO ] Invariant cache hit.
[2024-06-07 17:23:50] [INFO ] Implicit Places using invariants in 1119 ms returned []
[2024-06-07 17:23:50] [INFO ] Invariant cache hit.
[2024-06-07 17:23:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:23:52] [INFO ] Implicit Places using invariants and state equation in 2393 ms returned []
Implicit Place search using SMT with State Equation took 3514 ms to find 0 implicit places.
[2024-06-07 17:23:52] [INFO ] Invariant cache hit.
[2024-06-07 17:23:53] [INFO ] Dead Transitions using invariants and state equation in 1245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4807 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s141 1) (LT s152 1) (LT s216 1) (LT s232 1) (LT s280 1) (LT s321 1) (LT s382 1) (LT s434 1) (LT s481 1) (LT s507 1) (LT s542 1) (LT s574 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1570 ms.
Product exploration explored 100000 steps with 50000 reset in 1539 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-07-LTLFireability-06 finished in 8105 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&&X(X(p2))))))'
Support contains 109 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 53 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:23:57] [INFO ] Invariant cache hit.
[2024-06-07 17:23:57] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-06-07 17:23:57] [INFO ] Invariant cache hit.
[2024-06-07 17:23:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:24:00] [INFO ] Implicit Places using invariants and state equation in 2227 ms returned []
Implicit Place search using SMT with State Equation took 3025 ms to find 0 implicit places.
[2024-06-07 17:24:00] [INFO ] Invariant cache hit.
[2024-06-07 17:24:01] [INFO ] Dead Transitions using invariants and state equation in 1239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4321 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Stuttering acceptance computed with spot in 306 ms :[p0, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), true, (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 1}, { cond=p0, acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(OR (LT s141 1) (LT s152 1) (LT s216 1) (LT s232 1) (LT s280 1) (LT s321 1) (LT s382 1) (LT s434 1) (LT s481 1) (LT s507 1) (LT s542 1) (LT s574 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-07 finished in 4669 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((X((G(p1)&&p0))&&(X(G(p3))||p2)))))'
Support contains 9 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 45 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:24:01] [INFO ] Invariant cache hit.
[2024-06-07 17:24:02] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-06-07 17:24:02] [INFO ] Invariant cache hit.
[2024-06-07 17:24:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:24:05] [INFO ] Implicit Places using invariants and state equation in 2526 ms returned []
Implicit Place search using SMT with State Equation took 3425 ms to find 0 implicit places.
[2024-06-07 17:24:05] [INFO ] Invariant cache hit.
[2024-06-07 17:24:06] [INFO ] Dead Transitions using invariants and state equation in 1291 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4762 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 p3), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND p1 p3), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) p3), acceptance={0} source=5 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0, 1} source=6 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) (NOT p1) p3)), acceptance={0} source=6 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=6 dest: 4}, { cond=(AND p0 p1 p3), acceptance={} source=6 dest: 5}, { cond=(OR (AND p2 (NOT p0) p3) (AND p2 (NOT p1) p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (LT s49 1) (LT s93 1)), p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1)), p1:(AND (GEQ s2 1) (GEQ s88 1) (GEQ s89 1)), p3:(OR (LT s4 1) (LT s108 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3485 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-09 finished in 8664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 42 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:24:10] [INFO ] Invariant cache hit.
[2024-06-07 17:24:11] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2024-06-07 17:24:11] [INFO ] Invariant cache hit.
[2024-06-07 17:24:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:24:14] [INFO ] Implicit Places using invariants and state equation in 2652 ms returned []
Implicit Place search using SMT with State Equation took 3672 ms to find 0 implicit places.
[2024-06-07 17:24:14] [INFO ] Invariant cache hit.
[2024-06-07 17:24:15] [INFO ] Dead Transitions using invariants and state equation in 1263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4979 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s63 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][false, false, false]]
Product exploration explored 100000 steps with 208 reset in 3531 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-11 finished in 8650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(!p1 U (G(!p1)||(!p1&&(p2||X(!p3))))))))'
Support contains 38 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 48 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:24:19] [INFO ] Invariant cache hit.
[2024-06-07 17:24:20] [INFO ] Implicit Places using invariants in 979 ms returned []
[2024-06-07 17:24:20] [INFO ] Invariant cache hit.
[2024-06-07 17:24:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:24:22] [INFO ] Implicit Places using invariants and state equation in 2536 ms returned []
Implicit Place search using SMT with State Equation took 3517 ms to find 0 implicit places.
[2024-06-07 17:24:22] [INFO ] Invariant cache hit.
[2024-06-07 17:24:23] [INFO ] Dead Transitions using invariants and state equation in 1248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4816 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p3)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p3 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s141 1) (LT s152 1) (LT s216 1) (LT s232 1) (LT s280 1) (LT s321 1) (LT s382 1) (LT s434 1) (LT s481 1) (LT s507 1) (LT s542 1) (LT s574 1) (LT...], 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]]
Product exploration explored 100000 steps with 50000 reset in 1384 ms.
Product exploration explored 100000 steps with 50000 reset in 1445 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-07-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-07-LTLFireability-12 finished in 7891 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 34 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 48 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:24:27] [INFO ] Invariant cache hit.
[2024-06-07 17:24:28] [INFO ] Implicit Places using invariants in 956 ms returned []
[2024-06-07 17:24:28] [INFO ] Invariant cache hit.
[2024-06-07 17:24:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:24:30] [INFO ] Implicit Places using invariants and state equation in 2525 ms returned []
Implicit Place search using SMT with State Equation took 3489 ms to find 0 implicit places.
[2024-06-07 17:24:30] [INFO ] Invariant cache hit.
[2024-06-07 17:24:31] [INFO ] Dead Transitions using invariants and state equation in 1246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4783 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s141 1) (LT s152 1) (LT s216 1) (LT s232 1) (LT s280 1) (LT s321 1) (LT s382 1) (LT s434 1) (LT s481 1) (LT s507 1) (LT s542 1) (LT s574 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 598 reset in 3223 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-13 finished in 8173 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' '!((p0 U G((F(!p0)||X(G(!p1))))))'
Support contains 3 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 45 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:24:35] [INFO ] Invariant cache hit.
[2024-06-07 17:24:36] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2024-06-07 17:24:36] [INFO ] Invariant cache hit.
[2024-06-07 17:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:24:39] [INFO ] Implicit Places using invariants and state equation in 2771 ms returned []
Implicit Place search using SMT with State Equation took 3790 ms to find 0 implicit places.
[2024-06-07 17:24:39] [INFO ] Invariant cache hit.
[2024-06-07 17:24:40] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5082 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={1} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 4}], [{ cond=p0, acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s33 1), p1:(AND (GEQ s40 1) (GEQ s99 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 127 reset in 3452 ms.
Product exploration explored 100000 steps with 104 reset in 3533 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 106 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-07 17:24:48] [INFO ] Invariant cache hit.
[2024-06-07 17:24:48] [INFO ] [Real]Absence check using 77 positive place invariants in 37 ms returned sat
[2024-06-07 17:24:48] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-07-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-07-LTLFireability-14 finished in 13357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1521 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1521/1521 places, 2889/2889 transitions.
Applied a total of 0 rules in 228 ms. Remains 1521 /1521 variables (removed 0) and now considering 2889/2889 (removed 0) transitions.
[2024-06-07 17:24:48] [INFO ] Invariant cache hit.
[2024-06-07 17:24:49] [INFO ] Implicit Places using invariants in 920 ms returned []
[2024-06-07 17:24:49] [INFO ] Invariant cache hit.
[2024-06-07 17:24:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:24:52] [INFO ] Implicit Places using invariants and state equation in 2533 ms returned []
Implicit Place search using SMT with State Equation took 3455 ms to find 0 implicit places.
[2024-06-07 17:24:52] [INFO ] Redundant transitions in 77 ms returned []
[2024-06-07 17:24:52] [INFO ] Invariant cache hit.
[2024-06-07 17:24:53] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4979 ms. Remains : 1521/1521 places, 2889/2889 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s64 1) (LT s893 1)), p1:(OR (LT s2 1) (LT s64 1) (LT s65 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 0 reset in 3426 ms.
Stack based approach found an accepted trace after 1313 steps with 1 reset with depth 740 and stack size 629 in 48 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-15 finished in 8599 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(X((F(p0)&&X(G(p1)))))))'
[2024-06-07 17:24:57] [INFO ] Flatten gal took : 96 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16233825609125744900
[2024-06-07 17:24:57] [INFO ] Too many transitions (2889) to apply POR reductions. Disabling POR matrices.
[2024-06-07 17:24:57] [INFO ] Applying decomposition
[2024-06-07 17:24:57] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16233825609125744900
Running compilation step : cd /tmp/ltsmin16233825609125744900;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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-06-07 17:24:57] [INFO ] Flatten gal took : 94 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/graph14740843923124813482.txt' '-o' '/tmp/graph14740843923124813482.bin' '-w' '/tmp/graph14740843923124813482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14740843923124813482.bin' '-l' '-1' '-v' '-w' '/tmp/graph14740843923124813482.weights' '-q' '0' '-e' '0.001'
[2024-06-07 17:24:57] [INFO ] Decomposing Gal with order
[2024-06-07 17:24:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 17:24:58] [INFO ] Removed a total of 5396 redundant transitions.
[2024-06-07 17:24:58] [INFO ] Flatten gal took : 305 ms
[2024-06-07 17:24:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 51 ms.
[2024-06-07 17:24:58] [INFO ] Time to serialize gal into /tmp/LTLFireability7496992541067614287.gal : 27 ms
[2024-06-07 17:24:58] [INFO ] Time to serialize properties into /tmp/LTLFireability15715117063056727889.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/LTLFireability7496992541067614287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15715117063056727889.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(((((((u0.pred_holding_0>=1)||(u21.pred_holding_21>=1))||((u22.pred_holding_22>=1)||(u1.pred_holding_1>=1)))||(((u2.pred_...1870
Formula 0 simplified : XXX(G!"(((((((u0.pred_holding_0>=1)||(u21.pred_holding_21>=1))||((u22.pred_holding_22>=1)||(u1.pred_holding_1>=1)))||(((u2.pred_hold...1856
Compilation finished in 7717 ms.
Running link step : cd /tmp/ltsmin16233825609125744900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin16233825609125744900;'/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(X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-06-07 17:48:26] [INFO ] Applying decomposition
[2024-06-07 17:48:26] [INFO ] Flatten gal took : 206 ms
[2024-06-07 17:48:26] [INFO ] Decomposing Gal with order
[2024-06-07 17:48:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 17:48:28] [INFO ] Removed a total of 5622 redundant transitions.
[2024-06-07 17:48:28] [INFO ] Flatten gal took : 1015 ms
[2024-06-07 17:48:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 84 ms.
[2024-06-07 17:48:28] [INFO ] Time to serialize gal into /tmp/LTLFireability3242177016574536130.gal : 122 ms
[2024-06-07 17:48:28] [INFO ] Time to serialize properties into /tmp/LTLFireability6589146982173131209.ltl : 9 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/LTLFireability3242177016574536130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6589146982173131209.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 1 LTL properties
Checking formula 0 : !((X(X(X((F("(((((((u24.pred_holding_0>=1)||(u25.pred_holding_21>=1))||((u10.pred_holding_22>=1)||(u16.pred_holding_1>=1)))||(((u29.pr...1850
Formula 0 simplified : XXX(G!"(((((((u24.pred_holding_0>=1)||(u25.pred_holding_21>=1))||((u10.pred_holding_22>=1)||(u16.pred_holding_1>=1)))||(((u29.pred_h...1836
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.038: LTL layer: formula: X(X(X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.038: "X(X(X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.067: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.118: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.122: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.125: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.130: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.320: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 2.898: DFS-FIFO for weak LTL, using special progress label 2892
pins2lts-mc-linux64( 0/ 8), 2.898: There are 2893 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.898: State length is 1522, there are 2900 groups
pins2lts-mc-linux64( 0/ 8), 2.898: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.898: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.898: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 2.898: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 4.452: ~1 levels ~960 states ~7224 transitions
pins2lts-mc-linux64( 2/ 8), 5.012: ~1 levels ~1920 states ~15256 transitions
pins2lts-mc-linux64( 2/ 8), 6.554: ~1 levels ~3840 states ~29704 transitions
pins2lts-mc-linux64( 1/ 8), 9.700: ~1 levels ~7680 states ~62376 transitions
pins2lts-mc-linux64( 5/ 8), 14.992: ~1 levels ~15360 states ~119680 transitions
pins2lts-mc-linux64( 5/ 8), 18.313: ~1 levels ~30720 states ~241328 transitions
pins2lts-mc-linux64( 6/ 8), 24.306: ~1 levels ~61440 states ~455432 transitions
pins2lts-mc-linux64( 5/ 8), 35.663: ~1 levels ~122880 states ~907920 transitions
pins2lts-mc-linux64( 7/ 8), 58.144: ~1 levels ~245760 states ~1802880 transitions
pins2lts-mc-linux64( 0/ 8), 103.005: ~1 levels ~491520 states ~3778072 transitions
pins2lts-mc-linux64( 0/ 8), 194.360: ~1 levels ~983040 states ~7299080 transitions
pins2lts-mc-linux64( 0/ 8), 404.000: ~1 levels ~1966080 states ~14718960 transitions
pins2lts-mc-linux64( 7/ 8), 768.310: ~1 levels ~3932160 states ~29381120 transitions
pins2lts-mc-linux64( 1/ 8), 1489.686: ~1 levels ~7864320 states ~61788008 transitions
pins2lts-mc-linux64( 5/ 8), 1589.628: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1589.698:
pins2lts-mc-linux64( 0/ 8), 1589.698: mean standard work distribution: 0.6% (states) 1.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 1589.699:
pins2lts-mc-linux64( 0/ 8), 1589.699: Explored 8324869 states 66666868 transitions, fanout: 8.008
pins2lts-mc-linux64( 0/ 8), 1589.699: Total exploration time 1586.760 sec (1586.670 sec minimum, 1586.735 sec on average)
pins2lts-mc-linux64( 0/ 8), 1589.699: States per second: 5246, Transitions per second: 42014
pins2lts-mc-linux64( 0/ 8), 1589.699:
pins2lts-mc-linux64( 0/ 8), 1589.699: Progress states detected: 35653196
pins2lts-mc-linux64( 0/ 8), 1589.699: Redundant explorations: -76.6504
pins2lts-mc-linux64( 0/ 8), 1589.699:
pins2lts-mc-linux64( 0/ 8), 1589.699: Queue width: 8B, total height: 41907757, memory: 319.73MB
pins2lts-mc-linux64( 0/ 8), 1589.699: Tree memory: 528.0MB, 15.5 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1589.699: Tree fill ratio (roots/leafs): 26.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1589.702: Stored 2988 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1589.703: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1589.705: Est. total memory use: 847.7MB (~1343.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16233825609125744900;'/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(X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16233825609125744900;'/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(X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)

BK_STOP 1717783156028

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="BlocksWorld-PT-07"
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 BlocksWorld-PT-07, 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 r623-tall-171774435600133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-07.tgz
mv BlocksWorld-PT-07 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 ;