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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1020K
-rw-r--r-- 1 mcc users 12K Feb 26 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 02:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 02:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 02:10 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 580K 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-40-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678736377754

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-40
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 19:39:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:39:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:39:41] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2023-03-13 19:39:41] [INFO ] Transformed 1068 places.
[2023-03-13 19:39:41] [INFO ] Transformed 982 transitions.
[2023-03-13 19:39:41] [INFO ] Parsed PT model containing 1068 places and 982 transitions and 2991 arcs in 375 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-40-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 982/982 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1028 transition count 982
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 77 place count 991 transition count 945
Iterating global reduction 1 with 37 rules applied. Total rules applied 114 place count 991 transition count 945
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 150 place count 955 transition count 909
Iterating global reduction 1 with 36 rules applied. Total rules applied 186 place count 955 transition count 909
Applied a total of 186 rules in 667 ms. Remains 955 /1068 variables (removed 113) and now considering 909/982 (removed 73) transitions.
// Phase 1: matrix 909 rows 955 cols
[2023-03-13 19:39:43] [INFO ] Computed 46 place invariants in 53 ms
[2023-03-13 19:39:44] [INFO ] Implicit Places using invariants in 1168 ms returned []
[2023-03-13 19:39:44] [INFO ] Invariant cache hit.
[2023-03-13 19:39:45] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 2366 ms to find 0 implicit places.
[2023-03-13 19:39:45] [INFO ] Invariant cache hit.
[2023-03-13 19:39:46] [INFO ] Dead Transitions using invariants and state equation in 1244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 955/1068 places, 909/982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4287 ms. Remains : 955/1068 places, 909/982 transitions.
Support contains 48 out of 955 places after structural reductions.
[2023-03-13 19:39:47] [INFO ] Flatten gal took : 218 ms
[2023-03-13 19:39:47] [INFO ] Flatten gal took : 119 ms
[2023-03-13 19:39:47] [INFO ] Input system was already deterministic with 909 transitions.
Support contains 45 out of 955 places (down from 48) after GAL structural reductions.
Finished random walk after 974 steps, including 0 resets, run visited all 31 properties in 206 ms. (steps per millisecond=4 )
Computed a total of 955 stabilizing places and 909 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 955 transition count 909
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' '!(F((p0||(F(p1) U (!p1 U G(p0))))))'
Support contains 2 out of 955 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Reduce places removed 38 places and 38 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 917 transition count 481
Reduce places removed 390 places and 0 transitions.
Iterating post reduction 1 with 390 rules applied. Total rules applied 780 place count 527 transition count 481
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 784 place count 523 transition count 477
Iterating global reduction 2 with 4 rules applied. Total rules applied 788 place count 523 transition count 477
Applied a total of 788 rules in 153 ms. Remains 523 /955 variables (removed 432) and now considering 477/909 (removed 432) transitions.
// Phase 1: matrix 477 rows 523 cols
[2023-03-13 19:39:48] [INFO ] Computed 46 place invariants in 6 ms
[2023-03-13 19:39:49] [INFO ] Implicit Places using invariants in 750 ms returned []
[2023-03-13 19:39:49] [INFO ] Invariant cache hit.
[2023-03-13 19:39:52] [INFO ] Implicit Places using invariants and state equation in 2997 ms returned []
Implicit Place search using SMT with State Equation took 3752 ms to find 0 implicit places.
[2023-03-13 19:39:52] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-13 19:39:52] [INFO ] Invariant cache hit.
[2023-03-13 19:39:53] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 523/955 places, 477/909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4994 ms. Remains : 523/955 places, 477/909 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 399 reset in 884 ms.
Product exploration explored 100000 steps with 399 reset in 690 ms.
Computed a total of 523 stabilizing places and 477 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 523 transition count 477
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 274 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=91 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-13 19:39:55] [INFO ] Invariant cache hit.
[2023-03-13 19:39:57] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 476 ms returned sat
[2023-03-13 19:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:40:00] [INFO ] [Real]Absence check using state equation in 3626 ms returned sat
[2023-03-13 19:40:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 19:40:01] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 309 ms returned sat
[2023-03-13 19:40:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 19:40:05] [INFO ] [Nat]Absence check using state equation in 3910 ms returned sat
[2023-03-13 19:40:05] [INFO ] Computed and/alt/rep : 382/391/382 causal constraints (skipped 22 transitions) in 33 ms.
[2023-03-13 19:40:07] [INFO ] Added : 126 causal constraints over 26 iterations in 2362 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 523 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 477/477 transitions.
Applied a total of 0 rules in 52 ms. Remains 523 /523 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2023-03-13 19:40:08] [INFO ] Invariant cache hit.
[2023-03-13 19:40:09] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2023-03-13 19:40:09] [INFO ] Invariant cache hit.
[2023-03-13 19:40:12] [INFO ] Implicit Places using invariants and state equation in 3100 ms returned []
Implicit Place search using SMT with State Equation took 4183 ms to find 0 implicit places.
[2023-03-13 19:40:12] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-13 19:40:12] [INFO ] Invariant cache hit.
[2023-03-13 19:40:12] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5033 ms. Remains : 523/523 places, 477/477 transitions.
Computed a total of 523 stabilizing places and 477 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 523 transition count 477
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Finished random walk after 271 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=54 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 244 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-13 19:40:13] [INFO ] Invariant cache hit.
[2023-03-13 19:40:15] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 651 ms returned sat
[2023-03-13 19:40:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:40:19] [INFO ] [Real]Absence check using state equation in 3804 ms returned sat
[2023-03-13 19:40:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 19:40:19] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 323 ms returned sat
[2023-03-13 19:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 19:40:23] [INFO ] [Nat]Absence check using state equation in 4015 ms returned sat
[2023-03-13 19:40:24] [INFO ] Computed and/alt/rep : 382/391/382 causal constraints (skipped 22 transitions) in 44 ms.
[2023-03-13 19:40:26] [INFO ] Added : 126 causal constraints over 26 iterations in 2583 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 398 reset in 686 ms.
Product exploration explored 100000 steps with 399 reset in 430 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 477/477 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 522 transition count 466
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 512 transition count 466
Applied a total of 20 rules in 55 ms. Remains 512 /523 variables (removed 11) and now considering 466/477 (removed 11) transitions.
// Phase 1: matrix 466 rows 512 cols
[2023-03-13 19:40:27] [INFO ] Computed 46 place invariants in 4 ms
[2023-03-13 19:40:28] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-13 19:40:28] [INFO ] Invariant cache hit.
[2023-03-13 19:40:31] [INFO ] Implicit Places using invariants and state equation in 2498 ms returned []
Implicit Place search using SMT with State Equation took 3203 ms to find 0 implicit places.
[2023-03-13 19:40:31] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-13 19:40:31] [INFO ] Invariant cache hit.
[2023-03-13 19:40:31] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/523 places, 466/477 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4069 ms. Remains : 512/523 places, 466/477 transitions.
Treatment of property HirschbergSinclair-PT-40-LTLFireability-00 finished in 43841 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(p0)&&G(p1)))))'
Support contains 3 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 951 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 948 transition count 902
Applied a total of 14 rules in 199 ms. Remains 948 /955 variables (removed 7) and now considering 902/909 (removed 7) transitions.
// Phase 1: matrix 902 rows 948 cols
[2023-03-13 19:40:32] [INFO ] Computed 46 place invariants in 12 ms
[2023-03-13 19:40:33] [INFO ] Implicit Places using invariants in 807 ms returned []
[2023-03-13 19:40:33] [INFO ] Invariant cache hit.
[2023-03-13 19:40:37] [INFO ] Implicit Places using invariants and state equation in 3972 ms returned []
Implicit Place search using SMT with State Equation took 4782 ms to find 0 implicit places.
[2023-03-13 19:40:37] [INFO ] Invariant cache hit.
[2023-03-13 19:40:38] [INFO ] Dead Transitions using invariants and state equation in 1437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/955 places, 902/909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6425 ms. Remains : 948/955 places, 902/909 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LT s684 1), p0:(OR (LT s15 1) (LT s473 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 665 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-01 finished in 6677 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((X(p1)&&p0))))'
Support contains 3 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 951 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 948 transition count 902
Applied a total of 14 rules in 141 ms. Remains 948 /955 variables (removed 7) and now considering 902/909 (removed 7) transitions.
[2023-03-13 19:40:38] [INFO ] Invariant cache hit.
[2023-03-13 19:40:39] [INFO ] Implicit Places using invariants in 899 ms returned []
[2023-03-13 19:40:39] [INFO ] Invariant cache hit.
[2023-03-13 19:40:43] [INFO ] Implicit Places using invariants and state equation in 3832 ms returned []
Implicit Place search using SMT with State Equation took 4735 ms to find 0 implicit places.
[2023-03-13 19:40:43] [INFO ] Invariant cache hit.
[2023-03-13 19:40:44] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/955 places, 902/909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6016 ms. Remains : 948/955 places, 902/909 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s427 1)), p1:(GEQ s277 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 982 steps with 0 reset in 8 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-03 finished in 6210 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&&G(p1))))'
Support contains 2 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Reduce places removed 40 places and 40 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 915 transition count 461
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 507 transition count 461
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 819 place count 504 transition count 458
Iterating global reduction 2 with 3 rules applied. Total rules applied 822 place count 504 transition count 458
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 823 place count 504 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 824 place count 503 transition count 457
Applied a total of 824 rules in 101 ms. Remains 503 /955 variables (removed 452) and now considering 457/909 (removed 452) transitions.
// Phase 1: matrix 457 rows 503 cols
[2023-03-13 19:40:45] [INFO ] Computed 46 place invariants in 5 ms
[2023-03-13 19:40:46] [INFO ] Implicit Places using invariants in 953 ms returned []
[2023-03-13 19:40:46] [INFO ] Invariant cache hit.
[2023-03-13 19:40:48] [INFO ] Implicit Places using invariants and state equation in 2796 ms returned []
Implicit Place search using SMT with State Equation took 3757 ms to find 0 implicit places.
[2023-03-13 19:40:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 19:40:48] [INFO ] Invariant cache hit.
[2023-03-13 19:40:49] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/955 places, 457/909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4300 ms. Remains : 503/955 places, 457/909 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s86 1), p1:(GEQ s376 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 491 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-04 finished in 4411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)||G(p2)))'
Support contains 5 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 951 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 948 transition count 902
Applied a total of 14 rules in 188 ms. Remains 948 /955 variables (removed 7) and now considering 902/909 (removed 7) transitions.
// Phase 1: matrix 902 rows 948 cols
[2023-03-13 19:40:49] [INFO ] Computed 46 place invariants in 15 ms
[2023-03-13 19:40:50] [INFO ] Implicit Places using invariants in 1102 ms returned []
[2023-03-13 19:40:50] [INFO ] Invariant cache hit.
[2023-03-13 19:40:54] [INFO ] Implicit Places using invariants and state equation in 3923 ms returned []
Implicit Place search using SMT with State Equation took 5035 ms to find 0 implicit places.
[2023-03-13 19:40:54] [INFO ] Invariant cache hit.
[2023-03-13 19:40:55] [INFO ] Dead Transitions using invariants and state equation in 1291 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/955 places, 902/909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6515 ms. Remains : 948/955 places, 902/909 transitions.
Stuttering acceptance computed with spot in 469 ms :[(NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 10}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 10}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 p2), acceptance={} source=4 dest: 7}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 10}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=7 dest: 12}], [{ cond=p1, acceptance={} source=8 dest: 8}, { cond=(NOT p1), acceptance={} source=8 dest: 10}], [{ cond=true, acceptance={} source=9 dest: 0}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 3}, { cond=(AND p1 p2), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 9}], [{ cond=(AND (NOT p1) p2), acceptance={} source=12 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=12 dest: 10}, { cond=(AND p1 p2), acceptance={} source=12 dest: 12}]], initial=11, aps=[p0:(OR (LT s71 1) (LT s416 1)), p2:(GEQ s205 1), p1:(OR (LT s19 1) (LT s639 1) (GEQ s205 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, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1026 ms.
Product exploration explored 100000 steps with 33333 reset in 808 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (AND p1 (NOT p2))), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 19 factoid took 522 ms. Reduced automaton from 13 states, 31 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-05 finished in 9811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(F(p1))))))'
Support contains 2 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 951 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 948 transition count 902
Applied a total of 14 rules in 173 ms. Remains 948 /955 variables (removed 7) and now considering 902/909 (removed 7) transitions.
[2023-03-13 19:40:59] [INFO ] Invariant cache hit.
[2023-03-13 19:41:00] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-13 19:41:00] [INFO ] Invariant cache hit.
[2023-03-13 19:41:03] [INFO ] Implicit Places using invariants and state equation in 3579 ms returned []
Implicit Place search using SMT with State Equation took 4314 ms to find 0 implicit places.
[2023-03-13 19:41:03] [INFO ] Invariant cache hit.
[2023-03-13 19:41:04] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/955 places, 902/909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5699 ms. Remains : 948/955 places, 902/909 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s879 1), p1:(LT s557 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]]
Product exploration explored 100000 steps with 129 reset in 643 ms.
Product exploration explored 100000 steps with 131 reset in 485 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-06 finished in 7667 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' '!(((p0||X(F((!p0||G(p1))))) U (G((p0||X(F((!p0||G(p1))))))||((p0||X(F((!p0||G(p1)))))&&G(p2)))))'
Support contains 4 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 952 transition count 906
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 952 transition count 906
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 950 transition count 904
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 950 transition count 904
Applied a total of 10 rules in 179 ms. Remains 950 /955 variables (removed 5) and now considering 904/909 (removed 5) transitions.
// Phase 1: matrix 904 rows 950 cols
[2023-03-13 19:41:07] [INFO ] Computed 46 place invariants in 11 ms
[2023-03-13 19:41:08] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-13 19:41:08] [INFO ] Invariant cache hit.
[2023-03-13 19:41:11] [INFO ] Implicit Places using invariants and state equation in 3671 ms returned []
Implicit Place search using SMT with State Equation took 4615 ms to find 0 implicit places.
[2023-03-13 19:41:11] [INFO ] Invariant cache hit.
[2023-03-13 19:41:13] [INFO ] Dead Transitions using invariants and state equation in 1409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 950/955 places, 904/909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6204 ms. Remains : 950/955 places, 904/909 transitions.
Stuttering acceptance computed with spot in 220 ms :[false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LT s34 1), p0:(LT s183 1), p1:(AND (GEQ s77 1) (GEQ s910 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 386 reset in 816 ms.
Product exploration explored 100000 steps with 395 reset in 659 ms.
Computed a total of 950 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 950 transition count 904
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 p2) p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (F (G p2)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 14 factoid took 1017 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 19:41:16] [INFO ] Invariant cache hit.
[2023-03-13 19:41:17] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 339 ms returned sat
[2023-03-13 19:41:18] [INFO ] After 1579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:41:18] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 295 ms returned sat
[2023-03-13 19:41:19] [INFO ] After 754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:41:19] [INFO ] After 851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-13 19:41:19] [INFO ] After 1454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (F (G p2)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND (NOT p2) p0))), (F (AND p2 (NOT p0))), (F p2), (F (AND p1 p0)), (F (NOT p0)), (F (AND p2 p0))]
Knowledge based reduction with 14 factoid took 1432 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 904/904 transitions.
Applied a total of 0 rules in 60 ms. Remains 950 /950 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2023-03-13 19:41:21] [INFO ] Invariant cache hit.
[2023-03-13 19:41:22] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2023-03-13 19:41:22] [INFO ] Invariant cache hit.
[2023-03-13 19:41:27] [INFO ] Implicit Places using invariants and state equation in 4203 ms returned []
Implicit Place search using SMT with State Equation took 5324 ms to find 0 implicit places.
[2023-03-13 19:41:27] [INFO ] Invariant cache hit.
[2023-03-13 19:41:28] [INFO ] Dead Transitions using invariants and state equation in 1209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6596 ms. Remains : 950/950 places, 904/904 transitions.
Computed a total of 950 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 950 transition count 904
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 p2) p0 (NOT p1)), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (F (G p2)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 14 factoid took 1190 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :7
Finished Best-First random walk after 8714 steps, including 2 resets, run visited all 1 properties in 32 ms. (steps per millisecond=272 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (F (G p2)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND (NOT p2) p0))), (F (AND p2 (NOT p0))), (F p2), (F (AND p1 p0)), (F (NOT p0)), (F (AND p2 p0))]
Knowledge based reduction with 14 factoid took 1532 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 218 ms :[false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 226 ms :[false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 400 reset in 933 ms.
Stuttering criterion allowed to conclude after 91404 steps with 329 reset in 549 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-07 finished in 27089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 3 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Reduce places removed 39 places and 39 transitions.
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 916 transition count 472
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 1 with 398 rules applied. Total rules applied 796 place count 518 transition count 472
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 800 place count 514 transition count 468
Iterating global reduction 2 with 4 rules applied. Total rules applied 804 place count 514 transition count 468
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 805 place count 514 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 806 place count 513 transition count 467
Applied a total of 806 rules in 62 ms. Remains 513 /955 variables (removed 442) and now considering 467/909 (removed 442) transitions.
// Phase 1: matrix 467 rows 513 cols
[2023-03-13 19:41:34] [INFO ] Computed 46 place invariants in 3 ms
[2023-03-13 19:41:34] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-13 19:41:34] [INFO ] Invariant cache hit.
[2023-03-13 19:41:38] [INFO ] Implicit Places using invariants and state equation in 3104 ms returned []
Implicit Place search using SMT with State Equation took 4001 ms to find 0 implicit places.
[2023-03-13 19:41:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 19:41:38] [INFO ] Invariant cache hit.
[2023-03-13 19:41:38] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/955 places, 467/909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4780 ms. Remains : 513/955 places, 467/909 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s29 1) (GEQ s352 1)), p0:(GEQ s466 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9117 steps with 19 reset in 43 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-08 finished in 4994 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 p1) U X(!p2))))'
Support contains 6 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 951 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 948 transition count 902
Applied a total of 14 rules in 181 ms. Remains 948 /955 variables (removed 7) and now considering 902/909 (removed 7) transitions.
// Phase 1: matrix 902 rows 948 cols
[2023-03-13 19:41:39] [INFO ] Computed 46 place invariants in 10 ms
[2023-03-13 19:41:39] [INFO ] Implicit Places using invariants in 826 ms returned []
[2023-03-13 19:41:39] [INFO ] Invariant cache hit.
[2023-03-13 19:41:44] [INFO ] Implicit Places using invariants and state equation in 4233 ms returned []
Implicit Place search using SMT with State Equation took 5061 ms to find 0 implicit places.
[2023-03-13 19:41:44] [INFO ] Invariant cache hit.
[2023-03-13 19:41:45] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/955 places, 902/909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6247 ms. Remains : 948/955 places, 902/909 transitions.
Stuttering acceptance computed with spot in 423 ms :[p2, p2, p2, p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s65 1) (GEQ s504 1)), p0:(AND (GEQ s75 1) (GEQ s232 1)), p2:(AND (GEQ s53 1) (GEQ s398 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1165 ms.
Product exploration explored 100000 steps with 33333 reset in 900 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p0 p2)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p2)))
Knowledge based reduction with 13 factoid took 333 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-09 finished in 9572 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(X(p0))||F(p1)))))'
Support contains 3 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Reduce places removed 38 places and 38 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 917 transition count 471
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 517 transition count 471
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 804 place count 513 transition count 467
Iterating global reduction 2 with 4 rules applied. Total rules applied 808 place count 513 transition count 467
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 809 place count 513 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 512 transition count 466
Applied a total of 810 rules in 97 ms. Remains 512 /955 variables (removed 443) and now considering 466/909 (removed 443) transitions.
// Phase 1: matrix 466 rows 512 cols
[2023-03-13 19:41:48] [INFO ] Computed 46 place invariants in 5 ms
[2023-03-13 19:41:49] [INFO ] Implicit Places using invariants in 1047 ms returned []
[2023-03-13 19:41:49] [INFO ] Invariant cache hit.
[2023-03-13 19:41:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 19:41:52] [INFO ] Implicit Places using invariants and state equation in 2801 ms returned []
Implicit Place search using SMT with State Equation took 3853 ms to find 0 implicit places.
[2023-03-13 19:41:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 19:41:52] [INFO ] Invariant cache hit.
[2023-03-13 19:41:53] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/955 places, 466/909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4478 ms. Remains : 512/955 places, 466/909 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s32 1), p1:(AND (GEQ s15 1) (GEQ s496 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 203 reset in 502 ms.
Product exploration explored 100000 steps with 203 reset in 434 ms.
Computed a total of 512 stabilizing places and 466 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 512 transition count 466
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 p0) (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-10 finished in 5984 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 U (p1||G(!p0)))))'
Support contains 4 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 952 transition count 906
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 952 transition count 906
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 949 transition count 903
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 949 transition count 903
Applied a total of 12 rules in 143 ms. Remains 949 /955 variables (removed 6) and now considering 903/909 (removed 6) transitions.
// Phase 1: matrix 903 rows 949 cols
[2023-03-13 19:41:54] [INFO ] Computed 46 place invariants in 10 ms
[2023-03-13 19:41:55] [INFO ] Implicit Places using invariants in 867 ms returned []
[2023-03-13 19:41:55] [INFO ] Invariant cache hit.
[2023-03-13 19:41:56] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
[2023-03-13 19:41:56] [INFO ] Invariant cache hit.
[2023-03-13 19:41:57] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 949/955 places, 903/909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3311 ms. Remains : 949/955 places, 903/909 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (AND (GEQ s13 1) (GEQ s106 1))) (NOT (AND (GEQ s3 1) (GEQ s256 1)))), p0:(AND (GEQ s3 1) (GEQ s256 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1438 ms.
Product exploration explored 100000 steps with 50000 reset in 1078 ms.
Computed a total of 949 stabilizing places and 903 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 949 transition count 903
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 (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 8 factoid took 167 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-40-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-11 finished in 6601 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((X(G(p0))&&F(p1))))'
Support contains 2 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Reduce places removed 39 places and 39 transitions.
Drop transitions removed 409 transitions
Trivial Post-agglo rules discarded 409 transitions
Performed 409 trivial Post agglomeration. Transition count delta: 409
Iterating post reduction 0 with 409 rules applied. Total rules applied 409 place count 916 transition count 461
Reduce places removed 409 places and 0 transitions.
Iterating post reduction 1 with 409 rules applied. Total rules applied 818 place count 507 transition count 461
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 821 place count 504 transition count 458
Iterating global reduction 2 with 3 rules applied. Total rules applied 824 place count 504 transition count 458
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 825 place count 504 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 826 place count 503 transition count 457
Applied a total of 826 rules in 160 ms. Remains 503 /955 variables (removed 452) and now considering 457/909 (removed 452) transitions.
// Phase 1: matrix 457 rows 503 cols
[2023-03-13 19:42:01] [INFO ] Computed 46 place invariants in 3 ms
[2023-03-13 19:42:02] [INFO ] Implicit Places using invariants in 988 ms returned []
[2023-03-13 19:42:02] [INFO ] Invariant cache hit.
[2023-03-13 19:42:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 19:42:05] [INFO ] Implicit Places using invariants and state equation in 3231 ms returned []
Implicit Place search using SMT with State Equation took 4222 ms to find 0 implicit places.
[2023-03-13 19:42:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 19:42:05] [INFO ] Invariant cache hit.
[2023-03-13 19:42:06] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/955 places, 457/909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4938 ms. Remains : 503/955 places, 457/909 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s23 1), p0:(GEQ s101 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 491 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-13 finished in 5116 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&&X((F(p1)||(X(p2) U ((p3&&X(p2))||X(G(p2)))))))))'
Support contains 6 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 909/909 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 951 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 948 transition count 902
Applied a total of 14 rules in 176 ms. Remains 948 /955 variables (removed 7) and now considering 902/909 (removed 7) transitions.
// Phase 1: matrix 902 rows 948 cols
[2023-03-13 19:42:06] [INFO ] Computed 46 place invariants in 9 ms
[2023-03-13 19:42:07] [INFO ] Implicit Places using invariants in 919 ms returned []
[2023-03-13 19:42:07] [INFO ] Invariant cache hit.
[2023-03-13 19:42:11] [INFO ] Implicit Places using invariants and state equation in 4242 ms returned []
Implicit Place search using SMT with State Equation took 5163 ms to find 0 implicit places.
[2023-03-13 19:42:11] [INFO ] Invariant cache hit.
[2023-03-13 19:42:12] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/955 places, 902/909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6571 ms. Remains : 948/955 places, 902/909 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s535 1) (AND (GEQ s19 1) (GEQ s469 1))), p1:(OR (LT s47 1) (LT s699 1)), p3:(LT s519 1), p2:(LT s535 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1148 ms.
Product exploration explored 100000 steps with 33333 reset in 907 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 p3 p2), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (F (G p0)), (F (G p1)), (F (G p3)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 10 factoid took 333 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-14 finished in 9638 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||(F(p1) U (!p1 U G(p0))))))'
[2023-03-13 19:42:16] [INFO ] Flatten gal took : 84 ms
[2023-03-13 19:42:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-13 19:42:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 955 places, 909 transitions and 2730 arcs took 16 ms.
Total runtime 154814 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1590/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HirschbergSinclair-PT-40-LTLFireability-00

BK_STOP 1678736538921

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name HirschbergSinclair-PT-40-LTLFireability-00
ltl formula formula --ltl=/tmp/1590/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 955 places, 909 transitions and 2730 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1590/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1590/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.050 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1590/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1590/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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