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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 9.2K Feb 26 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 02:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 02:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 357K 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 HirschbergSinclair-PT-30-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678548293944

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-30
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 15:24:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 15:24:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:24:57] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2023-03-11 15:24:57] [INFO ] Transformed 670 places.
[2023-03-11 15:24:57] [INFO ] Transformed 605 transitions.
[2023-03-11 15:24:57] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 375 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-30-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 605/605 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 640 transition count 605
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 53 place count 617 transition count 582
Iterating global reduction 1 with 23 rules applied. Total rules applied 76 place count 617 transition count 582
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 97 place count 596 transition count 561
Iterating global reduction 1 with 21 rules applied. Total rules applied 118 place count 596 transition count 561
Applied a total of 118 rules in 211 ms. Remains 596 /670 variables (removed 74) and now considering 561/605 (removed 44) transitions.
// Phase 1: matrix 561 rows 596 cols
[2023-03-11 15:24:57] [INFO ] Computed 35 place invariants in 36 ms
[2023-03-11 15:24:58] [INFO ] Implicit Places using invariants in 999 ms returned []
[2023-03-11 15:24:58] [INFO ] Invariant cache hit.
[2023-03-11 15:25:01] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 3462 ms to find 0 implicit places.
[2023-03-11 15:25:01] [INFO ] Invariant cache hit.
[2023-03-11 15:25:01] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/670 places, 561/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4515 ms. Remains : 596/670 places, 561/605 transitions.
Support contains 50 out of 596 places after structural reductions.
[2023-03-11 15:25:02] [INFO ] Flatten gal took : 167 ms
[2023-03-11 15:25:02] [INFO ] Flatten gal took : 94 ms
[2023-03-11 15:25:02] [INFO ] Input system was already deterministic with 561 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 31) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 15:25:03] [INFO ] Invariant cache hit.
[2023-03-11 15:25:03] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 107 ms returned sat
[2023-03-11 15:25:04] [INFO ] After 939ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 15:25:04] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 140 ms returned sat
[2023-03-11 15:25:05] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 15:25:05] [INFO ] After 719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-11 15:25:05] [INFO ] After 1219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 9 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 561/561 transitions.
Graph (complete) has 1122 edges and 596 vertex of which 583 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.3 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 228 rules applied. Total rules applied 229 place count 583 transition count 333
Reduce places removed 215 places and 0 transitions.
Graph (complete) has 635 edges and 368 vertex of which 317 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 216 rules applied. Total rules applied 445 place count 317 transition count 333
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 496 place count 317 transition count 282
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 501 place count 312 transition count 277
Iterating global reduction 3 with 5 rules applied. Total rules applied 506 place count 312 transition count 277
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 511 place count 307 transition count 272
Iterating global reduction 3 with 5 rules applied. Total rules applied 516 place count 307 transition count 272
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 533 place count 307 transition count 255
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 550 place count 290 transition count 255
Reduce places removed 26 places and 26 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 576 place count 264 transition count 229
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 4 with 79 rules applied. Total rules applied 655 place count 252 transition count 162
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 5 with 67 rules applied. Total rules applied 722 place count 185 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 722 place count 185 transition count 149
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 748 place count 172 transition count 149
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 749 place count 171 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 749 place count 171 transition count 148
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 751 place count 170 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 755 place count 168 transition count 146
Applied a total of 755 rules in 143 ms. Remains 168 /596 variables (removed 428) and now considering 146/561 (removed 415) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 168/596 places, 146/561 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Finished Best-First random walk after 547 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=273 )
FORMULA HirschbergSinclair-PT-30-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-30-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 596 stabilizing places and 561 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 596 transition count 561
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (X(p1)&&F(p2)))))'
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 588 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 588 transition count 553
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 582 transition count 547
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 582 transition count 547
Applied a total of 28 rules in 88 ms. Remains 582 /596 variables (removed 14) and now considering 547/561 (removed 14) transitions.
// Phase 1: matrix 547 rows 582 cols
[2023-03-11 15:25:06] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-11 15:25:07] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-11 15:25:07] [INFO ] Invariant cache hit.
[2023-03-11 15:25:09] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 2504 ms to find 0 implicit places.
[2023-03-11 15:25:09] [INFO ] Invariant cache hit.
[2023-03-11 15:25:09] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 582/596 places, 547/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3367 ms. Remains : 582/596 places, 547/561 transitions.
Stuttering acceptance computed with spot in 491 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s43 1) (GEQ s350 1)), p2:(AND (GEQ s41 1) (GEQ s534 1)), p1:(GEQ s95 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-01 finished in 3968 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))||G(p1)))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Reduce places removed 30 places and 30 transitions.
Drop transitions removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 566 transition count 288
Reduce places removed 243 places and 0 transitions.
Iterating post reduction 1 with 243 rules applied. Total rules applied 486 place count 323 transition count 288
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 495 place count 314 transition count 279
Iterating global reduction 2 with 9 rules applied. Total rules applied 504 place count 314 transition count 279
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 506 place count 314 transition count 277
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 508 place count 312 transition count 277
Applied a total of 508 rules in 67 ms. Remains 312 /596 variables (removed 284) and now considering 277/561 (removed 284) transitions.
// Phase 1: matrix 277 rows 312 cols
[2023-03-11 15:25:10] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-11 15:25:10] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-11 15:25:10] [INFO ] Invariant cache hit.
[2023-03-11 15:25:12] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
[2023-03-11 15:25:12] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-11 15:25:12] [INFO ] Invariant cache hit.
[2023-03-11 15:25:12] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/596 places, 277/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2170 ms. Remains : 312/596 places, 277/561 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s212 1), p0:(GEQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 307 steps with 0 reset in 6 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-02 finished in 2308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 587 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 587 transition count 552
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 580 transition count 545
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 580 transition count 545
Applied a total of 32 rules in 60 ms. Remains 580 /596 variables (removed 16) and now considering 545/561 (removed 16) transitions.
// Phase 1: matrix 545 rows 580 cols
[2023-03-11 15:25:12] [INFO ] Computed 35 place invariants in 7 ms
[2023-03-11 15:25:13] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-11 15:25:13] [INFO ] Invariant cache hit.
[2023-03-11 15:25:15] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 3115 ms to find 0 implicit places.
[2023-03-11 15:25:15] [INFO ] Invariant cache hit.
[2023-03-11 15:25:16] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/596 places, 545/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3812 ms. Remains : 580/596 places, 545/561 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { 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:(GEQ s353 1), p0:(AND (LT s433 1) (GEQ s388 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-04 finished in 4068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0)) U (F(p2)&&p1)))'
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 588 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 588 transition count 553
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 582 transition count 547
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 582 transition count 547
Applied a total of 28 rules in 65 ms. Remains 582 /596 variables (removed 14) and now considering 547/561 (removed 14) transitions.
// Phase 1: matrix 547 rows 582 cols
[2023-03-11 15:25:16] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-11 15:25:17] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-11 15:25:17] [INFO ] Invariant cache hit.
[2023-03-11 15:25:19] [INFO ] Implicit Places using invariants and state equation in 2260 ms returned []
Implicit Place search using SMT with State Equation took 2787 ms to find 0 implicit places.
[2023-03-11 15:25:19] [INFO ] Invariant cache hit.
[2023-03-11 15:25:20] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 582/596 places, 547/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3448 ms. Remains : 582/596 places, 547/561 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s271 1)), p2:(GEQ s155 1), p0:(AND (GEQ s35 1) (GEQ s456 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 505 steps with 0 reset in 6 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-05 finished in 3639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F((p1||X(p2)))&&F(p3))))'
Support contains 6 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 588 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 588 transition count 553
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 582 transition count 547
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 582 transition count 547
Applied a total of 28 rules in 84 ms. Remains 582 /596 variables (removed 14) and now considering 547/561 (removed 14) transitions.
// Phase 1: matrix 547 rows 582 cols
[2023-03-11 15:25:20] [INFO ] Computed 35 place invariants in 6 ms
[2023-03-11 15:25:21] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-11 15:25:21] [INFO ] Invariant cache hit.
[2023-03-11 15:25:23] [INFO ] Implicit Places using invariants and state equation in 2624 ms returned []
Implicit Place search using SMT with State Equation took 3157 ms to find 0 implicit places.
[2023-03-11 15:25:23] [INFO ] Invariant cache hit.
[2023-03-11 15:25:24] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 582/596 places, 547/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3808 ms. Remains : 582/596 places, 547/561 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s396 1), p3:(GEQ s83 1), p0:(AND (GEQ s49 1) (GEQ s356 1)), p2:(AND (GEQ s1 1) (GEQ s221 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 639 reset in 561 ms.
Product exploration explored 100000 steps with 622 reset in 644 ms.
Computed a total of 582 stabilizing places and 547 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 582 transition count 547
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 541 ms. Reduced automaton from 5 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p3)]
Finished random walk after 228 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p3)]
Knowledge based reduction with 9 factoid took 449 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p3)]
[2023-03-11 15:25:27] [INFO ] Invariant cache hit.
[2023-03-11 15:25:28] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 117 ms returned unsat
Proved EG (NOT p3)
[2023-03-11 15:25:28] [INFO ] Invariant cache hit.
[2023-03-11 15:25:28] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 131 ms returned sat
[2023-03-11 15:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 15:25:34] [INFO ] [Real]Absence check using state equation in 5372 ms returned sat
[2023-03-11 15:25:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 15:25:35] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 191 ms returned sat
[2023-03-11 15:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 15:25:39] [INFO ] [Nat]Absence check using state equation in 4231 ms returned sat
[2023-03-11 15:25:39] [INFO ] Computed and/alt/rep : 344/1073/344 causal constraints (skipped 173 transitions) in 59 ms.
[2023-03-11 15:25:43] [INFO ] Added : 104 causal constraints over 21 iterations in 4124 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p3), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 9 factoid took 479 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-30-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-06 finished in 23465 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) U p1)))'
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 587 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 587 transition count 552
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 580 transition count 545
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 580 transition count 545
Applied a total of 32 rules in 91 ms. Remains 580 /596 variables (removed 16) and now considering 545/561 (removed 16) transitions.
// Phase 1: matrix 545 rows 580 cols
[2023-03-11 15:25:44] [INFO ] Computed 35 place invariants in 6 ms
[2023-03-11 15:25:44] [INFO ] Implicit Places using invariants in 830 ms returned []
[2023-03-11 15:25:44] [INFO ] Invariant cache hit.
[2023-03-11 15:25:47] [INFO ] Implicit Places using invariants and state equation in 2766 ms returned []
Implicit Place search using SMT with State Equation took 3635 ms to find 0 implicit places.
[2023-03-11 15:25:47] [INFO ] Invariant cache hit.
[2023-03-11 15:25:48] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/596 places, 545/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4496 ms. Remains : 580/596 places, 545/561 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s390 1) (GEQ s41 1) (GEQ s346 1)), p0:(LT s390 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3636 steps with 8 reset in 15 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-08 finished in 4704 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(F((G(p1)||p0)))))'
Support contains 8 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 588 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 588 transition count 553
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 582 transition count 547
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 582 transition count 547
Applied a total of 28 rules in 55 ms. Remains 582 /596 variables (removed 14) and now considering 547/561 (removed 14) transitions.
// Phase 1: matrix 547 rows 582 cols
[2023-03-11 15:25:48] [INFO ] Computed 35 place invariants in 3 ms
[2023-03-11 15:25:49] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-11 15:25:49] [INFO ] Invariant cache hit.
[2023-03-11 15:25:52] [INFO ] Implicit Places using invariants and state equation in 2801 ms returned []
Implicit Place search using SMT with State Equation took 3281 ms to find 0 implicit places.
[2023-03-11 15:25:52] [INFO ] Invariant cache hit.
[2023-03-11 15:25:52] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 582/596 places, 547/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3997 ms. Remains : 582/596 places, 547/561 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (LT s29 1) (LT s566 1) (GEQ s143 1)), p0:(OR (AND (GEQ s503 1) (GEQ s51 1) (GEQ s166 1)) (AND (GEQ s45 1) (GEQ s446 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 208 reset in 562 ms.
Product exploration explored 100000 steps with 208 reset in 573 ms.
Computed a total of 582 stabilizing places and 547 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 582 transition count 547
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-30-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-09 finished in 5832 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)))'
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 588 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 588 transition count 553
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 582 transition count 547
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 582 transition count 547
Applied a total of 28 rules in 91 ms. Remains 582 /596 variables (removed 14) and now considering 547/561 (removed 14) transitions.
// Phase 1: matrix 547 rows 582 cols
[2023-03-11 15:25:54] [INFO ] Computed 35 place invariants in 6 ms
[2023-03-11 15:25:55] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-03-11 15:25:55] [INFO ] Invariant cache hit.
[2023-03-11 15:25:58] [INFO ] Implicit Places using invariants and state equation in 2731 ms returned []
Implicit Place search using SMT with State Equation took 3418 ms to find 0 implicit places.
[2023-03-11 15:25:58] [INFO ] Invariant cache hit.
[2023-03-11 15:25:58] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 582/596 places, 547/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4019 ms. Remains : 582/596 places, 547/561 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s91 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 175 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-10 finished in 4162 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((G(F(p0)) U !p1)))'
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Reduce places removed 29 places and 29 transitions.
Drop transitions removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 233 place count 567 transition count 299
Reduce places removed 233 places and 0 transitions.
Iterating post reduction 1 with 233 rules applied. Total rules applied 466 place count 334 transition count 299
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 474 place count 326 transition count 291
Iterating global reduction 2 with 8 rules applied. Total rules applied 482 place count 326 transition count 291
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 326 transition count 289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 486 place count 324 transition count 289
Applied a total of 486 rules in 91 ms. Remains 324 /596 variables (removed 272) and now considering 289/561 (removed 272) transitions.
// Phase 1: matrix 289 rows 324 cols
[2023-03-11 15:25:58] [INFO ] Computed 35 place invariants in 3 ms
[2023-03-11 15:25:59] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-11 15:25:59] [INFO ] Invariant cache hit.
[2023-03-11 15:26:00] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
[2023-03-11 15:26:00] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-11 15:26:00] [INFO ] Invariant cache hit.
[2023-03-11 15:26:00] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/596 places, 289/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2301 ms. Remains : 324/596 places, 289/561 transitions.
Stuttering acceptance computed with spot in 166 ms :[p1, (NOT p0), (NOT p0), p1]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s200 1)), p0:(GEQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 319 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-11 finished in 2493 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((X(F((p1&&F(p2))))||p0))))'
Support contains 6 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Reduce places removed 27 places and 27 transitions.
Drop transitions removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 224 rules applied. Total rules applied 224 place count 569 transition count 310
Reduce places removed 224 places and 0 transitions.
Iterating post reduction 1 with 224 rules applied. Total rules applied 448 place count 345 transition count 310
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 455 place count 338 transition count 303
Iterating global reduction 2 with 7 rules applied. Total rules applied 462 place count 338 transition count 303
Applied a total of 462 rules in 65 ms. Remains 338 /596 variables (removed 258) and now considering 303/561 (removed 258) transitions.
// Phase 1: matrix 303 rows 338 cols
[2023-03-11 15:26:01] [INFO ] Computed 35 place invariants in 2 ms
[2023-03-11 15:26:01] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-11 15:26:01] [INFO ] Invariant cache hit.
[2023-03-11 15:26:02] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
[2023-03-11 15:26:02] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-11 15:26:02] [INFO ] Invariant cache hit.
[2023-03-11 15:26:02] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 338/596 places, 303/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1738 ms. Remains : 338/596 places, 303/561 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s60 1)), p2:(AND (GEQ s19 1) (GEQ s192 1) (GEQ s13 1) (GEQ s60 1) (GEQ s25 1) (GEQ s86 1)), p1:(OR (LT s13 1) (LT s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 463 reset in 575 ms.
Product exploration explored 100000 steps with 489 reset in 708 ms.
Computed a total of 338 stabilizing places and 303 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 338 transition count 303
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 12 factoid took 289 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-30-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-12 finished in 3707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G(p1)||(p1&&F(!p2))))))'
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 587 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 587 transition count 552
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 581 transition count 546
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 581 transition count 546
Applied a total of 30 rules in 57 ms. Remains 581 /596 variables (removed 15) and now considering 546/561 (removed 15) transitions.
// Phase 1: matrix 546 rows 581 cols
[2023-03-11 15:26:04] [INFO ] Computed 35 place invariants in 10 ms
[2023-03-11 15:26:05] [INFO ] Implicit Places using invariants in 626 ms returned []
[2023-03-11 15:26:05] [INFO ] Invariant cache hit.
[2023-03-11 15:26:08] [INFO ] Implicit Places using invariants and state equation in 2766 ms returned []
Implicit Place search using SMT with State Equation took 3405 ms to find 0 implicit places.
[2023-03-11 15:26:08] [INFO ] Invariant cache hit.
[2023-03-11 15:26:09] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 581/596 places, 546/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4163 ms. Remains : 581/596 places, 546/561 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (AND p2 (NOT p1)), p2]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s47 1) (LT s150 1)), p1:(LT s538 1), p2:(AND (GEQ s9 1) (GEQ s420 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1071 ms.
Product exploration explored 100000 steps with 50000 reset in 1174 ms.
Computed a total of 581 stabilizing places and 546 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 581 transition count 546
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X p0), (X (NOT (AND p1 p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (F (G p0)), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND p1 p2)))
Knowledge based reduction with 10 factoid took 320 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-30-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-13 finished in 7309 ms.
All properties solved by simple procedures.
Total runtime 75307 ms.
ITS solved all properties within timeout

BK_STOP 1678548373725

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="HirschbergSinclair-PT-30"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is HirschbergSinclair-PT-30, 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 r199-smll-167840346000468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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