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.r263-smll-167863538500620.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 lolaxred
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 r263-smll-167863538500620
=====================================================================

--------------------
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 1678859979344

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 05:59:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 05:59:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:59:42] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-15 05:59:42] [INFO ] Transformed 480 places.
[2023-03-15 05:59:42] [INFO ] Transformed 690 transitions.
[2023-03-15 05:59:42] [INFO ] Found NUPN structural information;
[2023-03-15 05:59:42] [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-15 05:59:42] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 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 36 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 05:59:43] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 05:59:43] [INFO ] Computed 19 place invariants in 47 ms
[2023-03-15 05:59:44] [INFO ] Implicit Places using invariants in 672 ms returned []
[2023-03-15 05:59:44] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 05:59:44] [INFO ] Invariant cache hit.
[2023-03-15 05:59:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 05:59:44] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
[2023-03-15 05:59:44] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 05:59:44] [INFO ] Invariant cache hit.
[2023-03-15 05:59:45] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2462 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 463 out of 480 places after structural reductions.
[2023-03-15 05:59:46] [INFO ] Flatten gal took : 184 ms
[2023-03-15 05:59:46] [INFO ] Flatten gal took : 148 ms
[2023-03-15 05:59:46] [INFO ] Input system was already deterministic with 690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 40) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) 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 8) seen :1
Running SMT prover for 7 properties.
[2023-03-15 05:59:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 05:59:48] [INFO ] Invariant cache hit.
[2023-03-15 05:59:48] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-15 05:59:48] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-15 05:59:49] [INFO ] After 692ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-15 05:59:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 05:59:49] [INFO ] After 440ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-15 05:59:49] [INFO ] After 1613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-15 05:59:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-15 05:59:50] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-15 05:59:50] [INFO ] After 662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-15 05:59:51] [INFO ] After 355ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-15 05:59:51] [INFO ] Deduced a trap composed of 14 places in 495 ms of which 8 ms to minimize.
[2023-03-15 05:59:52] [INFO ] Deduced a trap composed of 36 places in 485 ms of which 2 ms to minimize.
[2023-03-15 05:59:52] [INFO ] Deduced a trap composed of 92 places in 455 ms of which 2 ms to minimize.
[2023-03-15 05:59:53] [INFO ] Deduced a trap composed of 93 places in 449 ms of which 3 ms to minimize.
[2023-03-15 05:59:53] [INFO ] Deduced a trap composed of 126 places in 450 ms of which 1 ms to minimize.
[2023-03-15 05:59:54] [INFO ] Deduced a trap composed of 21 places in 454 ms of which 1 ms to minimize.
[2023-03-15 05:59:54] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 1 ms to minimize.
[2023-03-15 05:59:55] [INFO ] Deduced a trap composed of 14 places in 447 ms of which 5 ms to minimize.
[2023-03-15 05:59:55] [INFO ] Deduced a trap composed of 50 places in 459 ms of which 2 ms to minimize.
[2023-03-15 05:59:56] [INFO ] Deduced a trap composed of 65 places in 382 ms of which 4 ms to minimize.
[2023-03-15 05:59:56] [INFO ] Deduced a trap composed of 35 places in 372 ms of which 2 ms to minimize.
[2023-03-15 05:59:57] [INFO ] Deduced a trap composed of 112 places in 365 ms of which 2 ms to minimize.
[2023-03-15 05:59:57] [INFO ] Deduced a trap composed of 43 places in 407 ms of which 1 ms to minimize.
[2023-03-15 05:59:57] [INFO ] Deduced a trap composed of 85 places in 365 ms of which 1 ms to minimize.
[2023-03-15 05:59:58] [INFO ] Deduced a trap composed of 70 places in 386 ms of which 1 ms to minimize.
[2023-03-15 05:59:58] [INFO ] Deduced a trap composed of 87 places in 353 ms of which 1 ms to minimize.
[2023-03-15 05:59:59] [INFO ] Deduced a trap composed of 14 places in 417 ms of which 1 ms to minimize.
[2023-03-15 05:59:59] [INFO ] Deduced a trap composed of 36 places in 372 ms of which 2 ms to minimize.
[2023-03-15 06:00:00] [INFO ] Deduced a trap composed of 42 places in 343 ms of which 1 ms to minimize.
[2023-03-15 06:00:00] [INFO ] Deduced a trap composed of 48 places in 327 ms of which 1 ms to minimize.
[2023-03-15 06:00:00] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 1 ms to minimize.
[2023-03-15 06:00:00] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 9673 ms
[2023-03-15 06:00:01] [INFO ] Deduced a trap composed of 78 places in 318 ms of which 1 ms to minimize.
[2023-03-15 06:00:01] [INFO ] Deduced a trap composed of 77 places in 317 ms of which 2 ms to minimize.
[2023-03-15 06:00:02] [INFO ] Deduced a trap composed of 131 places in 318 ms of which 0 ms to minimize.
[2023-03-15 06:00:02] [INFO ] Deduced a trap composed of 113 places in 275 ms of which 1 ms to minimize.
[2023-03-15 06:00:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1466 ms
[2023-03-15 06:00:02] [INFO ] Deduced a trap composed of 18 places in 358 ms of which 1 ms to minimize.
[2023-03-15 06:00:03] [INFO ] Deduced a trap composed of 18 places in 364 ms of which 1 ms to minimize.
[2023-03-15 06:00:03] [INFO ] Deduced a trap composed of 21 places in 372 ms of which 1 ms to minimize.
[2023-03-15 06:00:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1270 ms
[2023-03-15 06:00:04] [INFO ] Deduced a trap composed of 32 places in 366 ms of which 1 ms to minimize.
[2023-03-15 06:00:04] [INFO ] Deduced a trap composed of 10 places in 330 ms of which 1 ms to minimize.
[2023-03-15 06:00:04] [INFO ] Deduced a trap composed of 80 places in 274 ms of which 1 ms to minimize.
[2023-03-15 06:00:05] [INFO ] Deduced a trap composed of 58 places in 274 ms of which 1 ms to minimize.
[2023-03-15 06:00:05] [INFO ] Deduced a trap composed of 57 places in 265 ms of which 1 ms to minimize.
[2023-03-15 06:00:05] [INFO ] Deduced a trap composed of 58 places in 260 ms of which 2 ms to minimize.
[2023-03-15 06:00:06] [INFO ] Deduced a trap composed of 58 places in 272 ms of which 5 ms to minimize.
[2023-03-15 06:00:06] [INFO ] Deduced a trap composed of 79 places in 316 ms of which 1 ms to minimize.
[2023-03-15 06:00:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2778 ms
[2023-03-15 06:00:07] [INFO ] Deduced a trap composed of 88 places in 279 ms of which 1 ms to minimize.
[2023-03-15 06:00:07] [INFO ] Deduced a trap composed of 88 places in 265 ms of which 1 ms to minimize.
[2023-03-15 06:00:07] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 1 ms to minimize.
[2023-03-15 06:00:07] [INFO ] Deduced a trap composed of 87 places in 287 ms of which 3 ms to minimize.
[2023-03-15 06:00:08] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 1 ms to minimize.
[2023-03-15 06:00:08] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 1 ms to minimize.
[2023-03-15 06:00:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1853 ms
[2023-03-15 06:00:08] [INFO ] Deduced a trap composed of 105 places in 295 ms of which 1 ms to minimize.
[2023-03-15 06:00:09] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 2 ms to minimize.
[2023-03-15 06:00:09] [INFO ] Deduced a trap composed of 80 places in 312 ms of which 2 ms to minimize.
[2023-03-15 06:00:09] [INFO ] Deduced a trap composed of 89 places in 214 ms of which 1 ms to minimize.
[2023-03-15 06:00:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1347 ms
[2023-03-15 06:00:09] [INFO ] After 19099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 412 ms.
[2023-03-15 06:00:10] [INFO ] After 20632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 12 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 1 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 130 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 130 ms. Remains : 171/480 places, 381/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 33 ms. (steps per millisecond=303 ) 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 38 ms. (steps per millisecond=263 ) 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
Running SMT prover for 6 properties.
[2023-03-15 06:00:10] [INFO ] Flow matrix only has 321 transitions (discarded 60 similar events)
// Phase 1: matrix 321 rows 171 cols
[2023-03-15 06:00:11] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-15 06:00:11] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 06:00:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 06:00:11] [INFO ] After 264ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-15 06:00:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:00:11] [INFO ] After 172ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 06:00:11] [INFO ] After 697ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 06:00:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-15 06:00:11] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 06:00:12] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 06:00:12] [INFO ] After 149ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 06:00:12] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2023-03-15 06:00:12] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2023-03-15 06:00:12] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2023-03-15 06:00:12] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2023-03-15 06:00:13] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2023-03-15 06:00:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 800 ms
[2023-03-15 06:00:13] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2023-03-15 06:00:13] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
[2023-03-15 06:00:13] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2023-03-15 06:00:13] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2023-03-15 06:00:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 595 ms
[2023-03-15 06:00:13] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 4 ms to minimize.
[2023-03-15 06:00:14] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2023-03-15 06:00:14] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2023-03-15 06:00:14] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2023-03-15 06:00:14] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2023-03-15 06:00:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 662 ms
[2023-03-15 06:00:14] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-15 06:00:14] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2023-03-15 06:00:14] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2023-03-15 06:00:15] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 0 ms to minimize.
[2023-03-15 06:00:15] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 4 ms to minimize.
[2023-03-15 06:00:15] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 1 ms to minimize.
[2023-03-15 06:00:15] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 15 ms to minimize.
[2023-03-15 06:00:15] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2023-03-15 06:00:15] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2023-03-15 06:00:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1437 ms
[2023-03-15 06:00:16] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-15 06:00:16] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2023-03-15 06:00:16] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-03-15 06:00:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 506 ms
[2023-03-15 06:00:16] [INFO ] After 4297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-15 06:00:16] [INFO ] After 4934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 42 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 41 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 41 ms. Remains : 169/171 places, 379/381 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) 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 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 620970 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 620970 steps, saw 103955 distinct states, run finished after 3003 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-15 06:00:20] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
// Phase 1: matrix 319 rows 169 cols
[2023-03-15 06:00:20] [INFO ] Computed 19 place invariants in 9 ms
[2023-03-15 06:00:20] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 06:00:20] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 06:00:20] [INFO ] After 193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-15 06:00:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:00:20] [INFO ] After 139ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 06:00:20] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 06:00:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 06:00:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-15 06:00:21] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 06:00:21] [INFO ] After 150ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 06:00:21] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2023-03-15 06:00:21] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-15 06:00:21] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-15 06:00:22] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 1 ms to minimize.
[2023-03-15 06:00:22] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-15 06:00:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 808 ms
[2023-03-15 06:00:22] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2023-03-15 06:00:22] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2023-03-15 06:00:22] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 1 ms to minimize.
[2023-03-15 06:00:22] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-15 06:00:23] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2023-03-15 06:00:23] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-15 06:00:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 900 ms
[2023-03-15 06:00:23] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2023-03-15 06:00:23] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2023-03-15 06:00:23] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2023-03-15 06:00:23] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 1 ms to minimize.
[2023-03-15 06:00:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 617 ms
[2023-03-15 06:00:24] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 1 ms to minimize.
[2023-03-15 06:00:24] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2023-03-15 06:00:24] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2023-03-15 06:00:24] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2023-03-15 06:00:24] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2023-03-15 06:00:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 594 ms
[2023-03-15 06:00:24] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2023-03-15 06:00:24] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2023-03-15 06:00:24] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2023-03-15 06:00:25] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2023-03-15 06:00:25] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-15 06:00:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 730 ms
[2023-03-15 06:00:25] [INFO ] After 3948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 239 ms.
[2023-03-15 06:00:25] [INFO ] After 4561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 43 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 22 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 23 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 21 ms. Remains 169 /169 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2023-03-15 06:00:25] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-15 06:00:25] [INFO ] Invariant cache hit.
[2023-03-15 06:00:25] [INFO ] Implicit Places using invariants in 378 ms returned [159, 160, 161, 162, 163]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 382 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 20 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 425 ms. Remains : 164/169 places, 379/379 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) 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 69 ms. (steps per millisecond=144 ) 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 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 603732 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 603732 steps, saw 101147 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-15 06:00:29] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
// Phase 1: matrix 319 rows 164 cols
[2023-03-15 06:00:29] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-15 06:00:29] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-15 06:00:30] [INFO ] After 193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-15 06:00:30] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:00:30] [INFO ] After 115ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 06:00:30] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 06:00:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 06:00:30] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 06:00:30] [INFO ] After 138ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 06:00:30] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-15 06:00:31] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2023-03-15 06:00:31] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 0 ms to minimize.
[2023-03-15 06:00:31] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 1 ms to minimize.
[2023-03-15 06:00:31] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-15 06:00:31] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2023-03-15 06:00:31] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2023-03-15 06:00:32] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-15 06:00:32] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-15 06:00:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1385 ms
[2023-03-15 06:00:32] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2023-03-15 06:00:32] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2023-03-15 06:00:32] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2023-03-15 06:00:32] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 0 ms to minimize.
[2023-03-15 06:00:32] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2023-03-15 06:00:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 668 ms
[2023-03-15 06:00:33] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 0 ms to minimize.
[2023-03-15 06:00:33] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2023-03-15 06:00:33] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2023-03-15 06:00:33] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2023-03-15 06:00:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 507 ms
[2023-03-15 06:00:33] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2023-03-15 06:00:33] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2023-03-15 06:00:33] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2023-03-15 06:00:33] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2023-03-15 06:00:34] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2023-03-15 06:00:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 623 ms
[2023-03-15 06:00:34] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2023-03-15 06:00:34] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-15 06:00:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2023-03-15 06:00:34] [INFO ] After 3762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-15 06:00:34] [INFO ] After 4361ms 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 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 17 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 17 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-15 06:00:34] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-15 06:00:34] [INFO ] Invariant cache hit.
[2023-03-15 06:00:34] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-15 06:00:34] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-15 06:00:34] [INFO ] Invariant cache hit.
[2023-03-15 06:00:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:00:35] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
[2023-03-15 06:00:35] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-15 06:00:35] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-15 06:00:35] [INFO ] Invariant cache hit.
[2023-03-15 06:00:36] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1591 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 5 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 0 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 1 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 43 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-15 06:00:36] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-15 06:00:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-15 06:00:36] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-15 06:00:36] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 06:00:36] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 06:00:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-15 06:00:36] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 06:00:36] [INFO ] After 122ms 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-15 06:00:36] [INFO ] After 225ms 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 11 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:00:37] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 06:00:37] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-15 06:00:37] [INFO ] Implicit Places using invariants in 351 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 358 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 12 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 382 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 486 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 20429 reset in 1043 ms.
Product exploration explored 100000 steps with 20444 reset in 688 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 272 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 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
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 244 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 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-15 06:00:40] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 06:00:40] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-15 06:00:42] [INFO ] [Real]Absence check using 14 positive place invariants in 33 ms returned sat
[2023-03-15 06:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:00:43] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2023-03-15 06:00:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:00:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 35 ms returned sat
[2023-03-15 06:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:00:46] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2023-03-15 06:00:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:00:46] [INFO ] [Nat]Added 116 Read/Feed constraints in 48 ms returned sat
[2023-03-15 06:00:46] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2023-03-15 06:00:47] [INFO ] Deduced a trap composed of 10 places in 316 ms of which 1 ms to minimize.
[2023-03-15 06:00:47] [INFO ] Deduced a trap composed of 36 places in 375 ms of which 1 ms to minimize.
[2023-03-15 06:00:47] [INFO ] Deduced a trap composed of 36 places in 355 ms of which 1 ms to minimize.
[2023-03-15 06:00:48] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 2 ms to minimize.
[2023-03-15 06:00:48] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 1 ms to minimize.
[2023-03-15 06:00:49] [INFO ] Deduced a trap composed of 40 places in 394 ms of which 1 ms to minimize.
[2023-03-15 06:00:49] [INFO ] Deduced a trap composed of 39 places in 357 ms of which 3 ms to minimize.
[2023-03-15 06:00:50] [INFO ] Deduced a trap composed of 35 places in 404 ms of which 1 ms to minimize.
[2023-03-15 06:00:50] [INFO ] Deduced a trap composed of 13 places in 345 ms of which 1 ms to minimize.
[2023-03-15 06:00:50] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 1 ms to minimize.
[2023-03-15 06:00:51] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 0 ms to minimize.
[2023-03-15 06:00:51] [INFO ] Deduced a trap composed of 54 places in 318 ms of which 1 ms to minimize.
[2023-03-15 06:00:52] [INFO ] Deduced a trap composed of 65 places in 329 ms of which 1 ms to minimize.
[2023-03-15 06:00:52] [INFO ] Deduced a trap composed of 32 places in 351 ms of which 1 ms to minimize.
[2023-03-15 06:00:52] [INFO ] Deduced a trap composed of 69 places in 298 ms of which 4 ms to minimize.
[2023-03-15 06:00:53] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 1 ms to minimize.
[2023-03-15 06:00:53] [INFO ] Deduced a trap composed of 58 places in 244 ms of which 1 ms to minimize.
[2023-03-15 06:00:53] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 1 ms to minimize.
[2023-03-15 06:00:53] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 7535 ms
[2023-03-15 06:00:54] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 87 ms.
[2023-03-15 06:00:59] [INFO ] Deduced a trap composed of 2 places in 456 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 06:00:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
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 13 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:00:59] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:00:59] [INFO ] Invariant cache hit.
[2023-03-15 06:00:59] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-15 06:00:59] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:00:59] [INFO ] Invariant cache hit.
[2023-03-15 06:01:00] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:01:00] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
[2023-03-15 06:01:00] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:00] [INFO ] Invariant cache hit.
[2023-03-15 06:01:01] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2428 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 119 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 141 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 151 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 146 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-15 06:01:02] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:02] [INFO ] Invariant cache hit.
[2023-03-15 06:01:04] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2023-03-15 06:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:01:05] [INFO ] [Real]Absence check using state equation in 989 ms returned sat
[2023-03-15 06:01:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:01:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 36 ms returned sat
[2023-03-15 06:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:01:08] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2023-03-15 06:01:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:01:08] [INFO ] [Nat]Added 116 Read/Feed constraints in 72 ms returned sat
[2023-03-15 06:01:08] [INFO ] Deduced a trap composed of 10 places in 361 ms of which 1 ms to minimize.
[2023-03-15 06:01:09] [INFO ] Deduced a trap composed of 27 places in 343 ms of which 1 ms to minimize.
[2023-03-15 06:01:09] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 1 ms to minimize.
[2023-03-15 06:01:09] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 1 ms to minimize.
[2023-03-15 06:01:10] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 2 ms to minimize.
[2023-03-15 06:01:10] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 1 ms to minimize.
[2023-03-15 06:01:10] [INFO ] Deduced a trap composed of 65 places in 307 ms of which 1 ms to minimize.
[2023-03-15 06:01:11] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 1 ms to minimize.
[2023-03-15 06:01:11] [INFO ] Deduced a trap composed of 58 places in 302 ms of which 1 ms to minimize.
[2023-03-15 06:01:12] [INFO ] Deduced a trap composed of 80 places in 273 ms of which 1 ms to minimize.
[2023-03-15 06:01:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3828 ms
[2023-03-15 06:01:12] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 83 ms.
[2023-03-15 06:01:20] [INFO ] Added : 394 causal constraints over 81 iterations in 8083 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20425 reset in 788 ms.
Product exploration explored 100000 steps with 20381 reset in 628 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 148 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 0 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 0 ms
Applied a total of 609 rules in 156 ms. Remains 323 /475 variables (removed 152) and now considering 586/690 (removed 104) transitions.
[2023-03-15 06:01:22] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 06:01:22] [INFO ] Flow matrix only has 526 transitions (discarded 60 similar events)
// Phase 1: matrix 526 rows 323 cols
[2023-03-15 06:01:22] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 06:01:22] [INFO ] Dead Transitions using invariants and state equation in 533 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 727 ms. Remains : 323/475 places, 586/690 transitions.
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 22 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:01:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 06:01:22] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 06:01:23] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-15 06:01:23] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:23] [INFO ] Invariant cache hit.
[2023-03-15 06:01:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:01:24] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
[2023-03-15 06:01:24] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:24] [INFO ] Invariant cache hit.
[2023-03-15 06:01:25] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2252 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-PT-4-LTLFireability-00 finished in 48208 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 1 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 68 ms. Remains 340 /480 variables (removed 140) and now considering 550/690 (removed 140) transitions.
[2023-03-15 06:01:25] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
// Phase 1: matrix 490 rows 340 cols
[2023-03-15 06:01:25] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-15 06:01:25] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-15 06:01:25] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-15 06:01:25] [INFO ] Invariant cache hit.
[2023-03-15 06:01:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:01:27] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
[2023-03-15 06:01:27] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 06:01:27] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-15 06:01:27] [INFO ] Invariant cache hit.
[2023-03-15 06:01:27] [INFO ] Dead Transitions using invariants and state equation in 744 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 2323 ms. Remains : 340/480 places, 550/690 transitions.
Stuttering acceptance computed with spot in 303 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 744 ms.
Stack based approach found an accepted trace after 53 steps with 3 reset with depth 30 and stack size 30 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-01 finished in 3413 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-15 06:01:28] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 06:01:28] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-15 06:01:29] [INFO ] Implicit Places using invariants in 337 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 339 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 361 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 296 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 1663 ms.
Product exploration explored 100000 steps with 0 reset in 1868 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 147 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 231 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 146 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=29 )
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 266 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 251 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 232 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 9 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:01:34] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 06:01:34] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-15 06:01:34] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-15 06:01:34] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:34] [INFO ] Invariant cache hit.
[2023-03-15 06:01:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:01:35] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1711 ms to find 0 implicit places.
[2023-03-15 06:01:35] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:35] [INFO ] Invariant cache hit.
[2023-03-15 06:01:36] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2516 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 137 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 231 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 125 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=41 )
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 265 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 231 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 228 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 228 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 1850 ms.
Product exploration explored 100000 steps with 0 reset in 1621 ms.
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 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:01:41] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:41] [INFO ] Invariant cache hit.
[2023-03-15 06:01:42] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-15 06:01:42] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:42] [INFO ] Invariant cache hit.
[2023-03-15 06:01:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:01:43] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
[2023-03-15 06:01:43] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:43] [INFO ] Invariant cache hit.
[2023-03-15 06:01:44] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2387 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-PT-4-LTLFireability-02 finished in 15382 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 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:01:44] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 06:01:44] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-15 06:01:44] [INFO ] Implicit Places using invariants in 338 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 340 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 352 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 373 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 6629 reset in 1749 ms.
Stack based approach found an accepted trace after 7045 steps with 463 reset with depth 8 and stack size 8 in 89 ms.
FORMULA Peterson-PT-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-05 finished in 2614 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 10 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:01:46] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:46] [INFO ] Invariant cache hit.
[2023-03-15 06:01:47] [INFO ] Implicit Places using invariants in 360 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 361 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 375 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 525 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 6 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 931 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 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:01:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:01:47] [INFO ] Invariant cache hit.
[2023-03-15 06:01:48] [INFO ] Implicit Places using invariants in 241 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 244 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 259 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 357 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 13356 reset in 1268 ms.
Product exploration explored 100000 steps with 13414 reset in 776 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 141 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 340 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 18 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
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 242 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 361 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 364 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-15 06:01:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 06:01:51] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 06:01:53] [INFO ] [Real]Absence check using 14 positive place invariants in 31 ms returned sat
[2023-03-15 06:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:01:54] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2023-03-15 06:01:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:01:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2023-03-15 06:01:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:01:57] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2023-03-15 06:01:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:01:57] [INFO ] [Nat]Added 116 Read/Feed constraints in 43 ms returned sat
[2023-03-15 06:01:57] [INFO ] Deduced a trap composed of 10 places in 429 ms of which 1 ms to minimize.
[2023-03-15 06:01:58] [INFO ] Deduced a trap composed of 43 places in 394 ms of which 1 ms to minimize.
[2023-03-15 06:01:58] [INFO ] Deduced a trap composed of 69 places in 394 ms of which 2 ms to minimize.
[2023-03-15 06:01:59] [INFO ] Deduced a trap composed of 69 places in 395 ms of which 1 ms to minimize.
[2023-03-15 06:01:59] [INFO ] Deduced a trap composed of 57 places in 414 ms of which 1 ms to minimize.
[2023-03-15 06:02:00] [INFO ] Deduced a trap composed of 35 places in 340 ms of which 1 ms to minimize.
[2023-03-15 06:02:00] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 1 ms to minimize.
[2023-03-15 06:02:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3076 ms
[2023-03-15 06:02:00] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 80 ms.
[2023-03-15 06:02:06] [INFO ] Added : 347 causal constraints over 70 iterations in 6536 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-15 06:02:06] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:02:07] [INFO ] Invariant cache hit.
[2023-03-15 06:02:10] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2023-03-15 06:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:02:11] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2023-03-15 06:02:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:02:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2023-03-15 06:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:02:16] [INFO ] [Nat]Absence check using state equation in 1015 ms returned sat
[2023-03-15 06:02:16] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:02:16] [INFO ] [Nat]Added 116 Read/Feed constraints in 110 ms returned sat
[2023-03-15 06:02:16] [INFO ] Deduced a trap composed of 94 places in 310 ms of which 1 ms to minimize.
[2023-03-15 06:02:17] [INFO ] Deduced a trap composed of 46 places in 384 ms of which 1 ms to minimize.
[2023-03-15 06:02:17] [INFO ] Deduced a trap composed of 10 places in 401 ms of which 1 ms to minimize.
[2023-03-15 06:02:18] [INFO ] Deduced a trap composed of 65 places in 292 ms of which 1 ms to minimize.
[2023-03-15 06:02:18] [INFO ] Deduced a trap composed of 40 places in 433 ms of which 1 ms to minimize.
[2023-03-15 06:02:19] [INFO ] Deduced a trap composed of 21 places in 397 ms of which 1 ms to minimize.
[2023-03-15 06:02:19] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 1 ms to minimize.
[2023-03-15 06:02:19] [INFO ] Deduced a trap composed of 69 places in 279 ms of which 1 ms to minimize.
[2023-03-15 06:02:20] [INFO ] Deduced a trap composed of 47 places in 294 ms of which 1 ms to minimize.
[2023-03-15 06:02:20] [INFO ] Deduced a trap composed of 10 places in 367 ms of which 1 ms to minimize.
[2023-03-15 06:02:21] [INFO ] Deduced a trap composed of 10 places in 364 ms of which 1 ms to minimize.
[2023-03-15 06:02:21] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2023-03-15 06:02:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4898 ms
[2023-03-15 06:02:21] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 79 ms.
[2023-03-15 06:02:26] [INFO ] Added : 315 causal constraints over 63 iterations in 5670 ms. Result :unknown
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 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:02:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:02:26] [INFO ] Invariant cache hit.
[2023-03-15 06:02:27] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-15 06:02:27] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:02:27] [INFO ] Invariant cache hit.
[2023-03-15 06:02:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:02:27] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2023-03-15 06:02:27] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:02:27] [INFO ] Invariant cache hit.
[2023-03-15 06:02:28] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1829 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 156 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 349 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 19 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=6 )
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 256 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 352 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 373 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-15 06:02:30] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:02:30] [INFO ] Invariant cache hit.
[2023-03-15 06:02:32] [INFO ] [Real]Absence check using 14 positive place invariants in 60 ms returned sat
[2023-03-15 06:02:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:02:33] [INFO ] [Real]Absence check using state equation in 1432 ms returned sat
[2023-03-15 06:02:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:02:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2023-03-15 06:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:02:36] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2023-03-15 06:02:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:02:36] [INFO ] [Nat]Added 116 Read/Feed constraints in 59 ms returned sat
[2023-03-15 06:02:36] [INFO ] Deduced a trap composed of 32 places in 405 ms of which 1 ms to minimize.
[2023-03-15 06:02:37] [INFO ] Deduced a trap composed of 47 places in 422 ms of which 1 ms to minimize.
[2023-03-15 06:02:37] [INFO ] Deduced a trap composed of 32 places in 435 ms of which 1 ms to minimize.
[2023-03-15 06:02:38] [INFO ] Deduced a trap composed of 32 places in 446 ms of which 1 ms to minimize.
[2023-03-15 06:02:39] [INFO ] Deduced a trap composed of 32 places in 464 ms of which 1 ms to minimize.
[2023-03-15 06:02:39] [INFO ] Deduced a trap composed of 39 places in 436 ms of which 1 ms to minimize.
[2023-03-15 06:02:40] [INFO ] Deduced a trap composed of 35 places in 445 ms of which 1 ms to minimize.
[2023-03-15 06:02:40] [INFO ] Deduced a trap composed of 13 places in 447 ms of which 1 ms to minimize.
[2023-03-15 06:02:41] [INFO ] Deduced a trap composed of 10 places in 459 ms of which 1 ms to minimize.
[2023-03-15 06:02:41] [INFO ] Deduced a trap composed of 35 places in 383 ms of which 1 ms to minimize.
[2023-03-15 06:02:41] [INFO ] Deduced a trap composed of 96 places in 363 ms of which 1 ms to minimize.
[2023-03-15 06:02:42] [INFO ] Deduced a trap composed of 54 places in 371 ms of which 1 ms to minimize.
[2023-03-15 06:02:42] [INFO ] Deduced a trap composed of 38 places in 360 ms of which 1 ms to minimize.
[2023-03-15 06:02:43] [INFO ] Deduced a trap composed of 30 places in 315 ms of which 1 ms to minimize.
[2023-03-15 06:02:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6720 ms
[2023-03-15 06:02:43] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 79 ms.
[2023-03-15 06:02:47] [INFO ] Added : 198 causal constraints over 41 iterations in 3781 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-15 06:02:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:02:47] [INFO ] Invariant cache hit.
[2023-03-15 06:02:50] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-15 06:02:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:02:52] [INFO ] [Real]Absence check using state equation in 1140 ms returned sat
[2023-03-15 06:02:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:02:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-15 06:02:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:02:56] [INFO ] [Nat]Absence check using state equation in 988 ms returned sat
[2023-03-15 06:02:56] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:02:56] [INFO ] [Nat]Added 116 Read/Feed constraints in 75 ms returned sat
[2023-03-15 06:02:56] [INFO ] Deduced a trap composed of 94 places in 289 ms of which 1 ms to minimize.
[2023-03-15 06:02:57] [INFO ] Deduced a trap composed of 46 places in 375 ms of which 1 ms to minimize.
[2023-03-15 06:02:57] [INFO ] Deduced a trap composed of 10 places in 372 ms of which 1 ms to minimize.
[2023-03-15 06:02:58] [INFO ] Deduced a trap composed of 65 places in 291 ms of which 1 ms to minimize.
[2023-03-15 06:02:58] [INFO ] Deduced a trap composed of 40 places in 419 ms of which 1 ms to minimize.
[2023-03-15 06:02:59] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 1 ms to minimize.
[2023-03-15 06:02:59] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 1 ms to minimize.
[2023-03-15 06:02:59] [INFO ] Deduced a trap composed of 69 places in 282 ms of which 1 ms to minimize.
[2023-03-15 06:03:00] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 1 ms to minimize.
[2023-03-15 06:03:00] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 0 ms to minimize.
[2023-03-15 06:03:00] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 0 ms to minimize.
[2023-03-15 06:03:01] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2023-03-15 06:03:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4659 ms
[2023-03-15 06:03:01] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 70 ms.
[2023-03-15 06:03:07] [INFO ] Added : 325 causal constraints over 65 iterations in 5920 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 367 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 13363 reset in 1045 ms.
Product exploration explored 100000 steps with 13331 reset in 977 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 308 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 70 ms. Remains 419 /475 variables (removed 56) and now considering 634/690 (removed 56) transitions.
[2023-03-15 06:03:10] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 06:03:10] [INFO ] Flow matrix only has 574 transitions (discarded 60 similar events)
// Phase 1: matrix 574 rows 419 cols
[2023-03-15 06:03:10] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 06:03:10] [INFO ] Dead Transitions using invariants and state equation in 612 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 702 ms. Remains : 419/475 places, 634/690 transitions.
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-15 06:03:10] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 06:03:10] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 06:03:10] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-15 06:03:10] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:03:10] [INFO ] Invariant cache hit.
[2023-03-15 06:03:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:03:11] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-15 06:03:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:03:11] [INFO ] Invariant cache hit.
[2023-03-15 06:03:12] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1798 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-PT-4-LTLFireability-07 finished in 84748 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 10 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:03:12] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 06:03:12] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-15 06:03:12] [INFO ] Implicit Places using invariants in 355 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 357 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 11 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 379 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 241 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 698 ms.
Product exploration explored 100000 steps with 33333 reset in 416 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 254 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 2017 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 10 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:03:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:03:14] [INFO ] Invariant cache hit.
[2023-03-15 06:03:15] [INFO ] Implicit Places using invariants in 471 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 473 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 493 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 323 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 244 ms.
Stack based approach found an accepted trace after 155 steps with 0 reset with depth 156 and stack size 156 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-09 finished in 1092 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 10 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:03:15] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:03:15] [INFO ] Invariant cache hit.
[2023-03-15 06:03:16] [INFO ] Implicit Places using invariants in 457 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 459 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 478 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 159 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 715 ms.
Product exploration explored 100000 steps with 50000 reset in 488 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 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 6 factoid took 220 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 2091 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-15 06:03:17] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 06:03:17] [INFO ] Invariant cache hit.
[2023-03-15 06:03:18] [INFO ] Implicit Places using invariants in 430 ms returned [467, 469, 470, 471]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 432 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 9 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 448 ms. Remains : 476/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 330 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 809 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 32 ms. Remains 161 /480 variables (removed 319) and now considering 371/690 (removed 319) transitions.
[2023-03-15 06:03:18] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 161 cols
[2023-03-15 06:03:18] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 06:03:18] [INFO ] Implicit Places using invariants in 323 ms returned [151, 152, 153, 154, 155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 340 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 9 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 383 ms. Remains : 156/480 places, 371/690 transitions.
Stuttering acceptance computed with spot in 58 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 261 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-12 finished in 724 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 1 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 31 ms. Remains 166 /480 variables (removed 314) and now considering 376/690 (removed 314) transitions.
[2023-03-15 06:03:19] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 166 cols
[2023-03-15 06:03:19] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 06:03:19] [INFO ] Implicit Places using invariants in 341 ms returned [155, 156, 157, 158, 159]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 343 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 7 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 383 ms. Remains : 161/480 places, 376/690 transitions.
Stuttering acceptance computed with spot in 109 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 354 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 2 ms.
FORMULA Peterson-PT-4-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-13 finished in 884 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 0 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 26 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2023-03-15 06:03:20] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2023-03-15 06:03:20] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 06:03:20] [INFO ] Implicit Places using invariants in 322 ms returned [150, 151, 152, 153]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 324 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 7 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 358 ms. Remains : 156/480 places, 370/690 transitions.
Stuttering acceptance computed with spot in 100 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 493 reset in 267 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-14 finished in 755 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 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 06:03:20] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 06:03:20] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-15 06:03:21] [INFO ] Implicit Places using invariants in 455 ms returned [467, 468, 470, 471]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 469 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 9 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 488 ms. Remains : 476/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 267 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-15 finished in 790 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(p0)||X(X(F(p1)))))'
Found a Shortening insensitive property : Peterson-PT-4-LTLFireability-00
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 60 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 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 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 400 place count 280 transition count 405
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 570 place count 195 transition count 405
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 610 place count 175 transition count 385
Applied a total of 610 rules in 32 ms. Remains 175 /480 variables (removed 305) and now considering 385/690 (removed 305) transitions.
[2023-03-15 06:03:22] [INFO ] Flow matrix only has 325 transitions (discarded 60 similar events)
// Phase 1: matrix 325 rows 175 cols
[2023-03-15 06:03:22] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 06:03:22] [INFO ] Implicit Places using invariants in 250 ms returned [165, 166, 167, 168, 169]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 254 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 170/480 places, 385/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 294 ms. Remains : 170/480 places, 385/690 transitions.
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 s117 1) (EQ s137 1)) (AND (EQ s121 1) (EQ s167 1)) (AND (EQ s126 1) (EQ s134 1)) (AND (EQ s124 1) (EQ s136 1)) (AND (EQ s115 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, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20500 reset in 585 ms.
Stack based approach found an accepted trace after 484 steps with 91 reset with depth 8 and stack size 8 in 2 ms.
Treatment of property Peterson-PT-4-LTLFireability-00 finished in 1318 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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 197 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 1 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 23 ms. Remains 276 /480 variables (removed 204) and now considering 486/690 (removed 204) transitions.
[2023-03-15 06:03:23] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 276 cols
[2023-03-15 06:03:23] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-15 06:03:23] [INFO ] Implicit Places using invariants in 294 ms returned [263, 264, 265, 266, 267]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 296 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 7 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 327 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 1842 ms.
Product exploration explored 100000 steps with 0 reset in 1514 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 131 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 203 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 103 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=34 )
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 258 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 228 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 216 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 2 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-15 06:03:28] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 271 cols
[2023-03-15 06:03:28] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 06:03:28] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-15 06:03:28] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-15 06:03:28] [INFO ] Invariant cache hit.
[2023-03-15 06:03:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:03:29] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
[2023-03-15 06:03:29] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-15 06:03:29] [INFO ] Invariant cache hit.
[2023-03-15 06:03:29] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1659 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 132 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 216 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 97 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=48 )
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 254 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 220 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 220 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 227 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 1883 ms.
Product exploration explored 100000 steps with 0 reset in 1750 ms.
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-15 06:03:34] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-15 06:03:34] [INFO ] Invariant cache hit.
[2023-03-15 06:03:35] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-15 06:03:35] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-15 06:03:35] [INFO ] Invariant cache hit.
[2023-03-15 06:03:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 06:03:35] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2023-03-15 06:03:35] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-15 06:03:35] [INFO ] Invariant cache hit.
[2023-03-15 06:03:35] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1100 ms. Remains : 271/271 places, 486/486 transitions.
Treatment of property Peterson-PT-4-LTLFireability-02 finished in 12962 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-15 06:03:36] [INFO ] Flatten gal took : 48 ms
[2023-03-15 06:03:36] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2023-03-15 06:03:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 4 ms.
Total runtime 233540 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-PT-4
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA Peterson-PT-4-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-4-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678860379743

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 Peterson-PT-4-LTLFireability-07
lola: time limit : 1197 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1197 3/32 Peterson-PT-4-LTLFireability-07 256142 m, 51228 m/sec, 749049 t fired, .

