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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 200K Feb 26 17:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 966K Feb 26 17:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 26 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 500K Feb 26 17:36 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 96K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 331K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 230K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 529K Feb 26 18:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 26 18:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 253K Feb 26 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 58K 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 228K 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-0200-LTLCardinality-00
FORMULA_NAME Referendum-PT-0200-LTLCardinality-01
FORMULA_NAME Referendum-PT-0200-LTLCardinality-02
FORMULA_NAME Referendum-PT-0200-LTLCardinality-03
FORMULA_NAME Referendum-PT-0200-LTLCardinality-04
FORMULA_NAME Referendum-PT-0200-LTLCardinality-05
FORMULA_NAME Referendum-PT-0200-LTLCardinality-06
FORMULA_NAME Referendum-PT-0200-LTLCardinality-07
FORMULA_NAME Referendum-PT-0200-LTLCardinality-08
FORMULA_NAME Referendum-PT-0200-LTLCardinality-09
FORMULA_NAME Referendum-PT-0200-LTLCardinality-10
FORMULA_NAME Referendum-PT-0200-LTLCardinality-11
FORMULA_NAME Referendum-PT-0200-LTLCardinality-12
FORMULA_NAME Referendum-PT-0200-LTLCardinality-13
FORMULA_NAME Referendum-PT-0200-LTLCardinality-14
FORMULA_NAME Referendum-PT-0200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679050573092

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-0200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 10:56:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 10:56:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:56:14] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-17 10:56:14] [INFO ] Transformed 601 places.
[2023-03-17 10:56:14] [INFO ] Transformed 401 transitions.
[2023-03-17 10:56:14] [INFO ] Found NUPN structural information;
[2023-03-17 10:56:14] [INFO ] Parsed PT model containing 601 places and 401 transitions and 1001 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Referendum-PT-0200-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 601 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 11 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 601 cols
[2023-03-17 10:56:15] [INFO ] Computed 200 place invariants in 18 ms
[2023-03-17 10:56:15] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-17 10:56:15] [INFO ] Invariant cache hit.
[2023-03-17 10:56:16] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
[2023-03-17 10:56:16] [INFO ] Invariant cache hit.
[2023-03-17 10:56:16] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1716 ms. Remains : 601/601 places, 401/401 transitions.
Support contains 601 out of 601 places after structural reductions.
[2023-03-17 10:56:16] [INFO ] Flatten gal took : 314 ms
[2023-03-17 10:56:16] [INFO ] Flatten gal took : 35 ms
[2023-03-17 10:56:17] [INFO ] Input system was already deterministic with 401 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 10:56:17] [INFO ] Invariant cache hit.
[2023-03-17 10:56:17] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 601 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 601 transition count 401
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' '!(X(F(p0)))'
Support contains 400 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 23 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-17 10:56:17] [INFO ] Invariant cache hit.
[2023-03-17 10:56:17] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-17 10:56:17] [INFO ] Invariant cache hit.
[2023-03-17 10:56:18] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-17 10:56:18] [INFO ] Invariant cache hit.
[2023-03-17 10:56:18] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 623 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-00 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 (ADD s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s...], 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 50000 reset in 2240 ms.
Product exploration explored 100000 steps with 50000 reset in 2162 ms.
Computed a total of 601 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 601 transition count 401
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, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-00 finished in 5482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U (p1||G(p2))))))'
Support contains 401 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 401 transition count 401
Applied a total of 200 rules in 9 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2023-03-17 10:56:23] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-17 10:56:23] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-17 10:56:23] [INFO ] Invariant cache hit.
[2023-03-17 10:56:23] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-17 10:56:23] [INFO ] Invariant cache hit.
[2023-03-17 10:56:23] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 (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 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 9 ms.
FORMULA Referendum-PT-0200-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-01 finished in 642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 400 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Graph (complete) has 600 edges and 601 vertex of which 401 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.2 ms
Discarding 200 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
[2023-03-17 10:56:23] [INFO ] Invariant cache hit.
[2023-03-17 10:56:23] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-17 10:56:23] [INFO ] Invariant cache hit.
[2023-03-17 10:56:24] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-17 10:56:24] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-17 10:56:24] [INFO ] Invariant cache hit.
[2023-03-17 10:56:24] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 429 ms. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 9 ms.
FORMULA Referendum-PT-0200-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-02 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((p0||X(p1))))&&G(!p1))))'
Support contains 201 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Graph (complete) has 600 edges and 601 vertex of which 401 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.3 ms
Discarding 200 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 401 transition count 401
Applied a total of 2 rules in 44 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2023-03-17 10:56:24] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-17 10:56:24] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-17 10:56:24] [INFO ] Invariant cache hit.
[2023-03-17 10:56:24] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-17 10:56:24] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-17 10:56:24] [INFO ] Invariant cache hit.
[2023-03-17 10:56:24] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) p1), (AND (NOT p1) (NOT p0)), p1, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}, { cond=(NOT p1), acceptance={1} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 5}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=(NOT p1), acceptance={1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={1} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=5 dest: 1}, { cond=(NOT p1), acceptance={1} source=5 dest: 2}]], initial=0, aps=[p1:(LEQ s0 (ADD s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s22...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 205 steps with 1 reset in 12 ms.
FORMULA Referendum-PT-0200-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-03 finished in 747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 400 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 12 ms. Remains 600 /601 variables (removed 1) and now considering 400/401 (removed 1) transitions.
// Phase 1: matrix 400 rows 600 cols
[2023-03-17 10:56:25] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-17 10:56:25] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-17 10:56:25] [INFO ] Invariant cache hit.
[2023-03-17 10:56:25] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-17 10:56:25] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 10:56:25] [INFO ] Invariant cache hit.
[2023-03-17 10:56:25] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 652 ms. Remains : 600/601 places, 400/401 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-07 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:(LEQ 1 (ADD s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427...], 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 672 reset in 3915 ms.
Product exploration explored 100000 steps with 656 reset in 3948 ms.
Computed a total of 600 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 600 transition count 400
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 (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 8 factoid took 472 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 10:56:38] [INFO ] Invariant cache hit.
[2023-03-17 10:56:38] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 10:56:38] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 739 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-17 10:56:39] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p0))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 10 factoid took 428 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-07 finished in 15520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 600 rules applied. Total rules applied 600 place count 201 transition count 201
Discarding 198 places :
Symmetric choice reduction at 1 with 198 rule applications. Total rules 798 place count 3 transition count 3
Iterating global reduction 1 with 198 rules applied. Total rules applied 996 place count 3 transition count 3
Applied a total of 996 rules in 10 ms. Remains 3 /601 variables (removed 598) and now considering 3/401 (removed 398) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:56:40] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:56:40] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-17 10:56:40] [INFO ] Invariant cache hit.
[2023-03-17 10:56:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-17 10:56:40] [INFO ] Invariant cache hit.
[2023-03-17 10:56:40] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/601 places, 3/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 3/601 places, 3/401 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s2 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-08 finished in 163 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&&X(p0))||G(p0)))))'
Support contains 1 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 399 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 202 transition count 202
Discarding 198 places :
Symmetric choice reduction at 1 with 198 rule applications. Total rules 796 place count 4 transition count 4
Iterating global reduction 1 with 198 rules applied. Total rules applied 994 place count 4 transition count 4
Applied a total of 994 rules in 6 ms. Remains 4 /601 variables (removed 597) and now considering 4/401 (removed 397) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-17 10:56:40] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:56:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 10:56:40] [INFO ] Invariant cache hit.
[2023-03-17 10:56:40] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-17 10:56:40] [INFO ] Invariant cache hit.
[2023-03-17 10:56:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/601 places, 4/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 4/601 places, 4/401 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), 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:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 403 steps with 1 reset in 7 ms.
FORMULA Referendum-PT-0200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-14 finished in 185 ms.
All properties solved by simple procedures.
Total runtime 26495 ms.
ITS solved all properties within timeout

BK_STOP 1679050602660

--------------------
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

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

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