fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r295-tall-167873948100604
Last Updated
May 14, 2023

About the Execution of LoLa+red for PolyORBLF-PT-S06J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1002.220 817558.00 860551.00 4392.70 ?FFFFFFFTTTFFFF? normal

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.r295-tall-167873948100604.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 PolyORBLF-PT-S06J04T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948100604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 26K Feb 26 14:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 14:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Feb 26 14:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 984K Feb 26 14:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 154K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 26 15:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Feb 26 15:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBLF-PT-S06J04T08-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S06J04T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678874002099

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=PolyORBLF-PT-S06J04T08
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 09:53:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 09:53:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:53:24] [INFO ] Load time of PNML (sax parser for PT used): 563 ms
[2023-03-15 09:53:24] [INFO ] Transformed 810 places.
[2023-03-15 09:53:24] [INFO ] Transformed 14014 transitions.
[2023-03-15 09:53:24] [INFO ] Parsed PT model containing 810 places and 14014 transitions and 118428 arcs in 712 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 202 out of 810 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 810/810 places, 3254/3254 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 804 transition count 3254
Applied a total of 6 rules in 168 ms. Remains 804 /810 variables (removed 6) and now considering 3254/3254 (removed 0) transitions.
[2023-03-15 09:53:24] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 804 cols
[2023-03-15 09:53:24] [INFO ] Computed 52 place invariants in 190 ms
[2023-03-15 09:53:27] [INFO ] Dead Transitions using invariants and state equation in 3060 ms found 1224 transitions.
Found 1224 dead transitions using SMT.
Drop transitions removed 1224 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1224 transitions.
[2023-03-15 09:53:27] [INFO ] Flow matrix only has 1982 transitions (discarded 48 similar events)
// Phase 1: matrix 1982 rows 804 cols
[2023-03-15 09:53:27] [INFO ] Computed 52 place invariants in 65 ms
[2023-03-15 09:53:28] [INFO ] Implicit Places using invariants in 673 ms returned []
[2023-03-15 09:53:28] [INFO ] Flow matrix only has 1982 transitions (discarded 48 similar events)
[2023-03-15 09:53:28] [INFO ] Invariant cache hit.
[2023-03-15 09:53:29] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 09:53:35] [INFO ] Implicit Places using invariants and state equation in 7339 ms returned []
Implicit Place search using SMT with State Equation took 8020 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 804/810 places, 2030/3254 transitions.
Applied a total of 0 rules in 18 ms. Remains 804 /804 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11300 ms. Remains : 804/810 places, 2030/3254 transitions.
Support contains 202 out of 804 places after structural reductions.
[2023-03-15 09:53:36] [INFO ] Flatten gal took : 207 ms
[2023-03-15 09:53:36] [INFO ] Flatten gal took : 135 ms
[2023-03-15 09:53:36] [INFO ] Input system was already deterministic with 2030 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 28) seen :25
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-15 09:53:37] [INFO ] Flow matrix only has 1982 transitions (discarded 48 similar events)
[2023-03-15 09:53:37] [INFO ] Invariant cache hit.
[2023-03-15 09:53:37] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-15 09:53:37] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 43 ms returned sat
[2023-03-15 09:53:43] [INFO ] After 5515ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 09:53:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-15 09:53:43] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 40 ms returned sat
[2023-03-15 09:53:57] [INFO ] After 14249ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 804 transition count 1966
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 740 transition count 1966
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 128 place count 740 transition count 1870
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 320 place count 644 transition count 1870
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 512 place count 548 transition count 1774
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 535 place count 548 transition count 1751
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 558 place count 525 transition count 1751
Applied a total of 558 rules in 267 ms. Remains 525 /804 variables (removed 279) and now considering 1751/2030 (removed 279) transitions.
[2023-03-15 09:53:57] [INFO ] Flow matrix only has 1703 transitions (discarded 48 similar events)
// Phase 1: matrix 1703 rows 525 cols
[2023-03-15 09:53:57] [INFO ] Computed 52 place invariants in 33 ms
[2023-03-15 09:53:58] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1346 ms. Remains : 525/804 places, 1751/2030 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102673 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102673 steps, saw 35853 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:54:01] [INFO ] Flow matrix only has 1703 transitions (discarded 48 similar events)
[2023-03-15 09:54:01] [INFO ] Invariant cache hit.
[2023-03-15 09:54:01] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-15 09:54:01] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 31 ms returned sat
[2023-03-15 09:54:05] [INFO ] After 3313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:54:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-15 09:54:05] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 29 ms returned sat
[2023-03-15 09:54:12] [INFO ] After 7102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:54:12] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 09:54:21] [INFO ] After 9068ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:54:21] [INFO ] After 16302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1751/1751 transitions.
Applied a total of 0 rules in 45 ms. Remains 525 /525 variables (removed 0) and now considering 1751/1751 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 525/525 places, 1751/1751 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1751/1751 transitions.
Applied a total of 0 rules in 46 ms. Remains 525 /525 variables (removed 0) and now considering 1751/1751 (removed 0) transitions.
[2023-03-15 09:54:21] [INFO ] Flow matrix only has 1703 transitions (discarded 48 similar events)
[2023-03-15 09:54:21] [INFO ] Invariant cache hit.
[2023-03-15 09:54:22] [INFO ] Implicit Places using invariants in 739 ms returned [33, 49, 147, 188, 220, 326, 333, 516]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 744 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 517/525 places, 1751/1751 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 513 transition count 1747
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 513 transition count 1747
Applied a total of 8 rules in 80 ms. Remains 513 /517 variables (removed 4) and now considering 1747/1751 (removed 4) transitions.
[2023-03-15 09:54:22] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
// Phase 1: matrix 1699 rows 513 cols
[2023-03-15 09:54:22] [INFO ] Computed 44 place invariants in 40 ms
[2023-03-15 09:54:23] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-15 09:54:23] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
[2023-03-15 09:54:23] [INFO ] Invariant cache hit.
[2023-03-15 09:54:23] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 09:54:33] [INFO ] Implicit Places using invariants and state equation in 10672 ms returned []
Implicit Place search using SMT with State Equation took 11359 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 513/525 places, 1747/1751 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12229 ms. Remains : 513/525 places, 1747/1751 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 107212 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107212 steps, saw 37315 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:54:36] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
[2023-03-15 09:54:36] [INFO ] Invariant cache hit.
[2023-03-15 09:54:36] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-15 09:54:37] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 29 ms returned sat
[2023-03-15 09:54:40] [INFO ] After 3440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:54:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-15 09:54:40] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 39 ms returned sat
[2023-03-15 09:54:59] [INFO ] After 19162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 1747/1747 transitions.
Applied a total of 0 rules in 46 ms. Remains 513 /513 variables (removed 0) and now considering 1747/1747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 513/513 places, 1747/1747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 1747/1747 transitions.
Applied a total of 0 rules in 36 ms. Remains 513 /513 variables (removed 0) and now considering 1747/1747 (removed 0) transitions.
[2023-03-15 09:54:59] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
[2023-03-15 09:54:59] [INFO ] Invariant cache hit.
[2023-03-15 09:55:00] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-15 09:55:00] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
[2023-03-15 09:55:00] [INFO ] Invariant cache hit.
[2023-03-15 09:55:00] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 09:55:10] [INFO ] Implicit Places using invariants and state equation in 10069 ms returned []
Implicit Place search using SMT with State Equation took 10675 ms to find 0 implicit places.
[2023-03-15 09:55:10] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-15 09:55:10] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
[2023-03-15 09:55:10] [INFO ] Invariant cache hit.
[2023-03-15 09:55:11] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11804 ms. Remains : 513/513 places, 1747/1747 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 513 transition count 1699
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 96 place count 513 transition count 1651
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 112 place count 505 transition count 1731
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 505 transition count 1723
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 128 place count 497 transition count 1723
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 497 transition count 1715
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 144 place count 489 transition count 1715
Applied a total of 144 rules in 220 ms. Remains 489 /513 variables (removed 24) and now considering 1715/1747 (removed 32) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1715 rows 489 cols
[2023-03-15 09:55:11] [INFO ] Computed 44 place invariants in 29 ms
[2023-03-15 09:55:11] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-15 09:55:11] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 25 ms returned sat
[2023-03-15 09:55:11] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:55:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-15 09:55:11] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 24 ms returned sat
[2023-03-15 09:58:56] [INFO ] After 225021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X((X(X(X(F(!p0)))) U G(!p1))))'
Support contains 18 out of 804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 796 transition count 2022
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 796 transition count 2022
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 788 transition count 2014
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 788 transition count 2014
Applied a total of 32 rules in 46 ms. Remains 788 /804 variables (removed 16) and now considering 2014/2030 (removed 16) transitions.
[2023-03-15 09:58:57] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 788 cols
[2023-03-15 09:58:57] [INFO ] Computed 52 place invariants in 40 ms
[2023-03-15 09:58:59] [INFO ] Dead Transitions using invariants and state equation in 2317 ms found 0 transitions.
[2023-03-15 09:58:59] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 09:58:59] [INFO ] Invariant cache hit.
[2023-03-15 09:59:00] [INFO ] Implicit Places using invariants in 764 ms returned [49, 73, 221, 280, 329, 486, 496, 773]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 770 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 780/804 places, 2014/2030 transitions.
Applied a total of 0 rules in 15 ms. Remains 780 /780 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3154 ms. Remains : 780/804 places, 2014/2030 transitions.
Stuttering acceptance computed with spot in 417 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s581 1) (GEQ s717 1) (GEQ s177 1) (GEQ s372 1) (GEQ s601 1) (GEQ s322 1) (GEQ s526 1) (GEQ s11 1)), p0:(OR (AND (GEQ s114 1) (GEQ s320 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20055 reset in 1084 ms.
Product exploration explored 100000 steps with 20024 reset in 973 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 p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Finished random walk after 260 steps, including 4 resets, run visited all 2 properties in 4 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 253 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Support contains 18 out of 780 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 2014/2014 transitions.
Applied a total of 0 rules in 12 ms. Remains 780 /780 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
[2023-03-15 09:59:04] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 780 cols
[2023-03-15 09:59:04] [INFO ] Computed 44 place invariants in 45 ms
[2023-03-15 09:59:06] [INFO ] Dead Transitions using invariants and state equation in 2226 ms found 0 transitions.
[2023-03-15 09:59:06] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 09:59:06] [INFO ] Invariant cache hit.
[2023-03-15 09:59:07] [INFO ] Implicit Places using invariants in 755 ms returned []
[2023-03-15 09:59:07] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 09:59:07] [INFO ] Invariant cache hit.
[2023-03-15 09:59:07] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 09:59:22] [INFO ] Implicit Places using invariants and state equation in 15070 ms returned []
Implicit Place search using SMT with State Equation took 15826 ms to find 0 implicit places.
[2023-03-15 09:59:22] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 09:59:22] [INFO ] Invariant cache hit.
[2023-03-15 09:59:24] [INFO ] Dead Transitions using invariants and state equation in 2173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20243 ms. Remains : 780/780 places, 2014/2014 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 p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Finished random walk after 303 steps, including 2 resets, run visited all 2 properties in 4 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 244 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 263 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 20036 reset in 968 ms.
Product exploration explored 100000 steps with 20037 reset in 962 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 286 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Support contains 18 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2014/2014 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 780 transition count 2014
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 61 Pre rules applied. Total rules applied 51 place count 780 transition count 2110
Deduced a syphon composed of 112 places in 1 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 112 place count 780 transition count 2110
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 128 place count 764 transition count 2094
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 144 place count 764 transition count 2094
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 2 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 264 place count 764 transition count 2094
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 292 place count 736 transition count 2066
Deduced a syphon composed of 192 places in 1 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 320 place count 736 transition count 2066
Deduced a syphon composed of 192 places in 2 ms
Applied a total of 320 rules in 272 ms. Remains 736 /780 variables (removed 44) and now considering 2066/2014 (removed -52) transitions.
[2023-03-15 09:59:28] [INFO ] Flow matrix only has 2018 transitions (discarded 48 similar events)
// Phase 1: matrix 2018 rows 736 cols
[2023-03-15 09:59:28] [INFO ] Computed 44 place invariants in 35 ms
[2023-03-15 09:59:30] [INFO ] Dead Transitions using invariants and state equation in 1610 ms found 0 transitions.
[2023-03-15 09:59:30] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-15 09:59:30] [INFO ] Flow matrix only has 2018 transitions (discarded 48 similar events)
[2023-03-15 09:59:30] [INFO ] Invariant cache hit.
[2023-03-15 09:59:31] [INFO ] Dead Transitions using invariants and state equation in 1641 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 736/780 places, 2066/2014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3656 ms. Remains : 736/780 places, 2066/2014 transitions.
Support contains 18 out of 780 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 2014/2014 transitions.
Applied a total of 0 rules in 15 ms. Remains 780 /780 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
[2023-03-15 09:59:31] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 780 cols
[2023-03-15 09:59:31] [INFO ] Computed 44 place invariants in 46 ms
[2023-03-15 09:59:34] [INFO ] Dead Transitions using invariants and state equation in 2121 ms found 0 transitions.
[2023-03-15 09:59:34] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 09:59:34] [INFO ] Invariant cache hit.
[2023-03-15 09:59:34] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-15 09:59:34] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 09:59:34] [INFO ] Invariant cache hit.
[2023-03-15 09:59:35] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 09:59:48] [INFO ] Implicit Places using invariants and state equation in 14122 ms returned []
Implicit Place search using SMT with State Equation took 14898 ms to find 0 implicit places.
[2023-03-15 09:59:48] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 09:59:48] [INFO ] Invariant cache hit.
[2023-03-15 09:59:51] [INFO ] Dead Transitions using invariants and state equation in 2174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19211 ms. Remains : 780/780 places, 2014/2014 transitions.
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-00 finished in 54164 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))'
Support contains 10 out of 804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 796 transition count 2022
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 796 transition count 2022
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 788 transition count 2014
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 788 transition count 2014
Applied a total of 32 rules in 51 ms. Remains 788 /804 variables (removed 16) and now considering 2014/2030 (removed 16) transitions.
[2023-03-15 09:59:51] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 788 cols
[2023-03-15 09:59:51] [INFO ] Computed 52 place invariants in 37 ms
[2023-03-15 09:59:53] [INFO ] Dead Transitions using invariants and state equation in 2233 ms found 0 transitions.
[2023-03-15 09:59:53] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 09:59:53] [INFO ] Invariant cache hit.
[2023-03-15 09:59:54] [INFO ] Implicit Places using invariants in 749 ms returned [49, 73, 221, 280, 329, 486, 496, 773]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 753 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 780/804 places, 2014/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 780 /780 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3052 ms. Remains : 780/804 places, 2014/2030 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s114 1) (GEQ s320 1) (GEQ s513 1)) (AND (GEQ s320 1) (GEQ s382 1) (GEQ s513 1)) (AND (GEQ s239 1) (GEQ s320 1) (GEQ s513 1)) (AND (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-01 finished in 3202 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 9 out of 804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 804 transition count 1974
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 748 transition count 1966
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 740 transition count 1966
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 128 place count 740 transition count 1870
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 320 place count 644 transition count 1870
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 512 place count 548 transition count 1774
Applied a total of 512 rules in 102 ms. Remains 548 /804 variables (removed 256) and now considering 1774/2030 (removed 256) transitions.
[2023-03-15 09:59:54] [INFO ] Flow matrix only has 1726 transitions (discarded 48 similar events)
// Phase 1: matrix 1726 rows 548 cols
[2023-03-15 09:59:54] [INFO ] Computed 52 place invariants in 27 ms
[2023-03-15 09:59:55] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
[2023-03-15 09:59:55] [INFO ] Flow matrix only has 1726 transitions (discarded 48 similar events)
[2023-03-15 09:59:55] [INFO ] Invariant cache hit.
[2023-03-15 09:59:56] [INFO ] Implicit Places using invariants in 583 ms returned [37, 53, 154, 196, 230, 341, 348, 539]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 586 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 540/804 places, 1774/2030 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 536 transition count 1770
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 536 transition count 1770
Applied a total of 8 rules in 43 ms. Remains 536 /540 variables (removed 4) and now considering 1770/1774 (removed 4) transitions.
[2023-03-15 09:59:56] [INFO ] Flow matrix only has 1722 transitions (discarded 48 similar events)
// Phase 1: matrix 1722 rows 536 cols
[2023-03-15 09:59:56] [INFO ] Computed 44 place invariants in 33 ms
[2023-03-15 09:59:57] [INFO ] Implicit Places using invariants in 645 ms returned []
[2023-03-15 09:59:57] [INFO ] Flow matrix only has 1722 transitions (discarded 48 similar events)
[2023-03-15 09:59:57] [INFO ] Invariant cache hit.
[2023-03-15 09:59:57] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 10:00:07] [INFO ] Implicit Places using invariants and state equation in 10456 ms returned []
Implicit Place search using SMT with State Equation took 11104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 536/804 places, 1770/2030 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12938 ms. Remains : 536/804 places, 1770/2030 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s126 1) (GEQ s414 1)) (AND (GEQ s126 1) (GEQ s483 1)) (AND (GEQ s126 1) (GEQ s177 1)) (AND (GEQ s126 1) (GEQ s307 1)) (AND (GEQ s124 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-02 finished in 12988 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((X((p0&&X(p1)))&&(F(p3)||p2))))'
Support contains 118 out of 804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 796 transition count 2022
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 796 transition count 2022
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 788 transition count 2014
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 788 transition count 2014
Applied a total of 32 rules in 35 ms. Remains 788 /804 variables (removed 16) and now considering 2014/2030 (removed 16) transitions.
[2023-03-15 10:00:07] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 788 cols
[2023-03-15 10:00:07] [INFO ] Computed 52 place invariants in 43 ms
[2023-03-15 10:00:09] [INFO ] Dead Transitions using invariants and state equation in 2112 ms found 0 transitions.
[2023-03-15 10:00:09] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 10:00:09] [INFO ] Invariant cache hit.
[2023-03-15 10:00:10] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-03-15 10:00:10] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 10:00:10] [INFO ] Invariant cache hit.
[2023-03-15 10:00:11] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 10:00:25] [INFO ] Implicit Places using invariants and state equation in 14677 ms returned []
Implicit Place search using SMT with State Equation took 15413 ms to find 0 implicit places.
[2023-03-15 10:00:25] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 10:00:25] [INFO ] Invariant cache hit.
[2023-03-15 10:00:27] [INFO ] Dead Transitions using invariants and state equation in 2037 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 788/804 places, 2014/2030 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19600 ms. Remains : 788/804 places, 2014/2030 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p3), true, (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s398 1) (GEQ s669 1)) (AND (GEQ s251 1) (GEQ s485 1)) (AND (GEQ s669 1) (GEQ s739 1)) (AND (GEQ s64 1) (GEQ s412 1)) (AND (GEQ s347 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-04 finished in 19808 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))))'
Support contains 14 out of 804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 796 transition count 2022
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 796 transition count 2022
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 788 transition count 2014
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 788 transition count 2014
Applied a total of 32 rules in 41 ms. Remains 788 /804 variables (removed 16) and now considering 2014/2030 (removed 16) transitions.
[2023-03-15 10:00:27] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 10:00:27] [INFO ] Invariant cache hit.
[2023-03-15 10:00:29] [INFO ] Dead Transitions using invariants and state equation in 2109 ms found 0 transitions.
[2023-03-15 10:00:29] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 10:00:29] [INFO ] Invariant cache hit.
[2023-03-15 10:00:30] [INFO ] Implicit Places using invariants in 738 ms returned [49, 73, 221, 280, 329, 486, 496, 773]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 740 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 780/804 places, 2014/2030 transitions.
Applied a total of 0 rules in 12 ms. Remains 780 /780 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2916 ms. Remains : 780/804 places, 2014/2030 transitions.
Stuttering acceptance computed with spot in 879 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s29 1) (LT s287 1) (LT s450 1)) (OR (LT s236 1) (LT s287 1) (LT s288 1)) (OR (LT s236 1) (LT s287 1) (LT s351 1)) (OR (LT s236 1) (LT s287...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 119 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-05 finished in 3819 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 G(p1)))'
Support contains 24 out of 804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 804 transition count 1974
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 748 transition count 1974
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 112 place count 748 transition count 1878
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 304 place count 652 transition count 1878
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 448 place count 580 transition count 1806
Applied a total of 448 rules in 101 ms. Remains 580 /804 variables (removed 224) and now considering 1806/2030 (removed 224) transitions.
[2023-03-15 10:00:31] [INFO ] Flow matrix only has 1758 transitions (discarded 48 similar events)
// Phase 1: matrix 1758 rows 580 cols
[2023-03-15 10:00:31] [INFO ] Computed 52 place invariants in 48 ms
[2023-03-15 10:00:32] [INFO ] Dead Transitions using invariants and state equation in 1216 ms found 0 transitions.
[2023-03-15 10:00:32] [INFO ] Flow matrix only has 1758 transitions (discarded 48 similar events)
[2023-03-15 10:00:32] [INFO ] Invariant cache hit.
[2023-03-15 10:00:33] [INFO ] Implicit Places using invariants in 658 ms returned [35, 53, 160, 207, 241, 359, 367, 571]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 661 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/804 places, 1806/2030 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 568 transition count 1802
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 568 transition count 1802
Applied a total of 8 rules in 40 ms. Remains 568 /572 variables (removed 4) and now considering 1802/1806 (removed 4) transitions.
[2023-03-15 10:00:33] [INFO ] Flow matrix only has 1754 transitions (discarded 48 similar events)
// Phase 1: matrix 1754 rows 568 cols
[2023-03-15 10:00:33] [INFO ] Computed 44 place invariants in 39 ms
[2023-03-15 10:00:33] [INFO ] Implicit Places using invariants in 674 ms returned []
[2023-03-15 10:00:33] [INFO ] Flow matrix only has 1754 transitions (discarded 48 similar events)
[2023-03-15 10:00:33] [INFO ] Invariant cache hit.
[2023-03-15 10:00:34] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 10:00:43] [INFO ] Implicit Places using invariants and state equation in 9463 ms returned []
Implicit Place search using SMT with State Equation took 10139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 568/804 places, 1802/2030 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12159 ms. Remains : 568/804 places, 1802/2030 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (GEQ s349 1) (GEQ s300 1) (GEQ s436 1) (GEQ s511 1) (GEQ s510 1) (GEQ s288 1) (GEQ s76 1) (GEQ s124 1))) (NOT (OR (GEQ s514 1) (GEQ s462 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 368 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-06 finished in 12256 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((p0||X(F(p1))))))'
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 796 transition count 2022
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 796 transition count 2022
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 788 transition count 2014
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 788 transition count 2014
Applied a total of 32 rules in 42 ms. Remains 788 /804 variables (removed 16) and now considering 2014/2030 (removed 16) transitions.
[2023-03-15 10:00:43] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 788 cols
[2023-03-15 10:00:43] [INFO ] Computed 52 place invariants in 46 ms
[2023-03-15 10:00:45] [INFO ] Dead Transitions using invariants and state equation in 2242 ms found 0 transitions.
[2023-03-15 10:00:45] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-15 10:00:45] [INFO ] Invariant cache hit.
[2023-03-15 10:00:46] [INFO ] Implicit Places using invariants in 729 ms returned [49, 73, 221, 280, 329, 486, 496, 773]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 732 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 780/804 places, 2014/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 780 /780 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3029 ms. Remains : 780/804 places, 2014/2030 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(GEQ s11 1), p1:(AND (GEQ s476 1) (GEQ s737 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-11 finished in 3176 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)&&F(G(p1)))))'
Support contains 5 out of 804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 804 transition count 1958
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 732 transition count 1958
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 144 place count 732 transition count 1863
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 334 place count 637 transition count 1863
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 526 place count 541 transition count 1767
Applied a total of 526 rules in 89 ms. Remains 541 /804 variables (removed 263) and now considering 1767/2030 (removed 263) transitions.
[2023-03-15 10:00:46] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
// Phase 1: matrix 1719 rows 541 cols
[2023-03-15 10:00:46] [INFO ] Computed 52 place invariants in 39 ms
[2023-03-15 10:00:47] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
[2023-03-15 10:00:47] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:00:47] [INFO ] Invariant cache hit.
[2023-03-15 10:00:48] [INFO ] Implicit Places using invariants in 610 ms returned [35, 51, 151, 193, 226, 337, 344, 532]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 614 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 533/804 places, 1767/2030 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 529 transition count 1763
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 529 transition count 1763
Applied a total of 8 rules in 42 ms. Remains 529 /533 variables (removed 4) and now considering 1763/1767 (removed 4) transitions.
[2023-03-15 10:00:48] [INFO ] Flow matrix only has 1715 transitions (discarded 48 similar events)
// Phase 1: matrix 1715 rows 529 cols
[2023-03-15 10:00:48] [INFO ] Computed 44 place invariants in 32 ms
[2023-03-15 10:00:49] [INFO ] Implicit Places using invariants in 626 ms returned []
[2023-03-15 10:00:49] [INFO ] Flow matrix only has 1715 transitions (discarded 48 similar events)
[2023-03-15 10:00:49] [INFO ] Invariant cache hit.
[2023-03-15 10:00:49] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 10:00:55] [INFO ] Implicit Places using invariants and state equation in 6624 ms returned []
Implicit Place search using SMT with State Equation took 7252 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 529/804 places, 1763/2030 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9133 ms. Remains : 529/804 places, 1763/2030 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s45 1) (GEQ s392 1)), p1:(AND (GEQ s218 1) (GEQ s280 1) (GEQ s299 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 173 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-12 finished in 9259 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(G((p0&&((p1||F(p2)) U p3))))))))'
Support contains 8 out of 804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 797 transition count 2023
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 797 transition count 2023
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 790 transition count 2016
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 790 transition count 2016
Applied a total of 28 rules in 37 ms. Remains 790 /804 variables (removed 14) and now considering 2016/2030 (removed 14) transitions.
[2023-03-15 10:00:55] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
// Phase 1: matrix 1968 rows 790 cols
[2023-03-15 10:00:55] [INFO ] Computed 52 place invariants in 46 ms
[2023-03-15 10:00:58] [INFO ] Dead Transitions using invariants and state equation in 2210 ms found 0 transitions.
[2023-03-15 10:00:58] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-15 10:00:58] [INFO ] Invariant cache hit.
[2023-03-15 10:00:58] [INFO ] Implicit Places using invariants in 762 ms returned [49, 73, 221, 282, 331, 488, 498, 775]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 765 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 782/804 places, 2016/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 782 /782 variables (removed 0) and now considering 2016/2016 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3026 ms. Remains : 782/804 places, 2016/2030 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(NOT p3), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s133 1), p3:(AND (GEQ s440 1) (GEQ s478 1)), p1:(AND (GEQ s322 1) (GEQ s515 1) (GEQ s756 1)), p2:(AND (GEQ s26 1) (GEQ s444 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-13 finished in 3403 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))) U p2))'
Support contains 7 out of 804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 804 transition count 1958
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 732 transition count 1958
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 144 place count 732 transition count 1862
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 336 place count 636 transition count 1862
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 514 place count 547 transition count 1773
Applied a total of 514 rules in 98 ms. Remains 547 /804 variables (removed 257) and now considering 1773/2030 (removed 257) transitions.
[2023-03-15 10:00:59] [INFO ] Flow matrix only has 1725 transitions (discarded 48 similar events)
// Phase 1: matrix 1725 rows 547 cols
[2023-03-15 10:00:59] [INFO ] Computed 52 place invariants in 32 ms
[2023-03-15 10:01:00] [INFO ] Dead Transitions using invariants and state equation in 1159 ms found 0 transitions.
[2023-03-15 10:01:00] [INFO ] Flow matrix only has 1725 transitions (discarded 48 similar events)
[2023-03-15 10:01:00] [INFO ] Invariant cache hit.
[2023-03-15 10:01:01] [INFO ] Implicit Places using invariants in 612 ms returned [35, 51, 155, 197, 230, 340, 347, 538]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 615 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 539/804 places, 1773/2030 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 535 transition count 1769
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 535 transition count 1769
Applied a total of 8 rules in 41 ms. Remains 535 /539 variables (removed 4) and now considering 1769/1773 (removed 4) transitions.
[2023-03-15 10:01:01] [INFO ] Flow matrix only has 1721 transitions (discarded 48 similar events)
// Phase 1: matrix 1721 rows 535 cols
[2023-03-15 10:01:01] [INFO ] Computed 44 place invariants in 33 ms
[2023-03-15 10:01:01] [INFO ] Implicit Places using invariants in 646 ms returned []
[2023-03-15 10:01:01] [INFO ] Flow matrix only has 1721 transitions (discarded 48 similar events)
[2023-03-15 10:01:01] [INFO ] Invariant cache hit.
[2023-03-15 10:01:02] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 10:01:28] [INFO ] Implicit Places using invariants and state equation in 26739 ms returned []
Implicit Place search using SMT with State Equation took 27387 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 535/804 places, 1769/2030 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29300 ms. Remains : 535/804 places, 1769/2030 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s13 1) (GEQ s162 1)) (AND (GEQ s253 1) (GEQ s478 1)) (AND (GEQ s61 1) (GEQ s127 1))), p1:(GEQ s86 1), p0:(AND (GEQ s13 1) (GEQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-14 finished in 29434 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(!p1)) U (G((p0&&X(!p1)))||(p0&&X((!p1&&G(p2))))))))'
Support contains 4 out of 804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 797 transition count 2023
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 797 transition count 2023
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 790 transition count 2016
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 790 transition count 2016
Applied a total of 28 rules in 36 ms. Remains 790 /804 variables (removed 14) and now considering 2016/2030 (removed 14) transitions.
[2023-03-15 10:01:28] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
// Phase 1: matrix 1968 rows 790 cols
[2023-03-15 10:01:28] [INFO ] Computed 52 place invariants in 42 ms
[2023-03-15 10:01:30] [INFO ] Dead Transitions using invariants and state equation in 2206 ms found 0 transitions.
[2023-03-15 10:01:30] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-15 10:01:30] [INFO ] Invariant cache hit.
[2023-03-15 10:01:31] [INFO ] Implicit Places using invariants in 748 ms returned [49, 73, 221, 280, 329, 487, 497, 775]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 750 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 782/804 places, 2016/2030 transitions.
Applied a total of 0 rules in 12 ms. Remains 782 /782 variables (removed 0) and now considering 2016/2016 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3005 ms. Remains : 782/804 places, 2016/2030 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) p1), p1, (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s515 1), p1:(AND (GEQ s174 1) (GEQ s178 1)), p2:(LT s140 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33319 reset in 963 ms.
Product exploration explored 100000 steps with 33380 reset in 1011 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1044 ms. Reduced automaton from 5 states, 24 edges and 3 AP (stutter sensitive) to 5 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) p1), p1, (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 59 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-15 10:01:35] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
// Phase 1: matrix 1968 rows 782 cols
[2023-03-15 10:01:35] [INFO ] Computed 44 place invariants in 38 ms
[2023-03-15 10:01:35] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-15 10:01:35] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 48 ms returned sat
[2023-03-15 10:01:36] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-15 10:01:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-15 10:01:36] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 44 ms returned sat
[2023-03-15 10:01:36] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 p0 p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) p0 p2))), (F (NOT p0)), (F (AND p1 p0)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 29 factoid took 1594 ms. Reduced automaton from 5 states, 24 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Support contains 4 out of 782 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 782/782 places, 2016/2016 transitions.
Applied a total of 0 rules in 12 ms. Remains 782 /782 variables (removed 0) and now considering 2016/2016 (removed 0) transitions.
[2023-03-15 10:01:38] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-15 10:01:38] [INFO ] Invariant cache hit.
[2023-03-15 10:01:40] [INFO ] Dead Transitions using invariants and state equation in 2175 ms found 0 transitions.
[2023-03-15 10:01:40] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-15 10:01:40] [INFO ] Invariant cache hit.
[2023-03-15 10:01:41] [INFO ] Implicit Places using invariants in 770 ms returned []
[2023-03-15 10:01:41] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-15 10:01:41] [INFO ] Invariant cache hit.
[2023-03-15 10:01:42] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 10:02:01] [INFO ] Implicit Places using invariants and state equation in 20234 ms returned []
Implicit Place search using SMT with State Equation took 21004 ms to find 0 implicit places.
[2023-03-15 10:02:01] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-15 10:02:01] [INFO ] Invariant cache hit.
[2023-03-15 10:02:03] [INFO ] Dead Transitions using invariants and state equation in 2175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25367 ms. Remains : 782/782 places, 2016/2016 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (AND p0 (NOT p1) p2))), true, (X (X (AND p0 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 727 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false]
Incomplete random walk after 10000 steps, including 75 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 10:02:04] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-15 10:02:04] [INFO ] Invariant cache hit.
[2023-03-15 10:02:05] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-15 10:02:05] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 43 ms returned sat
[2023-03-15 10:02:05] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 10:02:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-15 10:02:05] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 46 ms returned sat
[2023-03-15 10:02:05] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (AND p0 (NOT p1) p2))), true, (X (X (AND p0 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2) (AND p1 p2)))]
Knowledge based reduction with 13 factoid took 749 ms. Reduced automaton from 8 states, 29 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false]
Product exploration explored 100000 steps with 20611 reset in 909 ms.
Product exploration explored 100000 steps with 20584 reset in 923 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false]
Support contains 4 out of 782 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 782/782 places, 2016/2016 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 782 transition count 2016
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 61 Pre rules applied. Total rules applied 49 place count 782 transition count 2112
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 110 place count 782 transition count 2112
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 126 place count 766 transition count 2096
Deduced a syphon composed of 94 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 142 place count 766 transition count 2096
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 135 rules applied. Total rules applied 277 place count 766 transition count 2096
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 304 place count 739 transition count 2069
Deduced a syphon composed of 206 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 331 place count 739 transition count 2069
Deduced a syphon composed of 206 places in 1 ms
Applied a total of 331 rules in 124 ms. Remains 739 /782 variables (removed 43) and now considering 2069/2016 (removed -53) transitions.
[2023-03-15 10:02:09] [INFO ] Flow matrix only has 2021 transitions (discarded 48 similar events)
// Phase 1: matrix 2021 rows 739 cols
[2023-03-15 10:02:09] [INFO ] Computed 44 place invariants in 37 ms
[2023-03-15 10:02:10] [INFO ] Dead Transitions using invariants and state equation in 1686 ms found 0 transitions.
[2023-03-15 10:02:11] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-15 10:02:11] [INFO ] Flow matrix only has 2021 transitions (discarded 48 similar events)
[2023-03-15 10:02:11] [INFO ] Invariant cache hit.
[2023-03-15 10:02:12] [INFO ] Dead Transitions using invariants and state equation in 1629 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 739/782 places, 2069/2016 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3520 ms. Remains : 739/782 places, 2069/2016 transitions.
Support contains 4 out of 782 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 782/782 places, 2016/2016 transitions.
Applied a total of 0 rules in 13 ms. Remains 782 /782 variables (removed 0) and now considering 2016/2016 (removed 0) transitions.
[2023-03-15 10:02:12] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
// Phase 1: matrix 1968 rows 782 cols
[2023-03-15 10:02:12] [INFO ] Computed 44 place invariants in 38 ms
[2023-03-15 10:02:14] [INFO ] Dead Transitions using invariants and state equation in 2156 ms found 0 transitions.
[2023-03-15 10:02:14] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-15 10:02:14] [INFO ] Invariant cache hit.
[2023-03-15 10:02:15] [INFO ] Implicit Places using invariants in 751 ms returned []
[2023-03-15 10:02:15] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-15 10:02:15] [INFO ] Invariant cache hit.
[2023-03-15 10:02:16] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 10:02:30] [INFO ] Implicit Places using invariants and state equation in 14464 ms returned []
Implicit Place search using SMT with State Equation took 15219 ms to find 0 implicit places.
[2023-03-15 10:02:30] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-15 10:02:30] [INFO ] Invariant cache hit.
[2023-03-15 10:02:32] [INFO ] Dead Transitions using invariants and state equation in 2164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19555 ms. Remains : 782/782 places, 2016/2016 transitions.
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-15 finished in 63678 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(F(!p0)))) U G(!p1))))'
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(!p1)) U (G((p0&&X(!p1)))||(p0&&X((!p1&&G(p2))))))))'
Found a Shortening insensitive property : PolyORBLF-PT-S06J04T08-LTLFireability-15
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) p1), p1, (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 4 out of 804 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 804/804 places, 2030/2030 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 804 transition count 1963
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 737 transition count 1962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 736 transition count 1962
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 136 place count 736 transition count 1866
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 328 place count 640 transition count 1866
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 518 place count 545 transition count 1771
Applied a total of 518 rules in 79 ms. Remains 545 /804 variables (removed 259) and now considering 1771/2030 (removed 259) transitions.
[2023-03-15 10:02:32] [INFO ] Flow matrix only has 1723 transitions (discarded 48 similar events)
// Phase 1: matrix 1723 rows 545 cols
[2023-03-15 10:02:32] [INFO ] Computed 52 place invariants in 36 ms
[2023-03-15 10:02:33] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
[2023-03-15 10:02:33] [INFO ] Flow matrix only has 1723 transitions (discarded 48 similar events)
[2023-03-15 10:02:33] [INFO ] Invariant cache hit.
[2023-03-15 10:02:34] [INFO ] Implicit Places using invariants in 603 ms returned [35, 51, 153, 195, 229, 339, 346, 536]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 606 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 537/804 places, 1771/2030 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 533 transition count 1767
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 533 transition count 1767
Applied a total of 8 rules in 26 ms. Remains 533 /537 variables (removed 4) and now considering 1767/1771 (removed 4) transitions.
[2023-03-15 10:02:34] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
// Phase 1: matrix 1719 rows 533 cols
[2023-03-15 10:02:34] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-15 10:02:35] [INFO ] Implicit Places using invariants in 633 ms returned []
[2023-03-15 10:02:35] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:02:35] [INFO ] Invariant cache hit.
[2023-03-15 10:02:36] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 10:02:58] [INFO ] Implicit Places using invariants and state equation in 23575 ms returned []
Implicit Place search using SMT with State Equation took 24210 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 533/804 places, 1767/2030 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 26030 ms. Remains : 533/804 places, 1767/2030 transitions.
Running random walk in product with property : PolyORBLF-PT-S06J04T08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s350 1), p1:(AND (GEQ s122 1) (GEQ s124 1)), p2:(LT s96 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33309 reset in 843 ms.
Product exploration explored 100000 steps with 33254 reset in 856 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1053 ms. Reduced automaton from 5 states, 24 edges and 3 AP (stutter sensitive) to 5 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p1), p1, (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 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 36 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-15 10:03:02] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:02] [INFO ] Invariant cache hit.
[2023-03-15 10:03:02] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-15 10:03:02] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 29 ms returned sat
[2023-03-15 10:03:02] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-15 10:03:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-15 10:03:02] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 34 ms returned sat
[2023-03-15 10:03:02] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 p0 p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) p0 p2))), (F (NOT p0)), (F (AND p1 p0)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 29 factoid took 1582 ms. Reduced automaton from 5 states, 24 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Support contains 4 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 1767/1767 transitions.
Applied a total of 0 rules in 13 ms. Remains 533 /533 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2023-03-15 10:03:04] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:04] [INFO ] Invariant cache hit.
[2023-03-15 10:03:05] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
[2023-03-15 10:03:05] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:05] [INFO ] Invariant cache hit.
[2023-03-15 10:03:06] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-15 10:03:06] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:06] [INFO ] Invariant cache hit.
[2023-03-15 10:03:07] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 10:03:29] [INFO ] Implicit Places using invariants and state equation in 23615 ms returned []
Implicit Place search using SMT with State Equation took 24221 ms to find 0 implicit places.
[2023-03-15 10:03:29] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:29] [INFO ] Invariant cache hit.
[2023-03-15 10:03:30] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26362 ms. Remains : 533/533 places, 1767/1767 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (AND p0 (NOT p1) p2))), true, (X (X (AND p0 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 602 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 10:03:32] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:32] [INFO ] Invariant cache hit.
[2023-03-15 10:03:32] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-15 10:03:32] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 28 ms returned sat
[2023-03-15 10:03:32] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 10:03:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-15 10:03:32] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 29 ms returned sat
[2023-03-15 10:03:32] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (AND p0 (NOT p1) p2))), true, (X (X (AND p0 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2) (AND p1 p2)))]
Knowledge based reduction with 13 factoid took 711 ms. Reduced automaton from 8 states, 29 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false]
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false]
Product exploration explored 100000 steps with 20649 reset in 850 ms.
Product exploration explored 100000 steps with 20541 reset in 869 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND p1 p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false]
Support contains 4 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 1767/1767 transitions.
Applied a total of 0 rules in 27 ms. Remains 533 /533 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2023-03-15 10:03:36] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:36] [INFO ] Invariant cache hit.
[2023-03-15 10:03:37] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
[2023-03-15 10:03:37] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-15 10:03:37] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:37] [INFO ] Invariant cache hit.
[2023-03-15 10:03:38] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2220 ms. Remains : 533/533 places, 1767/1767 transitions.
Support contains 4 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 1767/1767 transitions.
Applied a total of 0 rules in 6 ms. Remains 533 /533 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2023-03-15 10:03:38] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:38] [INFO ] Invariant cache hit.
[2023-03-15 10:03:39] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
[2023-03-15 10:03:39] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:39] [INFO ] Invariant cache hit.
[2023-03-15 10:03:39] [INFO ] Implicit Places using invariants in 608 ms returned []
[2023-03-15 10:03:39] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:03:39] [INFO ] Invariant cache hit.
[2023-03-15 10:03:41] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-15 10:04:06] [INFO ] Implicit Places using invariants and state equation in 26918 ms returned []
Implicit Place search using SMT with State Equation took 27526 ms to find 0 implicit places.
[2023-03-15 10:04:06] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-15 10:04:06] [INFO ] Invariant cache hit.
[2023-03-15 10:04:07] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29612 ms. Remains : 533/533 places, 1767/1767 transitions.
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-15 finished in 95496 ms.
[2023-03-15 10:04:08] [INFO ] Flatten gal took : 99 ms
[2023-03-15 10:04:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-15 10:04:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 804 places, 2030 transitions and 10614 arcs took 15 ms.
Total runtime 644581 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBLF-PT-S06J04T08
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678874819657

--------------------
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: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 PolyORBLF-PT-S06J04T08-LTLFireability-15
lola: time limit : 1799 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
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/1799 3/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 224499 m, 44899 m/sec, 870591 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/1799 5/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 465786 m, 48257 m/sec, 1884651 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/1799 8/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 707258 m, 48294 m/sec, 2890146 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/1799 10/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 955710 m, 49690 m/sec, 3895777 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/1799 12/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 1199235 m, 48705 m/sec, 4875757 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/1799 15/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 1431705 m, 46494 m/sec, 5884060 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 34/1799 17/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 1654475 m, 44554 m/sec, 6900110 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 39/1799 20/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 1900007 m, 49106 m/sec, 7882090 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 44/1799 22/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 2140960 m, 48190 m/sec, 8857631 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 49/1799 24/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 2390889 m, 49985 m/sec, 9828584 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 54/1799 27/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 2630019 m, 47826 m/sec, 10808460 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 59/1799 29/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 2858175 m, 45631 m/sec, 11793686 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 64/1799 32/32 PolyORBLF-PT-S06J04T08-LTLFireability-15 3099739 m, 48312 m/sec, 12767591 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for PolyORBLF-PT-S06J04T08-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBLF-PT-S06J04T08-LTLFireability-00
lola: time limit : 3530 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
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3530 2/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 237600 m, 47520 m/sec, 1029671 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3530 4/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 469489 m, 46377 m/sec, 2044000 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3530 6/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 698762 m, 45854 m/sec, 3069372 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3530 8/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 911129 m, 42473 m/sec, 4083488 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3530 9/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 1115927 m, 40959 m/sec, 5118751 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3530 11/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 1305138 m, 37842 m/sec, 6150629 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3530 12/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 1534731 m, 45918 m/sec, 7171014 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3530 14/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 1757246 m, 44503 m/sec, 8185044 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3530 16/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 1977699 m, 44090 m/sec, 9205671 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3530 18/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 2205994 m, 45659 m/sec, 10208870 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3530 19/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 2426649 m, 44131 m/sec, 11215203 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3530 21/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 2657319 m, 46134 m/sec, 12223509 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3530 23/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 2882880 m, 45112 m/sec, 13215897 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3530 24/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 3092894 m, 42002 m/sec, 14220206 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3530 26/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 3321389 m, 45699 m/sec, 15229585 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3530 28/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 3535557 m, 42833 m/sec, 16232994 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3530 29/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 3731415 m, 39171 m/sec, 17254278 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3530 31/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 3910733 m, 35863 m/sec, 18278297 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3530 32/32 PolyORBLF-PT-S06J04T08-LTLFireability-00 4105571 m, 38967 m/sec, 19304925 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for PolyORBLF-PT-S06J04T08-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-PT-S06J04T08-LTLFireability-00: LTL unknown AGGR
PolyORBLF-PT-S06J04T08-LTLFireability-15: LTL unknown AGGR


Time elapsed: 170 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="PolyORBLF-PT-S06J04T08"
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 PolyORBLF-PT-S06J04T08, 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 r295-tall-167873948100604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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