Time elapsed: 12 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1197 5/32 Peterson-PT-4-LTLFireability-07 545260 m, 57823 m/sec, 1508990 t fired, .

Time elapsed: 17 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1197 7/32 Peterson-PT-4-LTLFireability-07 806935 m, 52335 m/sec, 2266787 t fired, .

Time elapsed: 22 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1197 9/32 Peterson-PT-4-LTLFireability-07 1062434 m, 51099 m/sec, 3019492 t fired, .

Time elapsed: 27 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1197 11/32 Peterson-PT-4-LTLFireability-07 1310232 m, 49559 m/sec, 3795010 t fired, .

Time elapsed: 32 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1197 13/32 Peterson-PT-4-LTLFireability-07 1544858 m, 46925 m/sec, 4550401 t fired, .

Time elapsed: 37 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1197 15/32 Peterson-PT-4-LTLFireability-07 1773644 m, 45757 m/sec, 5304323 t fired, .

Time elapsed: 42 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1197 16/32 Peterson-PT-4-LTLFireability-07 2000365 m, 45344 m/sec, 6049828 t fired, .

Time elapsed: 47 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1197 18/32 Peterson-PT-4-LTLFireability-07 2248327 m, 49592 m/sec, 6801431 t fired, .

Time elapsed: 52 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1197 20/32 Peterson-PT-4-LTLFireability-07 2464097 m, 43154 m/sec, 7538227 t fired, .

