Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 12K Feb 26 02:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 02:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 02:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 02:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:14 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 157K 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-05-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678538322079

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 12:38:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 12:38:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:38:45] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2023-03-11 12:38:45] [INFO ] Transformed 124 places.
[2023-03-11 12:38:45] [INFO ] Transformed 111 transitions.
[2023-03-11 12:38:45] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 118 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 118 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 116 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 116 transition count 107
Applied a total of 12 rules in 44 ms. Remains 116 /124 variables (removed 8) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 116 cols
[2023-03-11 12:38:45] [INFO ] Computed 9 place invariants in 22 ms
[2023-03-11 12:38:46] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-11 12:38:46] [INFO ] Invariant cache hit.
[2023-03-11 12:38:46] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-11 12:38:46] [INFO ] Invariant cache hit.
[2023-03-11 12:38:46] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/124 places, 107/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 994 ms. Remains : 116/124 places, 107/111 transitions.
Support contains 32 out of 116 places after structural reductions.
[2023-03-11 12:38:47] [INFO ] Flatten gal took : 69 ms
[2023-03-11 12:38:47] [INFO ] Flatten gal took : 30 ms
[2023-03-11 12:38:47] [INFO ] Input system was already deterministic with 107 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 727 ms. (steps per millisecond=13 ) properties (out of 24) seen :15
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-11 12:38:48] [INFO ] Invariant cache hit.
[2023-03-11 12:38:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 12:38:48] [INFO ] [Real]Absence check using 1 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-11 12:38:48] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 116 stabilizing places and 107 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 107
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&&X(p1))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 112 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 109 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 109 transition count 101
Applied a total of 13 rules in 47 ms. Remains 109 /116 variables (removed 7) and now considering 101/107 (removed 6) transitions.
// Phase 1: matrix 101 rows 109 cols
[2023-03-11 12:38:49] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-11 12:38:49] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-11 12:38:49] [INFO ] Invariant cache hit.
[2023-03-11 12:38:49] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2023-03-11 12:38:49] [INFO ] Invariant cache hit.
[2023-03-11 12:38:49] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 644 ms. Remains : 109/116 places, 101/107 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-02 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=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s91), p1:(LEQ 1 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 7 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-02 finished in 1104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 107/107 transitions.
Graph (complete) has 218 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 111 transition count 57
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 65 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 64 transition count 56
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 61 transition count 53
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 61 transition count 53
Applied a total of 101 rules in 37 ms. Remains 61 /116 variables (removed 55) and now considering 53/107 (removed 54) transitions.
// Phase 1: matrix 53 rows 61 cols
[2023-03-11 12:38:50] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 12:38:50] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-11 12:38:50] [INFO ] Invariant cache hit.
[2023-03-11 12:38:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 12:38:50] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-11 12:38:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 12:38:50] [INFO ] Invariant cache hit.
[2023-03-11 12:38:50] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/116 places, 53/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 61/116 places, 53/107 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s3 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1722 reset in 501 ms.
Product exploration explored 100000 steps with 1721 reset in 365 ms.
Computed a total of 61 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 53
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), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 224 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-03 finished in 1759 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 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 113 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 111 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 111 transition count 103
Applied a total of 9 rules in 19 ms. Remains 111 /116 variables (removed 5) and now considering 103/107 (removed 4) transitions.
// Phase 1: matrix 103 rows 111 cols
[2023-03-11 12:38:52] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 12:38:52] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-11 12:38:52] [INFO ] Invariant cache hit.
[2023-03-11 12:38:52] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-11 12:38:52] [INFO ] Invariant cache hit.
[2023-03-11 12:38:52] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/116 places, 103/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 111/116 places, 103/107 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(LEQ 1 s105), p0:(GT s90 s43)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-05 finished in 834 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 6 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 112 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 109 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 109 transition count 101
Applied a total of 13 rules in 14 ms. Remains 109 /116 variables (removed 7) and now considering 101/107 (removed 6) transitions.
// Phase 1: matrix 101 rows 109 cols
[2023-03-11 12:38:52] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 12:38:52] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-11 12:38:52] [INFO ] Invariant cache hit.
[2023-03-11 12:38:53] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-11 12:38:53] [INFO ] Invariant cache hit.
[2023-03-11 12:38:53] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 109/116 places, 101/107 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (LEQ s4 s90) (LEQ s51 s64)), p0:(LEQ s56 s40)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-09 finished in 701 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 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 112 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 109 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 109 transition count 101
Applied a total of 13 rules in 12 ms. Remains 109 /116 variables (removed 7) and now considering 101/107 (removed 6) transitions.
[2023-03-11 12:38:53] [INFO ] Invariant cache hit.
[2023-03-11 12:38:53] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-11 12:38:53] [INFO ] Invariant cache hit.
[2023-03-11 12:38:53] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-11 12:38:53] [INFO ] Invariant cache hit.
[2023-03-11 12:38:54] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 109/116 places, 101/107 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-11 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:(GT 1 s6), p0:(LEQ s98 s67)], 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 50000 reset in 617 ms.
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
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) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 164 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-05-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-11 finished in 1767 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 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 112 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 112 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 110 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 110 transition count 102
Applied a total of 11 rules in 8 ms. Remains 110 /116 variables (removed 6) and now considering 102/107 (removed 5) transitions.
// Phase 1: matrix 102 rows 110 cols
[2023-03-11 12:38:55] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 12:38:55] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-11 12:38:55] [INFO ] Invariant cache hit.
[2023-03-11 12:38:55] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-11 12:38:55] [INFO ] Invariant cache hit.
[2023-03-11 12:38:55] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/116 places, 102/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 110/116 places, 102/107 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s94 s87), p1:(LEQ s86 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13099 steps with 117 reset in 27 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-12 finished in 806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 112 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 112 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 110 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 110 transition count 102
Applied a total of 11 rules in 9 ms. Remains 110 /116 variables (removed 6) and now considering 102/107 (removed 5) transitions.
// Phase 1: matrix 102 rows 110 cols
[2023-03-11 12:38:56] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 12:38:56] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-11 12:38:56] [INFO ] Invariant cache hit.
[2023-03-11 12:38:56] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-11 12:38:56] [INFO ] Invariant cache hit.
[2023-03-11 12:38:56] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/116 places, 102/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 110/116 places, 102/107 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 18245 reset in 266 ms.
Product exploration explored 100000 steps with 18185 reset in 275 ms.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 152 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 32 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 169 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-11 12:38:57] [INFO ] Invariant cache hit.
[2023-03-11 12:38:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-11 12:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:38:58] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-11 12:38:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:38:58] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-11 12:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:38:58] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-11 12:38:58] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 17 ms.
[2023-03-11 12:38:58] [INFO ] Added : 7 causal constraints over 2 iterations in 82 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 106 transition count 55
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 63 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 62 transition count 54
Applied a total of 88 rules in 20 ms. Remains 62 /110 variables (removed 48) and now considering 54/102 (removed 48) transitions.
// Phase 1: matrix 54 rows 62 cols
[2023-03-11 12:38:58] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 12:38:58] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-11 12:38:58] [INFO ] Invariant cache hit.
[2023-03-11 12:38:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 12:38:58] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-11 12:38:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 12:38:58] [INFO ] Invariant cache hit.
[2023-03-11 12:38:58] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/110 places, 54/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 62/110 places, 54/102 transitions.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 246 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 48 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 256 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-11 12:38:59] [INFO ] Invariant cache hit.
[2023-03-11 12:38:59] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 12:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:38:59] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-11 12:38:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:38:59] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 12:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:38:59] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-11 12:38:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 12:38:59] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2023-03-11 12:38:59] [INFO ] Computed and/alt/rep : 47/59/47 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 12:38:59] [INFO ] Added : 1 causal constraints over 1 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 17886 reset in 236 ms.
Product exploration explored 100000 steps with 17909 reset in 239 ms.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-11 12:39:00] [INFO ] Invariant cache hit.
[2023-03-11 12:39:00] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-11 12:39:00] [INFO ] Invariant cache hit.
[2023-03-11 12:39:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 12:39:00] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-11 12:39:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 12:39:00] [INFO ] Invariant cache hit.
[2023-03-11 12:39:00] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 374 ms. Remains : 62/62 places, 54/54 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-13 finished in 4811 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)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-05-LTLCardinality-13
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 116/116 places, 107/107 transitions.
Graph (complete) has 218 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 111 transition count 57
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 65 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 64 transition count 56
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 62 transition count 54
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 62 transition count 54
Applied a total of 99 rules in 18 ms. Remains 62 /116 variables (removed 54) and now considering 54/107 (removed 53) transitions.
// Phase 1: matrix 54 rows 62 cols
[2023-03-11 12:39:01] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 12:39:01] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-11 12:39:01] [INFO ] Invariant cache hit.
[2023-03-11 12:39:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 12:39:01] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-11 12:39:01] [INFO ] Invariant cache hit.
[2023-03-11 12:39:01] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/116 places, 54/107 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 386 ms. Remains : 62/116 places, 54/107 transitions.
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 17889 reset in 209 ms.
Product exploration explored 100000 steps with 17987 reset in 262 ms.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 230 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 49 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 264 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-11 12:39:03] [INFO ] Invariant cache hit.
[2023-03-11 12:39:03] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 12:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:39:03] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-11 12:39:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:39:03] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 12:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:39:03] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-11 12:39:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 12:39:03] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2023-03-11 12:39:03] [INFO ] Computed and/alt/rep : 47/59/47 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 12:39:03] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-11 12:39:03] [INFO ] Invariant cache hit.
[2023-03-11 12:39:03] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-11 12:39:03] [INFO ] Invariant cache hit.
[2023-03-11 12:39:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 12:39:03] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-11 12:39:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 12:39:03] [INFO ] Invariant cache hit.
[2023-03-11 12:39:03] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 386 ms. Remains : 62/62 places, 54/54 transitions.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 225 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 48 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 276 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 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-11 12:39:04] [INFO ] Invariant cache hit.
[2023-03-11 12:39:04] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 12:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:39:04] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-11 12:39:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:39:04] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 12:39:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:39:04] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-11 12:39:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 12:39:04] [INFO ] [Nat]Added 9 Read/Feed constraints in 6 ms returned sat
[2023-03-11 12:39:04] [INFO ] Computed and/alt/rep : 47/59/47 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 12:39:04] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 17893 reset in 289 ms.
Product exploration explored 100000 steps with 17935 reset in 369 ms.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-11 12:39:05] [INFO ] Invariant cache hit.
[2023-03-11 12:39:05] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-11 12:39:05] [INFO ] Invariant cache hit.
[2023-03-11 12:39:05] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 12:39:05] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-11 12:39:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 12:39:05] [INFO ] Invariant cache hit.
[2023-03-11 12:39:05] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 62/62 places, 54/54 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-13 finished in 5035 ms.
[2023-03-11 12:39:05] [INFO ] Flatten gal took : 16 ms
[2023-03-11 12:39:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 12:39:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 107 transitions and 323 arcs took 4 ms.
Total runtime 20813 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HirschbergSinclair-PT-05
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA HirschbergSinclair-PT-05-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678538348053

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 HirschbergSinclair-PT-05-LTLCardinality-13
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for HirschbergSinclair-PT-05-LTLCardinality-13
lola: result : true
lola: markings : 3452
lola: fired transitions : 7418
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HirschbergSinclair-PT-05-LTLCardinality-13: LTL true LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is HirschbergSinclair-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r199-smll-167840345900427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-05.tgz
mv HirschbergSinclair-PT-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;