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.r005-oct2-167813593600772.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 itstools
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 r005-oct2-167813593600772
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-010
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 09:16:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 09:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:16:38] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-11 09:16:38] [INFO ] Transformed 1530 places.
[2023-03-11 09:16:38] [INFO ] Transformed 2020 transitions.
[2023-03-11 09:16:38] [INFO ] Found NUPN structural information;
[2023-03-11 09:16:38] [INFO ] Parsed PT model containing 1530 places and 2020 transitions and 16200 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 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 87 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2023-03-11 09:16:39] [INFO ] Computed 10 place invariants in 48 ms
[2023-03-11 09:16:39] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-11 09:16:39] [INFO ] Invariant cache hit.
[2023-03-11 09:16:40] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
[2023-03-11 09:16:40] [INFO ] Invariant cache hit.
[2023-03-11 09:16:43] [INFO ] Dead Transitions using invariants and state equation in 2788 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4609 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Support contains 1320 out of 1320 places after structural reductions.
[2023-03-11 09:16:44] [INFO ] Flatten gal took : 150 ms
[2023-03-11 09:16:44] [INFO ] Flatten gal took : 111 ms
[2023-03-11 09:16:45] [INFO ] Input system was already deterministic with 2020 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 09:16:45] [INFO ] Invariant cache hit.
[2023-03-11 09:16:46] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-11 09:16:46] [INFO ] After 839ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-11 09:16:47] [INFO ] After 1021ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 09:16:47] [INFO ] After 1513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 09:16:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 50 ms returned sat
[2023-03-11 09:16:48] [INFO ] After 840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 09:16:48] [INFO ] After 1216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 260 ms.
[2023-03-11 09:16:49] [INFO ] After 1957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 116 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 23 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 4 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 0 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 262 ms. Remains 890 /1320 variables (removed 430) and now considering 1580/2020 (removed 440) transitions.
[2023-03-11 09:16:50] [INFO ] Flow matrix only has 1571 transitions (discarded 9 similar events)
// Phase 1: matrix 1571 rows 890 cols
[2023-03-11 09:16:50] [INFO ] Computed 10 place invariants in 9 ms
[2023-03-11 09:16:50] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-11 09:16:50] [INFO ] Flow matrix only has 1571 transitions (discarded 9 similar events)
[2023-03-11 09:16:50] [INFO ] Invariant cache hit.
[2023-03-11 09:16:50] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-11 09:16:50] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-11 09:16:50] [INFO ] Flow matrix only has 1571 transitions (discarded 9 similar events)
[2023-03-11 09:16:50] [INFO ] Invariant cache hit.
[2023-03-11 09:16:51] [INFO ] Dead Transitions using invariants and state equation in 904 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 1938 ms. Remains : 890/1320 places, 1580/2020 transitions.
Stuttering acceptance computed with spot in 220 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 2265 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 283 ms. Remains 490 /1320 variables (removed 830) and now considering 1190/2020 (removed 830) transitions.
// Phase 1: matrix 1190 rows 490 cols
[2023-03-11 09:16:52] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-11 09:16:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-11 09:16:52] [INFO ] Invariant cache hit.
[2023-03-11 09:16:52] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-11 09:16:52] [INFO ] Invariant cache hit.
[2023-03-11 09:16:53] [INFO ] Dead Transitions using invariants and state equation in 525 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 1339 ms. Remains : 490/1320 places, 1190/2020 transitions.
Stuttering acceptance computed with spot in 132 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 1502 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 23 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2023-03-11 09:16:53] [INFO ] Computed 10 place invariants in 22 ms
[2023-03-11 09:16:54] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-11 09:16:54] [INFO ] Invariant cache hit.
[2023-03-11 09:16:55] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
[2023-03-11 09:16:55] [INFO ] Invariant cache hit.
[2023-03-11 09:16:56] [INFO ] Dead Transitions using invariants and state equation in 1312 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2663 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Stuttering acceptance computed with spot in 227 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 930 steps with 33 reset in 46 ms.
FORMULA BART-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-03 finished in 2976 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 9 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2023-03-11 09:16:56] [INFO ] Invariant cache hit.
[2023-03-11 09:16:56] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-11 09:16:56] [INFO ] Invariant cache hit.
[2023-03-11 09:16:57] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2023-03-11 09:16:57] [INFO ] Invariant cache hit.
[2023-03-11 09:16:58] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2238 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Stuttering acceptance computed with spot in 344 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 174 reset in 1051 ms.
Product exploration explored 100000 steps with 189 reset in 1187 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 775 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 371 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))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :7
Finished Best-First random walk after 688 steps, including 0 resets, run visited all 1 properties in 44 ms. (steps per millisecond=15 )
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 1463 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 504 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 569 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-11 09:17:07] [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 13 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2023-03-11 09:17:22] [INFO ] Invariant cache hit.
[2023-03-11 09:17:23] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-11 09:17:23] [INFO ] Invariant cache hit.
[2023-03-11 09:17:23] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2023-03-11 09:17:23] [INFO ] Invariant cache hit.
[2023-03-11 09:17:24] [INFO ] Dead Transitions using invariants and state equation in 1098 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2260 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 2040 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 427 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 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :6
Finished Best-First random walk after 688 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=26 )
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 943 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 524 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 464 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-11 09:17:31] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 318 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 215 reset in 1066 ms.
Product exploration explored 100000 steps with 236 reset in 982 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 317 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 40 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2023-03-11 09:17:49] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-11 09:17:49] [INFO ] Invariant cache hit.
[2023-03-11 09:17:51] [INFO ] Dead Transitions using invariants and state equation in 1290 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1433 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Built C files in :
/tmp/ltsmin929654320234224585
[2023-03-11 09:17:51] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin929654320234224585
Running compilation step : cd /tmp/ltsmin929654320234224585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin929654320234224585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin929654320234224585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 7 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2023-03-11 09:17:54] [INFO ] Invariant cache hit.
[2023-03-11 09:17:54] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-11 09:17:54] [INFO ] Invariant cache hit.
[2023-03-11 09:17:55] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2023-03-11 09:17:55] [INFO ] Invariant cache hit.
[2023-03-11 09:17:56] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2328 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Built C files in :
/tmp/ltsmin13083541433092315843
[2023-03-11 09:17:56] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13083541433092315843
Running compilation step : cd /tmp/ltsmin13083541433092315843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13083541433092315843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13083541433092315843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 09:17:59] [INFO ] Flatten gal took : 60 ms
[2023-03-11 09:18:00] [INFO ] Flatten gal took : 84 ms
[2023-03-11 09:18:00] [INFO ] Time to serialize gal into /tmp/LTL17879621946890883542.gal : 14 ms
[2023-03-11 09:18:00] [INFO ] Time to serialize properties into /tmp/LTL1482309516850668029.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17879621946890883542.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9505134621105890343.hoa' '-atoms' '/tmp/LTL1482309516850668029.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1482309516850668029.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9505134621105890343.hoa
Detected timeout of ITS tools.
[2023-03-11 09:18:15] [INFO ] Flatten gal took : 58 ms
[2023-03-11 09:18:15] [INFO ] Flatten gal took : 58 ms
[2023-03-11 09:18:15] [INFO ] Time to serialize gal into /tmp/LTL15475788999387184560.gal : 14 ms
[2023-03-11 09:18:15] [INFO ] Time to serialize properties into /tmp/LTL11506153515768890184.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15475788999387184560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11506153515768890184.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(("(((((((TrainState_1_2_5==1)||(TrainState_8_4_12==1))||((TrainState_4_4_13==1)||(TrainState_6_3_7==1)))||(((TrainState_5_4_11==1...45461
Formula 0 simplified : X(!"(((((((TrainState_1_2_5==1)||(TrainState_8_4_12==1))||((TrainState_4_4_13==1)||(TrainState_6_3_7==1)))||(((TrainState_5_4_11==1)...45446
Detected timeout of ITS tools.
[2023-03-11 09:18:30] [INFO ] Flatten gal took : 116 ms
[2023-03-11 09:18:30] [INFO ] Applying decomposition
[2023-03-11 09:18:30] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17365124169850071561.txt' '-o' '/tmp/graph17365124169850071561.bin' '-w' '/tmp/graph17365124169850071561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17365124169850071561.bin' '-l' '-1' '-v' '-w' '/tmp/graph17365124169850071561.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:18:31] [INFO ] Decomposing Gal with order
[2023-03-11 09:18:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:18:31] [INFO ] Removed a total of 175 redundant transitions.
[2023-03-11 09:18:31] [INFO ] Flatten gal took : 214 ms
[2023-03-11 09:18:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2023-03-11 09:18:31] [INFO ] Time to serialize gal into /tmp/LTL4802843847216140065.gal : 21 ms
[2023-03-11 09:18:31] [INFO ] Time to serialize properties into /tmp/LTL471280976729213541.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4802843847216140065.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL471280976729213541.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(("(((((((i3.i0.u20.TrainState_1_2_5==1)||(i9.i8.u131.TrainState_8_4_12==1))||((i1.i2.u162.TrainState_4_4_13==1)||(i5.i1.u36.Train...63943
Formula 0 simplified : X(!"(((((((i3.i0.u20.TrainState_1_2_5==1)||(i9.i8.u131.TrainState_8_4_12==1))||((i1.i2.u162.TrainState_4_4_13==1)||(i5.i1.u36.TrainS...63928
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
80 unique states visited
0 strongly connected components in search stack
84 transitions explored
42 items max in DFS search stack
707 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.24915,236216,1,0,351766,7851,18574,1.11774e+06,1699,16003,610530
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-010-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-010-LTLFireability-04 finished in 104349 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-11 09:18:41] [INFO ] Invariant cache hit.
[2023-03-11 09:18:41] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-11 09:18:41] [INFO ] Invariant cache hit.
[2023-03-11 09:18:42] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2023-03-11 09:18:42] [INFO ] Invariant cache hit.
[2023-03-11 09:18:43] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2627 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Stuttering acceptance computed with spot in 139 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 2806 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 106 ms. Remains 1000 /1320 variables (removed 320) and now considering 1700/2020 (removed 320) transitions.
// Phase 1: matrix 1700 rows 1000 cols
[2023-03-11 09:18:43] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-11 09:18:44] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-11 09:18:44] [INFO ] Invariant cache hit.
[2023-03-11 09:18:44] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2023-03-11 09:18:44] [INFO ] Invariant cache hit.
[2023-03-11 09:18:45] [INFO ] Dead Transitions using invariants and state equation in 744 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 1603 ms. Remains : 1000/1320 places, 1700/2020 transitions.
Stuttering acceptance computed with spot in 233 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 2049 ms.
Product exploration explored 100000 steps with 0 reset in 2074 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 418 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 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT 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 519 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 212 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-11 09:18:51] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
[2023-03-11 09:19:07] [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 6 ms. Remains 1000 /1000 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-11 09:19:22] [INFO ] Invariant cache hit.
[2023-03-11 09:19:22] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-11 09:19:22] [INFO ] Invariant cache hit.
[2023-03-11 09:19:23] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2023-03-11 09:19:23] [INFO ] Invariant cache hit.
[2023-03-11 09:19:24] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1647 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 464 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 237 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 30 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=15 )
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 484 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 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-11 09:19:26] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
[2023-03-11 09:19:42] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2076 ms.
Product exploration explored 100000 steps with 0 reset in 2137 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 142 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 1 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 0 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 0 ms
Applied a total of 240 rules in 84 ms. Remains 930 /1000 variables (removed 70) and now considering 1620/1700 (removed 80) transitions.
[2023-03-11 09:20:02] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1620 rows 930 cols
[2023-03-11 09:20:02] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-11 09:20:03] [INFO ] Dead Transitions using invariants and state equation in 667 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 815 ms. Remains : 930/1000 places, 1620/1700 transitions.
Built C files in :
/tmp/ltsmin3851818489278899728
[2023-03-11 09:20:03] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3851818489278899728
Running compilation step : cd /tmp/ltsmin3851818489278899728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2936 ms.
Running link step : cd /tmp/ltsmin3851818489278899728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin3851818489278899728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased780747646010288401.hoa' '--buchi-type=spotba'
LTSmin run took 2035 ms.
FORMULA BART-PT-010-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-010-LTLFireability-06 finished in 84422 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 55 ms. Remains 1290 /1320 variables (removed 30) and now considering 1990/2020 (removed 30) transitions.
// Phase 1: matrix 1990 rows 1290 cols
[2023-03-11 09:20:08] [INFO ] Computed 10 place invariants in 68 ms
[2023-03-11 09:20:08] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-11 09:20:08] [INFO ] Invariant cache hit.
[2023-03-11 09:20:09] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2023-03-11 09:20:09] [INFO ] Invariant cache hit.
[2023-03-11 09:20:10] [INFO ] Dead Transitions using invariants and state equation in 951 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 2033 ms. Remains : 1290/1320 places, 1990/2020 transitions.
Stuttering acceptance computed with spot in 97 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 1999 ms.
Product exploration explored 100000 steps with 50000 reset in 2130 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 157 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 6511 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 15 ms. Remains 2 /1320 variables (removed 1318) and now considering 3/2020 (removed 2017) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-11 09:20:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 09:20:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 09:20:14] [INFO ] Invariant cache hit.
[2023-03-11 09:20:14] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-11 09:20:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:20:14] [INFO ] Invariant cache hit.
[2023-03-11 09:20:14] [INFO ] Dead Transitions using invariants and state equation in 29 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 165 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 235 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 239 ms. Remains 494 /1320 variables (removed 826) and now considering 1194/2020 (removed 826) transitions.
// Phase 1: matrix 1194 rows 494 cols
[2023-03-11 09:20:15] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-11 09:20:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-11 09:20:15] [INFO ] Invariant cache hit.
[2023-03-11 09:20:15] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2023-03-11 09:20:15] [INFO ] Invariant cache hit.
[2023-03-11 09:20:16] [INFO ] Dead Transitions using invariants and state equation in 500 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 1281 ms. Remains : 494/1320 places, 1194/2020 transitions.
Stuttering acceptance computed with spot in 247 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 1376 ms.
Product exploration explored 100000 steps with 33333 reset in 1219 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 131 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 4310 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 169 ms. Remains 492 /1320 variables (removed 828) and now considering 1192/2020 (removed 828) transitions.
// Phase 1: matrix 1192 rows 492 cols
[2023-03-11 09:20:19] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-11 09:20:19] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-11 09:20:19] [INFO ] Invariant cache hit.
[2023-03-11 09:20:19] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2023-03-11 09:20:20] [INFO ] Invariant cache hit.
[2023-03-11 09:20:20] [INFO ] Dead Transitions using invariants and state equation in 507 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 1237 ms. Remains : 492/1320 places, 1192/2020 transitions.
Stuttering acceptance computed with spot in 378 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 14452 reset in 1501 ms.
Product exploration explored 100000 steps with 14467 reset in 1293 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 560 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 356 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 9685 steps, including 2 resets, run visited all 4 properties in 45 ms. (steps per millisecond=215 )
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 768 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 428 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 402 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
[2023-03-11 09:20:26] [INFO ] Invariant cache hit.
[2023-03-11 09:20:26] [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 698 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 8378 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 1 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 1 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 43 ms. Remains 6 /1320 variables (removed 1314) and now considering 7/2020 (removed 2013) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-11 09:20:27] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 09:20:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-11 09:20:27] [INFO ] Invariant cache hit.
[2023-03-11 09:20:27] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-11 09:20:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 09:20:27] [INFO ] Invariant cache hit.
[2023-03-11 09:20:27] [INFO ] Dead Transitions using invariants and state equation in 33 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 181 ms. Remains : 6/1320 places, 7/2020 transitions.
Stuttering acceptance computed with spot in 390 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 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 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 23 ms. Remains 2 /1320 variables (removed 1318) and now considering 3/2020 (removed 2017) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-11 09:20:28] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 09:20:28] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 09:20:28] [INFO ] Invariant cache hit.
[2023-03-11 09:20:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-11 09:20:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:20:28] [INFO ] Invariant cache hit.
[2023-03-11 09:20:28] [INFO ] Dead Transitions using invariants and state equation in 20 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 126 ms. Remains : 2/1320 places, 3/2020 transitions.
Stuttering acceptance computed with spot in 50 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 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-12 finished in 195 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 227 ms. Remains 501 /1320 variables (removed 819) and now considering 1201/2020 (removed 819) transitions.
// Phase 1: matrix 1201 rows 501 cols
[2023-03-11 09:20:28] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-11 09:20:28] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-11 09:20:28] [INFO ] Invariant cache hit.
[2023-03-11 09:20:29] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2023-03-11 09:20:29] [INFO ] Invariant cache hit.
[2023-03-11 09:20:29] [INFO ] Dead Transitions using invariants and state equation in 525 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 1525 ms. Remains : 501/1320 places, 1201/2020 transitions.
Stuttering acceptance computed with spot in 380 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 15347 reset in 1465 ms.
Product exploration explored 100000 steps with 15388 reset in 1354 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 244 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 564 ms :[p1, p1, p1, p1, (NOT p1), p1, (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Finished random walk after 162 steps, including 0 resets, run visited all 6 properties in 7 ms. (steps per millisecond=23 )
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 396 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 470 ms :[p1, p1, p1, p1, (NOT p1), p1, (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 587 ms :[p1, p1, p1, p1, (NOT p1), p1, (AND (NOT p0) (NOT p1)), true, (NOT p0)]
[2023-03-11 09:20:35] [INFO ] Invariant cache hit.
[2023-03-11 09:20:35] [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 317 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 7831 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 203 ms. Remains 492 /1320 variables (removed 828) and now considering 1192/2020 (removed 828) transitions.
// Phase 1: matrix 1192 rows 492 cols
[2023-03-11 09:20:36] [INFO ] Computed 10 place invariants in 9 ms
[2023-03-11 09:20:36] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-11 09:20:36] [INFO ] Invariant cache hit.
[2023-03-11 09:20:37] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-11 09:20:37] [INFO ] Invariant cache hit.
[2023-03-11 09:20:37] [INFO ] Dead Transitions using invariants and state equation in 524 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 1328 ms. Remains : 492/1320 places, 1192/2020 transitions.
Stuttering acceptance computed with spot in 141 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 0 ms.
FORMULA BART-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-15 finished in 1500 ms.
All properties solved by simple procedures.
Total runtime 239706 ms.

BK_STOP 1678526438343

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is 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 r005-oct2-167813593600772"
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 ;