Time elapsed: 57 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/1197 21/32 Peterson-PT-4-LTLFireability-07 2672585 m, 41697 m/sec, 8329993 t fired, .

Time elapsed: 62 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 60/1197 22/32 Peterson-PT-4-LTLFireability-07 2867670 m, 39017 m/sec, 9111327 t fired, .

Time elapsed: 67 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 65/1197 24/32 Peterson-PT-4-LTLFireability-07 3075084 m, 41482 m/sec, 9885220 t fired, .

Time elapsed: 72 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 70/1197 26/32 Peterson-PT-4-LTLFireability-07 3312785 m, 47540 m/sec, 10663542 t fired, .

Time elapsed: 77 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 7 (type EXCL) for Peterson-PT-4-LTLFireability-07
lola: result : false
lola: markings : 3499019
lola: fired transitions : 11373526
lola: time used : 75.000000
lola: memory pages used : 27
lola: LAUNCH task # 4 (type EXCL) for 3 Peterson-PT-4-LTLFireability-02
lola: time limit : 1759 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 0/1759 1/32 Peterson-PT-4-LTLFireability-02 22412 m, 4482 m/sec, 50929 t fired, .

Time elapsed: 82 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1759 3/32 Peterson-PT-4-LTLFireability-02 245789 m, 44675 m/sec, 1037164 t fired, .

