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.r327-tall-167889199700523.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 Referendum-PT-1000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199700523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 34M
-rw-r--r-- 1 mcc users 589K Feb 26 19:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Feb 26 19:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 574K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 556K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 258K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 20:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Feb 26 20:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Feb 26 19:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Feb 26 19:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 72K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 176K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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 Referendum-PT-1000-LTLCardinality-00
FORMULA_NAME Referendum-PT-1000-LTLCardinality-01
FORMULA_NAME Referendum-PT-1000-LTLCardinality-02
FORMULA_NAME Referendum-PT-1000-LTLCardinality-03
FORMULA_NAME Referendum-PT-1000-LTLCardinality-04
FORMULA_NAME Referendum-PT-1000-LTLCardinality-05
FORMULA_NAME Referendum-PT-1000-LTLCardinality-06
FORMULA_NAME Referendum-PT-1000-LTLCardinality-07
FORMULA_NAME Referendum-PT-1000-LTLCardinality-08
FORMULA_NAME Referendum-PT-1000-LTLCardinality-09
FORMULA_NAME Referendum-PT-1000-LTLCardinality-10
FORMULA_NAME Referendum-PT-1000-LTLCardinality-11
FORMULA_NAME Referendum-PT-1000-LTLCardinality-12
FORMULA_NAME Referendum-PT-1000-LTLCardinality-13
FORMULA_NAME Referendum-PT-1000-LTLCardinality-14
FORMULA_NAME Referendum-PT-1000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679051614010

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=Referendum-PT-1000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 11:13:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 11:13:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 11:13:36] [INFO ] Load time of PNML (sax parser for PT used): 756 ms
[2023-03-17 11:13:36] [INFO ] Transformed 3001 places.
[2023-03-17 11:13:36] [INFO ] Transformed 2001 transitions.
[2023-03-17 11:13:36] [INFO ] Found NUPN structural information;
[2023-03-17 11:13:36] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 1060 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 400 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Referendum-PT-1000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Applied a total of 0 rules in 30 ms. Remains 3001 /3001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 3001 cols
[2023-03-17 11:13:37] [INFO ] Computed 1000 place invariants in 30 ms
[2023-03-17 11:13:37] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-17 11:13:37] [INFO ] Invariant cache hit.
[2023-03-17 11:13:38] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2023-03-17 11:13:38] [INFO ] Invariant cache hit.
[2023-03-17 11:13:39] [INFO ] Dead Transitions using invariants and state equation in 1246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2421 ms. Remains : 3001/3001 places, 2001/2001 transitions.
Support contains 3001 out of 3001 places after structural reductions.
[2023-03-17 11:13:40] [INFO ] Flatten gal took : 319 ms
[2023-03-17 11:13:40] [INFO ] Flatten gal took : 213 ms
[2023-03-17 11:13:40] [INFO ] Input system was already deterministic with 2001 transitions.
Finished random walk after 1004 steps, including 1 resets, run visited all 15 properties in 389 ms. (steps per millisecond=2 )
Computed a total of 3001 stabilizing places and 2001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3001 transition count 2001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&X(F(p1)))))'
Support contains 2001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2001 transition count 2001
Applied a total of 1000 rules in 65 ms. Remains 2001 /3001 variables (removed 1000) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2023-03-17 11:13:41] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-17 11:13:41] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-17 11:13:41] [INFO ] Invariant cache hit.
[2023-03-17 11:13:42] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-03-17 11:13:42] [INFO ] Invariant cache hit.
[2023-03-17 11:13:43] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2001/3001 places, 2001/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1628 ms. Remains : 2001/3001 places, 2001/2001 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s3...], 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]]
Stuttering criterion allowed to conclude after 1001 steps with 0 reset in 228 ms.
FORMULA Referendum-PT-1000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-00 finished in 2194 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||G(p1)||(p1&&G(F((!p0||G(p2))))))))'
Support contains 2001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2001 transition count 2001
Applied a total of 1000 rules in 22 ms. Remains 2001 /3001 variables (removed 1000) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2023-03-17 11:13:43] [INFO ] Computed 0 place invariants in 16 ms
[2023-03-17 11:13:43] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-17 11:13:43] [INFO ] Invariant cache hit.
[2023-03-17 11:13:44] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-17 11:13:44] [INFO ] Invariant cache hit.
[2023-03-17 11:13:45] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2001/3001 places, 2001/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1588 ms. Remains : 2001/3001 places, 2001/2001 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 (ADD s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1023 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 65500 steps with 32750 reset in 10002 ms.
Product exploration timeout after 64920 steps with 32460 reset in 10001 ms.
Computed a total of 2001 stabilizing places and 2001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2001 transition count 2001
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) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 9 factoid took 151 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLCardinality-01 finished in 22971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&(p1||X(F(p2)))))))'
Support contains 2001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Applied a total of 0 rules in 110 ms. Remains 3001 /3001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 3001 cols
[2023-03-17 11:14:06] [INFO ] Computed 1000 place invariants in 13 ms
[2023-03-17 11:14:07] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-17 11:14:07] [INFO ] Invariant cache hit.
[2023-03-17 11:14:07] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2023-03-17 11:14:07] [INFO ] Invariant cache hit.
[2023-03-17 11:14:08] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2178 ms. Remains : 3001/3001 places, 2001/2001 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(GT (ADD s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1023 s102...], 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]]
Stuttering criterion allowed to conclude after 1402 steps with 21 reset in 240 ms.
FORMULA Referendum-PT-1000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-02 finished in 2576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G(F(!p0)))))))'
Support contains 1000 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2001 transition count 2001
Applied a total of 1000 rules in 164 ms. Remains 2001 /3001 variables (removed 1000) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2023-03-17 11:14:09] [INFO ] Computed 0 place invariants in 12 ms
[2023-03-17 11:14:09] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-17 11:14:09] [INFO ] Invariant cache hit.
[2023-03-17 11:14:10] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2023-03-17 11:14:10] [INFO ] Invariant cache hit.
[2023-03-17 11:14:11] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2001/3001 places, 2001/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1810 ms. Remains : 2001/3001 places, 2001/2001 transitions.
Stuttering acceptance computed with spot in 198 ms :[false, false, false, false, p0, p0]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 84410 steps with 84 reset in 10001 ms.
Product exploration timeout after 81720 steps with 81 reset in 10001 ms.
Computed a total of 2001 stabilizing places and 2001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2001 transition count 2001
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 : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 6 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[false, false, false, false, p0, p0]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 6 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[false, false, false, false, p0, p0]
Stuttering acceptance computed with spot in 178 ms :[false, false, false, false, p0, p0]
Support contains 1000 out of 2001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2001/2001 places, 2001/2001 transitions.
Applied a total of 0 rules in 60 ms. Remains 2001 /2001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
[2023-03-17 11:14:32] [INFO ] Invariant cache hit.
[2023-03-17 11:14:32] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-17 11:14:32] [INFO ] Invariant cache hit.
[2023-03-17 11:14:33] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2023-03-17 11:14:33] [INFO ] Invariant cache hit.
[2023-03-17 11:14:34] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1606 ms. Remains : 2001/2001 places, 2001/2001 transitions.
Computed a total of 2001 stabilizing places and 2001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2001 transition count 2001
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 : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 6 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[false, false, false, false, p0, p0]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 6 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[false, false, false, false, p0, p0]
Stuttering acceptance computed with spot in 208 ms :[false, false, false, false, p0, p0]
Stuttering acceptance computed with spot in 210 ms :[false, false, false, false, p0, p0]
Product exploration timeout after 84120 steps with 83 reset in 10001 ms.
Product exploration timeout after 81700 steps with 81 reset in 10001 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[false, false, false, false, p0, p0]
Support contains 1000 out of 2001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2001/2001 places, 2001/2001 transitions.
Applied a total of 0 rules in 219 ms. Remains 2001 /2001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
[2023-03-17 11:14:56] [INFO ] Redundant transitions in 162 ms returned []
[2023-03-17 11:14:56] [INFO ] Invariant cache hit.
[2023-03-17 11:14:57] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1235 ms. Remains : 2001/2001 places, 2001/2001 transitions.
Support contains 1000 out of 2001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2001/2001 places, 2001/2001 transitions.
Applied a total of 0 rules in 58 ms. Remains 2001 /2001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
[2023-03-17 11:14:57] [INFO ] Invariant cache hit.
[2023-03-17 11:14:57] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-17 11:14:57] [INFO ] Invariant cache hit.
[2023-03-17 11:14:57] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2023-03-17 11:14:57] [INFO ] Invariant cache hit.
[2023-03-17 11:14:58] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1619 ms. Remains : 2001/2001 places, 2001/2001 transitions.
Treatment of property Referendum-PT-1000-LTLCardinality-03 finished in 49923 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 1001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 2000 places and 0 transitions.
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 3000 rules applied. Total rules applied 3000 place count 1001 transition count 1001
Applied a total of 3000 rules in 31 ms. Remains 1001 /3001 variables (removed 2000) and now considering 1001/2001 (removed 1000) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2023-03-17 11:14:59] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-17 11:14:59] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-17 11:14:59] [INFO ] Invariant cache hit.
[2023-03-17 11:14:59] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2023-03-17 11:14:59] [INFO ] Invariant cache hit.
[2023-03-17 11:15:00] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/3001 places, 1001/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 965 ms. Remains : 1001/3001 places, 1001/2001 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-07 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:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s3...], 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 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-1000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-07 finished in 1180 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)||(p1&&F(G(p2))))))'
Support contains 3 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1999 places and 0 transitions.
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 0 with 2998 rules applied. Total rules applied 2998 place count 1002 transition count 1002
Discarding 996 places :
Symmetric choice reduction at 1 with 996 rule applications. Total rules 3994 place count 6 transition count 6
Iterating global reduction 1 with 996 rules applied. Total rules applied 4990 place count 6 transition count 6
Applied a total of 4990 rules in 31 ms. Remains 6 /3001 variables (removed 2995) and now considering 6/2001 (removed 1995) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-17 11:15:00] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 11:15:00] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-17 11:15:00] [INFO ] Invariant cache hit.
[2023-03-17 11:15:00] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2023-03-17 11:15:00] [INFO ] Invariant cache hit.
[2023-03-17 11:15:00] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/3001 places, 6/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 6/3001 places, 6/2001 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s5 1)), p1:(EQ s4 0), p2:(AND (EQ s5 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 9 factoid took 156 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLCardinality-08 finished in 570 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) U G((G(p0) U p1))))'
Support contains 4 out of 3001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Graph (complete) has 3000 edges and 3001 vertex of which 6 are kept as prefixes of interest. Removing 2995 places using SCC suffix rule.21 ms
Discarding 2995 places :
Also discarding 1994 output transitions
Drop transitions removed 1994 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 6
Applied a total of 3 rules in 36 ms. Remains 6 /3001 variables (removed 2995) and now considering 6/2001 (removed 1995) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-17 11:15:00] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 11:15:00] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-17 11:15:00] [INFO ] Invariant cache hit.
[2023-03-17 11:15:00] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2023-03-17 11:15:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 11:15:00] [INFO ] Invariant cache hit.
[2023-03-17 11:15:00] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/3001 places, 6/2001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 6/3001 places, 6/2001 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-12 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:(OR (EQ s4 0) (EQ s1 1)), p0:(OR (EQ s0 0) (EQ s2 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 23754 reset in 108 ms.
Product exploration explored 100000 steps with 23787 reset in 202 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
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 (NOT p1) p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 11 factoid took 287 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLCardinality-12 finished in 833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G(F(!p0)))))))'
Found a Lengthening insensitive property : Referendum-PT-1000-LTLCardinality-03
Stuttering acceptance computed with spot in 215 ms :[false, false, false, false, p0, p0]
Support contains 1000 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Graph (complete) has 3000 edges and 3001 vertex of which 2001 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.5 ms
Discarding 1000 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 78 ms. Remains 2000 /3001 variables (removed 1001) and now considering 2000/2001 (removed 1) transitions.
// Phase 1: matrix 2000 rows 2000 cols
[2023-03-17 11:15:02] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-17 11:15:02] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-17 11:15:02] [INFO ] Invariant cache hit.
[2023-03-17 11:15:02] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-03-17 11:15:02] [INFO ] Invariant cache hit.
[2023-03-17 11:15:03] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2000/3001 places, 2000/2001 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1683 ms. Remains : 2000/3001 places, 2000/2001 transitions.
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], 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, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 80660 steps with 80 reset in 10001 ms.
Product exploration timeout after 78340 steps with 78 reset in 10002 ms.
Computed a total of 2000 stabilizing places and 2000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2000 transition count 2000
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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 6 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[false, false, false, false, p0, p0]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 6 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[false, false, false, false, p0, p0]
Stuttering acceptance computed with spot in 236 ms :[false, false, false, false, p0, p0]
Support contains 1000 out of 2000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2000/2000 places, 2000/2000 transitions.
Applied a total of 0 rules in 54 ms. Remains 2000 /2000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2023-03-17 11:15:25] [INFO ] Invariant cache hit.
[2023-03-17 11:15:25] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-17 11:15:25] [INFO ] Invariant cache hit.
[2023-03-17 11:15:25] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2023-03-17 11:15:25] [INFO ] Invariant cache hit.
[2023-03-17 11:15:26] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1619 ms. Remains : 2000/2000 places, 2000/2000 transitions.
Computed a total of 2000 stabilizing places and 2000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2000 transition count 2000
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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 6 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[false, false, false, false, p0, p0]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 6 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[false, false, false, false, p0, p0]
Stuttering acceptance computed with spot in 198 ms :[false, false, false, false, p0, p0]
Stuttering acceptance computed with spot in 185 ms :[false, false, false, false, p0, p0]
Product exploration timeout after 80320 steps with 80 reset in 10001 ms.
Product exploration timeout after 78110 steps with 78 reset in 10001 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[false, false, false, false, p0, p0]
Support contains 1000 out of 2000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2000/2000 places, 2000/2000 transitions.
Applied a total of 0 rules in 79 ms. Remains 2000 /2000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2023-03-17 11:15:48] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-17 11:15:48] [INFO ] Invariant cache hit.
[2023-03-17 11:15:49] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 986 ms. Remains : 2000/2000 places, 2000/2000 transitions.
Support contains 1000 out of 2000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2000/2000 places, 2000/2000 transitions.
Applied a total of 0 rules in 74 ms. Remains 2000 /2000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2023-03-17 11:15:49] [INFO ] Invariant cache hit.
[2023-03-17 11:15:49] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-17 11:15:49] [INFO ] Invariant cache hit.
[2023-03-17 11:15:50] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-03-17 11:15:50] [INFO ] Invariant cache hit.
[2023-03-17 11:15:50] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1613 ms. Remains : 2000/2000 places, 2000/2000 transitions.
Treatment of property Referendum-PT-1000-LTLCardinality-03 finished in 49288 ms.
[2023-03-17 11:15:51] [INFO ] Flatten gal took : 128 ms
[2023-03-17 11:15:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-17 11:15:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3001 places, 2001 transitions and 5001 arcs took 8 ms.
Total runtime 135727 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Referendum-PT-1000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1679051832891

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Referendum-PT-1000-LTLCardinality-03
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 5/32 Referendum-PT-1000-LTLCardinality-03 215259 m, 43051 m/sec, 298252 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3599 7/32 Referendum-PT-1000-LTLCardinality-03 422855 m, 41519 m/sec, 666424 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3599 9/32 Referendum-PT-1000-LTLCardinality-03 627874 m, 41003 m/sec, 1033170 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3599 11/32 Referendum-PT-1000-LTLCardinality-03 832276 m, 40880 m/sec, 1398679 t fired, .

Time elapsed: 20 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3599 13/32 Referendum-PT-1000-LTLCardinality-03 1035501 m, 40645 m/sec, 1763809 t fired, .

Time elapsed: 25 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3599 15/32 Referendum-PT-1000-LTLCardinality-03 1237872 m, 40474 m/sec, 2129244 t fired, .

Time elapsed: 30 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3599 17/32 Referendum-PT-1000-LTLCardinality-03 1440910 m, 40607 m/sec, 2494435 t fired, .

Time elapsed: 35 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3599 19/32 Referendum-PT-1000-LTLCardinality-03 1643996 m, 40617 m/sec, 2859463 t fired, .

Time elapsed: 40 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3599 21/32 Referendum-PT-1000-LTLCardinality-03 1846632 m, 40527 m/sec, 3224462 t fired, .

Time elapsed: 45 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3599 23/32 Referendum-PT-1000-LTLCardinality-03 2047582 m, 40190 m/sec, 3588689 t fired, .

Time elapsed: 50 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/3599 25/32 Referendum-PT-1000-LTLCardinality-03 2249088 m, 40301 m/sec, 3953045 t fired, .

Time elapsed: 55 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/3599 26/32 Referendum-PT-1000-LTLCardinality-03 2449988 m, 40180 m/sec, 4318196 t fired, .

Time elapsed: 60 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/3599 28/32 Referendum-PT-1000-LTLCardinality-03 2648642 m, 39730 m/sec, 4681321 t fired, .

Time elapsed: 65 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/3599 30/32 Referendum-PT-1000-LTLCardinality-03 2850626 m, 40396 m/sec, 5044824 t fired, .

Time elapsed: 70 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 74/3599 32/32 Referendum-PT-1000-LTLCardinality-03 3052736 m, 40422 m/sec, 5408190 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for Referendum-PT-1000-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Referendum-PT-1000-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Referendum-PT-1000-LTLCardinality-03: LTL unknown AGGR


Time elapsed: 80 secs. Pages in use: 32

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="Referendum-PT-1000"
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 Referendum-PT-1000, 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 r327-tall-167889199700523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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