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-167840347800444.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-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347800444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 9.1K Feb 26 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 02:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 02:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K 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 14K Feb 26 02:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 02:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 02:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K 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 173K 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-15-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678707487184

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-15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 11:38:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 11:38:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:38:10] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-13 11:38:10] [INFO ] Transformed 330 places.
[2023-03-13 11:38:10] [INFO ] Transformed 296 transitions.
[2023-03-13 11:38:10] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-15-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 315 transition count 296
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 23 place count 307 transition count 288
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 307 transition count 288
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 300 transition count 281
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 300 transition count 281
Applied a total of 45 rules in 109 ms. Remains 300 /330 variables (removed 30) and now considering 281/296 (removed 15) transitions.
// Phase 1: matrix 281 rows 300 cols
[2023-03-13 11:38:10] [INFO ] Computed 19 place invariants in 28 ms
[2023-03-13 11:38:11] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-13 11:38:11] [INFO ] Invariant cache hit.
[2023-03-13 11:38:11] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
[2023-03-13 11:38:11] [INFO ] Invariant cache hit.
[2023-03-13 11:38:12] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/330 places, 281/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1645 ms. Remains : 300/330 places, 281/296 transitions.
Support contains 43 out of 300 places after structural reductions.
[2023-03-13 11:38:12] [INFO ] Flatten gal took : 78 ms
[2023-03-13 11:38:12] [INFO ] Flatten gal took : 34 ms
[2023-03-13 11:38:12] [INFO ] Input system was already deterministic with 281 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 32) seen :30
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-13 11:38:13] [INFO ] Invariant cache hit.
[2023-03-13 11:38:13] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 35 ms returned sat
[2023-03-13 11:38:13] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 300 stabilizing places and 281 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 281
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))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 286 transition count 156
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 175 transition count 156
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 230 place count 167 transition count 148
Iterating global reduction 2 with 8 rules applied. Total rules applied 238 place count 167 transition count 148
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 239 place count 167 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 166 transition count 147
Applied a total of 240 rules in 41 ms. Remains 166 /300 variables (removed 134) and now considering 147/281 (removed 134) transitions.
// Phase 1: matrix 147 rows 166 cols
[2023-03-13 11:38:14] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-13 11:38:14] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-13 11:38:14] [INFO ] Invariant cache hit.
[2023-03-13 11:38:14] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-13 11:38:14] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-13 11:38:14] [INFO ] Invariant cache hit.
[2023-03-13 11:38:14] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/300 places, 147/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 666 ms. Remains : 166/300 places, 147/281 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s116 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 910 reset in 442 ms.
Product exploration explored 100000 steps with 911 reset in 318 ms.
Computed a total of 166 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 147
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 168 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 41 ms :[(NOT p0)]
Finished random walk after 107 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=107 )
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 270 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-13 11:38:16] [INFO ] Invariant cache hit.
[2023-03-13 11:38:16] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 26 ms returned sat
[2023-03-13 11:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:38:16] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-13 11:38:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:38:16] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 25 ms returned sat
[2023-03-13 11:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:38:17] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2023-03-13 11:38:17] [INFO ] Computed and/alt/rep : 109/115/109 causal constraints (skipped 11 transitions) in 19 ms.
[2023-03-13 11:38:17] [INFO ] Added : 62 causal constraints over 13 iterations in 384 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 147/147 transitions.
Applied a total of 0 rules in 10 ms. Remains 166 /166 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2023-03-13 11:38:17] [INFO ] Invariant cache hit.
[2023-03-13 11:38:17] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-13 11:38:17] [INFO ] Invariant cache hit.
[2023-03-13 11:38:18] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-13 11:38:18] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-13 11:38:18] [INFO ] Invariant cache hit.
[2023-03-13 11:38:18] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 713 ms. Remains : 166/166 places, 147/147 transitions.
Computed a total of 166 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 147
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 166 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 36 ms :[(NOT p0)]
Finished random walk after 116 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
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 177 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-13 11:38:18] [INFO ] Invariant cache hit.
[2023-03-13 11:38:19] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 25 ms returned sat
[2023-03-13 11:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:38:19] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-13 11:38:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:38:19] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 29 ms returned sat
[2023-03-13 11:38:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:38:19] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-13 11:38:19] [INFO ] Computed and/alt/rep : 109/115/109 causal constraints (skipped 11 transitions) in 22 ms.
[2023-03-13 11:38:20] [INFO ] Added : 62 causal constraints over 13 iterations in 321 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 911 reset in 220 ms.
Product exploration explored 100000 steps with 910 reset in 218 ms.
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 147/147 transitions.
Applied a total of 0 rules in 8 ms. Remains 166 /166 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2023-03-13 11:38:20] [INFO ] Invariant cache hit.
[2023-03-13 11:38:20] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-13 11:38:20] [INFO ] Invariant cache hit.
[2023-03-13 11:38:21] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-13 11:38:21] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-13 11:38:21] [INFO ] Invariant cache hit.
[2023-03-13 11:38:21] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 694 ms. Remains : 166/166 places, 147/147 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-00 finished in 7339 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 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 294 transition count 275
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 294 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 289 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 289 transition count 270
Applied a total of 22 rules in 21 ms. Remains 289 /300 variables (removed 11) and now considering 270/281 (removed 11) transitions.
// Phase 1: matrix 270 rows 289 cols
[2023-03-13 11:38:21] [INFO ] Computed 19 place invariants in 12 ms
[2023-03-13 11:38:21] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-13 11:38:21] [INFO ] Invariant cache hit.
[2023-03-13 11:38:22] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2023-03-13 11:38:22] [INFO ] Invariant cache hit.
[2023-03-13 11:38:22] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/300 places, 270/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1132 ms. Remains : 289/300 places, 270/281 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GEQ s0 1), p0:(OR (AND (LT s239 1) (LT s49 1)) (GEQ s87 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 7 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-01 finished in 1358 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((G(p0) U p1))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 285 transition count 147
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 166 transition count 147
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 246 place count 158 transition count 139
Iterating global reduction 2 with 8 rules applied. Total rules applied 254 place count 158 transition count 139
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 255 place count 158 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 256 place count 157 transition count 138
Applied a total of 256 rules in 25 ms. Remains 157 /300 variables (removed 143) and now considering 138/281 (removed 143) transitions.
// Phase 1: matrix 138 rows 157 cols
[2023-03-13 11:38:22] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:38:22] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-13 11:38:22] [INFO ] Invariant cache hit.
[2023-03-13 11:38:23] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-13 11:38:23] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-13 11:38:23] [INFO ] Invariant cache hit.
[2023-03-13 11:38:23] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/300 places, 138/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 664 ms. Remains : 157/300 places, 138/281 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s101 1), p0:(AND (GEQ s45 1) (GEQ s49 1))], nbAcceptance=2, 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 150 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-02 finished in 809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 292 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 285 transition count 266
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 285 transition count 266
Applied a total of 30 rules in 19 ms. Remains 285 /300 variables (removed 15) and now considering 266/281 (removed 15) transitions.
// Phase 1: matrix 266 rows 285 cols
[2023-03-13 11:38:23] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-13 11:38:23] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-13 11:38:23] [INFO ] Invariant cache hit.
[2023-03-13 11:38:24] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2023-03-13 11:38:24] [INFO ] Invariant cache hit.
[2023-03-13 11:38:24] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/300 places, 266/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1027 ms. Remains : 285/300 places, 266/281 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s113 1), p1:(GEQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 470 reset in 263 ms.
Product exploration explored 100000 steps with 475 reset in 349 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
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 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 163 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 417 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-13 11:38:26] [INFO ] Invariant cache hit.
[2023-03-13 11:38:26] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-13 11:38:26] [INFO ] Invariant cache hit.
[2023-03-13 11:38:27] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2023-03-13 11:38:27] [INFO ] Invariant cache hit.
[2023-03-13 11:38:27] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1081 ms. Remains : 285/285 places, 266/266 transitions.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
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 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 166 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 482 reset in 196 ms.
Product exploration explored 100000 steps with 470 reset in 227 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 285 transition count 266
Deduced a syphon composed of 114 places in 0 ms
Applied a total of 114 rules in 51 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-13 11:38:29] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 266 rows 285 cols
[2023-03-13 11:38:29] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:38:29] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/285 places, 266/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 285/285 places, 266/266 transitions.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Applied a total of 0 rules in 9 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 285 cols
[2023-03-13 11:38:29] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-13 11:38:30] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-13 11:38:30] [INFO ] Invariant cache hit.
[2023-03-13 11:38:30] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2023-03-13 11:38:30] [INFO ] Invariant cache hit.
[2023-03-13 11:38:30] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1026 ms. Remains : 285/285 places, 266/266 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-03 finished in 7450 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)))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 286 transition count 156
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 175 transition count 156
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 230 place count 167 transition count 148
Iterating global reduction 2 with 8 rules applied. Total rules applied 238 place count 167 transition count 148
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 239 place count 167 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 166 transition count 147
Applied a total of 240 rules in 26 ms. Remains 166 /300 variables (removed 134) and now considering 147/281 (removed 134) transitions.
// Phase 1: matrix 147 rows 166 cols
[2023-03-13 11:38:31] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:38:31] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-13 11:38:31] [INFO ] Invariant cache hit.
[2023-03-13 11:38:31] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-13 11:38:31] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 11:38:31] [INFO ] Invariant cache hit.
[2023-03-13 11:38:31] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/300 places, 147/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 660 ms. Remains : 166/300 places, 147/281 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s141 1), p1:(AND (GEQ s13 1) (GEQ s148 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 156 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-04 finished in 767 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||G(p1)))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 292 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 286 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 286 transition count 267
Applied a total of 28 rules in 16 ms. Remains 286 /300 variables (removed 14) and now considering 267/281 (removed 14) transitions.
// Phase 1: matrix 267 rows 286 cols
[2023-03-13 11:38:31] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:38:31] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-13 11:38:31] [INFO ] Invariant cache hit.
[2023-03-13 11:38:32] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2023-03-13 11:38:32] [INFO ] Invariant cache hit.
[2023-03-13 11:38:32] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/300 places, 267/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1089 ms. Remains : 286/300 places, 267/281 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-05 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}]], initial=1, aps=[p1:(OR (LT s11 1) (LT s198 1)), p0:(AND (GEQ s21 1) (GEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4352 reset in 322 ms.
Product exploration explored 100000 steps with 4347 reset in 334 ms.
Computed a total of 286 stabilizing places and 267 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 286 transition count 267
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 (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-05 finished in 2176 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||G(p1)))))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 285 transition count 146
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 165 transition count 146
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 159 transition count 140
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 159 transition count 140
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 253 place count 159 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 254 place count 158 transition count 139
Applied a total of 254 rules in 19 ms. Remains 158 /300 variables (removed 142) and now considering 139/281 (removed 142) transitions.
// Phase 1: matrix 139 rows 158 cols
[2023-03-13 11:38:33] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:38:34] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-13 11:38:34] [INFO ] Invariant cache hit.
[2023-03-13 11:38:34] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2023-03-13 11:38:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 11:38:34] [INFO ] Invariant cache hit.
[2023-03-13 11:38:34] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/300 places, 139/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 691 ms. Remains : 158/300 places, 139/281 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s29 1), p0:(GEQ s43 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 1029 reset in 176 ms.
Product exploration explored 100000 steps with 1044 reset in 199 ms.
Computed a total of 158 stabilizing places and 139 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 158 transition count 139
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)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 256 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-15-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-06 finished in 1487 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(p2))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 294 transition count 275
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 294 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 289 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 289 transition count 270
Applied a total of 22 rules in 15 ms. Remains 289 /300 variables (removed 11) and now considering 270/281 (removed 11) transitions.
// Phase 1: matrix 270 rows 289 cols
[2023-03-13 11:38:35] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:38:35] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-13 11:38:35] [INFO ] Invariant cache hit.
[2023-03-13 11:38:36] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2023-03-13 11:38:36] [INFO ] Invariant cache hit.
[2023-03-13 11:38:36] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/300 places, 270/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1068 ms. Remains : 289/300 places, 270/281 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2), true, (AND (NOT p2) p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s203 1)), p2:(LT s59 1), p0:(GEQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24931 reset in 371 ms.
Entered a terminal (fully accepting) state of product in 99177 steps with 24775 reset in 392 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-07 finished in 2034 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)||F(p2))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 293 transition count 274
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 293 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 287 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 287 transition count 268
Applied a total of 26 rules in 14 ms. Remains 287 /300 variables (removed 13) and now considering 268/281 (removed 13) transitions.
// Phase 1: matrix 268 rows 287 cols
[2023-03-13 11:38:37] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:38:37] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-13 11:38:37] [INFO ] Invariant cache hit.
[2023-03-13 11:38:38] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2023-03-13 11:38:38] [INFO ] Invariant cache hit.
[2023-03-13 11:38:38] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/300 places, 268/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1063 ms. Remains : 287/300 places, 268/281 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s240 1)), p0:(GEQ s73 1), p2:(AND (GEQ s1 1) (GEQ s285 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]]
Product exploration explored 100000 steps with 341 reset in 176 ms.
Product exploration explored 100000 steps with 341 reset in 201 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
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 (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 533 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Finished random walk after 294 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 11 factoid took 438 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
[2023-03-13 11:38:40] [INFO ] Invariant cache hit.
[2023-03-13 11:38:40] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 31 ms returned sat
[2023-03-13 11:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:38:42] [INFO ] [Real]Absence check using state equation in 1723 ms returned sat
[2023-03-13 11:38:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:38:42] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 37 ms returned sat
[2023-03-13 11:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:38:43] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2023-03-13 11:38:43] [INFO ] Computed and/alt/rep : 170/542/170 causal constraints (skipped 83 transitions) in 24 ms.
[2023-03-13 11:38:45] [INFO ] Added : 149 causal constraints over 30 iterations in 2443 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 287 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 : 287/287 places, 268/268 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 273 transition count 149
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 168 transition count 149
Applied a total of 210 rules in 13 ms. Remains 168 /287 variables (removed 119) and now considering 149/268 (removed 119) transitions.
// Phase 1: matrix 149 rows 168 cols
[2023-03-13 11:38:45] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-13 11:38:45] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-13 11:38:45] [INFO ] Invariant cache hit.
[2023-03-13 11:38:46] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2023-03-13 11:38:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 11:38:46] [INFO ] Invariant cache hit.
[2023-03-13 11:38:46] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/287 places, 149/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 707 ms. Remains : 168/287 places, 149/268 transitions.
Computed a total of 168 stabilizing places and 149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 149
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 p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 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 38 ms :[(NOT p2)]
Finished random walk after 168 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=84 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 175 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 37 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
[2023-03-13 11:38:46] [INFO ] Invariant cache hit.
[2023-03-13 11:38:47] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 23 ms returned sat
[2023-03-13 11:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:38:47] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2023-03-13 11:38:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:38:47] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 26 ms returned sat
[2023-03-13 11:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:38:48] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2023-03-13 11:38:48] [INFO ] Computed and/alt/rep : 111/117/111 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-13 11:38:49] [INFO ] Added : 103 causal constraints over 21 iterations in 753 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 39 ms :[(NOT p2)]
Product exploration explored 100000 steps with 621 reset in 160 ms.
Product exploration explored 100000 steps with 621 reset in 187 ms.
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 149/149 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 168 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 166 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 165 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 165 transition count 146
Applied a total of 6 rules in 13 ms. Remains 165 /168 variables (removed 3) and now considering 146/149 (removed 3) transitions.
// Phase 1: matrix 146 rows 165 cols
[2023-03-13 11:38:49] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-13 11:38:49] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-13 11:38:49] [INFO ] Invariant cache hit.
[2023-03-13 11:38:50] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-13 11:38:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 11:38:50] [INFO ] Invariant cache hit.
[2023-03-13 11:38:50] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/168 places, 146/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 657 ms. Remains : 165/168 places, 146/149 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-09 finished in 13033 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((F(X(F(G((G(p1) U p1)))))&&X(p1)&&p0))))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 292 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 285 transition count 266
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 285 transition count 266
Applied a total of 30 rules in 13 ms. Remains 285 /300 variables (removed 15) and now considering 266/281 (removed 15) transitions.
// Phase 1: matrix 266 rows 285 cols
[2023-03-13 11:38:50] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-13 11:38:50] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-13 11:38:50] [INFO ] Invariant cache hit.
[2023-03-13 11:38:51] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-13 11:38:51] [INFO ] Invariant cache hit.
[2023-03-13 11:38:51] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/300 places, 266/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1056 ms. Remains : 285/300 places, 266/281 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-11 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s21 1) (GEQ s74 1)), p1:(AND (GEQ s21 1) (GEQ s74 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-11 finished in 1216 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 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 293 transition count 274
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 293 transition count 274
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 286 transition count 267
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 286 transition count 267
Applied a total of 28 rules in 17 ms. Remains 286 /300 variables (removed 14) and now considering 267/281 (removed 14) transitions.
// Phase 1: matrix 267 rows 286 cols
[2023-03-13 11:38:51] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:38:51] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-13 11:38:51] [INFO ] Invariant cache hit.
[2023-03-13 11:38:52] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2023-03-13 11:38:52] [INFO ] Invariant cache hit.
[2023-03-13 11:38:52] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/300 places, 267/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 286/300 places, 267/281 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-12 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:(OR (LT s23 1) (LT s72 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 8 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-12 finished in 1129 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||F(p1)))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 293 transition count 274
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 293 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 287 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 287 transition count 268
Applied a total of 26 rules in 15 ms. Remains 287 /300 variables (removed 13) and now considering 268/281 (removed 13) transitions.
// Phase 1: matrix 268 rows 287 cols
[2023-03-13 11:38:52] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:38:52] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-13 11:38:52] [INFO ] Invariant cache hit.
[2023-03-13 11:38:53] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-13 11:38:53] [INFO ] Invariant cache hit.
[2023-03-13 11:38:53] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/300 places, 268/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1024 ms. Remains : 287/300 places, 268/281 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s13 1) (LT s228 1)), p0:(LT s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 360 ms.
Product exploration explored 100000 steps with 33333 reset in 390 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
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 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-13 finished in 2121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(p1 U (p2||G(p1))))))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 292 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 285 transition count 266
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 285 transition count 266
Applied a total of 30 rules in 15 ms. Remains 285 /300 variables (removed 15) and now considering 266/281 (removed 15) transitions.
// Phase 1: matrix 266 rows 285 cols
[2023-03-13 11:38:54] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-13 11:38:55] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-13 11:38:55] [INFO ] Invariant cache hit.
[2023-03-13 11:38:55] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-13 11:38:55] [INFO ] Invariant cache hit.
[2023-03-13 11:38:55] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/300 places, 266/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1022 ms. Remains : 285/300 places, 266/281 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s23 1) (LT s120 1)), p2:(AND (GEQ s51 1) (LT s149 1)), p1:(LT s149 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 138 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-14 finished in 1189 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((F(p1)&&p0))||X((F(p2) U p3))))'
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 292 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 285 transition count 266
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 285 transition count 266
Applied a total of 30 rules in 15 ms. Remains 285 /300 variables (removed 15) and now considering 266/281 (removed 15) transitions.
[2023-03-13 11:38:56] [INFO ] Invariant cache hit.
[2023-03-13 11:38:56] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-13 11:38:56] [INFO ] Invariant cache hit.
[2023-03-13 11:38:56] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-13 11:38:56] [INFO ] Invariant cache hit.
[2023-03-13 11:38:57] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/300 places, 266/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1057 ms. Remains : 285/300 places, 266/281 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s224 1) (GEQ s19 1) (GEQ s70 1)), p1:(AND (GEQ s19 1) (GEQ s70 1)), p3:(AND (GEQ s17 1) (GEQ s222 1)), p2:(OR (AND (GEQ s15 1) (G...], 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 413 reset in 239 ms.
Product exploration explored 100000 steps with 413 reset in 245 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
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) (NOT p3) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p3) (NOT p2))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (AND (NOT p1) (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 1073 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 11:38:59] [INFO ] Invariant cache hit.
[2023-03-13 11:38:59] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p3) (NOT p2))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (AND (NOT p1) (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (G (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (G (NOT (AND p0 (NOT p3) (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 20 factoid took 1221 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
[2023-03-13 11:39:01] [INFO ] Invariant cache hit.
[2023-03-13 11:39:01] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 32 ms returned sat
[2023-03-13 11:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:39:02] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2023-03-13 11:39:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:39:02] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 38 ms returned sat
[2023-03-13 11:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:39:03] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2023-03-13 11:39:03] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 21 ms.
[2023-03-13 11:39:04] [INFO ] Added : 154 causal constraints over 31 iterations in 1196 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
[2023-03-13 11:39:04] [INFO ] Invariant cache hit.
[2023-03-13 11:39:04] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 38 ms returned sat
[2023-03-13 11:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:39:05] [INFO ] [Real]Absence check using state equation in 1010 ms returned sat
[2023-03-13 11:39:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:39:05] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 32 ms returned sat
[2023-03-13 11:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:39:06] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2023-03-13 11:39:06] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 24 ms.
[2023-03-13 11:39:07] [INFO ] Added : 143 causal constraints over 29 iterations in 1181 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-13 11:39:07] [INFO ] Invariant cache hit.
[2023-03-13 11:39:07] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-13 11:39:07] [INFO ] Invariant cache hit.
[2023-03-13 11:39:08] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2023-03-13 11:39:08] [INFO ] Invariant cache hit.
[2023-03-13 11:39:08] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1010 ms. Remains : 285/285 places, 266/266 transitions.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
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 p3) (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 408 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Finished random walk after 244 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3))))]
Knowledge based reduction with 10 factoid took 483 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
[2023-03-13 11:39:10] [INFO ] Invariant cache hit.
[2023-03-13 11:39:10] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 33 ms returned sat
[2023-03-13 11:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:39:11] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2023-03-13 11:39:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:39:11] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 37 ms returned sat
[2023-03-13 11:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:39:11] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2023-03-13 11:39:12] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 22 ms.
[2023-03-13 11:39:13] [INFO ] Added : 154 causal constraints over 31 iterations in 1185 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
[2023-03-13 11:39:13] [INFO ] Invariant cache hit.
[2023-03-13 11:39:13] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 36 ms returned sat
[2023-03-13 11:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:39:14] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2023-03-13 11:39:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:39:14] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 33 ms returned sat
[2023-03-13 11:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:39:15] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2023-03-13 11:39:15] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 23 ms.
[2023-03-13 11:39:16] [INFO ] Added : 143 causal constraints over 29 iterations in 1162 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 412 reset in 212 ms.
Product exploration explored 100000 steps with 413 reset in 234 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 285 transition count 266
Deduced a syphon composed of 97 places in 0 ms
Applied a total of 97 rules in 17 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-13 11:39:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 266 rows 285 cols
[2023-03-13 11:39:17] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:39:17] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/285 places, 266/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 285/285 places, 266/266 transitions.
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 285 cols
[2023-03-13 11:39:17] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-13 11:39:17] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-13 11:39:17] [INFO ] Invariant cache hit.
[2023-03-13 11:39:18] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-13 11:39:18] [INFO ] Invariant cache hit.
[2023-03-13 11:39:18] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1041 ms. Remains : 285/285 places, 266/266 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-15 finished in 22516 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-15-LTLFireability-03
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 285 transition count 146
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 165 transition count 146
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 248 place count 157 transition count 138
Iterating global reduction 2 with 8 rules applied. Total rules applied 256 place count 157 transition count 138
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 257 place count 157 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 156 transition count 137
Applied a total of 258 rules in 12 ms. Remains 156 /300 variables (removed 144) and now considering 137/281 (removed 144) transitions.
// Phase 1: matrix 137 rows 156 cols
[2023-03-13 11:39:18] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-13 11:39:19] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-13 11:39:19] [INFO ] Invariant cache hit.
[2023-03-13 11:39:19] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-13 11:39:19] [INFO ] Invariant cache hit.
[2023-03-13 11:39:19] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 156/300 places, 137/281 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 644 ms. Remains : 156/300 places, 137/281 transitions.
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s59 1), p1:(GEQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 975 reset in 169 ms.
Product exploration explored 100000 steps with 976 reset in 195 ms.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
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 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 347 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 89 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-13 11:39:21] [INFO ] Invariant cache hit.
[2023-03-13 11:39:21] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-13 11:39:21] [INFO ] Invariant cache hit.
[2023-03-13 11:39:21] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-13 11:39:21] [INFO ] Invariant cache hit.
[2023-03-13 11:39:21] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 156/156 places, 137/137 transitions.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
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 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 86 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 973 reset in 171 ms.
Product exploration explored 100000 steps with 976 reset in 194 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-13 11:39:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 11:39:23] [INFO ] Invariant cache hit.
[2023-03-13 11:39:23] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 156/156 places, 137/137 transitions.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-13 11:39:23] [INFO ] Invariant cache hit.
[2023-03-13 11:39:23] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-13 11:39:23] [INFO ] Invariant cache hit.
[2023-03-13 11:39:24] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-13 11:39:24] [INFO ] Invariant cache hit.
[2023-03-13 11:39:24] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 156/156 places, 137/137 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-03 finished in 5525 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)||F(p2))))'
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((F(p1)&&p0))||X((F(p2) U p3))))'
[2023-03-13 11:39:24] [INFO ] Flatten gal took : 23 ms
[2023-03-13 11:39:24] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-13 11:39:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 300 places, 281 transitions and 840 arcs took 5 ms.
Total runtime 74513 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2129/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2129/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2129/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2129/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HirschbergSinclair-PT-15-LTLFireability-00
Could not compute solution for formula : HirschbergSinclair-PT-15-LTLFireability-03
Could not compute solution for formula : HirschbergSinclair-PT-15-LTLFireability-09
Could not compute solution for formula : HirschbergSinclair-PT-15-LTLFireability-15

BK_STOP 1678707566570

--------------------
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-15-LTLFireability-00
ltl formula formula --ltl=/tmp/2129/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 300 places, 281 transitions and 840 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2129/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2129/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2129/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2129/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
double free or corruption (fasttop)
ltl formula name HirschbergSinclair-PT-15-LTLFireability-03
ltl formula formula --ltl=/tmp/2129/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 300 places, 281 transitions and 840 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2129/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2129/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2129/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2129/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name HirschbergSinclair-PT-15-LTLFireability-09
ltl formula formula --ltl=/tmp/2129/ltl_2_
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 300 places, 281 transitions and 840 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2129/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2129/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2129/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2129/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name HirschbergSinclair-PT-15-LTLFireability-15
ltl formula formula --ltl=/tmp/2129/ltl_3_
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
pnml2lts-mc( 0/ 4): Petri net has 300 places, 281 transitions and 840 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2129/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2129/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2129/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2129/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-15"
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-15, 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-167840347800444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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