Time elapsed: 87 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1759 5/32 Peterson-PT-4-LTLFireability-02 470154 m, 44873 m/sec, 2024366 t fired, .

Time elapsed: 92 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1759 7/32 Peterson-PT-4-LTLFireability-02 690009 m, 43971 m/sec, 2995941 t fired, .

Time elapsed: 97 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1759 10/32 Peterson-PT-4-LTLFireability-02 907351 m, 43468 m/sec, 3962096 t fired, .

Time elapsed: 102 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1759 12/32 Peterson-PT-4-LTLFireability-02 1121931 m, 42916 m/sec, 4923804 t fired, .

Time elapsed: 107 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1759 14/32 Peterson-PT-4-LTLFireability-02 1336542 m, 42922 m/sec, 5869018 t fired, .

Time elapsed: 112 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1759 16/32 Peterson-PT-4-LTLFireability-02 1545932 m, 41878 m/sec, 6804619 t fired, .

Time elapsed: 117 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1759 18/32 Peterson-PT-4-LTLFireability-02 1758503 m, 42514 m/sec, 7738753 t fired, .

Time elapsed: 122 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1759 20/32 Peterson-PT-4-LTLFireability-02 1967733 m, 41846 m/sec, 8668442 t fired, .

Time elapsed: 127 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1759 22/32 Peterson-PT-4-LTLFireability-02 2172101 m, 40873 m/sec, 9573119 t fired, .

