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.r261-smll-167863536600620.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 Peterson-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536600620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 68K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 323K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 22:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 25 22:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 255K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 225K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K Mar 5 18:23 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 Peterson-PT-4-LTLFireability-00
FORMULA_NAME Peterson-PT-4-LTLFireability-01
FORMULA_NAME Peterson-PT-4-LTLFireability-02
FORMULA_NAME Peterson-PT-4-LTLFireability-03
FORMULA_NAME Peterson-PT-4-LTLFireability-04
FORMULA_NAME Peterson-PT-4-LTLFireability-05
FORMULA_NAME Peterson-PT-4-LTLFireability-06
FORMULA_NAME Peterson-PT-4-LTLFireability-07
FORMULA_NAME Peterson-PT-4-LTLFireability-08
FORMULA_NAME Peterson-PT-4-LTLFireability-09
FORMULA_NAME Peterson-PT-4-LTLFireability-10
FORMULA_NAME Peterson-PT-4-LTLFireability-11
FORMULA_NAME Peterson-PT-4-LTLFireability-12
FORMULA_NAME Peterson-PT-4-LTLFireability-13
FORMULA_NAME Peterson-PT-4-LTLFireability-14
FORMULA_NAME Peterson-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679048734458

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=Peterson-PT-4
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-17 10:25:38] [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-03-17 10:25:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:25:38] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2023-03-17 10:25:38] [INFO ] Transformed 480 places.
[2023-03-17 10:25:38] [INFO ] Transformed 690 transitions.
[2023-03-17 10:25:38] [INFO ] Found NUPN structural information;
[2023-03-17 10:25:38] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2023-03-17 10:25:38] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-4-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 463 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 38 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:25:39] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-17 10:25:39] [INFO ] Computed 19 place invariants in 46 ms
[2023-03-17 10:25:39] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-03-17 10:25:39] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:25:39] [INFO ] Invariant cache hit.
[2023-03-17 10:25:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:25:40] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2023-03-17 10:25:40] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:25:40] [INFO ] Invariant cache hit.
[2023-03-17 10:25:41] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2662 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 463 out of 480 places after structural reductions.
[2023-03-17 10:25:42] [INFO ] Flatten gal took : 184 ms
[2023-03-17 10:25:42] [INFO ] Flatten gal took : 141 ms
[2023-03-17 10:25:43] [INFO ] Input system was already deterministic with 690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 963 ms. (steps per millisecond=10 ) properties (out of 40) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-17 10:25:44] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:25:44] [INFO ] Invariant cache hit.
[2023-03-17 10:25:45] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-17 10:25:45] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-17 10:25:45] [INFO ] After 561ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-17 10:25:45] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:25:46] [INFO ] After 394ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 10:25:46] [INFO ] After 1487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 10:25:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-17 10:25:46] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-17 10:25:47] [INFO ] After 692ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 10:25:47] [INFO ] After 359ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-17 10:25:48] [INFO ] Deduced a trap composed of 14 places in 413 ms of which 13 ms to minimize.
[2023-03-17 10:25:48] [INFO ] Deduced a trap composed of 36 places in 414 ms of which 2 ms to minimize.
[2023-03-17 10:25:49] [INFO ] Deduced a trap composed of 92 places in 444 ms of which 3 ms to minimize.
[2023-03-17 10:25:49] [INFO ] Deduced a trap composed of 93 places in 420 ms of which 3 ms to minimize.
[2023-03-17 10:25:49] [INFO ] Deduced a trap composed of 126 places in 285 ms of which 1 ms to minimize.
[2023-03-17 10:25:50] [INFO ] Deduced a trap composed of 21 places in 348 ms of which 1 ms to minimize.
[2023-03-17 10:25:50] [INFO ] Deduced a trap composed of 13 places in 355 ms of which 1 ms to minimize.
[2023-03-17 10:25:51] [INFO ] Deduced a trap composed of 14 places in 479 ms of which 1 ms to minimize.
[2023-03-17 10:25:51] [INFO ] Deduced a trap composed of 50 places in 379 ms of which 2 ms to minimize.
[2023-03-17 10:25:52] [INFO ] Deduced a trap composed of 65 places in 386 ms of which 1 ms to minimize.
[2023-03-17 10:25:52] [INFO ] Deduced a trap composed of 35 places in 370 ms of which 2 ms to minimize.
[2023-03-17 10:25:52] [INFO ] Deduced a trap composed of 112 places in 400 ms of which 1 ms to minimize.
[2023-03-17 10:25:53] [INFO ] Deduced a trap composed of 43 places in 319 ms of which 1 ms to minimize.
[2023-03-17 10:25:53] [INFO ] Deduced a trap composed of 85 places in 343 ms of which 1 ms to minimize.
[2023-03-17 10:25:54] [INFO ] Deduced a trap composed of 70 places in 384 ms of which 1 ms to minimize.
[2023-03-17 10:25:54] [INFO ] Deduced a trap composed of 87 places in 363 ms of which 2 ms to minimize.
[2023-03-17 10:25:54] [INFO ] Deduced a trap composed of 14 places in 367 ms of which 1 ms to minimize.
[2023-03-17 10:25:55] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 1 ms to minimize.
[2023-03-17 10:25:55] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 1 ms to minimize.
[2023-03-17 10:25:55] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 0 ms to minimize.
[2023-03-17 10:25:56] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 1 ms to minimize.
[2023-03-17 10:25:56] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 8337 ms
[2023-03-17 10:25:56] [INFO ] Deduced a trap composed of 78 places in 319 ms of which 2 ms to minimize.
[2023-03-17 10:25:56] [INFO ] Deduced a trap composed of 77 places in 320 ms of which 1 ms to minimize.
[2023-03-17 10:25:57] [INFO ] Deduced a trap composed of 131 places in 324 ms of which 1 ms to minimize.
[2023-03-17 10:25:57] [INFO ] Deduced a trap composed of 113 places in 287 ms of which 1 ms to minimize.
[2023-03-17 10:25:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1516 ms
[2023-03-17 10:25:58] [INFO ] Deduced a trap composed of 18 places in 377 ms of which 1 ms to minimize.
[2023-03-17 10:25:58] [INFO ] Deduced a trap composed of 18 places in 336 ms of which 1 ms to minimize.
[2023-03-17 10:25:58] [INFO ] Deduced a trap composed of 21 places in 368 ms of which 1 ms to minimize.
[2023-03-17 10:25:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1264 ms
[2023-03-17 10:25:59] [INFO ] Deduced a trap composed of 32 places in 371 ms of which 1 ms to minimize.
[2023-03-17 10:25:59] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 1 ms to minimize.
[2023-03-17 10:26:00] [INFO ] Deduced a trap composed of 80 places in 250 ms of which 1 ms to minimize.
[2023-03-17 10:26:00] [INFO ] Deduced a trap composed of 58 places in 293 ms of which 1 ms to minimize.
[2023-03-17 10:26:00] [INFO ] Deduced a trap composed of 57 places in 260 ms of which 1 ms to minimize.
[2023-03-17 10:26:01] [INFO ] Deduced a trap composed of 58 places in 284 ms of which 1 ms to minimize.
[2023-03-17 10:26:01] [INFO ] Deduced a trap composed of 58 places in 291 ms of which 12 ms to minimize.
[2023-03-17 10:26:01] [INFO ] Deduced a trap composed of 79 places in 290 ms of which 2 ms to minimize.
[2023-03-17 10:26:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2790 ms
[2023-03-17 10:26:02] [INFO ] Deduced a trap composed of 88 places in 276 ms of which 1 ms to minimize.
[2023-03-17 10:26:02] [INFO ] Deduced a trap composed of 88 places in 307 ms of which 6 ms to minimize.
[2023-03-17 10:26:02] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 1 ms to minimize.
[2023-03-17 10:26:03] [INFO ] Deduced a trap composed of 87 places in 265 ms of which 3 ms to minimize.
[2023-03-17 10:26:03] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 1 ms to minimize.
[2023-03-17 10:26:03] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 1 ms to minimize.
[2023-03-17 10:26:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1767 ms
[2023-03-17 10:26:04] [INFO ] Deduced a trap composed of 105 places in 313 ms of which 1 ms to minimize.
[2023-03-17 10:26:04] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 1 ms to minimize.
[2023-03-17 10:26:04] [INFO ] Deduced a trap composed of 80 places in 297 ms of which 0 ms to minimize.
[2023-03-17 10:26:04] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 0 ms to minimize.
[2023-03-17 10:26:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1252 ms
[2023-03-17 10:26:05] [INFO ] After 17636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 441 ms.
[2023-03-17 10:26:05] [INFO ] After 19268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 8 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 480 transition count 500
Reduce places removed 190 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 192 rules applied. Total rules applied 382 place count 290 transition count 498
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 384 place count 288 transition count 398
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 584 place count 188 transition count 398
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 618 place count 171 transition count 381
Applied a total of 618 rules in 94 ms. Remains 171 /480 variables (removed 309) and now considering 381/690 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 171/480 places, 381/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 10:26:06] [INFO ] Flow matrix only has 321 transitions (discarded 60 similar events)
// Phase 1: matrix 321 rows 171 cols
[2023-03-17 10:26:06] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-17 10:26:06] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-17 10:26:06] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-17 10:26:06] [INFO ] After 270ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-17 10:26:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:26:06] [INFO ] After 170ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 10:26:06] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 10:26:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-17 10:26:07] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-17 10:26:07] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 10:26:07] [INFO ] After 156ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 10:26:07] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2023-03-17 10:26:07] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-17 10:26:08] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2023-03-17 10:26:08] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2023-03-17 10:26:08] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2023-03-17 10:26:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 883 ms
[2023-03-17 10:26:08] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 1 ms to minimize.
[2023-03-17 10:26:08] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2023-03-17 10:26:08] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2023-03-17 10:26:09] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2023-03-17 10:26:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 657 ms
[2023-03-17 10:26:09] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2023-03-17 10:26:09] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-17 10:26:09] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2023-03-17 10:26:09] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2023-03-17 10:26:09] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2023-03-17 10:26:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 680 ms
[2023-03-17 10:26:09] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2023-03-17 10:26:10] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2023-03-17 10:26:10] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-03-17 10:26:10] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 1 ms to minimize.
[2023-03-17 10:26:10] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 2 ms to minimize.
[2023-03-17 10:26:10] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2023-03-17 10:26:10] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2023-03-17 10:26:11] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 5 ms to minimize.
[2023-03-17 10:26:11] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2023-03-17 10:26:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1428 ms
[2023-03-17 10:26:11] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2023-03-17 10:26:11] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2023-03-17 10:26:11] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-03-17 10:26:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 508 ms
[2023-03-17 10:26:11] [INFO ] After 4462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-17 10:26:12] [INFO ] After 5114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 44 ms.
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 381/381 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 171 transition count 379
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 169 transition count 379
Applied a total of 4 rules in 40 ms. Remains 169 /171 variables (removed 2) and now considering 379/381 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 169/171 places, 379/381 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 543126 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 543126 steps, saw 90933 distinct states, run finished after 3003 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 10:26:15] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
// Phase 1: matrix 319 rows 169 cols
[2023-03-17 10:26:15] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-17 10:26:15] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 10:26:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-17 10:26:15] [INFO ] After 249ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-17 10:26:15] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:26:16] [INFO ] After 159ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 10:26:16] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 10:26:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-17 10:26:16] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-17 10:26:16] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 10:26:16] [INFO ] After 146ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 10:26:16] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2023-03-17 10:26:16] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-17 10:26:17] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-17 10:26:17] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 1 ms to minimize.
[2023-03-17 10:26:17] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2023-03-17 10:26:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 803 ms
[2023-03-17 10:26:17] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2023-03-17 10:26:17] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2023-03-17 10:26:17] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2023-03-17 10:26:18] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-17 10:26:18] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2023-03-17 10:26:18] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-17 10:26:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 887 ms
[2023-03-17 10:26:18] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2023-03-17 10:26:18] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-03-17 10:26:18] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 0 ms to minimize.
[2023-03-17 10:26:18] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2023-03-17 10:26:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 427 ms
[2023-03-17 10:26:19] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2023-03-17 10:26:19] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2023-03-17 10:26:19] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2023-03-17 10:26:19] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2023-03-17 10:26:19] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2023-03-17 10:26:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 607 ms
[2023-03-17 10:26:19] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2023-03-17 10:26:19] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2023-03-17 10:26:19] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2023-03-17 10:26:20] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 1 ms to minimize.
[2023-03-17 10:26:20] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2023-03-17 10:26:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 751 ms
[2023-03-17 10:26:20] [INFO ] After 3754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-17 10:26:20] [INFO ] After 4409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 29 ms.
Support contains 7 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 379/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 169 /169 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 169/169 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 379/379 transitions.
Applied a total of 0 rules in 12 ms. Remains 169 /169 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2023-03-17 10:26:20] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-17 10:26:20] [INFO ] Invariant cache hit.
[2023-03-17 10:26:20] [INFO ] Implicit Places using invariants in 225 ms returned [159, 160, 161, 162, 163]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 228 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/169 places, 379/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 254 ms. Remains : 164/169 places, 379/379 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 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 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 513720 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 513720 steps, saw 86041 distinct states, run finished after 3002 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 10:26:24] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
// Phase 1: matrix 319 rows 164 cols
[2023-03-17 10:26:24] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-17 10:26:24] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-17 10:26:24] [INFO ] After 177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-17 10:26:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:26:24] [INFO ] After 104ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 10:26:24] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 10:26:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 10:26:25] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 10:26:25] [INFO ] After 118ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 10:26:25] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2023-03-17 10:26:25] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-17 10:26:25] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 1 ms to minimize.
[2023-03-17 10:26:25] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 1 ms to minimize.
[2023-03-17 10:26:26] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-17 10:26:26] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2023-03-17 10:26:26] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2023-03-17 10:26:26] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2023-03-17 10:26:26] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2023-03-17 10:26:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1391 ms
[2023-03-17 10:26:26] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2023-03-17 10:26:27] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 1 ms to minimize.
[2023-03-17 10:26:27] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2023-03-17 10:26:27] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2023-03-17 10:26:27] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-03-17 10:26:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 704 ms
[2023-03-17 10:26:27] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2023-03-17 10:26:27] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2023-03-17 10:26:27] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2023-03-17 10:26:27] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2023-03-17 10:26:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 500 ms
[2023-03-17 10:26:28] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2023-03-17 10:26:28] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2023-03-17 10:26:28] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2023-03-17 10:26:28] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2023-03-17 10:26:28] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2023-03-17 10:26:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 654 ms
[2023-03-17 10:26:28] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2023-03-17 10:26:28] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2023-03-17 10:26:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2023-03-17 10:26:29] [INFO ] After 3830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-17 10:26:29] [INFO ] After 4380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 50 ms.
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 379/379 transitions.
Applied a total of 0 rules in 30 ms. Remains 164 /164 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 164/164 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 379/379 transitions.
Applied a total of 0 rules in 17 ms. Remains 164 /164 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2023-03-17 10:26:29] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-17 10:26:29] [INFO ] Invariant cache hit.
[2023-03-17 10:26:29] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-17 10:26:29] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-17 10:26:29] [INFO ] Invariant cache hit.
[2023-03-17 10:26:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:26:30] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
[2023-03-17 10:26:30] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-17 10:26:30] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-17 10:26:30] [INFO ] Invariant cache hit.
[2023-03-17 10:26:30] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1539 ms. Remains : 164/164 places, 379/379 transitions.
Graph (trivial) has 276 edges and 164 vertex of which 97 / 164 are part of one of the 20 SCC in 7 ms
Free SCC test removed 77 places
Drop transitions removed 154 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 228 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 1 place count 87 transition count 137
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 73 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 71 transition count 135
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 53 place count 59 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 30 edges and 59 vertex of which 22 / 59 are part of one of the 4 SCC in 0 ms
Free SCC test removed 18 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 57 place count 41 transition count 143
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (trivial) has 40 edges and 39 vertex of which 8 / 39 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 25 rules applied. Total rules applied 82 place count 35 transition count 121
Drop transitions removed 8 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 118 place count 35 transition count 85
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 35 transition count 77
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 35 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 33 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 33 transition count 75
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 33 transition count 74
Applied a total of 134 rules in 55 ms. Remains 33 /164 variables (removed 131) and now considering 74/379 (removed 305) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 74 rows 33 cols
[2023-03-17 10:26:30] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-17 10:26:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 10:26:31] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-17 10:26:31] [INFO ] After 85ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 10:26:31] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 10:26:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 10:26:31] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 10:26:31] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-17 10:26:31] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA Peterson-PT-4-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 17 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:26:32] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-17 10:26:32] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-17 10:26:32] [INFO ] Implicit Places using invariants in 266 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 269 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 19 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 307 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 442 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (OR (AND (EQ s333 1) (EQ s420 1)) (AND (EQ s337 1) (EQ s469 1)) (AND (EQ s345 1) (EQ s417 1)) (AND (EQ s340 1) (EQ s419 1)) (AND (EQ s299 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20410 reset in 931 ms.
Product exploration explored 100000 steps with 20389 reset in 766 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 p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 244 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 3 factoid took 310 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-17 10:26:35] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-17 10:26:35] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-17 10:26:37] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-17 10:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:26:37] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2023-03-17 10:26:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:26:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-17 10:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:26:39] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-17 10:26:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:26:39] [INFO ] [Nat]Added 116 Read/Feed constraints in 88 ms returned sat
[2023-03-17 10:26:40] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 2 ms to minimize.
[2023-03-17 10:26:40] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 0 ms to minimize.
[2023-03-17 10:26:41] [INFO ] Deduced a trap composed of 36 places in 333 ms of which 1 ms to minimize.
[2023-03-17 10:26:41] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 1 ms to minimize.
[2023-03-17 10:26:41] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 1 ms to minimize.
[2023-03-17 10:26:42] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 1 ms to minimize.
[2023-03-17 10:26:42] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 1 ms to minimize.
[2023-03-17 10:26:42] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 1 ms to minimize.
[2023-03-17 10:26:43] [INFO ] Deduced a trap composed of 35 places in 276 ms of which 1 ms to minimize.
[2023-03-17 10:26:43] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 1 ms to minimize.
[2023-03-17 10:26:43] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2023-03-17 10:26:44] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 1 ms to minimize.
[2023-03-17 10:26:44] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 1 ms to minimize.
[2023-03-17 10:26:44] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 1 ms to minimize.
[2023-03-17 10:26:44] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 0 ms to minimize.
[2023-03-17 10:26:45] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 2 ms to minimize.
[2023-03-17 10:26:45] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 1 ms to minimize.
[2023-03-17 10:26:45] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 1 ms to minimize.
[2023-03-17 10:26:45] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 0 ms to minimize.
[2023-03-17 10:26:45] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5958 ms
[2023-03-17 10:26:45] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 71 ms.
[2023-03-17 10:26:50] [INFO ] Added : 324 causal constraints over 66 iterations in 5055 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 14 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:26:50] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:26:50] [INFO ] Invariant cache hit.
[2023-03-17 10:26:51] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-17 10:26:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:26:51] [INFO ] Invariant cache hit.
[2023-03-17 10:26:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:26:52] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2023-03-17 10:26:52] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:26:52] [INFO ] Invariant cache hit.
[2023-03-17 10:26:52] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1869 ms. Remains : 475/475 places, 690/690 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 p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-17 10:26:53] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:26:53] [INFO ] Invariant cache hit.
[2023-03-17 10:26:54] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-17 10:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:26:55] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2023-03-17 10:26:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:26:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 31 ms returned sat
[2023-03-17 10:26:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:26:58] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2023-03-17 10:26:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:26:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 61 ms returned sat
[2023-03-17 10:26:58] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 1 ms to minimize.
[2023-03-17 10:26:58] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 1 ms to minimize.
[2023-03-17 10:26:58] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2023-03-17 10:26:59] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 0 ms to minimize.
[2023-03-17 10:26:59] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 0 ms to minimize.
[2023-03-17 10:26:59] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 0 ms to minimize.
[2023-03-17 10:26:59] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 0 ms to minimize.
[2023-03-17 10:27:00] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 1 ms to minimize.
[2023-03-17 10:27:00] [INFO ] Deduced a trap composed of 58 places in 258 ms of which 1 ms to minimize.
[2023-03-17 10:27:00] [INFO ] Deduced a trap composed of 80 places in 248 ms of which 1 ms to minimize.
[2023-03-17 10:27:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2749 ms
[2023-03-17 10:27:00] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 50 ms.
[2023-03-17 10:27:05] [INFO ] Added : 394 causal constraints over 81 iterations in 4845 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20455 reset in 496 ms.
Product exploration explored 100000 steps with 20460 reset in 510 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 475 transition count 690
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 85 Pre rules applied. Total rules applied 120 place count 475 transition count 738
Deduced a syphon composed of 205 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 205 place count 475 transition count 738
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 273 place count 407 transition count 670
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 341 place count 407 transition count 670
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 237 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 441 place count 407 transition count 670
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 525 place count 323 transition count 586
Deduced a syphon composed of 153 places in 1 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 609 place count 323 transition count 586
Deduced a syphon composed of 153 places in 1 ms
Applied a total of 609 rules in 102 ms. Remains 323 /475 variables (removed 152) and now considering 586/690 (removed 104) transitions.
[2023-03-17 10:27:07] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-17 10:27:07] [INFO ] Flow matrix only has 526 transitions (discarded 60 similar events)
// Phase 1: matrix 526 rows 323 cols
[2023-03-17 10:27:07] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-17 10:27:07] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/475 places, 586/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 467 ms. Remains : 323/475 places, 586/690 transitions.
Built C files in :
/tmp/ltsmin4547963745305559661
[2023-03-17 10:27:07] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4547963745305559661
Running compilation step : cd /tmp/ltsmin4547963745305559661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1783 ms.
Running link step : cd /tmp/ltsmin4547963745305559661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin4547963745305559661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11782403731671137699.hoa' '--buchi-type=spotba'
LTSmin run took 550 ms.
FORMULA Peterson-PT-4-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-4-LTLFireability-00 finished in 38143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(G((G(X(p0)) U p1))))&&X(p0)))))'
Support contains 110 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 480 transition count 686
Reduce places removed 4 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 1 with 104 rules applied. Total rules applied 108 place count 476 transition count 586
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 208 place count 376 transition count 586
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 208 place count 376 transition count 566
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 248 place count 356 transition count 566
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 280 place count 340 transition count 550
Applied a total of 280 rules in 56 ms. Remains 340 /480 variables (removed 140) and now considering 550/690 (removed 140) transitions.
[2023-03-17 10:27:10] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
// Phase 1: matrix 490 rows 340 cols
[2023-03-17 10:27:10] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-17 10:27:10] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-17 10:27:10] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-17 10:27:10] [INFO ] Invariant cache hit.
[2023-03-17 10:27:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:27:11] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
[2023-03-17 10:27:11] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-17 10:27:11] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-17 10:27:11] [INFO ] Invariant cache hit.
[2023-03-17 10:27:12] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 340/480 places, 550/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1989 ms. Remains : 340/480 places, 550/690 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=3 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s111 1) (EQ s172 1) (EQ s115 1) (EQ s176 1) (EQ s119 1) (EQ s180 1) (EQ s123 1) (EQ s184 1) (EQ s127 1) (EQ s131 1) (EQ s192 1) (EQ s135 1) (EQ...], nbAcceptance=2, 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 1 reset in 418 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-01 finished in 2704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 12 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:27:12] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-17 10:27:12] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-17 10:27:13] [INFO ] Implicit Places using invariants in 234 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 237 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s68 1) (EQ s5 1) (EQ s70 1) (EQ s7 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1570 ms.
Product exploration explored 100000 steps with 0 reset in 1735 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 128 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 11 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:27:17] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-17 10:27:17] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-17 10:27:17] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-17 10:27:17] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:27:17] [INFO ] Invariant cache hit.
[2023-03-17 10:27:18] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:27:18] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2023-03-17 10:27:18] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:27:18] [INFO ] Invariant cache hit.
[2023-03-17 10:27:19] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1814 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 95 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 248 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1524 ms.
Product exploration explored 100000 steps with 0 reset in 1602 ms.
Built C files in :
/tmp/ltsmin2612880128869756331
[2023-03-17 10:27:23] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2612880128869756331
Running compilation step : cd /tmp/ltsmin2612880128869756331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1689 ms.
Running link step : cd /tmp/ltsmin2612880128869756331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2612880128869756331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12911067482434151060.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 130 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:27:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:27:38] [INFO ] Invariant cache hit.
[2023-03-17 10:27:38] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-17 10:27:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:27:38] [INFO ] Invariant cache hit.
[2023-03-17 10:27:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:27:39] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
[2023-03-17 10:27:39] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:27:39] [INFO ] Invariant cache hit.
[2023-03-17 10:27:40] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1854 ms. Remains : 475/475 places, 690/690 transitions.
Built C files in :
/tmp/ltsmin1487981290773066504
[2023-03-17 10:27:40] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1487981290773066504
Running compilation step : cd /tmp/ltsmin1487981290773066504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1836 ms.
Running link step : cd /tmp/ltsmin1487981290773066504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1487981290773066504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3175586419153595449.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 10:27:55] [INFO ] Flatten gal took : 43 ms
[2023-03-17 10:27:55] [INFO ] Flatten gal took : 38 ms
[2023-03-17 10:27:55] [INFO ] Time to serialize gal into /tmp/LTL7239633768853449615.gal : 15 ms
[2023-03-17 10:27:55] [INFO ] Time to serialize properties into /tmp/LTL16638100349971580917.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7239633768853449615.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5043500533740199706.hoa' '-atoms' '/tmp/LTL16638100349971580917.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16638100349971580917.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5043500533740199706.hoa
Detected timeout of ITS tools.
[2023-03-17 10:28:11] [INFO ] Flatten gal took : 52 ms
[2023-03-17 10:28:11] [INFO ] Flatten gal took : 61 ms
[2023-03-17 10:28:11] [INFO ] Time to serialize gal into /tmp/LTL12565337418639477941.gal : 19 ms
[2023-03-17 10:28:11] [INFO ] Time to serialize properties into /tmp/LTL7801948980118618480.ltl : 21 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12565337418639477941.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7801948980118618480.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("((((((((IsEndLoop_1_0_0==1)||(IsEndLoop_3_1_3==1))||((IsEndLoop_3_0_0==1)||(IsEndLoop_2_0_3==1)))||(((IsEndLoop_4_0_3==1)...6445
Formula 0 simplified : XXF(!"(((((((((Turn_1_3==0)||(AskForSection_2_1==0))&&((AskForSection_0_2==0)||(Turn_2_4==0)))&&(((AskForSection_2_1==0)||(Turn_1_4=...6435
Detected timeout of ITS tools.
[2023-03-17 10:28:26] [INFO ] Flatten gal took : 50 ms
[2023-03-17 10:28:26] [INFO ] Applying decomposition
[2023-03-17 10:28:26] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16815699268227944452.txt' '-o' '/tmp/graph16815699268227944452.bin' '-w' '/tmp/graph16815699268227944452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16815699268227944452.bin' '-l' '-1' '-v' '-w' '/tmp/graph16815699268227944452.weights' '-q' '0' '-e' '0.001'
[2023-03-17 10:28:26] [INFO ] Decomposing Gal with order
[2023-03-17 10:28:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 10:28:26] [INFO ] Removed a total of 491 redundant transitions.
[2023-03-17 10:28:26] [INFO ] Flatten gal took : 136 ms
[2023-03-17 10:28:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 15 ms.
[2023-03-17 10:28:26] [INFO ] Time to serialize gal into /tmp/LTL606641752326271328.gal : 14 ms
[2023-03-17 10:28:26] [INFO ] Time to serialize properties into /tmp/LTL3111288341627255950.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL606641752326271328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3111288341627255950.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("((((((((i20.u60.IsEndLoop_1_0_0==1)||(i2.u27.IsEndLoop_3_1_3==1))||((i6.u61.IsEndLoop_3_0_0==1)||(i0.u28.IsEndLoop_2_0_3=...8718
Formula 0 simplified : XXF(!"(((((((((i4.u144.Turn_1_3==0)||(i4.u36.AskForSection_2_1==0))&&((i17.u143.AskForSection_0_2==0)||(i17.u44.Turn_2_4==0)))&&(((i...8708
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7003683717714787037
[2023-03-17 10:28:41] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7003683717714787037
Running compilation step : cd /tmp/ltsmin7003683717714787037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1659 ms.
Running link step : cd /tmp/ltsmin7003683717714787037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7003683717714787037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-PT-4-LTLFireability-02 finished in 104268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(!p1))||p0)) U (F(p2)&&X(p3))))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:28:57] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-17 10:28:57] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-17 10:28:57] [INFO ] Implicit Places using invariants in 244 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 246 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 257 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s101 1) (EQ s103 1) (EQ s102 1) (EQ s106 1) (EQ s107 1) (EQ s104 1) (EQ s105 1) (EQ s111 1) (EQ s108 1) (EQ s114 1) (EQ s115 1) (EQ s112 1) (EQ...], 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 6644 reset in 1194 ms.
Stack based approach found an accepted trace after 19768 steps with 1303 reset with depth 11 and stack size 11 in 235 ms.
FORMULA Peterson-PT-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-05 finished in 2032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((X(p1)||p0)))) U (G(p2)||X(p3))))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:28:59] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:28:59] [INFO ] Invariant cache hit.
[2023-03-17 10:28:59] [INFO ] Implicit Places using invariants in 271 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 274 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 283 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 458 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 6}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s68 1) (EQ s5 1) (EQ s70 1) (EQ s7 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-06 finished in 770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((X(X(F(p0)))||p1)) U p2))))'
Support contains 225 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:28:59] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:28:59] [INFO ] Invariant cache hit.
[2023-03-17 10:29:00] [INFO ] Implicit Places using invariants in 150 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 153 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (EQ s208 1) (EQ s252 1)) (AND (EQ s208 1) (EQ s248 1)) (AND (EQ s208 1) (EQ s250 1)) (AND (EQ s235 1) (EQ s277 1)) (AND (EQ s233 1) (EQ s316 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13368 reset in 805 ms.
Product exploration explored 100000 steps with 13389 reset in 732 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 (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
[2023-03-17 10:29:03] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-17 10:29:03] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-17 10:29:04] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2023-03-17 10:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:05] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2023-03-17 10:29:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:29:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-17 10:29:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:07] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2023-03-17 10:29:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:29:07] [INFO ] [Nat]Added 116 Read/Feed constraints in 46 ms returned sat
[2023-03-17 10:29:08] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 4 ms to minimize.
[2023-03-17 10:29:08] [INFO ] Deduced a trap composed of 43 places in 423 ms of which 2 ms to minimize.
[2023-03-17 10:29:09] [INFO ] Deduced a trap composed of 69 places in 314 ms of which 1 ms to minimize.
[2023-03-17 10:29:09] [INFO ] Deduced a trap composed of 69 places in 338 ms of which 1 ms to minimize.
[2023-03-17 10:29:09] [INFO ] Deduced a trap composed of 57 places in 295 ms of which 1 ms to minimize.
[2023-03-17 10:29:10] [INFO ] Deduced a trap composed of 35 places in 285 ms of which 1 ms to minimize.
[2023-03-17 10:29:10] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 1 ms to minimize.
[2023-03-17 10:29:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2523 ms
[2023-03-17 10:29:10] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 72 ms.
[2023-03-17 10:29:15] [INFO ] Added : 347 causal constraints over 70 iterations in 4806 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-17 10:29:15] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:29:15] [INFO ] Invariant cache hit.
[2023-03-17 10:29:19] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-17 10:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:20] [INFO ] [Real]Absence check using state equation in 958 ms returned sat
[2023-03-17 10:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:29:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-17 10:29:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:23] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2023-03-17 10:29:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:29:23] [INFO ] [Nat]Added 116 Read/Feed constraints in 74 ms returned sat
[2023-03-17 10:29:23] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 0 ms to minimize.
[2023-03-17 10:29:23] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 1 ms to minimize.
[2023-03-17 10:29:23] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 1 ms to minimize.
[2023-03-17 10:29:24] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 1 ms to minimize.
[2023-03-17 10:29:24] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 1 ms to minimize.
[2023-03-17 10:29:24] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 1 ms to minimize.
[2023-03-17 10:29:25] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 0 ms to minimize.
[2023-03-17 10:29:25] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 1 ms to minimize.
[2023-03-17 10:29:25] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 1 ms to minimize.
[2023-03-17 10:29:25] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 1 ms to minimize.
[2023-03-17 10:29:26] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 0 ms to minimize.
[2023-03-17 10:29:26] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-17 10:29:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3263 ms
[2023-03-17 10:29:26] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 47 ms.
[2023-03-17 10:29:30] [INFO ] Added : 368 causal constraints over 74 iterations in 4413 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:29:30] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:29:30] [INFO ] Invariant cache hit.
[2023-03-17 10:29:31] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-17 10:29:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:29:31] [INFO ] Invariant cache hit.
[2023-03-17 10:29:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:29:31] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2023-03-17 10:29:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:29:31] [INFO ] Invariant cache hit.
[2023-03-17 10:29:31] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1050 ms. Remains : 475/475 places, 690/690 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 (NOT p2) (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p2), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
[2023-03-17 10:29:32] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:29:32] [INFO ] Invariant cache hit.
[2023-03-17 10:29:34] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2023-03-17 10:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:35] [INFO ] [Real]Absence check using state equation in 891 ms returned sat
[2023-03-17 10:29:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:29:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-17 10:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:36] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2023-03-17 10:29:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:29:36] [INFO ] [Nat]Added 116 Read/Feed constraints in 56 ms returned sat
[2023-03-17 10:29:37] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 0 ms to minimize.
[2023-03-17 10:29:37] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 1 ms to minimize.
[2023-03-17 10:29:37] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 0 ms to minimize.
[2023-03-17 10:29:38] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 1 ms to minimize.
[2023-03-17 10:29:38] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 0 ms to minimize.
[2023-03-17 10:29:38] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 1 ms to minimize.
[2023-03-17 10:29:39] [INFO ] Deduced a trap composed of 35 places in 274 ms of which 0 ms to minimize.
[2023-03-17 10:29:39] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 0 ms to minimize.
[2023-03-17 10:29:39] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 0 ms to minimize.
[2023-03-17 10:29:40] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 0 ms to minimize.
[2023-03-17 10:29:40] [INFO ] Deduced a trap composed of 96 places in 220 ms of which 1 ms to minimize.
[2023-03-17 10:29:40] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 0 ms to minimize.
[2023-03-17 10:29:40] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 0 ms to minimize.
[2023-03-17 10:29:41] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 0 ms to minimize.
[2023-03-17 10:29:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4110 ms
[2023-03-17 10:29:41] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 60 ms.
[2023-03-17 10:29:43] [INFO ] Added : 198 causal constraints over 41 iterations in 2350 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-17 10:29:43] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:29:43] [INFO ] Invariant cache hit.
[2023-03-17 10:29:45] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-17 10:29:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:46] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2023-03-17 10:29:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:29:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2023-03-17 10:29:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:29:49] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2023-03-17 10:29:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:29:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 67 ms returned sat
[2023-03-17 10:29:50] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 1 ms to minimize.
[2023-03-17 10:29:50] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 0 ms to minimize.
[2023-03-17 10:29:50] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 1 ms to minimize.
[2023-03-17 10:29:50] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 0 ms to minimize.
[2023-03-17 10:29:51] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 1 ms to minimize.
[2023-03-17 10:29:51] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 0 ms to minimize.
[2023-03-17 10:29:51] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 0 ms to minimize.
[2023-03-17 10:29:51] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 0 ms to minimize.
[2023-03-17 10:29:52] [INFO ] Deduced a trap composed of 47 places in 291 ms of which 1 ms to minimize.
[2023-03-17 10:29:52] [INFO ] Deduced a trap composed of 10 places in 359 ms of which 1 ms to minimize.
[2023-03-17 10:29:53] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 1 ms to minimize.
[2023-03-17 10:29:53] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2023-03-17 10:29:53] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3546 ms
[2023-03-17 10:29:53] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 80 ms.
[2023-03-17 10:30:00] [INFO ] Added : 368 causal constraints over 74 iterations in 7482 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13386 reset in 873 ms.
Product exploration explored 100000 steps with 13310 reset in 900 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 475 transition count 690
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 85 Pre rules applied. Total rules applied 40 place count 475 transition count 690
Deduced a syphon composed of 125 places in 0 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 125 place count 475 transition count 690
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 177 place count 423 transition count 638
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 229 place count 423 transition count 638
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 249 place count 423 transition count 638
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 253 place count 419 transition count 634
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 257 place count 419 transition count 634
Deduced a syphon composed of 89 places in 0 ms
Applied a total of 257 rules in 124 ms. Remains 419 /475 variables (removed 56) and now considering 634/690 (removed 56) transitions.
[2023-03-17 10:30:03] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-17 10:30:03] [INFO ] Flow matrix only has 574 transitions (discarded 60 similar events)
// Phase 1: matrix 574 rows 419 cols
[2023-03-17 10:30:03] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-17 10:30:04] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/475 places, 634/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 882 ms. Remains : 419/475 places, 634/690 transitions.
Built C files in :
/tmp/ltsmin1438851760822331287
[2023-03-17 10:30:04] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1438851760822331287
Running compilation step : cd /tmp/ltsmin1438851760822331287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1838 ms.
Running link step : cd /tmp/ltsmin1438851760822331287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1438851760822331287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5764842688906715188.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:30:19] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-17 10:30:19] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-17 10:30:19] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-17 10:30:19] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:30:19] [INFO ] Invariant cache hit.
[2023-03-17 10:30:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:30:20] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2023-03-17 10:30:20] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:30:20] [INFO ] Invariant cache hit.
[2023-03-17 10:30:21] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1491 ms. Remains : 475/475 places, 690/690 transitions.
Built C files in :
/tmp/ltsmin14588040968658555646
[2023-03-17 10:30:21] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14588040968658555646
Running compilation step : cd /tmp/ltsmin14588040968658555646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1677 ms.
Running link step : cd /tmp/ltsmin14588040968658555646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14588040968658555646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased446022536828191656.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 10:30:36] [INFO ] Flatten gal took : 30 ms
[2023-03-17 10:30:36] [INFO ] Flatten gal took : 31 ms
[2023-03-17 10:30:36] [INFO ] Time to serialize gal into /tmp/LTL1560960171186369874.gal : 18 ms
[2023-03-17 10:30:36] [INFO ] Time to serialize properties into /tmp/LTL10461914796841590699.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1560960171186369874.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4699627539526911045.hoa' '-atoms' '/tmp/LTL10461914796841590699.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10461914796841590699.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4699627539526911045.hoa
Detected timeout of ITS tools.
[2023-03-17 10:30:51] [INFO ] Flatten gal took : 27 ms
[2023-03-17 10:30:51] [INFO ] Flatten gal took : 25 ms
[2023-03-17 10:30:51] [INFO ] Time to serialize gal into /tmp/LTL8430228596158818913.gal : 4 ms
[2023-03-17 10:30:51] [INFO ] Time to serialize properties into /tmp/LTL6927070690408930604.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8430228596158818913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6927070690408930604.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((X((X(X(F("(((((((((TestTurn_3_2==1)&&(Turn_2_3==1))||((TestTurn_4_1==1)&&(Turn_1_4==1)))||(((TestTurn_2_3==1)&&(Turn_3_2==1))|...13269
Formula 0 simplified : XX(!"(((((((((WantSection_0_T==1)&&(TestAlone_1_2_0==1))||((WantSection_0_T==1)&&(TestAlone_1_3_0==1)))||(((WantSection_0_T==1)&&(Te...17100
Detected timeout of ITS tools.
[2023-03-17 10:31:06] [INFO ] Flatten gal took : 39 ms
[2023-03-17 10:31:06] [INFO ] Applying decomposition
[2023-03-17 10:31:06] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7572658536136733004.txt' '-o' '/tmp/graph7572658536136733004.bin' '-w' '/tmp/graph7572658536136733004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7572658536136733004.bin' '-l' '-1' '-v' '-w' '/tmp/graph7572658536136733004.weights' '-q' '0' '-e' '0.001'
[2023-03-17 10:31:06] [INFO ] Decomposing Gal with order
[2023-03-17 10:31:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 10:31:06] [INFO ] Removed a total of 504 redundant transitions.
[2023-03-17 10:31:06] [INFO ] Flatten gal took : 53 ms
[2023-03-17 10:31:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 8 ms.
[2023-03-17 10:31:06] [INFO ] Time to serialize gal into /tmp/LTL16282709787685301929.gal : 8 ms
[2023-03-17 10:31:06] [INFO ] Time to serialize properties into /tmp/LTL9253341527757989475.ltl : 4 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16282709787685301929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9253341527757989475.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((X((X(X(F("(((((((((i2.u137.TestTurn_3_2==1)&&(i2.u137.Turn_2_3==1))||((i1.u54.TestTurn_4_1==1)&&(i1.u124.Turn_1_4==1)))||(((i1...18243
Formula 0 simplified : XX(!"(((((((((i12.u105.WantSection_0_T==1)&&(i2.u62.TestAlone_1_2_0==1))||((i12.u105.WantSection_0_T==1)&&(i12.u57.TestAlone_1_3_0==...23692
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9549982901414912541
[2023-03-17 10:31:21] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9549982901414912541
Running compilation step : cd /tmp/ltsmin9549982901414912541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1687 ms.
Running link step : cd /tmp/ltsmin9549982901414912541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9549982901414912541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X((X(X(<>((LTLAPp0==true))))||(LTLAPp1==true))) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-PT-4-LTLFireability-07 finished in 157053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((p1&&X(F(p2)))))))'
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:31:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-17 10:31:36] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-17 10:31:37] [INFO ] Implicit Places using invariants in 311 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 313 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 326 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s328 0), p1:(EQ s89 0), p2:(EQ s387 0)], 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 33333 reset in 469 ms.
Product exploration explored 100000 steps with 33333 reset in 467 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 p1 p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 8 factoid took 244 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLFireability-08 finished in 1719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((X(X(F(p0)))||F(p2)||p1)))))'
Support contains 6 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:31:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:31:38] [INFO ] Invariant cache hit.
[2023-03-17 10:31:38] [INFO ] Implicit Places using invariants in 288 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 290 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 303 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p0:(EQ s64 1), p2:(AND (EQ s293 1) (EQ s422 1)), p1:(OR (AND (EQ s230 1) (EQ s264 1)) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 162 ms.
Stack based approach found an accepted trace after 233 steps with 0 reset with depth 234 and stack size 234 in 10 ms.
FORMULA Peterson-PT-4-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-09 finished in 722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0)) U G(p1))||X(F(!p1))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:31:39] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:31:39] [INFO ] Invariant cache hit.
[2023-03-17 10:31:39] [INFO ] Implicit Places using invariants in 301 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 302 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 314 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 113 ms :[p1, false, (AND p1 (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s345 1) (EQ s417 1)), p0:(AND (EQ s208 1) (EQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 579 ms.
Product exploration explored 100000 steps with 50000 reset in 626 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 p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 6 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLFireability-10 finished in 1851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&(p1 U p2))||(G(p4)&&p3))))'
Support contains 8 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:31:41] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-17 10:31:41] [INFO ] Invariant cache hit.
[2023-03-17 10:31:41] [INFO ] Implicit Places using invariants in 308 ms returned [467, 469, 470, 471]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 310 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 476 /476 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 323 ms. Remains : 476/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (NOT p4), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p4), acceptance={} source=3 dest: 0}, { cond=p4, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND (NOT p2) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p4))), acceptance={} source=4 dest: 0}, { cond=(OR (AND p0 (NOT p2) p1 (NOT p3)) (AND p0 (NOT p2) p1 (NOT p4))), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p3 p4) (AND (NOT p2) (NOT p1) p3 p4)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1 p3 p4), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (EQ s231 1) (EQ s276 1)), p1:(AND (EQ s334 1) (EQ s420 1)), p4:(AND (EQ s333 1) (EQ s469 1)), p0:(OR (EQ s229 0) (EQ s467 0)), p3:(AND (EQ s229 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-11 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 281 transition count 491
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 398 place count 281 transition count 391
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 598 place count 181 transition count 391
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 638 place count 161 transition count 371
Applied a total of 638 rules in 25 ms. Remains 161 /480 variables (removed 319) and now considering 371/690 (removed 319) transitions.
[2023-03-17 10:31:41] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 161 cols
[2023-03-17 10:31:41] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-17 10:31:42] [INFO ] Implicit Places using invariants in 205 ms returned [151, 152, 153, 154, 155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 207 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/480 places, 371/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 156/480 places, 371/690 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s101 1) (EQ s110 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 169 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-12 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p2)&&p1)))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 283 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 396 place count 282 transition count 393
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 594 place count 183 transition count 393
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 628 place count 166 transition count 376
Applied a total of 628 rules in 21 ms. Remains 166 /480 variables (removed 314) and now considering 376/690 (removed 314) transitions.
[2023-03-17 10:31:42] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 166 cols
[2023-03-17 10:31:42] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-17 10:31:42] [INFO ] Implicit Places using invariants in 200 ms returned [155, 156, 157, 158, 159]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 201 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/480 places, 376/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 227 ms. Remains : 161/480 places, 376/690 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s28 0) (OR (EQ s88 1) (EQ s28 1))), p0:(EQ s64 1), p2:(EQ s61 0)], 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 224 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-13 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 400 place count 280 transition count 390
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 180 transition count 390
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 640 place count 160 transition count 370
Applied a total of 640 rules in 19 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2023-03-17 10:31:42] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2023-03-17 10:31:42] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-17 10:31:43] [INFO ] Implicit Places using invariants in 198 ms returned [150, 151, 152, 153]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 204 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/480 places, 370/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 156/480 places, 370/690 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-14 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 s105 1) (EQ s150 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 522 reset in 171 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-14 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1)&&X((p2 U (p3||G(p2))))))'
Support contains 7 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-17 10:31:43] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-17 10:31:43] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-17 10:31:43] [INFO ] Implicit Places using invariants in 293 ms returned [467, 468, 470, 471]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 295 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 476 /476 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 307 ms. Remains : 476/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2)), true]
Running random walk in product with property : Peterson-PT-4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s422 1) (EQ s465 1)), p0:(EQ s11 1), p3:(AND (NOT (AND (EQ s293 1) (EQ s418 1))) (NOT (AND (EQ s230 1) (EQ s467 1))) (EQ s422 1) (EQ s465 1)),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-15 finished in 674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Found a Lengthening insensitive property : Peterson-PT-4-LTLFireability-02
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 480 transition count 602
Reduce places removed 88 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 168 rules applied. Total rules applied 256 place count 392 transition count 522
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 336 place count 312 transition count 522
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 336 place count 312 transition count 502
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 376 place count 292 transition count 502
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 408 place count 276 transition count 486
Applied a total of 408 rules in 24 ms. Remains 276 /480 variables (removed 204) and now considering 486/690 (removed 204) transitions.
[2023-03-17 10:31:44] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 276 cols
[2023-03-17 10:31:44] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-17 10:31:44] [INFO ] Implicit Places using invariants in 223 ms returned [263, 264, 265, 266, 267]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 224 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 271/480 places, 486/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 254 ms. Remains : 271/480 places, 486/690 transitions.
Running random walk in product with property : Peterson-PT-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s68 1) (EQ s5 1) (EQ s70 1) (EQ s7 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1559 ms.
Product exploration explored 100000 steps with 0 reset in 1592 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 121 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-17 10:31:48] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 271 cols
[2023-03-17 10:31:48] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 10:31:48] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-17 10:31:48] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-17 10:31:48] [INFO ] Invariant cache hit.
[2023-03-17 10:31:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:31:49] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-17 10:31:49] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-17 10:31:49] [INFO ] Invariant cache hit.
[2023-03-17 10:31:49] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 985 ms. Remains : 271/271 places, 486/486 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 178 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1609 ms.
Product exploration explored 100000 steps with 0 reset in 1637 ms.
Built C files in :
/tmp/ltsmin14919603558954699561
[2023-03-17 10:31:53] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14919603558954699561
Running compilation step : cd /tmp/ltsmin14919603558954699561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1257 ms.
Running link step : cd /tmp/ltsmin14919603558954699561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14919603558954699561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6847181243354490694.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 130 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-17 10:32:08] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-17 10:32:08] [INFO ] Invariant cache hit.
[2023-03-17 10:32:09] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-17 10:32:09] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-17 10:32:09] [INFO ] Invariant cache hit.
[2023-03-17 10:32:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-17 10:32:09] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2023-03-17 10:32:09] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-17 10:32:09] [INFO ] Invariant cache hit.
[2023-03-17 10:32:09] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1032 ms. Remains : 271/271 places, 486/486 transitions.
Built C files in :
/tmp/ltsmin13215543734414668592
[2023-03-17 10:32:09] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13215543734414668592
Running compilation step : cd /tmp/ltsmin13215543734414668592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1160 ms.
Running link step : cd /tmp/ltsmin13215543734414668592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13215543734414668592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5901524045467734759.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 10:32:25] [INFO ] Flatten gal took : 25 ms
[2023-03-17 10:32:25] [INFO ] Flatten gal took : 16 ms
[2023-03-17 10:32:25] [INFO ] Time to serialize gal into /tmp/LTL4733683569905982586.gal : 4 ms
[2023-03-17 10:32:25] [INFO ] Time to serialize properties into /tmp/LTL3978621752098556690.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4733683569905982586.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5131982523760132320.hoa' '-atoms' '/tmp/LTL3978621752098556690.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3978621752098556690.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5131982523760132320.hoa
Detected timeout of ITS tools.
[2023-03-17 10:32:40] [INFO ] Flatten gal took : 25 ms
[2023-03-17 10:32:40] [INFO ] Flatten gal took : 24 ms
[2023-03-17 10:32:40] [INFO ] Time to serialize gal into /tmp/LTL1702160905260455904.gal : 3 ms
[2023-03-17 10:32:40] [INFO ] Time to serialize properties into /tmp/LTL3434385937833691831.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1702160905260455904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3434385937833691831.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("((((((((IsEndLoop_1_0_0==1)||(IsEndLoop_3_1_3==1))||((IsEndLoop_3_0_0==1)||(IsEndLoop_2_0_3==1)))||(((IsEndLoop_4_0_3==1)...6445
Formula 0 simplified : XXF(!"(((((((((Turn_1_3==0)||(AskForSection_2_1==0))&&((AskForSection_0_2==0)||(Turn_2_4==0)))&&(((AskForSection_2_1==0)||(Turn_1_4=...6435
Detected timeout of ITS tools.
[2023-03-17 10:32:55] [INFO ] Flatten gal took : 15 ms
[2023-03-17 10:32:55] [INFO ] Applying decomposition
[2023-03-17 10:32:55] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph7026305018594108387.txt' '-o' '/tmp/graph7026305018594108387.bin' '-w' '/tmp/graph7026305018594108387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7026305018594108387.bin' '-l' '-1' '-v' '-w' '/tmp/graph7026305018594108387.weights' '-q' '0' '-e' '0.001'
[2023-03-17 10:32:55] [INFO ] Decomposing Gal with order
[2023-03-17 10:32:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 10:32:55] [INFO ] Removed a total of 472 redundant transitions.
[2023-03-17 10:32:55] [INFO ] Flatten gal took : 34 ms
[2023-03-17 10:32:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 20 ms.
[2023-03-17 10:32:55] [INFO ] Time to serialize gal into /tmp/LTL14191908660068608275.gal : 8 ms
[2023-03-17 10:32:55] [INFO ] Time to serialize properties into /tmp/LTL743196410285439261.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14191908660068608275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL743196410285439261.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("((((((((i1.u1.IsEndLoop_1_0_0==1)||(i7.i1.u70.IsEndLoop_3_1_3==1))||((i12.u53.IsEndLoop_3_0_0==1)||(i2.i1.u82.IsEndLoop_2...9337
Formula 0 simplified : XXF(!"(((((((((i3.i1.u78.Turn_1_3==0)||(i3.i1.u89.AskForSection_2_1==0))&&((i11.i0.u88.AskForSection_0_2==0)||(i11.i0.u88.Turn_2_4==...9327
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1602180195141301789
[2023-03-17 10:33:10] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1602180195141301789
Running compilation step : cd /tmp/ltsmin1602180195141301789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1130 ms.
Running link step : cd /tmp/ltsmin1602180195141301789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1602180195141301789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-PT-4-LTLFireability-02 finished in 101625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((X(X(F(p0)))||p1)) U p2))))'
[2023-03-17 10:33:25] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4215098729936850092
[2023-03-17 10:33:25] [INFO ] Computing symmetric may disable matrix : 690 transitions.
[2023-03-17 10:33:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 10:33:25] [INFO ] Computing symmetric may enable matrix : 690 transitions.
[2023-03-17 10:33:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 10:33:25] [INFO ] Applying decomposition
[2023-03-17 10:33:25] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15197507547841605724.txt' '-o' '/tmp/graph15197507547841605724.bin' '-w' '/tmp/graph15197507547841605724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15197507547841605724.bin' '-l' '-1' '-v' '-w' '/tmp/graph15197507547841605724.weights' '-q' '0' '-e' '0.001'
[2023-03-17 10:33:25] [INFO ] Decomposing Gal with order
[2023-03-17 10:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 10:33:25] [INFO ] Removed a total of 513 redundant transitions.
[2023-03-17 10:33:25] [INFO ] Flatten gal took : 45 ms
[2023-03-17 10:33:26] [INFO ] Computing Do-Not-Accords matrix : 690 transitions.
[2023-03-17 10:33:26] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 10:33:26] [INFO ] Built C files in 225ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4215098729936850092
Running compilation step : cd /tmp/ltsmin4215098729936850092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-17 10:33:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2023-03-17 10:33:26] [INFO ] Time to serialize gal into /tmp/LTLFireability3287627633906511096.gal : 6 ms
[2023-03-17 10:33:26] [INFO ] Time to serialize properties into /tmp/LTLFireability16890427678337674323.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3287627633906511096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16890427678337674323.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(G(("(((((((((i6.u14.Turn_1_3==0)||(i6.u13.AskForSection_2_1==0))&&((i5.u89.AskForSection_0_2==0)||(i5.u19.Turn_2_4==0)))&&(((i6...8743
Formula 0 simplified : XXF(!"(((((((((i6.u14.Turn_1_3==0)||(i6.u13.AskForSection_2_1==0))&&((i5.u89.AskForSection_0_2==0)||(i5.u19.Turn_2_4==0)))&&(((i6.u1...8733
Compilation finished in 2743 ms.
Running link step : cd /tmp/ltsmin4215098729936850092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4215098729936850092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-17 10:56:01] [INFO ] Applying decomposition
[2023-03-17 10:56:01] [INFO ] Flatten gal took : 101 ms
[2023-03-17 10:56:01] [INFO ] Decomposing Gal with order
[2023-03-17 10:56:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 10:56:02] [INFO ] Removed a total of 436 redundant transitions.
[2023-03-17 10:56:02] [INFO ] Flatten gal took : 281 ms
[2023-03-17 10:56:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 25 ms.
[2023-03-17 10:56:02] [INFO ] Time to serialize gal into /tmp/LTLFireability11615520729204832523.gal : 4 ms
[2023-03-17 10:56:02] [INFO ] Time to serialize properties into /tmp/LTLFireability10148761556475950484.ltl : 57 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11615520729204832523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10148761556475950484.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(X(G(("(((((((((u9.Turn_1_3==0)||(u4.AskForSection_2_1==0))&&((missing.AskForSection_0_2==0)||(u10.Turn_2_4==0)))&&(((u4.AskForSec...7395
Formula 0 simplified : XXF(!"(((((((((u9.Turn_1_3==0)||(u4.AskForSection_2_1==0))&&((missing.AskForSection_0_2==0)||(u10.Turn_2_4==0)))&&(((u4.AskForSectio...7385
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin4215098729936850092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4215098729936850092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X((X(X(<>((LTLAPp2==true))))||(LTLAPp3==true))) U (LTLAPp4==true))))' '--buchi-type=spotba'
LTSmin run took 144825 ms.
FORMULA Peterson-PT-4-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin4215098729936850092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t67, t71, t73, t75, t76, t77, t88, t94, t95, t144, t145, t146, t147, t148, t161, t162, t165, ...784
Detected timeout of ITS tools.
[2023-03-17 11:18:37] [INFO ] Flatten gal took : 57 ms
[2023-03-17 11:18:38] [INFO ] Input system was already deterministic with 690 transitions.
[2023-03-17 11:18:38] [INFO ] Transformed 480 places.
[2023-03-17 11:18:38] [INFO ] Transformed 690 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-17 11:18:38] [INFO ] Time to serialize gal into /tmp/LTLFireability10575679249889001947.gal : 3 ms
[2023-03-17 11:18:38] [INFO ] Time to serialize properties into /tmp/LTLFireability6104560040273040096.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10575679249889001947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6104560040273040096.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(("(((((((((Turn_1_3==0)||(AskForSection_2_1==0))&&((AskForSection_0_2==0)||(Turn_2_4==0)))&&(((AskForSection_2_1==0)||(Turn_1...6445
Formula 0 simplified : XXF(!"(((((((((Turn_1_3==0)||(AskForSection_2_1==0))&&((AskForSection_0_2==0)||(Turn_2_4==0)))&&(((AskForSection_2_1==0)||(Turn_1_4=...6435
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11069832 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16031692 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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