Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r517-tall-167987243300044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Anderson-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243300044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 927K Mar 31 16:48 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 Anderson-PT-09-LTLFireability-00
FORMULA_NAME Anderson-PT-09-LTLFireability-01
FORMULA_NAME Anderson-PT-09-LTLFireability-02
FORMULA_NAME Anderson-PT-09-LTLFireability-03
FORMULA_NAME Anderson-PT-09-LTLFireability-04
FORMULA_NAME Anderson-PT-09-LTLFireability-05
FORMULA_NAME Anderson-PT-09-LTLFireability-06
FORMULA_NAME Anderson-PT-09-LTLFireability-07
FORMULA_NAME Anderson-PT-09-LTLFireability-08
FORMULA_NAME Anderson-PT-09-LTLFireability-09
FORMULA_NAME Anderson-PT-09-LTLFireability-10
FORMULA_NAME Anderson-PT-09-LTLFireability-11
FORMULA_NAME Anderson-PT-09-LTLFireability-12
FORMULA_NAME Anderson-PT-09-LTLFireability-13
FORMULA_NAME Anderson-PT-09-LTLFireability-14
FORMULA_NAME Anderson-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680844443513

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 05:14:05] [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]
[2023-04-07 05:14:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:14:05] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-04-07 05:14:05] [INFO ] Transformed 505 places.
[2023-04-07 05:14:05] [INFO ] Transformed 1845 transitions.
[2023-04-07 05:14:05] [INFO ] Found NUPN structural information;
[2023-04-07 05:14:05] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 47 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 121 places :
Symmetric choice reduction at 0 with 121 rule applications. Total rules 121 place count 384 transition count 908
Iterating global reduction 0 with 121 rules applied. Total rules applied 242 place count 384 transition count 908
Applied a total of 242 rules in 77 ms. Remains 384 /505 variables (removed 121) and now considering 908/1845 (removed 937) transitions.
// Phase 1: matrix 908 rows 384 cols
[2023-04-07 05:14:05] [INFO ] Computed 21 invariants in 36 ms
[2023-04-07 05:14:06] [INFO ] Implicit Places using invariants in 677 ms returned []
[2023-04-07 05:14:06] [INFO ] Invariant cache hit.
[2023-04-07 05:14:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:07] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
[2023-04-07 05:14:07] [INFO ] Invariant cache hit.
[2023-04-07 05:14:07] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/505 places, 908/1845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2453 ms. Remains : 384/505 places, 908/1845 transitions.
Support contains 47 out of 384 places after structural reductions.
[2023-04-07 05:14:08] [INFO ] Flatten gal took : 89 ms
[2023-04-07 05:14:08] [INFO ] Flatten gal took : 56 ms
[2023-04-07 05:14:08] [INFO ] Input system was already deterministic with 908 transitions.
Support contains 46 out of 384 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 35) seen :7
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-04-07 05:14:08] [INFO ] Invariant cache hit.
[2023-04-07 05:14:09] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-04-07 05:14:09] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 12 ms returned sat
[2023-04-07 05:14:10] [INFO ] After 985ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:22
[2023-04-07 05:14:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-04-07 05:14:10] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 12 ms returned sat
[2023-04-07 05:14:12] [INFO ] After 2144ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :21
[2023-04-07 05:14:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:14] [INFO ] After 1774ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :2 sat :21
[2023-04-07 05:14:16] [INFO ] After 3725ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :21
Attempting to minimize the solution found.
Minimization took 1586 ms.
[2023-04-07 05:14:17] [INFO ] After 7843ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :21
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 3 properties in 155 ms.
Support contains 29 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 384 transition count 837
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 313 transition count 837
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 149 place count 306 transition count 734
Iterating global reduction 0 with 7 rules applied. Total rules applied 156 place count 306 transition count 734
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 158 place count 305 transition count 733
Applied a total of 158 rules in 68 ms. Remains 305 /384 variables (removed 79) and now considering 733/908 (removed 175) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 305/384 places, 733/908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 733 rows 305 cols
[2023-04-07 05:14:18] [INFO ] Computed 21 invariants in 13 ms
[2023-04-07 05:14:18] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 05:14:18] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-07 05:14:19] [INFO ] After 630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 05:14:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 05:14:19] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 11 ms returned sat
[2023-04-07 05:14:20] [INFO ] After 1041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 05:14:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:21] [INFO ] After 1031ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 05:14:22] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 1 ms to minimize.
[2023-04-07 05:14:22] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 1 ms to minimize.
[2023-04-07 05:14:22] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 1 ms to minimize.
[2023-04-07 05:14:22] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 1 ms to minimize.
[2023-04-07 05:14:23] [INFO ] Deduced a trap composed of 170 places in 130 ms of which 1 ms to minimize.
[2023-04-07 05:14:23] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 1 ms to minimize.
[2023-04-07 05:14:23] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2023-04-07 05:14:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1292 ms
[2023-04-07 05:14:23] [INFO ] After 3404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1100 ms.
[2023-04-07 05:14:24] [INFO ] After 5755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 30 ms.
Support contains 23 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 733/733 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 302 transition count 682
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 302 transition count 682
Applied a total of 6 rules in 30 ms. Remains 302 /305 variables (removed 3) and now considering 682/733 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 302/305 places, 682/733 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 682 rows 302 cols
[2023-04-07 05:14:25] [INFO ] Computed 21 invariants in 8 ms
[2023-04-07 05:14:25] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-04-07 05:14:25] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 14 ms returned sat
[2023-04-07 05:14:26] [INFO ] After 690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 05:14:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-04-07 05:14:26] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 14 ms returned sat
[2023-04-07 05:14:27] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 05:14:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:27] [INFO ] After 467ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 05:14:28] [INFO ] After 977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 396 ms.
[2023-04-07 05:14:28] [INFO ] After 2156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 57 ms.
Support contains 15 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 682/682 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 298 transition count 614
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 298 transition count 614
Applied a total of 8 rules in 23 ms. Remains 298 /302 variables (removed 4) and now considering 614/682 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 298/302 places, 614/682 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 614 rows 298 cols
[2023-04-07 05:14:29] [INFO ] Computed 21 invariants in 12 ms
[2023-04-07 05:14:29] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 05:14:29] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 14 ms returned sat
[2023-04-07 05:14:29] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 05:14:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 05:14:29] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 25 ms returned sat
[2023-04-07 05:14:30] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 05:14:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:30] [INFO ] After 316ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 05:14:30] [INFO ] After 645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 323 ms.
[2023-04-07 05:14:31] [INFO ] After 1559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 27 ms.
Support contains 14 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 614/614 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 297 transition count 597
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 297 transition count 597
Applied a total of 2 rules in 17 ms. Remains 297 /298 variables (removed 1) and now considering 597/614 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 297/298 places, 597/614 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 597 rows 297 cols
[2023-04-07 05:14:31] [INFO ] Computed 21 invariants in 8 ms
[2023-04-07 05:14:31] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 05:14:31] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 9 ms returned sat
[2023-04-07 05:14:32] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 05:14:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 05:14:32] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 05:14:32] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 05:14:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:33] [INFO ] After 317ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 05:14:33] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-04-07 05:14:33] [INFO ] After 1505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 7 ms.
Support contains 13 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 597/597 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 296 transition count 580
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 296 transition count 580
Applied a total of 2 rules in 19 ms. Remains 296 /297 variables (removed 1) and now considering 580/597 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 296/297 places, 580/597 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 580 rows 296 cols
[2023-04-07 05:14:34] [INFO ] Computed 21 invariants in 11 ms
[2023-04-07 05:14:34] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 05:14:34] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 12 ms returned sat
[2023-04-07 05:14:34] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 05:14:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 05:14:34] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 17 ms returned sat
[2023-04-07 05:14:35] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 05:14:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:35] [INFO ] After 229ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 05:14:35] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-04-07 05:14:35] [INFO ] After 1132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 21 ms.
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 580/580 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 295 transition count 563
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 295 transition count 563
Applied a total of 2 rules in 16 ms. Remains 295 /296 variables (removed 1) and now considering 563/580 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 295/296 places, 563/580 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 399568 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 399568 steps, saw 278060 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 563 rows 295 cols
[2023-04-07 05:14:39] [INFO ] Computed 21 invariants in 8 ms
[2023-04-07 05:14:39] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 05:14:39] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 12 ms returned sat
[2023-04-07 05:14:39] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:14:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 05:14:39] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-07 05:14:39] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:14:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:40] [INFO ] After 130ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 05:14:40] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-07 05:14:40] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 563/563 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 292 transition count 512
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 292 transition count 512
Applied a total of 6 rules in 15 ms. Remains 292 /295 variables (removed 3) and now considering 512/563 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 292/295 places, 512/563 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 872430 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :{1=1}
Probabilistic random walk after 872430 steps, saw 613260 distinct states, run finished after 3002 ms. (steps per millisecond=290 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 512 rows 292 cols
[2023-04-07 05:14:43] [INFO ] Computed 21 invariants in 10 ms
[2023-04-07 05:14:43] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 05:14:43] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-07 05:14:43] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:14:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 05:14:43] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 9 ms returned sat
[2023-04-07 05:14:43] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:14:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:43] [INFO ] After 73ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:14:44] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-07 05:14:44] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 512/512 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 291 transition count 495
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 291 transition count 495
Applied a total of 2 rules in 17 ms. Remains 291 /292 variables (removed 1) and now considering 495/512 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 291/292 places, 495/512 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1152085 steps, run timeout after 3002 ms. (steps per millisecond=383 ) properties seen :{}
Probabilistic random walk after 1152085 steps, saw 801738 distinct states, run finished after 3002 ms. (steps per millisecond=383 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 495 rows 291 cols
[2023-04-07 05:14:47] [INFO ] Computed 21 invariants in 6 ms
[2023-04-07 05:14:47] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 05:14:47] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 12 ms returned sat
[2023-04-07 05:14:47] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:14:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 05:14:47] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 12 ms returned sat
[2023-04-07 05:14:47] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:14:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:47] [INFO ] After 73ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:14:47] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-04-07 05:14:47] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 495/495 transitions.
Applied a total of 0 rules in 21 ms. Remains 291 /291 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 291/291 places, 495/495 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 495/495 transitions.
Applied a total of 0 rules in 11 ms. Remains 291 /291 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2023-04-07 05:14:47] [INFO ] Invariant cache hit.
[2023-04-07 05:14:48] [INFO ] Implicit Places using invariants in 245 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 247 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/291 places, 495/495 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 290 transition count 415
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 210 transition count 415
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 210 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 209 transition count 414
Applied a total of 162 rules in 16 ms. Remains 209 /290 variables (removed 81) and now considering 414/495 (removed 81) transitions.
// Phase 1: matrix 414 rows 209 cols
[2023-04-07 05:14:48] [INFO ] Computed 20 invariants in 5 ms
[2023-04-07 05:14:48] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-04-07 05:14:48] [INFO ] Invariant cache hit.
[2023-04-07 05:14:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:48] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/291 places, 414/495 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 934 ms. Remains : 209/291 places, 414/495 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1254722 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :{}
Probabilistic random walk after 1254722 steps, saw 839369 distinct states, run finished after 3001 ms. (steps per millisecond=418 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:14:51] [INFO ] Invariant cache hit.
[2023-04-07 05:14:51] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-04-07 05:14:51] [INFO ] [Real]Absence check using 10 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 05:14:51] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:14:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-04-07 05:14:52] [INFO ] [Nat]Absence check using 10 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 05:14:52] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:14:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:52] [INFO ] After 54ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:14:52] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 05:14:52] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 9 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 209/209 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 7 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2023-04-07 05:14:52] [INFO ] Invariant cache hit.
[2023-04-07 05:14:52] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-04-07 05:14:52] [INFO ] Invariant cache hit.
[2023-04-07 05:14:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:52] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-04-07 05:14:52] [INFO ] Redundant transitions in 29 ms returned []
[2023-04-07 05:14:52] [INFO ] Invariant cache hit.
[2023-04-07 05:14:53] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 892 ms. Remains : 209/209 places, 414/414 transitions.
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 81 Pre rules applied. Total rules applied 0 place count 209 transition count 333
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 128 transition count 333
Applied a total of 162 rules in 13 ms. Remains 128 /209 variables (removed 81) and now considering 333/414 (removed 81) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 333 rows 128 cols
[2023-04-07 05:14:53] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 05:14:53] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 05:14:53] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 05:14:53] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:14:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 05:14:53] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 05:14:53] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:14:53] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-07 05:14:53] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA Anderson-PT-09-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-09-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Anderson-PT-09-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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) U (F((F(p3)&&p2))&&p1))))'
Support contains 6 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 9 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 05:14:53] [INFO ] Computed 21 invariants in 8 ms
[2023-04-07 05:14:54] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-04-07 05:14:54] [INFO ] Invariant cache hit.
[2023-04-07 05:14:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:55] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2023-04-07 05:14:55] [INFO ] Invariant cache hit.
[2023-04-07 05:14:55] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/384 places, 583/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1704 ms. Remains : 363/384 places, 583/908 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 749 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p2) (NOT p1) (NOT p3)), true, (NOT p0), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s303 1)), p0:(AND (EQ s21 1) (EQ s37 1)), p2:(AND (EQ s10 1) (EQ s35 1)), p3:(AND (EQ s0 1) (EQ s303 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Anderson-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLFireability-00 finished in 2517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 166 place count 290 transition count 494
Iterating global reduction 0 with 22 rules applied. Total rules applied 188 place count 290 transition count 494
Applied a total of 188 rules in 31 ms. Remains 290 /384 variables (removed 94) and now considering 494/908 (removed 414) transitions.
// Phase 1: matrix 494 rows 290 cols
[2023-04-07 05:14:56] [INFO ] Computed 21 invariants in 4 ms
[2023-04-07 05:14:56] [INFO ] Implicit Places using invariants in 251 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/384 places, 494/908 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 12 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
// Phase 1: matrix 414 rows 209 cols
[2023-04-07 05:14:56] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 05:14:56] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-04-07 05:14:56] [INFO ] Invariant cache hit.
[2023-04-07 05:14:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:57] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/384 places, 414/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 898 ms. Remains : 209/384 places, 414/908 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : Anderson-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 240 ms.
Product exploration explored 100000 steps with 0 reset in 322 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16360 steps, run visited all 1 properties in 36 ms. (steps per millisecond=454 )
Probabilistic random walk after 16360 steps, saw 12736 distinct states, run finished after 36 ms. (steps per millisecond=454 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[p0]
Stuttering acceptance computed with spot in 29 ms :[p0]
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 19 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2023-04-07 05:14:58] [INFO ] Invariant cache hit.
[2023-04-07 05:14:58] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-04-07 05:14:58] [INFO ] Invariant cache hit.
[2023-04-07 05:14:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:58] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2023-04-07 05:14:58] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 05:14:58] [INFO ] Invariant cache hit.
[2023-04-07 05:14:59] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 852 ms. Remains : 209/209 places, 414/414 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished Best-First random walk after 4338 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1084 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 141 ms.
Built C files in :
/tmp/ltsmin17197715156676984758
[2023-04-07 05:14:59] [INFO ] Computing symmetric may disable matrix : 414 transitions.
[2023-04-07 05:14:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:14:59] [INFO ] Computing symmetric may enable matrix : 414 transitions.
[2023-04-07 05:14:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:14:59] [INFO ] Computing Do-Not-Accords matrix : 414 transitions.
[2023-04-07 05:14:59] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:14:59] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17197715156676984758
Running compilation step : cd /tmp/ltsmin17197715156676984758;'/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'
Compilation finished in 1349 ms.
Running link step : cd /tmp/ltsmin17197715156676984758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17197715156676984758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6893316559190395695.hoa' '--buchi-type=spotba'
LTSmin run took 4683 ms.
FORMULA Anderson-PT-09-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-09-LTLFireability-02 finished in 9565 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(p0) U X(p1)))'
Support contains 6 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 364 transition count 600
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 364 transition count 600
Applied a total of 40 rules in 8 ms. Remains 364 /384 variables (removed 20) and now considering 600/908 (removed 308) transitions.
// Phase 1: matrix 600 rows 364 cols
[2023-04-07 05:15:05] [INFO ] Computed 21 invariants in 8 ms
[2023-04-07 05:15:06] [INFO ] Implicit Places using invariants in 279 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 280 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 363/384 places, 600/908 transitions.
Applied a total of 0 rules in 3 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 292 ms. Remains : 363/384 places, 600/908 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NOT (AND (EQ s24 1) (EQ s29 1))) (AND (EQ s10 1) (EQ s31 1))), p1:(AND (EQ s16 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 170 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)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 91 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 600 rows 363 cols
[2023-04-07 05:15:07] [INFO ] Computed 20 invariants in 8 ms
[2023-04-07 05:15:07] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 05:15:07] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 05:15:07] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:15:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 05:15:07] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 05:15:07] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:15:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:07] [INFO ] After 140ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:15:07] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-04-07 05:15:07] [INFO ] After 574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 600/600 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 363 transition count 521
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 284 transition count 521
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 158 place count 284 transition count 449
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 302 place count 212 transition count 449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 303 place count 211 transition count 432
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 211 transition count 432
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 211 transition count 430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 308 place count 209 transition count 430
Applied a total of 308 rules in 20 ms. Remains 209 /363 variables (removed 154) and now considering 430/600 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 209/363 places, 430/600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 40429 steps, run visited all 1 properties in 85 ms. (steps per millisecond=475 )
Probabilistic random walk after 40429 steps, saw 29758 distinct states, run finished after 86 ms. (steps per millisecond=470 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 106 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-03 finished in 2364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&(p2 U p0)&&F(p3)))))'
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 164 place count 292 transition count 528
Iterating global reduction 0 with 20 rules applied. Total rules applied 184 place count 292 transition count 528
Applied a total of 184 rules in 17 ms. Remains 292 /384 variables (removed 92) and now considering 528/908 (removed 380) transitions.
// Phase 1: matrix 528 rows 292 cols
[2023-04-07 05:15:08] [INFO ] Computed 21 invariants in 5 ms
[2023-04-07 05:15:08] [INFO ] Implicit Places using invariants in 250 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 254 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/384 places, 528/908 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 291 transition count 450
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 213 transition count 450
Applied a total of 156 rules in 9 ms. Remains 213 /291 variables (removed 78) and now considering 450/528 (removed 78) transitions.
// Phase 1: matrix 450 rows 213 cols
[2023-04-07 05:15:08] [INFO ] Computed 20 invariants in 6 ms
[2023-04-07 05:15:08] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-04-07 05:15:08] [INFO ] Invariant cache hit.
[2023-04-07 05:15:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:09] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 213/384 places, 450/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 949 ms. Remains : 213/384 places, 450/908 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s22 0) (EQ s30 0) (AND (EQ s11 1) (EQ s30 1))), p0:(AND (EQ s21 1) (EQ s28 1)), p2:(AND (EQ s23 1) (EQ s38 1)), p3:(AND (EQ s22 1) (EQ s30 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 164 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-04 finished in 1247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 362 transition count 566
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 362 transition count 566
Applied a total of 44 rules in 8 ms. Remains 362 /384 variables (removed 22) and now considering 566/908 (removed 342) transitions.
// Phase 1: matrix 566 rows 362 cols
[2023-04-07 05:15:09] [INFO ] Computed 21 invariants in 7 ms
[2023-04-07 05:15:09] [INFO ] Implicit Places using invariants in 256 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 257 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/384 places, 566/908 transitions.
Applied a total of 0 rules in 3 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 268 ms. Remains : 361/384 places, 566/908 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Anderson-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s143 1)), p1:(AND (EQ s15 1) (EQ s31 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 32 reset in 150 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-05 finished in 582 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)))'
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 567
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 567
Applied a total of 42 rules in 11 ms. Remains 363 /384 variables (removed 21) and now considering 567/908 (removed 341) transitions.
// Phase 1: matrix 567 rows 363 cols
[2023-04-07 05:15:10] [INFO ] Computed 21 invariants in 3 ms
[2023-04-07 05:15:10] [INFO ] Implicit Places using invariants in 245 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 247 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 567/908 transitions.
Applied a total of 0 rules in 3 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 262 ms. Remains : 362/384 places, 567/908 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s46 1) (EQ s22 0) (EQ s29 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 125 ms.
Product exploration explored 100000 steps with 0 reset in 156 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 129806 steps, run visited all 1 properties in 310 ms. (steps per millisecond=418 )
Probabilistic random walk after 129806 steps, saw 94362 distinct states, run finished after 311 ms. (steps per millisecond=417 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-06 finished in 1501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((!p0&&X(!p0))) U (p1 U p2)))))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 13 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 05:15:11] [INFO ] Computed 21 invariants in 7 ms
[2023-04-07 05:15:11] [INFO ] Implicit Places using invariants in 260 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 263 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 583/908 transitions.
Applied a total of 0 rules in 3 ms. Remains 362 /362 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 279 ms. Remains : 362/384 places, 583/908 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s21 1) (EQ s28 1)), p1:(OR (AND (EQ s21 1) (EQ s28 1)) (AND (EQ s14 1) (EQ s32 1))), p0:(AND (EQ s14 1) (EQ s32 1))], nbAcceptance=1, 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 22299 reset in 251 ms.
Product exploration explored 100000 steps with 22296 reset in 258 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 212 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 583 rows 362 cols
[2023-04-07 05:15:13] [INFO ] Computed 20 invariants in 5 ms
[2023-04-07 05:15:13] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F p2), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 22 factoid took 809 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p2))]
[2023-04-07 05:15:14] [INFO ] Invariant cache hit.
[2023-04-07 05:15:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F p2), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 22 factoid took 840 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-07 finished in 4125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p1)||p0)))&&(!p2 U (p3||G(!p2)))))'
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 165 place count 291 transition count 511
Iterating global reduction 0 with 21 rules applied. Total rules applied 186 place count 291 transition count 511
Applied a total of 186 rules in 24 ms. Remains 291 /384 variables (removed 93) and now considering 511/908 (removed 397) transitions.
// Phase 1: matrix 511 rows 291 cols
[2023-04-07 05:15:15] [INFO ] Computed 21 invariants in 7 ms
[2023-04-07 05:15:15] [INFO ] Implicit Places using invariants in 244 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 245 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/384 places, 511/908 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 290 transition count 432
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 211 transition count 432
Applied a total of 158 rules in 8 ms. Remains 211 /290 variables (removed 79) and now considering 432/511 (removed 79) transitions.
// Phase 1: matrix 432 rows 211 cols
[2023-04-07 05:15:15] [INFO ] Computed 20 invariants in 5 ms
[2023-04-07 05:15:16] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-04-07 05:15:16] [INFO ] Invariant cache hit.
[2023-04-07 05:15:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:16] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/384 places, 432/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 908 ms. Remains : 211/384 places, 432/908 transitions.
Stuttering acceptance computed with spot in 462 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), true, (AND (NOT p0) (NOT p1)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s21 1) (EQ s91 1))) (NOT (AND (EQ s20 1) (EQ s100 1)))), p2:(AND (EQ s20 1) (EQ s100 1)), p0:(OR (NEQ s10 1) (NEQ s31 1)), p1:(OR (N...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 190 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 p3 (NOT p2) p0 p1), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 71 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 05:15:17] [INFO ] Invariant cache hit.
[2023-04-07 05:15:17] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 05:15:17] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 05:15:17] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:15:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-07 05:15:17] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 05:15:17] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:15:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:18] [INFO ] After 47ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:15:18] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-04-07 05:15:18] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 432/432 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 209 transition count 430
Applied a total of 4 rules in 14 ms. Remains 209 /211 variables (removed 2) and now considering 430/432 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 209/211 places, 430/432 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished Best-First random walk after 7006 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1401 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 211 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-04-07 05:15:18] [INFO ] Invariant cache hit.
[2023-04-07 05:15:18] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-04-07 05:15:18] [INFO ] Invariant cache hit.
[2023-04-07 05:15:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:19] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-04-07 05:15:19] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 05:15:19] [INFO ] Invariant cache hit.
[2023-04-07 05:15:19] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 888 ms. Remains : 211/211 places, 432/432 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Finished Best-First random walk after 364 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=364 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 158 ms.
Built C files in :
/tmp/ltsmin4493901008470696374
[2023-04-07 05:15:20] [INFO ] Computing symmetric may disable matrix : 432 transitions.
[2023-04-07 05:15:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:15:20] [INFO ] Computing symmetric may enable matrix : 432 transitions.
[2023-04-07 05:15:20] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:15:20] [INFO ] Computing Do-Not-Accords matrix : 432 transitions.
[2023-04-07 05:15:20] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:15:20] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4493901008470696374
Running compilation step : cd /tmp/ltsmin4493901008470696374;'/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'
Compilation finished in 863 ms.
Running link step : cd /tmp/ltsmin4493901008470696374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4493901008470696374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5982746607381551804.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 11 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-04-07 05:15:35] [INFO ] Invariant cache hit.
[2023-04-07 05:15:35] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-04-07 05:15:35] [INFO ] Invariant cache hit.
[2023-04-07 05:15:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:36] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2023-04-07 05:15:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 05:15:36] [INFO ] Invariant cache hit.
[2023-04-07 05:15:36] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 935 ms. Remains : 211/211 places, 432/432 transitions.
Built C files in :
/tmp/ltsmin4457960146599517675
[2023-04-07 05:15:36] [INFO ] Computing symmetric may disable matrix : 432 transitions.
[2023-04-07 05:15:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:15:36] [INFO ] Computing symmetric may enable matrix : 432 transitions.
[2023-04-07 05:15:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:15:36] [INFO ] Computing Do-Not-Accords matrix : 432 transitions.
[2023-04-07 05:15:36] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:15:36] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4457960146599517675
Running compilation step : cd /tmp/ltsmin4457960146599517675;'/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'
Compilation finished in 2169 ms.
Running link step : cd /tmp/ltsmin4457960146599517675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4457960146599517675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15945848878543888633.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 05:15:51] [INFO ] Flatten gal took : 25 ms
[2023-04-07 05:15:51] [INFO ] Flatten gal took : 24 ms
[2023-04-07 05:15:52] [INFO ] Time to serialize gal into /tmp/LTL1605796480136193431.gal : 962 ms
[2023-04-07 05:15:52] [INFO ] Time to serialize properties into /tmp/LTL4682856971578592044.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1605796480136193431.gal' '-t' 'CGAL' '-hoa' '/tmp/aut348975920810279891.hoa' '-atoms' '/tmp/LTL4682856971578592044.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL4682856971578592044.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut348975920810279891.hoa
Detected timeout of ITS tools.
[2023-04-07 05:16:07] [INFO ] Flatten gal took : 24 ms
[2023-04-07 05:16:07] [INFO ] Flatten gal took : 19 ms
[2023-04-07 05:16:07] [INFO ] Time to serialize gal into /tmp/LTL11688653265284052857.gal : 4 ms
[2023-04-07 05:16:07] [INFO ] Time to serialize properties into /tmp/LTL523477321184596269.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/LTL11688653265284052857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL523477321184596269.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(G(("((next_1!=1)||(ncs_2_6!=1))")||(F("((next_1!=1)||(ncs_0_3!=1))")))))&&((!("((next_11==1)&&(p1_6_8==1))"))U(("((!((next_12==1...249
Formula 0 simplified : G(F!"((next_1!=1)||(ncs_2_6!=1))" & FG!"((next_1!=1)||(ncs_0_3!=1))") | ("((next_11==1)&&(p1_6_8==1))" M !"((!((next_12==1)&&(p1_5_8...196
Detected timeout of ITS tools.
[2023-04-07 05:16:22] [INFO ] Flatten gal took : 22 ms
[2023-04-07 05:16:22] [INFO ] Applying decomposition
[2023-04-07 05:16:22] [INFO ] Flatten gal took : 16 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/graph11763660926471807561.txt' '-o' '/tmp/graph11763660926471807561.bin' '-w' '/tmp/graph11763660926471807561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11763660926471807561.bin' '-l' '-1' '-v' '-w' '/tmp/graph11763660926471807561.weights' '-q' '0' '-e' '0.001'
[2023-04-07 05:16:22] [INFO ] Decomposing Gal with order
[2023-04-07 05:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:16:22] [INFO ] Removed a total of 775 redundant transitions.
[2023-04-07 05:16:22] [INFO ] Flatten gal took : 78 ms
[2023-04-07 05:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 15 ms.
[2023-04-07 05:16:22] [INFO ] Time to serialize gal into /tmp/LTL8023835201918167905.gal : 5 ms
[2023-04-07 05:16:22] [INFO ] Time to serialize properties into /tmp/LTL8763730443725570343.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8023835201918167905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8763730443725570343.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F(G(("((i4.i0.u4.next_1!=1)||(i4.i0.u14.ncs_2_6!=1))")||(F("((i4.i0.u4.next_1!=1)||(u34.ncs_0_3!=1))")))))&&((!("((i4.i1.u9.next_1...357
Formula 0 simplified : G(F!"((i4.i0.u4.next_1!=1)||(i4.i0.u14.ncs_2_6!=1))" & FG!"((i4.i0.u4.next_1!=1)||(u34.ncs_0_3!=1))") | ("((i4.i1.u9.next_11==1)&&(i...285
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9354254239994992811
[2023-04-07 05:16:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9354254239994992811
Running compilation step : cd /tmp/ltsmin9354254239994992811;'/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'
Compilation finished in 617 ms.
Running link step : cd /tmp/ltsmin9354254239994992811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9354254239994992811;'/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' '(<>([]((<>((LTLAPp1==true))||(LTLAPp0==true))))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-09-LTLFireability-08 finished in 97439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 167 place count 289 transition count 477
Iterating global reduction 0 with 23 rules applied. Total rules applied 190 place count 289 transition count 477
Applied a total of 190 rules in 21 ms. Remains 289 /384 variables (removed 95) and now considering 477/908 (removed 431) transitions.
// Phase 1: matrix 477 rows 289 cols
[2023-04-07 05:16:53] [INFO ] Computed 21 invariants in 4 ms
[2023-04-07 05:16:53] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-04-07 05:16:53] [INFO ] Invariant cache hit.
[2023-04-07 05:16:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:16:54] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2023-04-07 05:16:54] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 05:16:54] [INFO ] Invariant cache hit.
[2023-04-07 05:16:54] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/384 places, 477/908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1349 ms. Remains : 289/384 places, 477/908 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s270 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21 reset in 175 ms.
Product exploration explored 100000 steps with 24 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6709 steps, including 2 resets, run visited all 1 properties in 19 ms. (steps per millisecond=353 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 477/477 transitions.
Applied a total of 0 rules in 13 ms. Remains 289 /289 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2023-04-07 05:16:55] [INFO ] Invariant cache hit.
[2023-04-07 05:16:55] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-04-07 05:16:55] [INFO ] Invariant cache hit.
[2023-04-07 05:16:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:16:56] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2023-04-07 05:16:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 05:16:56] [INFO ] Invariant cache hit.
[2023-04-07 05:16:56] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1243 ms. Remains : 289/289 places, 477/477 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21 reset in 168 ms.
Product exploration explored 100000 steps with 40 reset in 170 ms.
Built C files in :
/tmp/ltsmin10221349585256363637
[2023-04-07 05:16:57] [INFO ] Computing symmetric may disable matrix : 477 transitions.
[2023-04-07 05:16:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:16:57] [INFO ] Computing symmetric may enable matrix : 477 transitions.
[2023-04-07 05:16:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:16:57] [INFO ] Computing Do-Not-Accords matrix : 477 transitions.
[2023-04-07 05:16:57] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:16:57] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10221349585256363637
Running compilation step : cd /tmp/ltsmin10221349585256363637;'/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'
Compilation finished in 980 ms.
Running link step : cd /tmp/ltsmin10221349585256363637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10221349585256363637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7483739847410206206.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 477/477 transitions.
Applied a total of 0 rules in 11 ms. Remains 289 /289 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2023-04-07 05:17:12] [INFO ] Invariant cache hit.
[2023-04-07 05:17:12] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-04-07 05:17:12] [INFO ] Invariant cache hit.
[2023-04-07 05:17:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:17:13] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2023-04-07 05:17:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 05:17:13] [INFO ] Invariant cache hit.
[2023-04-07 05:17:13] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1269 ms. Remains : 289/289 places, 477/477 transitions.
Built C files in :
/tmp/ltsmin5532532216008624477
[2023-04-07 05:17:13] [INFO ] Computing symmetric may disable matrix : 477 transitions.
[2023-04-07 05:17:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:17:13] [INFO ] Computing symmetric may enable matrix : 477 transitions.
[2023-04-07 05:17:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:17:13] [INFO ] Computing Do-Not-Accords matrix : 477 transitions.
[2023-04-07 05:17:13] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:17:13] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5532532216008624477
Running compilation step : cd /tmp/ltsmin5532532216008624477;'/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'
Compilation finished in 1007 ms.
Running link step : cd /tmp/ltsmin5532532216008624477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5532532216008624477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10517684300753766713.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 05:17:28] [INFO ] Flatten gal took : 17 ms
[2023-04-07 05:17:28] [INFO ] Flatten gal took : 16 ms
[2023-04-07 05:17:28] [INFO ] Time to serialize gal into /tmp/LTL6570029920820377868.gal : 4 ms
[2023-04-07 05:17:28] [INFO ] Time to serialize properties into /tmp/LTL8340391359977696237.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/LTL6570029920820377868.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9676796025395368282.hoa' '-atoms' '/tmp/LTL8340391359977696237.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8340391359977696237.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9676796025395368282.hoa
Detected timeout of ITS tools.
[2023-04-07 05:17:44] [INFO ] Flatten gal took : 15 ms
[2023-04-07 05:17:44] [INFO ] Flatten gal took : 15 ms
[2023-04-07 05:17:44] [INFO ] Time to serialize gal into /tmp/LTL13640008046549234550.gal : 3 ms
[2023-04-07 05:17:44] [INFO ] Time to serialize properties into /tmp/LTL15152818409062815715.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13640008046549234550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15152818409062815715.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((slot_F.F.F.F.F.F.F.F.F==0)||(cs_6_8==0))"))))
Formula 0 simplified : FG!"((slot_F.F.F.F.F.F.F.F.F==0)||(cs_6_8==0))"
Detected timeout of ITS tools.
[2023-04-07 05:17:59] [INFO ] Flatten gal took : 14 ms
[2023-04-07 05:17:59] [INFO ] Applying decomposition
[2023-04-07 05:17:59] [INFO ] Flatten gal took : 14 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/graph10786453566012665855.txt' '-o' '/tmp/graph10786453566012665855.bin' '-w' '/tmp/graph10786453566012665855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10786453566012665855.bin' '-l' '-1' '-v' '-w' '/tmp/graph10786453566012665855.weights' '-q' '0' '-e' '0.001'
[2023-04-07 05:17:59] [INFO ] Decomposing Gal with order
[2023-04-07 05:17:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:17:59] [INFO ] Removed a total of 667 redundant transitions.
[2023-04-07 05:17:59] [INFO ] Flatten gal took : 42 ms
[2023-04-07 05:17:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 10 ms.
[2023-04-07 05:17:59] [INFO ] Time to serialize gal into /tmp/LTL13175887265528479702.gal : 4 ms
[2023-04-07 05:17:59] [INFO ] Time to serialize properties into /tmp/LTL5768061783896288214.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/LTL13175887265528479702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5768061783896288214.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u0.slot_F.F.F.F.F.F.F.F.F==0)||(i3.u41.cs_6_8==0))"))))
Formula 0 simplified : FG!"((i0.u0.slot_F.F.F.F.F.F.F.F.F==0)||(i3.u41.cs_6_8==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15843625612296165282
[2023-04-07 05:18:14] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15843625612296165282
Running compilation step : cd /tmp/ltsmin15843625612296165282;'/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'
Compilation finished in 745 ms.
Running link step : cd /tmp/ltsmin15843625612296165282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15843625612296165282;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-09-LTLFireability-09 finished in 96295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 384 transition count 837
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 313 transition count 837
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 163 place count 292 transition count 496
Iterating global reduction 0 with 21 rules applied. Total rules applied 184 place count 292 transition count 496
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 186 place count 291 transition count 495
Applied a total of 186 rules in 23 ms. Remains 291 /384 variables (removed 93) and now considering 495/908 (removed 413) transitions.
// Phase 1: matrix 495 rows 291 cols
[2023-04-07 05:18:29] [INFO ] Computed 21 invariants in 5 ms
[2023-04-07 05:18:29] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-04-07 05:18:29] [INFO ] Invariant cache hit.
[2023-04-07 05:18:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:18:30] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
[2023-04-07 05:18:30] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-07 05:18:30] [INFO ] Invariant cache hit.
[2023-04-07 05:18:30] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/384 places, 495/908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1429 ms. Remains : 291/384 places, 495/908 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (AND (EQ s21 1) (EQ s35 1)) (AND (EQ s0 1) (EQ s286 1)))) (EQ s91 1)), p0:(AND (EQ s21 1) (EQ s35 1) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 175 ms.
Stack based approach found an accepted trace after 138 steps with 0 reset with depth 139 and stack size 139 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-11 finished in 1695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||((p1 U p0) U !p1)))))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 11 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 05:18:31] [INFO ] Computed 21 invariants in 7 ms
[2023-04-07 05:18:31] [INFO ] Implicit Places using invariants in 280 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 281 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 583/908 transitions.
Applied a total of 0 rules in 4 ms. Remains 362 /362 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 297 ms. Remains : 362/384 places, 583/908 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s29 1)), p1:(AND (EQ s24 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Product exploration explored 100000 steps with 50000 reset in 296 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 (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-13 finished in 991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 12 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 05:18:32] [INFO ] Computed 21 invariants in 3 ms
[2023-04-07 05:18:32] [INFO ] Implicit Places using invariants in 317 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 318 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 583/908 transitions.
Applied a total of 0 rules in 3 ms. Remains 362 /362 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 333 ms. Remains : 362/384 places, 583/908 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s20 1) (NEQ s31 1) (AND (EQ s25 1) (EQ s34 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-14 finished in 1000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 166 place count 290 transition count 494
Iterating global reduction 0 with 22 rules applied. Total rules applied 188 place count 290 transition count 494
Applied a total of 188 rules in 20 ms. Remains 290 /384 variables (removed 94) and now considering 494/908 (removed 414) transitions.
// Phase 1: matrix 494 rows 290 cols
[2023-04-07 05:18:33] [INFO ] Computed 21 invariants in 10 ms
[2023-04-07 05:18:33] [INFO ] Implicit Places using invariants in 315 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 316 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/384 places, 494/908 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 6 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
// Phase 1: matrix 414 rows 209 cols
[2023-04-07 05:18:33] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 05:18:33] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-04-07 05:18:33] [INFO ] Invariant cache hit.
[2023-04-07 05:18:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:18:34] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/384 places, 414/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 925 ms. Remains : 209/384 places, 414/908 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-15 finished in 1132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p1)||p0)))&&(!p2 U (p3||G(!p2)))))'
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)))'
[2023-04-07 05:18:34] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10436101230961672000
[2023-04-07 05:18:34] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2023-04-07 05:18:34] [INFO ] Applying decomposition
[2023-04-07 05:18:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:18:34] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2023-04-07 05:18:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:18:34] [INFO ] Flatten gal took : 26 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/graph12539316027465286993.txt' '-o' '/tmp/graph12539316027465286993.bin' '-w' '/tmp/graph12539316027465286993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12539316027465286993.bin' '-l' '-1' '-v' '-w' '/tmp/graph12539316027465286993.weights' '-q' '0' '-e' '0.001'
[2023-04-07 05:18:34] [INFO ] Decomposing Gal with order
[2023-04-07 05:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:18:34] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2023-04-07 05:18:34] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:18:34] [INFO ] Removed a total of 1493 redundant transitions.
[2023-04-07 05:18:34] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10436101230961672000
Running compilation step : cd /tmp/ltsmin10436101230961672000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
[2023-04-07 05:18:34] [INFO ] Flatten gal took : 58 ms
[2023-04-07 05:18:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 15 ms.
[2023-04-07 05:18:34] [INFO ] Time to serialize gal into /tmp/LTLFireability8271590048723635667.gal : 6 ms
[2023-04-07 05:18:34] [INFO ] Time to serialize properties into /tmp/LTLFireability15063471120019308785.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/LTLFireability8271590048723635667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15063471120019308785.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 2 LTL properties
Checking formula 0 : !(((F(G(("((i2.u1.next_1!=1)||(i3.u2.ncs_2_6!=1))")||(F("((i2.u1.next_1!=1)||(i8.u43.ncs_0_3!=1))")))))&&((!("((i2.u5.next_11==1)&&(i2...326
Formula 0 simplified : G(F!"((i2.u1.next_1!=1)||(i3.u2.ncs_2_6!=1))" & FG!"((i2.u1.next_1!=1)||(i8.u43.ncs_0_3!=1))") | ("((i2.u5.next_11==1)&&(i2.u29.p1_6...260
Compilation finished in 2428 ms.
Running link step : cd /tmp/ltsmin10436101230961672000;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10436101230961672000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((<>((LTLAPp1==true))||(LTLAPp0==true))))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-04-07 05:40:04] [INFO ] Applying decomposition
[2023-04-07 05:40:04] [INFO ] Flatten gal took : 81 ms
[2023-04-07 05:40:04] [INFO ] Decomposing Gal with order
[2023-04-07 05:40:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:40:04] [INFO ] Removed a total of 1086 redundant transitions.
[2023-04-07 05:40:04] [INFO ] Flatten gal took : 238 ms
[2023-04-07 05:40:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 291 labels/synchronizations in 41 ms.
[2023-04-07 05:40:04] [INFO ] Time to serialize gal into /tmp/LTLFireability7795866165914542503.gal : 4 ms
[2023-04-07 05:40:04] [INFO ] Time to serialize properties into /tmp/LTLFireability3303137942857018499.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/LTLFireability7795866165914542503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3303137942857018499.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 2 LTL properties
Checking formula 0 : !(((F(G(("((u10.next_1!=1)||(u8.ncs_2_6!=1))")||(F("((u10.next_1!=1)||(u6.ncs_0_3!=1))")))))&&((!("((u10.next_11==1)&&(u3.p1_6_8==1))"...291
Formula 0 simplified : G(F!"((u10.next_1!=1)||(u8.ncs_2_6!=1))" & FG!"((u10.next_1!=1)||(u6.ncs_0_3!=1))") | ("((u10.next_11==1)&&(u3.p1_6_8==1))" M !"((!(...231
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t40, t41, t42, t75, t76, t86, t87, t108, t119, t142, t143, t153, t154, t172, t195...1008
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
14702 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,147.08,2231940,1,0,2.54872e+06,1.37742e+06,2604,3.30298e+06,1572,8.63288e+06,688748
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Anderson-PT-09-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("((u11.slot_F.F.F.F.F.F.F.F.F==0)||(u3.cs_6_8==0))"))))
Formula 1 simplified : FG!"((u11.slot_F.F.F.F.F.F.F.F.F==0)||(u3.cs_6_8==0))"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3232 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,179.405,2231940,1,0,2.54872e+06,1.37742e+06,3978,3.30298e+06,1930,8.63288e+06,8764814
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Anderson-PT-09-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1976706 ms.

BK_STOP 1680846422804

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Anderson-PT-09, 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 r517-tall-167987243300044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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