Time elapsed: 132 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1759 24/32 Peterson-PT-4-LTLFireability-02 2372428 m, 40065 m/sec, 10465396 t fired, .

Time elapsed: 137 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1759 26/32 Peterson-PT-4-LTLFireability-02 2580628 m, 41640 m/sec, 11373855 t fired, .

Time elapsed: 142 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1759 28/32 Peterson-PT-4-LTLFireability-02 2784799 m, 40834 m/sec, 12272969 t fired, .

Time elapsed: 147 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1759 30/32 Peterson-PT-4-LTLFireability-02 2986232 m, 40286 m/sec, 13170758 t fired, .

Time elapsed: 152 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1759 31/32 Peterson-PT-4-LTLFireability-02 3187865 m, 40326 m/sec, 14061886 t fired, .

Time elapsed: 157 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for Peterson-PT-4-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-PT-4-LTLFireability-02: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 162 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 Peterson-PT-4-LTLFireability-00
lola: time limit : 3438 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Peterson-PT-4-LTLFireability-00
lola: result : false
lola: markings : 406
lola: fired transitions : 524
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-4-LTLFireability-00: LTL false LTL model checker
Peterson-PT-4-LTLFireability-02: LTL unknown AGGR
Peterson-PT-4-LTLFireability-07: LTL false LTL model checker


Time elapsed: 162 secs. Pages in use: 32

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="lolaxred"
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 lolaxred"
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 r263-smll-167863538500620"
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 ;