About the Execution of LTSMin+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 |
| 899.636 | 518173.00 | 571899.00 | 1649.30 | ?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.r297-tall-167873950700604.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 ltsminxred
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 r297-tall-167873950700604
=====================================================================
--------------------
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 1679584882310
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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 15:21:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 15:21:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 15:21:25] [INFO ] Load time of PNML (sax parser for PT used): 735 ms
[2023-03-23 15:21:25] [INFO ] Transformed 810 places.
[2023-03-23 15:21:25] [INFO ] Transformed 14014 transitions.
[2023-03-23 15:21:25] [INFO ] Parsed PT model containing 810 places and 14014 transitions and 118428 arcs in 999 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 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 177 ms. Remains 804 /810 variables (removed 6) and now considering 3254/3254 (removed 0) transitions.
[2023-03-23 15:21:26] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 804 cols
[2023-03-23 15:21:26] [INFO ] Computed 52 place invariants in 227 ms
[2023-03-23 15:21:30] [INFO ] Dead Transitions using invariants and state equation in 3880 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-23 15:21:30] [INFO ] Flow matrix only has 1982 transitions (discarded 48 similar events)
// Phase 1: matrix 1982 rows 804 cols
[2023-03-23 15:21:30] [INFO ] Computed 52 place invariants in 67 ms
[2023-03-23 15:21:30] [INFO ] Implicit Places using invariants in 801 ms returned []
[2023-03-23 15:21:30] [INFO ] Flow matrix only has 1982 transitions (discarded 48 similar events)
[2023-03-23 15:21:30] [INFO ] Invariant cache hit.
[2023-03-23 15:21:31] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:21:37] [INFO ] Implicit Places using invariants and state equation in 6920 ms returned []
Implicit Place search using SMT with State Equation took 7727 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 36 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 11880 ms. Remains : 804/810 places, 2030/3254 transitions.
Support contains 202 out of 804 places after structural reductions.
[2023-03-23 15:21:38] [INFO ] Flatten gal took : 220 ms
[2023-03-23 15:21:38] [INFO ] Flatten gal took : 156 ms
[2023-03-23 15:21:38] [INFO ] Input system was already deterministic with 2030 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 15:21:39] [INFO ] Flow matrix only has 1982 transitions (discarded 48 similar events)
[2023-03-23 15:21:39] [INFO ] Invariant cache hit.
[2023-03-23 15:21:39] [INFO ] [Real]Absence check using 12 positive place invariants in 31 ms returned sat
[2023-03-23 15:21:39] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 50 ms returned sat
[2023-03-23 15:21:45] [INFO ] After 6149ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 15:21:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-23 15:21:45] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 56 ms returned sat
[2023-03-23 15:22:00] [INFO ] After 14717ms 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 297 ms. Remains 525 /804 variables (removed 279) and now considering 1751/2030 (removed 279) transitions.
[2023-03-23 15:22:00] [INFO ] Flow matrix only has 1703 transitions (discarded 48 similar events)
// Phase 1: matrix 1703 rows 525 cols
[2023-03-23 15:22:00] [INFO ] Computed 52 place invariants in 33 ms
[2023-03-23 15:22:01] [INFO ] Dead Transitions using invariants and state equation in 1245 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1546 ms. Remains : 525/804 places, 1751/2030 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 94658 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94658 steps, saw 33314 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 15:22:05] [INFO ] Flow matrix only has 1703 transitions (discarded 48 similar events)
[2023-03-23 15:22:05] [INFO ] Invariant cache hit.
[2023-03-23 15:22:05] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-23 15:22:05] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 35 ms returned sat
[2023-03-23 15:22:08] [INFO ] After 3527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 15:22:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-23 15:22:08] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 30 ms returned sat
[2023-03-23 15:22:16] [INFO ] After 7849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 15:22:16] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:22:25] [INFO ] After 9051ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-23 15:22:25] [INFO ] After 17026ms 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 54 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 56 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 49 ms. Remains 525 /525 variables (removed 0) and now considering 1751/1751 (removed 0) transitions.
[2023-03-23 15:22:25] [INFO ] Flow matrix only has 1703 transitions (discarded 48 similar events)
[2023-03-23 15:22:25] [INFO ] Invariant cache hit.
[2023-03-23 15:22:26] [INFO ] Implicit Places using invariants in 803 ms returned [33, 49, 147, 188, 220, 326, 333, 516]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 808 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 62 ms. Remains 513 /517 variables (removed 4) and now considering 1747/1751 (removed 4) transitions.
[2023-03-23 15:22:26] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
// Phase 1: matrix 1699 rows 513 cols
[2023-03-23 15:22:26] [INFO ] Computed 44 place invariants in 39 ms
[2023-03-23 15:22:27] [INFO ] Implicit Places using invariants in 925 ms returned []
[2023-03-23 15:22:27] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
[2023-03-23 15:22:27] [INFO ] Invariant cache hit.
[2023-03-23 15:22:28] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:22:40] [INFO ] Implicit Places using invariants and state equation in 12716 ms returned []
Implicit Place search using SMT with State Equation took 13646 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 14566 ms. Remains : 513/525 places, 1747/1751 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97658 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97658 steps, saw 34173 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 15:22:43] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
[2023-03-23 15:22:43] [INFO ] Invariant cache hit.
[2023-03-23 15:22:43] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 15:22:43] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 32 ms returned sat
[2023-03-23 15:22:47] [INFO ] After 3688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 15:22:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-23 15:22:47] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 45 ms returned sat
[2023-03-23 15:23:06] [INFO ] After 19309ms 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 41 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 41 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 35 ms. Remains 513 /513 variables (removed 0) and now considering 1747/1747 (removed 0) transitions.
[2023-03-23 15:23:06] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
[2023-03-23 15:23:06] [INFO ] Invariant cache hit.
[2023-03-23 15:23:07] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-23 15:23:07] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
[2023-03-23 15:23:07] [INFO ] Invariant cache hit.
[2023-03-23 15:23:07] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:23:18] [INFO ] Implicit Places using invariants and state equation in 10889 ms returned []
Implicit Place search using SMT with State Equation took 11543 ms to find 0 implicit places.
[2023-03-23 15:23:18] [INFO ] Redundant transitions in 114 ms returned []
[2023-03-23 15:23:18] [INFO ] Flow matrix only has 1699 transitions (discarded 48 similar events)
[2023-03-23 15:23:18] [INFO ] Invariant cache hit.
[2023-03-23 15:23:19] [INFO ] Dead Transitions using invariants and state equation in 1244 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12953 ms. Remains : 513/513 places, 1747/1747 transitions.
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 43 ms. Remains 788 /804 variables (removed 16) and now considering 2014/2030 (removed 16) transitions.
[2023-03-23 15:23:19] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 788 cols
[2023-03-23 15:23:19] [INFO ] Computed 52 place invariants in 39 ms
[2023-03-23 15:23:22] [INFO ] Dead Transitions using invariants and state equation in 2291 ms found 0 transitions.
[2023-03-23 15:23:22] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:23:22] [INFO ] Invariant cache hit.
[2023-03-23 15:23:22] [INFO ] Implicit Places using invariants in 855 ms returned [49, 73, 221, 280, 329, 486, 496, 773]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 866 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 20 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 3225 ms. Remains : 780/804 places, 2014/2030 transitions.
Stuttering acceptance computed with spot in 423 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 20122 reset in 1238 ms.
Product exploration explored 100000 steps with 20051 reset in 1086 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 172 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 246 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Finished random walk after 179 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=22 )
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 215 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 270 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 280 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 15 ms. Remains 780 /780 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
[2023-03-23 15:23:27] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 780 cols
[2023-03-23 15:23:27] [INFO ] Computed 44 place invariants in 52 ms
[2023-03-23 15:23:29] [INFO ] Dead Transitions using invariants and state equation in 2274 ms found 0 transitions.
[2023-03-23 15:23:29] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:23:29] [INFO ] Invariant cache hit.
[2023-03-23 15:23:30] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-03-23 15:23:30] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:23:30] [INFO ] Invariant cache hit.
[2023-03-23 15:23:31] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:23:47] [INFO ] Implicit Places using invariants and state equation in 16961 ms returned []
Implicit Place search using SMT with State Equation took 17840 ms to find 0 implicit places.
[2023-03-23 15:23:47] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:23:47] [INFO ] Invariant cache hit.
[2023-03-23 15:23:49] [INFO ] Dead Transitions using invariants and state equation in 2420 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22552 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 169 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 249 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Finished random walk after 191 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=47 )
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 214 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 273 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 325 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 260 ms :[p1, p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 20092 reset in 1027 ms.
Product exploration explored 100000 steps with 20056 reset in 1038 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 263 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 1 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 1 ms
Applied a total of 320 rules in 218 ms. Remains 736 /780 variables (removed 44) and now considering 2066/2014 (removed -52) transitions.
[2023-03-23 15:23:53] [INFO ] Flow matrix only has 2018 transitions (discarded 48 similar events)
// Phase 1: matrix 2018 rows 736 cols
[2023-03-23 15:23:53] [INFO ] Computed 44 place invariants in 41 ms
[2023-03-23 15:23:55] [INFO ] Dead Transitions using invariants and state equation in 1814 ms found 0 transitions.
[2023-03-23 15:23:55] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-23 15:23:55] [INFO ] Flow matrix only has 2018 transitions (discarded 48 similar events)
[2023-03-23 15:23:55] [INFO ] Invariant cache hit.
[2023-03-23 15:23:57] [INFO ] Dead Transitions using invariants and state equation in 1821 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 3989 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 17 ms. Remains 780 /780 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
[2023-03-23 15:23:57] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 780 cols
[2023-03-23 15:23:57] [INFO ] Computed 44 place invariants in 45 ms
[2023-03-23 15:24:00] [INFO ] Dead Transitions using invariants and state equation in 2379 ms found 0 transitions.
[2023-03-23 15:24:00] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:24:00] [INFO ] Invariant cache hit.
[2023-03-23 15:24:00] [INFO ] Implicit Places using invariants in 848 ms returned []
[2023-03-23 15:24:00] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:24:00] [INFO ] Invariant cache hit.
[2023-03-23 15:24:01] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:24:17] [INFO ] Implicit Places using invariants and state equation in 16741 ms returned []
Implicit Place search using SMT with State Equation took 17596 ms to find 0 implicit places.
[2023-03-23 15:24:17] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:24:17] [INFO ] Invariant cache hit.
[2023-03-23 15:24:20] [INFO ] Dead Transitions using invariants and state equation in 2534 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22528 ms. Remains : 780/780 places, 2014/2014 transitions.
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-00 finished in 60701 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 45 ms. Remains 788 /804 variables (removed 16) and now considering 2014/2030 (removed 16) transitions.
[2023-03-23 15:24:20] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 788 cols
[2023-03-23 15:24:20] [INFO ] Computed 52 place invariants in 46 ms
[2023-03-23 15:24:22] [INFO ] Dead Transitions using invariants and state equation in 2420 ms found 0 transitions.
[2023-03-23 15:24:22] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:24:22] [INFO ] Invariant cache hit.
[2023-03-23 15:24:23] [INFO ] Implicit Places using invariants in 848 ms returned [49, 73, 221, 280, 329, 486, 496, 773]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 852 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 3331 ms. Remains : 780/804 places, 2014/2030 transitions.
Stuttering acceptance computed with spot in 100 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 3463 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 2 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 133 ms. Remains 548 /804 variables (removed 256) and now considering 1774/2030 (removed 256) transitions.
[2023-03-23 15:24:24] [INFO ] Flow matrix only has 1726 transitions (discarded 48 similar events)
// Phase 1: matrix 1726 rows 548 cols
[2023-03-23 15:24:24] [INFO ] Computed 52 place invariants in 31 ms
[2023-03-23 15:24:25] [INFO ] Dead Transitions using invariants and state equation in 1293 ms found 0 transitions.
[2023-03-23 15:24:25] [INFO ] Flow matrix only has 1726 transitions (discarded 48 similar events)
[2023-03-23 15:24:25] [INFO ] Invariant cache hit.
[2023-03-23 15:24:26] [INFO ] Implicit Places using invariants in 738 ms returned [37, 53, 154, 196, 230, 341, 348, 539]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 742 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 44 ms. Remains 536 /540 variables (removed 4) and now considering 1770/1774 (removed 4) transitions.
[2023-03-23 15:24:26] [INFO ] Flow matrix only has 1722 transitions (discarded 48 similar events)
// Phase 1: matrix 1722 rows 536 cols
[2023-03-23 15:24:26] [INFO ] Computed 44 place invariants in 34 ms
[2023-03-23 15:24:26] [INFO ] Implicit Places using invariants in 763 ms returned []
[2023-03-23 15:24:26] [INFO ] Flow matrix only has 1722 transitions (discarded 48 similar events)
[2023-03-23 15:24:26] [INFO ] Invariant cache hit.
[2023-03-23 15:24:27] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:24:39] [INFO ] Implicit Places using invariants and state equation in 12266 ms returned []
Implicit Place search using SMT with State Equation took 13031 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 15245 ms. Remains : 536/804 places, 1770/2030 transitions.
Stuttering acceptance computed with spot in 108 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 7 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-02 finished in 15388 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 47 ms. Remains 788 /804 variables (removed 16) and now considering 2014/2030 (removed 16) transitions.
[2023-03-23 15:24:39] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 788 cols
[2023-03-23 15:24:39] [INFO ] Computed 52 place invariants in 36 ms
[2023-03-23 15:24:41] [INFO ] Dead Transitions using invariants and state equation in 2532 ms found 0 transitions.
[2023-03-23 15:24:41] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:24:41] [INFO ] Invariant cache hit.
[2023-03-23 15:24:42] [INFO ] Implicit Places using invariants in 885 ms returned []
[2023-03-23 15:24:42] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:24:42] [INFO ] Invariant cache hit.
[2023-03-23 15:24:43] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:24:59] [INFO ] Implicit Places using invariants and state equation in 16236 ms returned []
Implicit Place search using SMT with State Equation took 17137 ms to find 0 implicit places.
[2023-03-23 15:24:59] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:24:59] [INFO ] Invariant cache hit.
[2023-03-23 15:25:01] [INFO ] Dead Transitions using invariants and state equation in 2319 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 22039 ms. Remains : 788/804 places, 2014/2030 transitions.
Stuttering acceptance computed with spot in 179 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]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-04 finished in 22258 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 39 ms. Remains 788 /804 variables (removed 16) and now considering 2014/2030 (removed 16) transitions.
[2023-03-23 15:25:01] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:25:01] [INFO ] Invariant cache hit.
[2023-03-23 15:25:03] [INFO ] Dead Transitions using invariants and state equation in 2359 ms found 0 transitions.
[2023-03-23 15:25:03] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:25:03] [INFO ] Invariant cache hit.
[2023-03-23 15:25:04] [INFO ] Implicit Places using invariants in 786 ms returned [49, 73, 221, 280, 329, 486, 496, 773]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 816 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 3230 ms. Remains : 780/804 places, 2014/2030 transitions.
Stuttering acceptance computed with spot in 103 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 170 steps with 6 reset in 4 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-05 finished in 3357 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 92 ms. Remains 580 /804 variables (removed 224) and now considering 1806/2030 (removed 224) transitions.
[2023-03-23 15:25:05] [INFO ] Flow matrix only has 1758 transitions (discarded 48 similar events)
// Phase 1: matrix 1758 rows 580 cols
[2023-03-23 15:25:05] [INFO ] Computed 52 place invariants in 41 ms
[2023-03-23 15:25:06] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
[2023-03-23 15:25:06] [INFO ] Flow matrix only has 1758 transitions (discarded 48 similar events)
[2023-03-23 15:25:06] [INFO ] Invariant cache hit.
[2023-03-23 15:25:07] [INFO ] Implicit Places using invariants in 714 ms returned [35, 53, 160, 207, 241, 359, 367, 571]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 730 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 44 ms. Remains 568 /572 variables (removed 4) and now considering 1802/1806 (removed 4) transitions.
[2023-03-23 15:25:07] [INFO ] Flow matrix only has 1754 transitions (discarded 48 similar events)
// Phase 1: matrix 1754 rows 568 cols
[2023-03-23 15:25:07] [INFO ] Computed 44 place invariants in 34 ms
[2023-03-23 15:25:07] [INFO ] Implicit Places using invariants in 844 ms returned []
[2023-03-23 15:25:07] [INFO ] Flow matrix only has 1754 transitions (discarded 48 similar events)
[2023-03-23 15:25:07] [INFO ] Invariant cache hit.
[2023-03-23 15:25:08] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:25:18] [INFO ] Implicit Places using invariants and state equation in 10058 ms returned []
Implicit Place search using SMT with State Equation took 10915 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 13122 ms. Remains : 568/804 places, 1802/2030 transitions.
Stuttering acceptance computed with spot in 75 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 183 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-06 finished in 13220 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 45 ms. Remains 788 /804 variables (removed 16) and now considering 2014/2030 (removed 16) transitions.
[2023-03-23 15:25:18] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
// Phase 1: matrix 1966 rows 788 cols
[2023-03-23 15:25:18] [INFO ] Computed 52 place invariants in 42 ms
[2023-03-23 15:25:20] [INFO ] Dead Transitions using invariants and state equation in 2357 ms found 0 transitions.
[2023-03-23 15:25:20] [INFO ] Flow matrix only has 1966 transitions (discarded 48 similar events)
[2023-03-23 15:25:20] [INFO ] Invariant cache hit.
[2023-03-23 15:25:21] [INFO ] Implicit Places using invariants in 885 ms returned [49, 73, 221, 280, 329, 486, 496, 773]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 888 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 11 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 3315 ms. Remains : 780/804 places, 2014/2030 transitions.
Stuttering acceptance computed with spot in 141 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 27 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 3476 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 1 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 92 ms. Remains 541 /804 variables (removed 263) and now considering 1767/2030 (removed 263) transitions.
[2023-03-23 15:25:21] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
// Phase 1: matrix 1719 rows 541 cols
[2023-03-23 15:25:21] [INFO ] Computed 52 place invariants in 28 ms
[2023-03-23 15:25:23] [INFO ] Dead Transitions using invariants and state equation in 1573 ms found 0 transitions.
[2023-03-23 15:25:23] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:25:23] [INFO ] Invariant cache hit.
[2023-03-23 15:25:23] [INFO ] Implicit Places using invariants in 694 ms returned [35, 51, 151, 193, 226, 337, 344, 532]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 697 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 53 ms. Remains 529 /533 variables (removed 4) and now considering 1763/1767 (removed 4) transitions.
[2023-03-23 15:25:24] [INFO ] Flow matrix only has 1715 transitions (discarded 48 similar events)
// Phase 1: matrix 1715 rows 529 cols
[2023-03-23 15:25:24] [INFO ] Computed 44 place invariants in 31 ms
[2023-03-23 15:25:24] [INFO ] Implicit Places using invariants in 846 ms returned []
[2023-03-23 15:25:24] [INFO ] Flow matrix only has 1715 transitions (discarded 48 similar events)
[2023-03-23 15:25:24] [INFO ] Invariant cache hit.
[2023-03-23 15:25:25] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:25:32] [INFO ] Implicit Places using invariants and state equation in 8053 ms returned []
Implicit Place search using SMT with State Equation took 8901 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 11331 ms. Remains : 529/804 places, 1763/2030 transitions.
Stuttering acceptance computed with spot in 102 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 27 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-12 finished in 11456 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 34 ms. Remains 790 /804 variables (removed 14) and now considering 2016/2030 (removed 14) transitions.
[2023-03-23 15:25:33] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
// Phase 1: matrix 1968 rows 790 cols
[2023-03-23 15:25:33] [INFO ] Computed 52 place invariants in 40 ms
[2023-03-23 15:25:35] [INFO ] Dead Transitions using invariants and state equation in 2639 ms found 0 transitions.
[2023-03-23 15:25:35] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-23 15:25:35] [INFO ] Invariant cache hit.
[2023-03-23 15:25:36] [INFO ] Implicit Places using invariants in 864 ms returned [49, 73, 221, 282, 331, 488, 498, 775]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 868 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 3554 ms. Remains : 782/804 places, 2016/2030 transitions.
Stuttering acceptance computed with spot in 516 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 0 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-13 finished in 4110 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 87 ms. Remains 547 /804 variables (removed 257) and now considering 1773/2030 (removed 257) transitions.
[2023-03-23 15:25:37] [INFO ] Flow matrix only has 1725 transitions (discarded 48 similar events)
// Phase 1: matrix 1725 rows 547 cols
[2023-03-23 15:25:37] [INFO ] Computed 52 place invariants in 26 ms
[2023-03-23 15:25:38] [INFO ] Dead Transitions using invariants and state equation in 1351 ms found 0 transitions.
[2023-03-23 15:25:38] [INFO ] Flow matrix only has 1725 transitions (discarded 48 similar events)
[2023-03-23 15:25:38] [INFO ] Invariant cache hit.
[2023-03-23 15:25:39] [INFO ] Implicit Places using invariants in 654 ms returned [35, 51, 155, 197, 230, 340, 347, 538]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 659 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-23 15:25:39] [INFO ] Flow matrix only has 1721 transitions (discarded 48 similar events)
// Phase 1: matrix 1721 rows 535 cols
[2023-03-23 15:25:39] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-23 15:25:40] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-23 15:25:40] [INFO ] Flow matrix only has 1721 transitions (discarded 48 similar events)
[2023-03-23 15:25:40] [INFO ] Invariant cache hit.
[2023-03-23 15:25:40] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:26:05] [INFO ] Implicit Places using invariants and state equation in 25736 ms returned []
Implicit Place search using SMT with State Equation took 26473 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 28626 ms. Remains : 535/804 places, 1769/2030 transitions.
Stuttering acceptance computed with spot in 146 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 8 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-14 finished in 28797 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 40 ms. Remains 790 /804 variables (removed 14) and now considering 2016/2030 (removed 14) transitions.
[2023-03-23 15:26:06] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
// Phase 1: matrix 1968 rows 790 cols
[2023-03-23 15:26:06] [INFO ] Computed 52 place invariants in 43 ms
[2023-03-23 15:26:08] [INFO ] Dead Transitions using invariants and state equation in 2525 ms found 0 transitions.
[2023-03-23 15:26:08] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-23 15:26:08] [INFO ] Invariant cache hit.
[2023-03-23 15:26:09] [INFO ] Implicit Places using invariants in 932 ms returned [49, 73, 221, 280, 329, 487, 497, 775]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 935 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 3513 ms. Remains : 782/804 places, 2016/2030 transitions.
Stuttering acceptance computed with spot in 222 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 33387 reset in 1019 ms.
Product exploration explored 100000 steps with 33327 reset in 1091 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 1080 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 210 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 73 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-23 15:26:14] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
// Phase 1: matrix 1968 rows 782 cols
[2023-03-23 15:26:14] [INFO ] Computed 44 place invariants in 37 ms
[2023-03-23 15:26:14] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-23 15:26:14] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 47 ms returned sat
[2023-03-23 15:26:14] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2023-03-23 15:26:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-23 15:26:14] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 47 ms returned sat
[2023-03-23 15:26:39] [INFO ] After 24766ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-23 15:26:39] [INFO ] State equation strengthened by 224 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 15:26:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 15:26:39] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:6
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 2016/2016 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 782 transition count 1963
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 729 transition count 1962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 728 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 108 place count 728 transition count 1866
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 300 place count 632 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 490 place count 537 transition count 1771
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 494 place count 533 transition count 1767
Iterating global reduction 3 with 4 rules applied. Total rules applied 498 place count 533 transition count 1767
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 516 place count 533 transition count 1749
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 534 place count 515 transition count 1749
Applied a total of 534 rules in 149 ms. Remains 515 /782 variables (removed 267) and now considering 1749/2016 (removed 267) transitions.
[2023-03-23 15:26:39] [INFO ] Flow matrix only has 1701 transitions (discarded 48 similar events)
// Phase 1: matrix 1701 rows 515 cols
[2023-03-23 15:26:39] [INFO ] Computed 44 place invariants in 24 ms
[2023-03-23 15:26:41] [INFO ] Dead Transitions using invariants and state equation in 1274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1424 ms. Remains : 515/782 places, 1749/2016 transitions.
Finished random walk after 1695 steps, including 16 resets, run visited all 2 properties in 31 ms. (steps per millisecond=54 )
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 (NOT p1) (NOT p0) p2)), (F (AND p1 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 1673 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 224 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 206 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 18 ms. Remains 782 /782 variables (removed 0) and now considering 2016/2016 (removed 0) transitions.
[2023-03-23 15:26:43] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
// Phase 1: matrix 1968 rows 782 cols
[2023-03-23 15:26:43] [INFO ] Computed 44 place invariants in 52 ms
[2023-03-23 15:26:45] [INFO ] Dead Transitions using invariants and state equation in 2373 ms found 0 transitions.
[2023-03-23 15:26:45] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-23 15:26:45] [INFO ] Invariant cache hit.
[2023-03-23 15:26:46] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-23 15:26:46] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-23 15:26:46] [INFO ] Invariant cache hit.
[2023-03-23 15:26:47] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:27:05] [INFO ] Implicit Places using invariants and state equation in 18740 ms returned []
Implicit Place search using SMT with State Equation took 19645 ms to find 0 implicit places.
[2023-03-23 15:27:05] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-23 15:27:05] [INFO ] Invariant cache hit.
[2023-03-23 15:27:07] [INFO ] Dead Transitions using invariants and state equation in 2571 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24609 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 560 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 345 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 61 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 15:27:08] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-23 15:27:08] [INFO ] Invariant cache hit.
[2023-03-23 15:27:09] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-23 15:27:09] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 45 ms returned sat
[2023-03-23 15:27:09] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-23 15:27:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-23 15:27:09] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 48 ms returned sat
[2023-03-23 15:27:34] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 2016/2016 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 782 transition count 1962
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 109 place count 728 transition count 1961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 727 transition count 1961
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 110 place count 727 transition count 1865
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 302 place count 631 transition count 1865
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 494 place count 535 transition count 1769
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 498 place count 531 transition count 1765
Iterating global reduction 3 with 4 rules applied. Total rules applied 502 place count 531 transition count 1765
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 519 place count 531 transition count 1748
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 536 place count 514 transition count 1748
Applied a total of 536 rules in 151 ms. Remains 514 /782 variables (removed 268) and now considering 1748/2016 (removed 268) transitions.
[2023-03-23 15:27:34] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
// Phase 1: matrix 1700 rows 514 cols
[2023-03-23 15:27:34] [INFO ] Computed 44 place invariants in 29 ms
[2023-03-23 15:27:35] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1360 ms. Remains : 514/782 places, 1748/2016 transitions.
Finished random walk after 114 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
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 740 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 323 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 302 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 323 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 20642 reset in 950 ms.
Product exploration explored 100000 steps with 20655 reset in 963 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 292 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 121 ms. Remains 739 /782 variables (removed 43) and now considering 2069/2016 (removed -53) transitions.
[2023-03-23 15:27:39] [INFO ] Flow matrix only has 2021 transitions (discarded 48 similar events)
// Phase 1: matrix 2021 rows 739 cols
[2023-03-23 15:27:39] [INFO ] Computed 44 place invariants in 42 ms
[2023-03-23 15:27:41] [INFO ] Dead Transitions using invariants and state equation in 2094 ms found 0 transitions.
[2023-03-23 15:27:41] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-23 15:27:41] [INFO ] Flow matrix only has 2021 transitions (discarded 48 similar events)
[2023-03-23 15:27:41] [INFO ] Invariant cache hit.
[2023-03-23 15:27:43] [INFO ] Dead Transitions using invariants and state equation in 1920 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 4232 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 11 ms. Remains 782 /782 variables (removed 0) and now considering 2016/2016 (removed 0) transitions.
[2023-03-23 15:27:43] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
// Phase 1: matrix 1968 rows 782 cols
[2023-03-23 15:27:43] [INFO ] Computed 44 place invariants in 36 ms
[2023-03-23 15:27:46] [INFO ] Dead Transitions using invariants and state equation in 2255 ms found 0 transitions.
[2023-03-23 15:27:46] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-23 15:27:46] [INFO ] Invariant cache hit.
[2023-03-23 15:27:46] [INFO ] Implicit Places using invariants in 793 ms returned []
[2023-03-23 15:27:46] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-23 15:27:46] [INFO ] Invariant cache hit.
[2023-03-23 15:27:47] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:28:04] [INFO ] Implicit Places using invariants and state equation in 17167 ms returned []
Implicit Place search using SMT with State Equation took 17965 ms to find 0 implicit places.
[2023-03-23 15:28:04] [INFO ] Flow matrix only has 1968 transitions (discarded 48 similar events)
[2023-03-23 15:28:04] [INFO ] Invariant cache hit.
[2023-03-23 15:28:06] [INFO ] Dead Transitions using invariants and state equation in 2306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22568 ms. Remains : 782/782 places, 2016/2016 transitions.
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-15 finished in 120536 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 197 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 81 ms. Remains 545 /804 variables (removed 259) and now considering 1771/2030 (removed 259) transitions.
[2023-03-23 15:28:07] [INFO ] Flow matrix only has 1723 transitions (discarded 48 similar events)
// Phase 1: matrix 1723 rows 545 cols
[2023-03-23 15:28:07] [INFO ] Computed 52 place invariants in 26 ms
[2023-03-23 15:28:08] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
[2023-03-23 15:28:08] [INFO ] Flow matrix only has 1723 transitions (discarded 48 similar events)
[2023-03-23 15:28:08] [INFO ] Invariant cache hit.
[2023-03-23 15:28:09] [INFO ] Implicit Places using invariants in 740 ms returned [35, 51, 153, 195, 229, 339, 346, 536]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 754 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-23 15:28:09] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
// Phase 1: matrix 1719 rows 533 cols
[2023-03-23 15:28:09] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-23 15:28:09] [INFO ] Implicit Places using invariants in 686 ms returned []
[2023-03-23 15:28:09] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:28:09] [INFO ] Invariant cache hit.
[2023-03-23 15:28:11] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:28:41] [INFO ] Performed 486/533 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-23 15:28:43] [INFO ] Implicit Places using invariants and state equation in 33786 ms returned []
Implicit Place search using SMT with State Equation took 34473 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 36764 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 33214 reset in 903 ms.
Product exploration explored 100000 steps with 33401 reset in 921 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 1170 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 196 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 116 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-23 15:28:47] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:28:47] [INFO ] Invariant cache hit.
[2023-03-23 15:28:47] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-23 15:28:47] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 31 ms returned sat
[2023-03-23 15:28:47] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-23 15:28:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-23 15:28:47] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 32 ms returned sat
[2023-03-23 15:28:47] [INFO ] After 146ms 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 1801 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 213 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 180 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 10 ms. Remains 533 /533 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2023-03-23 15:28:49] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:28:49] [INFO ] Invariant cache hit.
[2023-03-23 15:28:51] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
[2023-03-23 15:28:51] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:28:51] [INFO ] Invariant cache hit.
[2023-03-23 15:28:51] [INFO ] Implicit Places using invariants in 687 ms returned []
[2023-03-23 15:28:51] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:28:51] [INFO ] Invariant cache hit.
[2023-03-23 15:28:52] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:29:08] [INFO ] Implicit Places using invariants and state equation in 16773 ms returned []
Implicit Place search using SMT with State Equation took 17483 ms to find 0 implicit places.
[2023-03-23 15:29:08] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:29:08] [INFO ] Invariant cache hit.
[2023-03-23 15:29:09] [INFO ] Dead Transitions using invariants and state equation in 1290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20016 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 605 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 347 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 120 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 15:29:11] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:29:11] [INFO ] Invariant cache hit.
[2023-03-23 15:29:11] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-23 15:29:11] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 31 ms returned sat
[2023-03-23 15:29:11] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 15:29:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-23 15:29:11] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 32 ms returned sat
[2023-03-23 15:29:11] [INFO ] After 124ms 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 795 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 363 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 351 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 346 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 20503 reset in 907 ms.
Product exploration explored 100000 steps with 20703 reset in 934 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 425 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 36 ms. Remains 533 /533 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2023-03-23 15:29:15] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:29:15] [INFO ] Invariant cache hit.
[2023-03-23 15:29:17] [INFO ] Dead Transitions using invariants and state equation in 1363 ms found 0 transitions.
[2023-03-23 15:29:17] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-23 15:29:17] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:29:17] [INFO ] Invariant cache hit.
[2023-03-23 15:29:18] [INFO ] Dead Transitions using invariants and state equation in 1371 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2851 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 7 ms. Remains 533 /533 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2023-03-23 15:29:18] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:29:18] [INFO ] Invariant cache hit.
[2023-03-23 15:29:19] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
[2023-03-23 15:29:19] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:29:19] [INFO ] Invariant cache hit.
[2023-03-23 15:29:20] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-23 15:29:20] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:29:20] [INFO ] Invariant cache hit.
[2023-03-23 15:29:22] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 15:29:52] [INFO ] Performed 466/533 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-23 15:29:55] [INFO ] Implicit Places using invariants and state equation in 35109 ms returned []
Implicit Place search using SMT with State Equation took 35815 ms to find 0 implicit places.
[2023-03-23 15:29:55] [INFO ] Flow matrix only has 1719 transitions (discarded 48 similar events)
[2023-03-23 15:29:55] [INFO ] Invariant cache hit.
[2023-03-23 15:29:56] [INFO ] Dead Transitions using invariants and state equation in 1260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38439 ms. Remains : 533/533 places, 1767/1767 transitions.
Treatment of property PolyORBLF-PT-S06J04T08-LTLFireability-15 finished in 110447 ms.
[2023-03-23 15:29:57] [INFO ] Flatten gal took : 181 ms
[2023-03-23 15:29:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-23 15:29:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 804 places, 2030 transitions and 10614 arcs took 32 ms.
Total runtime 513047 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2346/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2346/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBLF-PT-S06J04T08-LTLFireability-00
Could not compute solution for formula : PolyORBLF-PT-S06J04T08-LTLFireability-15
BK_STOP 1679585400483
--------------------
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
mcc2023
ltl formula name PolyORBLF-PT-S06J04T08-LTLFireability-00
ltl formula formula --ltl=/tmp/2346/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 804 places, 2030 transitions and 10614 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2346/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2346/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.100 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2346/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2346/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name PolyORBLF-PT-S06J04T08-LTLFireability-15
ltl formula formula --ltl=/tmp/2346/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 804 places, 2030 transitions and 10614 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.630 real 0.080 user 0.100 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2346/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2346/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2346/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2346/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
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="ltsminxred"
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 ltsminxred"
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 r297-tall-167873950700604"
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 '
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 ;