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.r007-oct2-167813596000772.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is BART-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813596000772
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 896K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 615K Feb 26 04:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 04:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 242K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 250K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 622K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.1M Feb 26 05:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.8M Feb 26 05:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1010K Feb 26 04:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 04:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 92K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 187K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.4M Mar 5 18:22 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 BART-PT-010-LTLFireability-00
FORMULA_NAME BART-PT-010-LTLFireability-01
FORMULA_NAME BART-PT-010-LTLFireability-02
FORMULA_NAME BART-PT-010-LTLFireability-03
FORMULA_NAME BART-PT-010-LTLFireability-04
FORMULA_NAME BART-PT-010-LTLFireability-05
FORMULA_NAME BART-PT-010-LTLFireability-06
FORMULA_NAME BART-PT-010-LTLFireability-07
FORMULA_NAME BART-PT-010-LTLFireability-08
FORMULA_NAME BART-PT-010-LTLFireability-09
FORMULA_NAME BART-PT-010-LTLFireability-10
FORMULA_NAME BART-PT-010-LTLFireability-11
FORMULA_NAME BART-PT-010-LTLFireability-12
FORMULA_NAME BART-PT-010-LTLFireability-13
FORMULA_NAME BART-PT-010-LTLFireability-14
FORMULA_NAME BART-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678356002267

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 10:00:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 10:00:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 10:00:05] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2023-03-09 10:00:05] [INFO ] Transformed 1530 places.
[2023-03-09 10:00:05] [INFO ] Transformed 2020 transitions.
[2023-03-09 10:00:05] [INFO ] Found NUPN structural information;
[2023-03-09 10:00:05] [INFO ] Parsed PT model containing 1530 places and 2020 transitions and 16200 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-010-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1320 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 22 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2023-03-09 10:00:05] [INFO ] Computed 10 place invariants in 44 ms
[2023-03-09 10:00:05] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-09 10:00:05] [INFO ] Invariant cache hit.
[2023-03-09 10:00:06] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
[2023-03-09 10:00:06] [INFO ] Invariant cache hit.
[2023-03-09 10:00:08] [INFO ] Dead Transitions using invariants and state equation in 1215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2599 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Support contains 1320 out of 1320 places after structural reductions.
[2023-03-09 10:00:08] [INFO ] Flatten gal took : 140 ms
[2023-03-09 10:00:08] [INFO ] Flatten gal took : 95 ms
[2023-03-09 10:00:09] [INFO ] Input system was already deterministic with 2020 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 10:00:09] [INFO ] Invariant cache hit.
[2023-03-09 10:00:09] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-09 10:00:10] [INFO ] After 959ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 10:00:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-09 10:00:11] [INFO ] After 750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 10:00:11] [INFO ] After 904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-09 10:00:11] [INFO ] After 1317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 115 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 7 ms.
FORMULA BART-PT-010-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 880 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 440 edges and 1320 vertex of which 60 / 1320 are part of one of the 10 SCC in 5 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 1270 transition count 1960
Reduce places removed 10 places and 0 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Iterating post reduction 1 with 100 rules applied. Total rules applied 111 place count 1260 transition count 1870
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 201 place count 1170 transition count 1870
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 201 place count 1170 transition count 1850
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 241 place count 1150 transition count 1850
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 291 place count 1100 transition count 1800
Iterating global reduction 3 with 50 rules applied. Total rules applied 341 place count 1100 transition count 1800
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 371 place count 1070 transition count 1770
Iterating global reduction 3 with 30 rules applied. Total rules applied 401 place count 1070 transition count 1770
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 431 place count 1040 transition count 1740
Iterating global reduction 3 with 30 rules applied. Total rules applied 461 place count 1040 transition count 1740
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 491 place count 1010 transition count 1710
Iterating global reduction 3 with 30 rules applied. Total rules applied 521 place count 1010 transition count 1710
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 541 place count 990 transition count 1690
Iterating global reduction 3 with 20 rules applied. Total rules applied 561 place count 990 transition count 1690
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 581 place count 970 transition count 1670
Iterating global reduction 3 with 20 rules applied. Total rules applied 601 place count 970 transition count 1670
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 611 place count 960 transition count 1660
Iterating global reduction 3 with 10 rules applied. Total rules applied 621 place count 960 transition count 1660
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 761 place count 890 transition count 1590
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 771 place count 890 transition count 1580
Applied a total of 771 rules in 273 ms. Remains 890 /1320 variables (removed 430) and now considering 1580/2020 (removed 440) transitions.
[2023-03-09 10:00:12] [INFO ] Flow matrix only has 1571 transitions (discarded 9 similar events)
// Phase 1: matrix 1571 rows 890 cols
[2023-03-09 10:00:12] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-09 10:00:13] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-09 10:00:13] [INFO ] Flow matrix only has 1571 transitions (discarded 9 similar events)
[2023-03-09 10:00:13] [INFO ] Invariant cache hit.
[2023-03-09 10:00:13] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-09 10:00:13] [INFO ] Redundant transitions in 113 ms returned []
[2023-03-09 10:00:13] [INFO ] Flow matrix only has 1571 transitions (discarded 9 similar events)
[2023-03-09 10:00:13] [INFO ] Invariant cache hit.
[2023-03-09 10:00:14] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 890/1320 places, 1580/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1674 ms. Remains : 890/1320 places, 1580/2020 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-01 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 (EQ s120 1) (EQ s102 1) (EQ s84 1) (EQ s882 1) (EQ s814 1) (EQ s669 1) (EQ s173 1) (EQ s457 1) (EQ s586 1) (EQ s642 1) (EQ s513 1) (EQ s687 1) (EQ ...], 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 0 steps with 0 reset in 2 ms.
FORMULA BART-PT-010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-01 finished in 1966 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(G(p1))||p0)))'
Support contains 20 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 320 place count 1000 transition count 1700
Iterating global reduction 0 with 320 rules applied. Total rules applied 640 place count 1000 transition count 1700
Discarding 270 places :
Symmetric choice reduction at 0 with 270 rule applications. Total rules 910 place count 730 transition count 1430
Iterating global reduction 0 with 270 rules applied. Total rules applied 1180 place count 730 transition count 1430
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1220 place count 690 transition count 1390
Iterating global reduction 0 with 40 rules applied. Total rules applied 1260 place count 690 transition count 1390
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1290 place count 660 transition count 1360
Iterating global reduction 0 with 30 rules applied. Total rules applied 1320 place count 660 transition count 1360
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1350 place count 630 transition count 1330
Iterating global reduction 0 with 30 rules applied. Total rules applied 1380 place count 630 transition count 1330
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1410 place count 600 transition count 1300
Iterating global reduction 0 with 30 rules applied. Total rules applied 1440 place count 600 transition count 1300
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1470 place count 570 transition count 1270
Iterating global reduction 0 with 30 rules applied. Total rules applied 1500 place count 570 transition count 1270
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1530 place count 540 transition count 1240
Iterating global reduction 0 with 30 rules applied. Total rules applied 1560 place count 540 transition count 1240
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1580 place count 520 transition count 1220
Iterating global reduction 0 with 20 rules applied. Total rules applied 1600 place count 520 transition count 1220
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1620 place count 500 transition count 1200
Iterating global reduction 0 with 20 rules applied. Total rules applied 1640 place count 500 transition count 1200
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1650 place count 490 transition count 1190
Iterating global reduction 0 with 10 rules applied. Total rules applied 1660 place count 490 transition count 1190
Applied a total of 1660 rules in 324 ms. Remains 490 /1320 variables (removed 830) and now considering 1190/2020 (removed 830) transitions.
// Phase 1: matrix 1190 rows 490 cols
[2023-03-09 10:00:14] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-09 10:00:14] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 10:00:14] [INFO ] Invariant cache hit.
[2023-03-09 10:00:15] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-09 10:00:15] [INFO ] Invariant cache hit.
[2023-03-09 10:00:15] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 490/1320 places, 1190/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1257 ms. Remains : 490/1320 places, 1190/2020 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s16 1) (EQ s17 1) (EQ s18 1) (EQ s19 1) (EQ s10 1) (EQ s11 1) (EQ s12 1) (EQ s13 1) (EQ s14 1) (EQ s15 1)), p1:(OR (EQ s9 1) (EQ s4 1) (EQ s5 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 2 ms.
FORMULA BART-PT-010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-02 finished in 1377 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)) U (X(p1) U p0)))'
Support contains 970 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 20 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2023-03-09 10:00:15] [INFO ] Computed 10 place invariants in 12 ms
[2023-03-09 10:00:16] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-09 10:00:16] [INFO ] Invariant cache hit.
[2023-03-09 10:00:17] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2023-03-09 10:00:17] [INFO ] Invariant cache hit.
[2023-03-09 10:00:18] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2311 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s310 1) (EQ s272 1) (EQ s234 1) (EQ s1312 1) (EQ s1244 1) (EQ s1069 1) (EQ s403 1) (EQ s787 1) (EQ s956 1) (EQ s1032 1) (EQ s863 1) (EQ s1087 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 670 steps with 25 reset in 62 ms.
FORMULA BART-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-03 finished in 2620 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(((p1 U p2)||G(F(p3))||p0)))'
Support contains 1310 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 13 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2023-03-09 10:00:18] [INFO ] Invariant cache hit.
[2023-03-09 10:00:18] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-09 10:00:18] [INFO ] Invariant cache hit.
[2023-03-09 10:00:19] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2023-03-09 10:00:19] [INFO ] Invariant cache hit.
[2023-03-09 10:00:20] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2121 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BART-PT-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s70 1) (EQ s297 1) (EQ s333 1) (EQ s125 1) (EQ s254 1) (EQ s77 1) (EQ s183 1) (EQ s187 1) (EQ s121 1) (EQ s250 1) (EQ s376 1) (EQ s337 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 246 reset in 1198 ms.
Product exploration explored 100000 steps with 195 reset in 1055 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 816 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Finished random walk after 9734 steps, including 2 resets, run visited all 8 properties in 97 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (F (AND p1 (NOT p0) (NOT p2) p3)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2) (NOT p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 854 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 477 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2023-03-09 10:00:28] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))
Support contains 1310 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 11 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2023-03-09 10:00:43] [INFO ] Invariant cache hit.
[2023-03-09 10:00:43] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-09 10:00:43] [INFO ] Invariant cache hit.
[2023-03-09 10:00:44] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2023-03-09 10:00:44] [INFO ] Invariant cache hit.
[2023-03-09 10:00:45] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2003 ms. Remains : 1320/1320 places, 2020/2020 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) (NOT p2) (NOT p3)), true]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2) p3)), (X (NOT (AND p1 (NOT p0) (NOT p2) p3))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 2 factoid took 571 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :6
Finished Best-First random walk after 688 steps, including 0 resets, run visited all 1 properties in 46 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), true]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2) p3)), (X (NOT (AND p1 (NOT p0) (NOT p2) p3))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p3), (F (AND (NOT p0) p1 (NOT p2) p3))]
Knowledge based reduction with 2 factoid took 721 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2023-03-09 10:00:50] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 204 reset in 949 ms.
Product exploration explored 100000 steps with 144 reset in 834 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 1310 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 51 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2023-03-09 10:01:08] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-09 10:01:08] [INFO ] Invariant cache hit.
[2023-03-09 10:01:09] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1190 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Support contains 1310 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 3 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2023-03-09 10:01:09] [INFO ] Invariant cache hit.
[2023-03-09 10:01:09] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-09 10:01:09] [INFO ] Invariant cache hit.
[2023-03-09 10:01:10] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2023-03-09 10:01:10] [INFO ] Invariant cache hit.
[2023-03-09 10:01:11] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1925 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Treatment of property BART-PT-010-LTLFireability-04 finished in 52707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 1220 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 5 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2023-03-09 10:01:11] [INFO ] Invariant cache hit.
[2023-03-09 10:01:11] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-09 10:01:11] [INFO ] Invariant cache hit.
[2023-03-09 10:01:12] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
[2023-03-09 10:01:12] [INFO ] Invariant cache hit.
[2023-03-09 10:01:13] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2237 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s310 0) (EQ s272 0) (EQ s234 0) (EQ s1312 0) (EQ s1244 0) (EQ s1069 0) (EQ s403 0) (EQ s787 0) (EQ s956 0) (EQ s1032 0) (EQ s863 0) (EQ s1087 ...], 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 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-05 finished in 2409 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(F((G(p1)&&p0))))'
Support contains 890 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 1230 transition count 1930
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 1230 transition count 1930
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 240 place count 1170 transition count 1870
Iterating global reduction 0 with 60 rules applied. Total rules applied 300 place count 1170 transition count 1870
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 330 place count 1140 transition count 1840
Iterating global reduction 0 with 30 rules applied. Total rules applied 360 place count 1140 transition count 1840
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 390 place count 1110 transition count 1810
Iterating global reduction 0 with 30 rules applied. Total rules applied 420 place count 1110 transition count 1810
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 450 place count 1080 transition count 1780
Iterating global reduction 0 with 30 rules applied. Total rules applied 480 place count 1080 transition count 1780
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 510 place count 1050 transition count 1750
Iterating global reduction 0 with 30 rules applied. Total rules applied 540 place count 1050 transition count 1750
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 560 place count 1030 transition count 1730
Iterating global reduction 0 with 20 rules applied. Total rules applied 580 place count 1030 transition count 1730
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 600 place count 1010 transition count 1710
Iterating global reduction 0 with 20 rules applied. Total rules applied 620 place count 1010 transition count 1710
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 630 place count 1000 transition count 1700
Iterating global reduction 0 with 10 rules applied. Total rules applied 640 place count 1000 transition count 1700
Applied a total of 640 rules in 93 ms. Remains 1000 /1320 variables (removed 320) and now considering 1700/2020 (removed 320) transitions.
// Phase 1: matrix 1700 rows 1000 cols
[2023-03-09 10:01:13] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-09 10:01:13] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-09 10:01:13] [INFO ] Invariant cache hit.
[2023-03-09 10:01:14] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2023-03-09 10:01:14] [INFO ] Invariant cache hit.
[2023-03-09 10:01:15] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1320 places, 1700/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1455 ms. Remains : 1000/1320 places, 1700/2020 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s16 1) (EQ s17 1) (EQ s18 1) (EQ s19 1) (EQ s10 1) (EQ s11 1) (EQ s12 1) (EQ s13 1) (EQ s14 1) (EQ s15 1)) (OR (EQ s180 1) (EQ s162 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2014 ms.
Product exploration explored 100000 steps with 0 reset in 1980 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 49 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-09 10:01:20] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
[2023-03-09 10:01:36] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-09 10:01:51] [INFO ] Invariant cache hit.
[2023-03-09 10:01:51] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-09 10:01:51] [INFO ] Invariant cache hit.
[2023-03-09 10:01:52] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2023-03-09 10:01:52] [INFO ] Invariant cache hit.
[2023-03-09 10:01:52] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1442 ms. Remains : 1000/1000 places, 1700/1700 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 p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 38 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 366 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-09 10:01:54] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
[2023-03-09 10:02:10] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2013 ms.
Product exploration explored 100000 steps with 0 reset in 2081 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 1700
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 10 place count 1000 transition count 1700
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 20 place count 1000 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 990 transition count 1690
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 990 transition count 1690
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 110 place count 990 transition count 1690
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 120 place count 990 transition count 1680
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 180 place count 930 transition count 1620
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 240 place count 930 transition count 1620
Deduced a syphon composed of 20 places in 1 ms
Applied a total of 240 rules in 86 ms. Remains 930 /1000 variables (removed 70) and now considering 1620/1700 (removed 80) transitions.
[2023-03-09 10:02:29] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 1620 rows 930 cols
[2023-03-09 10:02:29] [INFO ] Computed 10 place invariants in 16 ms
[2023-03-09 10:02:30] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 930/1000 places, 1620/1700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 831 ms. Remains : 930/1000 places, 1620/1700 transitions.
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Applied a total of 0 rules in 4 ms. Remains 1000 /1000 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
// Phase 1: matrix 1700 rows 1000 cols
[2023-03-09 10:02:30] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-09 10:02:30] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-09 10:02:30] [INFO ] Invariant cache hit.
[2023-03-09 10:02:31] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-09 10:02:31] [INFO ] Invariant cache hit.
[2023-03-09 10:02:31] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1351 ms. Remains : 1000/1000 places, 1700/1700 transitions.
Treatment of property BART-PT-010-LTLFireability-06 finished in 78373 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(F(p0)))'
Support contains 680 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1290 transition count 1990
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1290 transition count 1990
Applied a total of 60 rules in 51 ms. Remains 1290 /1320 variables (removed 30) and now considering 1990/2020 (removed 30) transitions.
// Phase 1: matrix 1990 rows 1290 cols
[2023-03-09 10:02:32] [INFO ] Computed 10 place invariants in 19 ms
[2023-03-09 10:02:32] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-09 10:02:32] [INFO ] Invariant cache hit.
[2023-03-09 10:02:33] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-09 10:02:33] [INFO ] Invariant cache hit.
[2023-03-09 10:02:33] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1290/1320 places, 1990/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1712 ms. Remains : 1290/1320 places, 1990/2020 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1070 1) (EQ s666 1) (EQ s430 1) (EQ s1119 1) (EQ s709 1) (EQ s516 1) (EQ s310 1) (EQ s559 1) (EQ s35 1) (EQ s1286 1) (EQ s142 1) (EQ s623 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1902 ms.
Product exploration explored 100000 steps with 50000 reset in 1925 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-07 finished in 5909 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))'
Support contains 1 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 2016 edges and 1320 vertex of which 1318 / 1320 are part of one of the 10 SCC in 3 ms
Free SCC test removed 1308 places
Ensure Unique test removed 2006 transitions
Reduce isomorphic transitions removed 2006 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 3 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 2 transition count 3
Applied a total of 13 rules in 13 ms. Remains 2 /1320 variables (removed 1318) and now considering 3/2020 (removed 2017) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-09 10:02:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 10:02:37] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 10:02:37] [INFO ] Invariant cache hit.
[2023-03-09 10:02:38] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-09 10:02:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 10:02:38] [INFO ] Invariant cache hit.
[2023-03-09 10:02:38] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1320 places, 3/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 2/1320 places, 3/2020 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-08 finished in 198 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(p0) U !p1))))'
Support contains 3 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 318 place count 1002 transition count 1702
Iterating global reduction 0 with 318 rules applied. Total rules applied 636 place count 1002 transition count 1702
Discarding 268 places :
Symmetric choice reduction at 0 with 268 rule applications. Total rules 904 place count 734 transition count 1434
Iterating global reduction 0 with 268 rules applied. Total rules applied 1172 place count 734 transition count 1434
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1212 place count 694 transition count 1394
Iterating global reduction 0 with 40 rules applied. Total rules applied 1252 place count 694 transition count 1394
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1282 place count 664 transition count 1364
Iterating global reduction 0 with 30 rules applied. Total rules applied 1312 place count 664 transition count 1364
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1342 place count 634 transition count 1334
Iterating global reduction 0 with 30 rules applied. Total rules applied 1372 place count 634 transition count 1334
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1402 place count 604 transition count 1304
Iterating global reduction 0 with 30 rules applied. Total rules applied 1432 place count 604 transition count 1304
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1462 place count 574 transition count 1274
Iterating global reduction 0 with 30 rules applied. Total rules applied 1492 place count 574 transition count 1274
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1522 place count 544 transition count 1244
Iterating global reduction 0 with 30 rules applied. Total rules applied 1552 place count 544 transition count 1244
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1572 place count 524 transition count 1224
Iterating global reduction 0 with 20 rules applied. Total rules applied 1592 place count 524 transition count 1224
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1612 place count 504 transition count 1204
Iterating global reduction 0 with 20 rules applied. Total rules applied 1632 place count 504 transition count 1204
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1642 place count 494 transition count 1194
Iterating global reduction 0 with 10 rules applied. Total rules applied 1652 place count 494 transition count 1194
Applied a total of 1652 rules in 241 ms. Remains 494 /1320 variables (removed 826) and now considering 1194/2020 (removed 826) transitions.
// Phase 1: matrix 1194 rows 494 cols
[2023-03-09 10:02:38] [INFO ] Computed 10 place invariants in 10 ms
[2023-03-09 10:02:38] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-09 10:02:38] [INFO ] Invariant cache hit.
[2023-03-09 10:02:38] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-09 10:02:38] [INFO ] Invariant cache hit.
[2023-03-09 10:02:39] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 494/1320 places, 1194/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1159 ms. Remains : 494/1320 places, 1194/2020 transitions.
Stuttering acceptance computed with spot in 264 ms :[p1, (OR (NOT p0) p1), p1, p1, true]
Running random walk in product with property : BART-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s17 1) (EQ s372 1)), p0:(EQ s160 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1198 ms.
Product exploration explored 100000 steps with 33333 reset in 1213 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 (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-09 finished in 3989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((p1||X((p1||F(!p0)))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 907 place count 732 transition count 1432
Iterating global reduction 0 with 269 rules applied. Total rules applied 1176 place count 732 transition count 1432
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1216 place count 692 transition count 1392
Iterating global reduction 0 with 40 rules applied. Total rules applied 1256 place count 692 transition count 1392
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1286 place count 662 transition count 1362
Iterating global reduction 0 with 30 rules applied. Total rules applied 1316 place count 662 transition count 1362
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1346 place count 632 transition count 1332
Iterating global reduction 0 with 30 rules applied. Total rules applied 1376 place count 632 transition count 1332
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1406 place count 602 transition count 1302
Iterating global reduction 0 with 30 rules applied. Total rules applied 1436 place count 602 transition count 1302
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1466 place count 572 transition count 1272
Iterating global reduction 0 with 30 rules applied. Total rules applied 1496 place count 572 transition count 1272
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1526 place count 542 transition count 1242
Iterating global reduction 0 with 30 rules applied. Total rules applied 1556 place count 542 transition count 1242
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1576 place count 522 transition count 1222
Iterating global reduction 0 with 20 rules applied. Total rules applied 1596 place count 522 transition count 1222
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1616 place count 502 transition count 1202
Iterating global reduction 0 with 20 rules applied. Total rules applied 1636 place count 502 transition count 1202
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1646 place count 492 transition count 1192
Iterating global reduction 0 with 10 rules applied. Total rules applied 1656 place count 492 transition count 1192
Applied a total of 1656 rules in 209 ms. Remains 492 /1320 variables (removed 828) and now considering 1192/2020 (removed 828) transitions.
// Phase 1: matrix 1192 rows 492 cols
[2023-03-09 10:02:42] [INFO ] Computed 10 place invariants in 9 ms
[2023-03-09 10:02:42] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 10:02:42] [INFO ] Invariant cache hit.
[2023-03-09 10:02:43] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2023-03-09 10:02:43] [INFO ] Invariant cache hit.
[2023-03-09 10:02:43] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 492/1320 places, 1192/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1595 ms. Remains : 492/1320 places, 1192/2020 transitions.
Stuttering acceptance computed with spot in 318 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s390 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14438 reset in 1285 ms.
Product exploration explored 100000 steps with 14371 reset in 1156 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 386 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Finished random walk after 2589 steps, including 0 resets, run visited all 4 properties in 16 ms. (steps per millisecond=161 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 844 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 395 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
[2023-03-09 10:02:48] [INFO ] Invariant cache hit.
[2023-03-09 10:02:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
Proved EG (AND p0 (NOT p1))
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (G (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND p0 (NOT p1)))
Knowledge based reduction with 4 factoid took 430 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-10 finished in 7675 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) U p2)))))'
Support contains 3 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1977 edges and 1320 vertex of which 1029 / 1320 are part of one of the 8 SCC in 3 ms
Free SCC test removed 1021 places
Ensure Unique test removed 1569 transitions
Reduce isomorphic transitions removed 1569 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 152 rules applied. Total rules applied 153 place count 292 transition count 299
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 151 rules applied. Total rules applied 304 place count 146 transition count 294
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 309 place count 144 transition count 291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 312 place count 143 transition count 289
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 315 place count 142 transition count 287
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 318 place count 141 transition count 285
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 320 place count 140 transition count 284
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 320 place count 140 transition count 275
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 338 place count 131 transition count 275
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 351 place count 118 transition count 262
Iterating global reduction 7 with 13 rules applied. Total rules applied 364 place count 118 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 367 place count 118 transition count 259
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 375 place count 110 transition count 251
Iterating global reduction 8 with 8 rules applied. Total rules applied 383 place count 110 transition count 251
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 389 place count 104 transition count 245
Iterating global reduction 8 with 6 rules applied. Total rules applied 395 place count 104 transition count 245
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 401 place count 98 transition count 239
Iterating global reduction 8 with 6 rules applied. Total rules applied 407 place count 98 transition count 239
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 411 place count 94 transition count 235
Iterating global reduction 8 with 4 rules applied. Total rules applied 415 place count 94 transition count 235
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 419 place count 90 transition count 231
Iterating global reduction 8 with 4 rules applied. Total rules applied 423 place count 90 transition count 231
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 425 place count 88 transition count 229
Iterating global reduction 8 with 2 rules applied. Total rules applied 427 place count 88 transition count 229
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 455 place count 74 transition count 215
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 463 place count 74 transition count 207
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 471 place count 70 transition count 203
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 479 place count 70 transition count 195
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 487 place count 66 transition count 191
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 495 place count 66 transition count 183
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 503 place count 62 transition count 179
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 511 place count 62 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 519 place count 58 transition count 167
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 527 place count 58 transition count 159
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 535 place count 54 transition count 155
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 543 place count 54 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 551 place count 50 transition count 143
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 559 place count 50 transition count 135
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 567 place count 46 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 575 place count 46 transition count 123
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 583 place count 42 transition count 119
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 591 place count 42 transition count 111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 599 place count 38 transition count 107
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 607 place count 38 transition count 99
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 615 place count 34 transition count 95
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 623 place count 34 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 631 place count 30 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 19 with 8 rules applied. Total rules applied 639 place count 30 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 647 place count 26 transition count 71
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 20 with 8 rules applied. Total rules applied 655 place count 26 transition count 63
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 663 place count 22 transition count 59
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 21 with 8 rules applied. Total rules applied 671 place count 22 transition count 51
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 679 place count 18 transition count 47
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 22 with 8 rules applied. Total rules applied 687 place count 18 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 695 place count 14 transition count 35
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 23 with 8 rules applied. Total rules applied 703 place count 14 transition count 27
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 711 place count 10 transition count 23
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 24 with 9 rules applied. Total rules applied 720 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 25 with 3 rules applied. Total rules applied 723 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 725 place count 8 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 27 with 1 Pre rules applied. Total rules applied 725 place count 8 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 727 place count 7 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 27 with 2 rules applied. Total rules applied 729 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 27 with 1 Pre rules applied. Total rules applied 729 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 731 place count 6 transition count 7
Applied a total of 731 rules in 77 ms. Remains 6 /1320 variables (removed 1314) and now considering 7/2020 (removed 2013) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-09 10:02:49] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 10:02:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 10:02:49] [INFO ] Invariant cache hit.
[2023-03-09 10:02:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-09 10:02:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 10:02:49] [INFO ] Invariant cache hit.
[2023-03-09 10:02:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/1320 places, 7/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 6/1320 places, 7/2020 transitions.
Stuttering acceptance computed with spot in 406 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p2 p1) (AND p1 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s2 1), p1:(EQ s4 1), p0:(EQ s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-11 finished in 630 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 1 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 2018 edges and 1320 vertex of which 1188 / 1320 are part of one of the 9 SCC in 2 ms
Free SCC test removed 1179 places
Ensure Unique test removed 1809 transitions
Reduce isomorphic transitions removed 1809 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 72 rules applied. Total rules applied 73 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 137 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 137 place count 68 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 145 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 151 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 175 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 178 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 202 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 206 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 214 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 218 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 222 place count 32 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 226 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 230 place count 30 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 234 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 238 place count 28 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 242 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 246 place count 26 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 250 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 254 place count 24 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 258 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 262 place count 22 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 266 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 270 place count 20 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 274 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 278 place count 18 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 282 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 286 place count 16 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 290 place count 14 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 294 place count 14 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 298 place count 12 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 302 place count 12 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 306 place count 10 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 310 place count 10 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 314 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 318 place count 8 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 322 place count 6 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 326 place count 6 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 330 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 335 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 337 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 337 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 339 place count 2 transition count 3
Applied a total of 339 rules in 42 ms. Remains 2 /1320 variables (removed 1318) and now considering 3/2020 (removed 2017) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-09 10:02:50] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 10:02:50] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 10:02:50] [INFO ] Invariant cache hit.
[2023-03-09 10:02:50] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-09 10:02:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 10:02:50] [INFO ] Invariant cache hit.
[2023-03-09 10:02:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1320 places, 3/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 2/1320 places, 3/2020 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s1 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 2 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-12 finished in 238 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(G(((G(p0)||X(p1)) U !p1))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 907 place count 732 transition count 1432
Iterating global reduction 0 with 269 rules applied. Total rules applied 1176 place count 732 transition count 1432
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1215 place count 693 transition count 1393
Iterating global reduction 0 with 39 rules applied. Total rules applied 1254 place count 693 transition count 1393
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1283 place count 664 transition count 1364
Iterating global reduction 0 with 29 rules applied. Total rules applied 1312 place count 664 transition count 1364
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1341 place count 635 transition count 1335
Iterating global reduction 0 with 29 rules applied. Total rules applied 1370 place count 635 transition count 1335
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1399 place count 606 transition count 1306
Iterating global reduction 0 with 29 rules applied. Total rules applied 1428 place count 606 transition count 1306
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1457 place count 577 transition count 1277
Iterating global reduction 0 with 29 rules applied. Total rules applied 1486 place count 577 transition count 1277
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1515 place count 548 transition count 1248
Iterating global reduction 0 with 29 rules applied. Total rules applied 1544 place count 548 transition count 1248
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1563 place count 529 transition count 1229
Iterating global reduction 0 with 19 rules applied. Total rules applied 1582 place count 529 transition count 1229
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1601 place count 510 transition count 1210
Iterating global reduction 0 with 19 rules applied. Total rules applied 1620 place count 510 transition count 1210
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 1629 place count 501 transition count 1201
Iterating global reduction 0 with 9 rules applied. Total rules applied 1638 place count 501 transition count 1201
Applied a total of 1638 rules in 222 ms. Remains 501 /1320 variables (removed 819) and now considering 1201/2020 (removed 819) transitions.
// Phase 1: matrix 1201 rows 501 cols
[2023-03-09 10:02:50] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-09 10:02:51] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-09 10:02:51] [INFO ] Invariant cache hit.
[2023-03-09 10:02:51] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-09 10:02:51] [INFO ] Invariant cache hit.
[2023-03-09 10:02:51] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/1320 places, 1201/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1070 ms. Remains : 501/1320 places, 1201/2020 transitions.
Stuttering acceptance computed with spot in 394 ms :[p1, p1, p1, p1, (NOT p1), p1, (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : BART-PT-010-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: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={0} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(NEQ s50 1), p0:(NEQ s16 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, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15403 reset in 1419 ms.
Product exploration explored 100000 steps with 15360 reset in 1332 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 9 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 515 ms :[p1, p1, p1, p1, (NOT p1), p1, (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Finished random walk after 2802 steps, including 0 resets, run visited all 6 properties in 22 ms. (steps per millisecond=127 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 411 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 9 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 561 ms :[p1, p1, p1, p1, (NOT p1), p1, (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 495 ms :[p1, p1, p1, p1, (NOT p1), p1, (AND (NOT p0) (NOT p1)), true, (NOT p0)]
[2023-03-09 10:02:57] [INFO ] Invariant cache hit.
[2023-03-09 10:02:57] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned unsat
Proved EG p1
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (G p1)]
Property proved to be false thanks to negative knowledge :(G p1)
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-13 finished in 6999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 3 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 907 place count 732 transition count 1432
Iterating global reduction 0 with 269 rules applied. Total rules applied 1176 place count 732 transition count 1432
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1216 place count 692 transition count 1392
Iterating global reduction 0 with 40 rules applied. Total rules applied 1256 place count 692 transition count 1392
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1286 place count 662 transition count 1362
Iterating global reduction 0 with 30 rules applied. Total rules applied 1316 place count 662 transition count 1362
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1346 place count 632 transition count 1332
Iterating global reduction 0 with 30 rules applied. Total rules applied 1376 place count 632 transition count 1332
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1406 place count 602 transition count 1302
Iterating global reduction 0 with 30 rules applied. Total rules applied 1436 place count 602 transition count 1302
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1466 place count 572 transition count 1272
Iterating global reduction 0 with 30 rules applied. Total rules applied 1496 place count 572 transition count 1272
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1526 place count 542 transition count 1242
Iterating global reduction 0 with 30 rules applied. Total rules applied 1556 place count 542 transition count 1242
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1576 place count 522 transition count 1222
Iterating global reduction 0 with 20 rules applied. Total rules applied 1596 place count 522 transition count 1222
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1616 place count 502 transition count 1202
Iterating global reduction 0 with 20 rules applied. Total rules applied 1636 place count 502 transition count 1202
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1646 place count 492 transition count 1192
Iterating global reduction 0 with 10 rules applied. Total rules applied 1656 place count 492 transition count 1192
Applied a total of 1656 rules in 209 ms. Remains 492 /1320 variables (removed 828) and now considering 1192/2020 (removed 828) transitions.
// Phase 1: matrix 1192 rows 492 cols
[2023-03-09 10:02:57] [INFO ] Computed 10 place invariants in 9 ms
[2023-03-09 10:02:57] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-09 10:02:57] [INFO ] Invariant cache hit.
[2023-03-09 10:02:58] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-09 10:02:58] [INFO ] Invariant cache hit.
[2023-03-09 10:02:58] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 492/1320 places, 1192/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1089 ms. Remains : 492/1320 places, 1192/2020 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s1 0), p1:(OR (EQ s270 0) (EQ s2 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-15 finished in 1228 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(((p1 U p2)||G(F(p3))||p0)))'
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(F((G(p1)&&p0))))'
Found a Shortening insensitive property : BART-PT-010-LTLFireability-06
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 890 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1320 transition count 2000
Reduce places removed 20 places and 0 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Iterating post reduction 1 with 110 rules applied. Total rules applied 130 place count 1300 transition count 1910
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 220 place count 1210 transition count 1910
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 220 place count 1210 transition count 1870
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 300 place count 1170 transition count 1870
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 360 place count 1110 transition count 1810
Iterating global reduction 3 with 60 rules applied. Total rules applied 420 place count 1110 transition count 1810
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 430 place count 1110 transition count 1800
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 460 place count 1080 transition count 1770
Iterating global reduction 4 with 30 rules applied. Total rules applied 490 place count 1080 transition count 1770
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 520 place count 1050 transition count 1740
Iterating global reduction 4 with 30 rules applied. Total rules applied 550 place count 1050 transition count 1740
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 580 place count 1020 transition count 1710
Iterating global reduction 4 with 30 rules applied. Total rules applied 610 place count 1020 transition count 1710
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 630 place count 1000 transition count 1690
Iterating global reduction 4 with 20 rules applied. Total rules applied 650 place count 1000 transition count 1690
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 670 place count 980 transition count 1670
Iterating global reduction 4 with 20 rules applied. Total rules applied 690 place count 980 transition count 1670
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 700 place count 970 transition count 1660
Iterating global reduction 4 with 10 rules applied. Total rules applied 710 place count 970 transition count 1660
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 830 place count 910 transition count 1600
Applied a total of 830 rules in 131 ms. Remains 910 /1320 variables (removed 410) and now considering 1600/2020 (removed 420) transitions.
// Phase 1: matrix 1600 rows 910 cols
[2023-03-09 10:02:59] [INFO ] Computed 10 place invariants in 16 ms
[2023-03-09 10:02:59] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-09 10:02:59] [INFO ] Invariant cache hit.
[2023-03-09 10:03:00] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-09 10:03:00] [INFO ] Invariant cache hit.
[2023-03-09 10:03:00] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 910/1320 places, 1600/2020 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1438 ms. Remains : 910/1320 places, 1600/2020 transitions.
Running random walk in product with property : BART-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s16 1) (EQ s17 1) (EQ s18 1) (EQ s19 1) (EQ s10 1) (EQ s11 1) (EQ s12 1) (EQ s13 1) (EQ s14 1) (EQ s15 1)) (OR (EQ s140 1) (EQ s122 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1463 ms.
Product exploration explored 100000 steps with 0 reset in 1421 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 14 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 431 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-09 10:03:05] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
[2023-03-09 10:03:21] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 890 out of 910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 910/910 places, 1600/1600 transitions.
Applied a total of 0 rules in 8 ms. Remains 910 /910 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
[2023-03-09 10:03:36] [INFO ] Invariant cache hit.
[2023-03-09 10:03:36] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-09 10:03:36] [INFO ] Invariant cache hit.
[2023-03-09 10:03:37] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-09 10:03:37] [INFO ] Invariant cache hit.
[2023-03-09 10:03:37] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1378 ms. Remains : 910/910 places, 1600/1600 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 p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 368 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 27 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 328 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-09 10:03:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
[2023-03-09 10:03:55] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1243 ms.
Product exploration explored 100000 steps with 0 reset in 1315 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 890 out of 910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 910/910 places, 1600/1600 transitions.
Applied a total of 0 rules in 16 ms. Remains 910 /910 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
[2023-03-09 10:04:13] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-09 10:04:13] [INFO ] Invariant cache hit.
[2023-03-09 10:04:14] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 852 ms. Remains : 910/910 places, 1600/1600 transitions.
Support contains 890 out of 910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 910/910 places, 1600/1600 transitions.
Applied a total of 0 rules in 3 ms. Remains 910 /910 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
[2023-03-09 10:04:14] [INFO ] Invariant cache hit.
[2023-03-09 10:04:14] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 10:04:14] [INFO ] Invariant cache hit.
[2023-03-09 10:04:15] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2023-03-09 10:04:15] [INFO ] Invariant cache hit.
[2023-03-09 10:04:15] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1172 ms. Remains : 910/910 places, 1600/1600 transitions.
Treatment of property BART-PT-010-LTLFireability-06 finished in 76738 ms.
[2023-03-09 10:04:15] [INFO ] Flatten gal took : 57 ms
[2023-03-09 10:04:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2023-03-09 10:04:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1320 places, 2020 transitions and 4040 arcs took 5 ms.
Total runtime 251087 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BART-PT-010
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA BART-PT-010-LTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678356537234

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 BART-PT-010-LTLFireability-06
lola: time limit : 1754 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for BART-PT-010-LTLFireability-06
lola: result : false
lola: markings : 157
lola: fired transitions : 157
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 BART-PT-010-LTLFireability-04
lola: time limit : 3509 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3509 1/32 BART-PT-010-LTLFireability-04 81197 m, 16239 m/sec, 308518 t fired, .

Time elapsed: 95 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3509 2/32 BART-PT-010-LTLFireability-04 186322 m, 21025 m/sec, 763123 t fired, .

Time elapsed: 100 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3509 3/32 BART-PT-010-LTLFireability-04 288373 m, 20410 m/sec, 1221147 t fired, .

Time elapsed: 105 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3509 4/32 BART-PT-010-LTLFireability-04 389501 m, 20225 m/sec, 1679394 t fired, .

Time elapsed: 110 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3509 5/32 BART-PT-010-LTLFireability-04 489857 m, 20071 m/sec, 2136852 t fired, .

Time elapsed: 115 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3509 6/32 BART-PT-010-LTLFireability-04 593621 m, 20752 m/sec, 2581934 t fired, .

Time elapsed: 120 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3509 7/32 BART-PT-010-LTLFireability-04 695400 m, 20355 m/sec, 3029542 t fired, .

Time elapsed: 125 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3509 7/32 BART-PT-010-LTLFireability-04 799437 m, 20807 m/sec, 3464375 t fired, .

Time elapsed: 130 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3509 8/32 BART-PT-010-LTLFireability-04 899257 m, 19964 m/sec, 3906106 t fired, .

Time elapsed: 135 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3509 9/32 BART-PT-010-LTLFireability-04 1004061 m, 20960 m/sec, 4330582 t fired, .

Time elapsed: 140 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/3509 10/32 BART-PT-010-LTLFireability-04 1105208 m, 20229 m/sec, 4759286 t fired, .

Time elapsed: 145 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/3509 11/32 BART-PT-010-LTLFireability-04 1205968 m, 20152 m/sec, 5185923 t fired, .

Time elapsed: 150 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/3509 12/32 BART-PT-010-LTLFireability-04 1305782 m, 19962 m/sec, 5610179 t fired, .

Time elapsed: 155 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/3509 13/32 BART-PT-010-LTLFireability-04 1406809 m, 20205 m/sec, 6028705 t fired, .

Time elapsed: 160 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 74/3509 14/32 BART-PT-010-LTLFireability-04 1507013 m, 20040 m/sec, 6448339 t fired, .

Time elapsed: 165 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 79/3509 14/32 BART-PT-010-LTLFireability-04 1604849 m, 19567 m/sec, 6873601 t fired, .

Time elapsed: 170 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 84/3509 15/32 BART-PT-010-LTLFireability-04 1703037 m, 19637 m/sec, 7292606 t fired, .

Time elapsed: 175 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 89/3509 16/32 BART-PT-010-LTLFireability-04 1802419 m, 19876 m/sec, 7702138 t fired, .

Time elapsed: 180 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 94/3509 17/32 BART-PT-010-LTLFireability-04 1898727 m, 19261 m/sec, 8122558 t fired, .

Time elapsed: 185 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 99/3509 18/32 BART-PT-010-LTLFireability-04 1998691 m, 19992 m/sec, 8525639 t fired, .

Time elapsed: 190 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 104/3509 19/32 BART-PT-010-LTLFireability-04 2093760 m, 19013 m/sec, 8946264 t fired, .

Time elapsed: 195 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 109/3509 20/32 BART-PT-010-LTLFireability-04 2189675 m, 19183 m/sec, 9365678 t fired, .

Time elapsed: 200 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 114/3509 20/32 BART-PT-010-LTLFireability-04 2285913 m, 19247 m/sec, 9779343 t fired, .

Time elapsed: 205 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 119/3509 21/32 BART-PT-010-LTLFireability-04 2384710 m, 19759 m/sec, 10179128 t fired, .

Time elapsed: 210 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 124/3509 22/32 BART-PT-010-LTLFireability-04 2481514 m, 19360 m/sec, 10592909 t fired, .

Time elapsed: 215 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 129/3509 23/32 BART-PT-010-LTLFireability-04 2576355 m, 18968 m/sec, 11007147 t fired, .

Time elapsed: 220 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 134/3509 24/32 BART-PT-010-LTLFireability-04 2673506 m, 19430 m/sec, 11407281 t fired, .

Time elapsed: 225 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 139/3509 25/32 BART-PT-010-LTLFireability-04 2769219 m, 19142 m/sec, 11812339 t fired, .

Time elapsed: 230 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 144/3509 26/32 BART-PT-010-LTLFireability-04 2865161 m, 19188 m/sec, 12216005 t fired, .

Time elapsed: 235 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 149/3509 26/32 BART-PT-010-LTLFireability-04 2959943 m, 18956 m/sec, 12617329 t fired, .

Time elapsed: 240 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 154/3509 27/32 BART-PT-010-LTLFireability-04 3057225 m, 19456 m/sec, 13014220 t fired, .

Time elapsed: 245 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 159/3509 28/32 BART-PT-010-LTLFireability-04 3150664 m, 18687 m/sec, 13425429 t fired, .

Time elapsed: 250 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 164/3509 29/32 BART-PT-010-LTLFireability-04 3244307 m, 18728 m/sec, 13825441 t fired, .

Time elapsed: 255 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 169/3509 30/32 BART-PT-010-LTLFireability-04 3337775 m, 18693 m/sec, 14224234 t fired, .

Time elapsed: 260 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 174/3509 30/32 BART-PT-010-LTLFireability-04 3429876 m, 18420 m/sec, 14628665 t fired, .

Time elapsed: 265 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 179/3509 31/32 BART-PT-010-LTLFireability-04 3524144 m, 18853 m/sec, 15030475 t fired, .

Time elapsed: 270 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 184/3509 32/32 BART-PT-010-LTLFireability-04 3615386 m, 18248 m/sec, 15436104 t fired, .

Time elapsed: 275 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for BART-PT-010-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BART-PT-010-LTLFireability-04: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BART-PT-010-LTLFireability-04: LTL unknown AGGR
BART-PT-010-LTLFireability-06: LTL false LTL model checker


Time elapsed: 280 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is BART-PT-010, 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 r007-oct2-167813596000772"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-010.tgz
mv BART-PT-010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;