fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r327-tall-167889199700499
Last Updated
May 14, 2023

About the Execution of LoLa+red for Referendum-PT-0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
672.140 72527.00 79871.00 496.70 F?FFFFFFFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 120K Feb 26 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 628K Feb 26 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Feb 26 17:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 309K Feb 26 17:30 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 59K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 212K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 158K Feb 26 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 802K Feb 26 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 129K Feb 26 17:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 986K Feb 26 17:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 27K 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 113K 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-0100-LTLCardinality-00
FORMULA_NAME Referendum-PT-0100-LTLCardinality-01
FORMULA_NAME Referendum-PT-0100-LTLCardinality-02
FORMULA_NAME Referendum-PT-0100-LTLCardinality-03
FORMULA_NAME Referendum-PT-0100-LTLCardinality-04
FORMULA_NAME Referendum-PT-0100-LTLCardinality-05
FORMULA_NAME Referendum-PT-0100-LTLCardinality-06
FORMULA_NAME Referendum-PT-0100-LTLCardinality-07
FORMULA_NAME Referendum-PT-0100-LTLCardinality-08
FORMULA_NAME Referendum-PT-0100-LTLCardinality-09
FORMULA_NAME Referendum-PT-0100-LTLCardinality-10
FORMULA_NAME Referendum-PT-0100-LTLCardinality-11
FORMULA_NAME Referendum-PT-0100-LTLCardinality-12
FORMULA_NAME Referendum-PT-0100-LTLCardinality-13
FORMULA_NAME Referendum-PT-0100-LTLCardinality-14
FORMULA_NAME Referendum-PT-0100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679050142953

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-0100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 10:49:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 10:49:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:49:04] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-17 10:49:04] [INFO ] Transformed 301 places.
[2023-03-17 10:49:04] [INFO ] Transformed 201 transitions.
[2023-03-17 10:49:04] [INFO ] Found NUPN structural information;
[2023-03-17 10:49:04] [INFO ] Parsed PT model containing 301 places and 201 transitions and 501 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 8 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2023-03-17 10:49:04] [INFO ] Computed 100 place invariants in 20 ms
[2023-03-17 10:49:05] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-17 10:49:05] [INFO ] Invariant cache hit.
[2023-03-17 10:49:05] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2023-03-17 10:49:05] [INFO ] Invariant cache hit.
[2023-03-17 10:49:05] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 737 ms. Remains : 301/301 places, 201/201 transitions.
Support contains 301 out of 301 places after structural reductions.
[2023-03-17 10:49:05] [INFO ] Flatten gal took : 44 ms
[2023-03-17 10:49:05] [INFO ] Flatten gal took : 17 ms
[2023-03-17 10:49:05] [INFO ] Input system was already deterministic with 201 transitions.
Finished random walk after 469 steps, including 4 resets, run visited all 23 properties in 48 ms. (steps per millisecond=9 )
FORMULA Referendum-PT-0100-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 301 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 301 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 200 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 201 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.2 ms
Discarding 100 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 201 /301 variables (removed 100) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2023-03-17 10:49:06] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:49:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-17 10:49:06] [INFO ] Invariant cache hit.
[2023-03-17 10:49:06] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-17 10:49:06] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-17 10:49:06] [INFO ] Invariant cache hit.
[2023-03-17 10:49:06] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/301 places, 201/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 263 ms. Remains : 201/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 980 reset in 1587 ms.
Product exploration explored 100000 steps with 980 reset in 1587 ms.
Computed a total of 201 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-17 10:49:10] [INFO ] Invariant cache hit.
[2023-03-17 10:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:49:11] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2023-03-17 10:49:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:49:12] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-03-17 10:49:13] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-17 10:49:13] [INFO ] Added : 50 causal constraints over 10 iterations in 168 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 200 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 6 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:49:13] [INFO ] Invariant cache hit.
[2023-03-17 10:49:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-17 10:49:13] [INFO ] Invariant cache hit.
[2023-03-17 10:49:13] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-17 10:49:13] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-17 10:49:13] [INFO ] Invariant cache hit.
[2023-03-17 10:49:13] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 201/201 places, 201/201 transitions.
Computed a total of 201 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-17 10:49:13] [INFO ] Invariant cache hit.
[2023-03-17 10:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:49:14] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-17 10:49:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:49:16] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2023-03-17 10:49:16] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-17 10:49:16] [INFO ] Added : 50 causal constraints over 10 iterations in 132 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 980 reset in 1620 ms.
Product exploration explored 100000 steps with 980 reset in 1605 ms.
Support contains 200 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 6 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:49:20] [INFO ] Invariant cache hit.
[2023-03-17 10:49:20] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-17 10:49:20] [INFO ] Invariant cache hit.
[2023-03-17 10:49:20] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-17 10:49:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 10:49:20] [INFO ] Invariant cache hit.
[2023-03-17 10:49:20] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 201/201 places, 201/201 transitions.
Treatment of property Referendum-PT-0100-LTLCardinality-01 finished in 14324 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(F((p0&&G(p1)))))))'
Support contains 101 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 201 transition count 201
Applied a total of 100 rules in 14 ms. Remains 201 /301 variables (removed 100) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:49:20] [INFO ] Invariant cache hit.
[2023-03-17 10:49:20] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-17 10:49:20] [INFO ] Invariant cache hit.
[2023-03-17 10:49:20] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-17 10:49:20] [INFO ] Invariant cache hit.
[2023-03-17 10:49:20] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/301 places, 201/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 201/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-02 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=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 11 ms.
FORMULA Referendum-PT-0100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-02 finished in 543 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||F(p1)) U (G((p0||F(p1)))||(p2&&(p0||F(p1))))))))'
Support contains 201 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2023-03-17 10:49:20] [INFO ] Computed 100 place invariants in 2 ms
[2023-03-17 10:49:20] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-17 10:49:20] [INFO ] Invariant cache hit.
[2023-03-17 10:49:21] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-17 10:49:21] [INFO ] Invariant cache hit.
[2023-03-17 10:49:21] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 2 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-03 finished in 453 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((G(p0)||(X(p1) U ((p1&&X(p1))||X(G(p1))))))))'
Support contains 200 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:49:21] [INFO ] Invariant cache hit.
[2023-03-17 10:49:21] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-17 10:49:21] [INFO ] Invariant cache hit.
[2023-03-17 10:49:21] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-17 10:49:21] [INFO ] Invariant cache hit.
[2023-03-17 10:49:21] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 112 steps with 1 reset in 4 ms.
FORMULA Referendum-PT-0100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-04 finished in 421 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(p0)||X(G(p1))))'
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:49:21] [INFO ] Invariant cache hit.
[2023-03-17 10:49:21] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-17 10:49:21] [INFO ] Invariant cache hit.
[2023-03-17 10:49:21] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-17 10:49:21] [INFO ] Invariant cache hit.
[2023-03-17 10:49:22] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (GT s0 (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 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-05 finished in 467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 300 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:49:22] [INFO ] Invariant cache hit.
[2023-03-17 10:49:22] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-17 10:49:22] [INFO ] Invariant cache hit.
[2023-03-17 10:49:22] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-17 10:49:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 10:49:22] [INFO ] Invariant cache hit.
[2023-03-17 10:49:22] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT (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 s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 103 steps with 1 reset in 2 ms.
FORMULA Referendum-PT-0100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-06 finished in 487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p0&&X(p1)))&&G(p2))))'
Support contains 300 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:49:22] [INFO ] Invariant cache hit.
[2023-03-17 10:49:22] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-17 10:49:22] [INFO ] Invariant cache hit.
[2023-03-17 10:49:22] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-17 10:49:22] [INFO ] Invariant cache hit.
[2023-03-17 10:49:23] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (OR (NOT p2) (NOT p1) p0), (OR (NOT p2) (NOT p1) p0), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) p0), (NOT p2)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p2) p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 2}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (LEQ 1 (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...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-07 finished in 500 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((G(p0)||X((!p1 U (p2||G(!p1))))))))'
Support contains 6 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 292 rules applied. Total rules applied 292 place count 105 transition count 105
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 385 place count 12 transition count 12
Iterating global reduction 1 with 93 rules applied. Total rules applied 478 place count 12 transition count 12
Applied a total of 478 rules in 4 ms. Remains 12 /301 variables (removed 289) and now considering 12/201 (removed 189) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-17 10:49:23] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:49:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 10:49:23] [INFO ] Invariant cache hit.
[2023-03-17 10:49:23] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-17 10:49:23] [INFO ] Invariant cache hit.
[2023-03-17 10:49:23] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 12/301 places, 12/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 12/301 places, 12/201 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2))]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={} source=5 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(OR (EQ s8 0) (EQ s4 1)), p2:(AND (NOT (OR (EQ s6 0) (EQ s11 1))) (NOT (OR (EQ s10 0) (EQ s9 1)))), p1:(OR (EQ s10 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 212 steps with 2 reset in 1 ms.
FORMULA Referendum-PT-0100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-09 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 298 rules applied. Total rules applied 298 place count 102 transition count 102
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 396 place count 4 transition count 4
Iterating global reduction 1 with 98 rules applied. Total rules applied 494 place count 4 transition count 4
Applied a total of 494 rules in 4 ms. Remains 4 /301 variables (removed 297) and now considering 4/201 (removed 197) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-17 10:49:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:49:23] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 10:49:23] [INFO ] Invariant cache hit.
[2023-03-17 10:49:23] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-17 10:49:23] [INFO ] Invariant cache hit.
[2023-03-17 10:49:23] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/301 places, 4/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 4/301 places, 4/201 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s3 0) (NEQ s0 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 101 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-10 finished in 161 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)&&X(F((X(p3)&&p2))))))'
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 298 rules applied. Total rules applied 298 place count 102 transition count 102
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 393 place count 7 transition count 7
Iterating global reduction 1 with 95 rules applied. Total rules applied 488 place count 7 transition count 7
Applied a total of 488 rules in 2 ms. Remains 7 /301 variables (removed 294) and now considering 7/201 (removed 194) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-17 10:49:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:49:23] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-17 10:49:23] [INFO ] Invariant cache hit.
[2023-03-17 10:49:23] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-17 10:49:23] [INFO ] Invariant cache hit.
[2023-03-17 10:49:23] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/301 places, 7/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 7/301 places, 7/201 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p1) (NOT p3) (NOT p2) (NOT p0)), true]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p3), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s5 0) (EQ s0 1) (EQ s6 0) (EQ s3 1)), p3:(AND (EQ s0 0) (EQ s5 1)), p2:(AND (EQ s0 0) (EQ s5 1)), 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, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-12 finished in 298 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 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 3 are kept as prefixes of interest. Removing 298 places using SCC suffix rule.1 ms
Discarding 298 places :
Also discarding 198 output transitions
Drop transitions removed 198 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 3 ms. Remains 2 /301 variables (removed 299) and now considering 2/201 (removed 199) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:49:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:49:23] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-17 10:49:23] [INFO ] Invariant cache hit.
[2023-03-17 10:49:23] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2023-03-17 10:49:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:49:23] [INFO ] Invariant cache hit.
[2023-03-17 10:49:23] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/301 places, 2/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 2/301 places, 2/201 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-15 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:(EQ s1 1)], 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 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-15 finished in 113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-17 10:49:24] [INFO ] Flatten gal took : 13 ms
[2023-03-17 10:49:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-17 10:49:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 301 places, 201 transitions and 501 arcs took 2 ms.
Total runtime 19872 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Referendum-PT-0100
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1679050215480

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 3 (type SKEL/SRCH) for 0 Referendum-PT-0100-LTLCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 1 (type EXCL) for 0 Referendum-PT-0100-LTLCardinality-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type SKEL/SRCH) for Referendum-PT-0100-LTLCardinality-01
lola: result : false
lola: markings : 7753
lola: fired transitions : 25502
lola: time used : 0.000000
lola: memory pages used : 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 5/32 Referendum-PT-0100-LTLCardinality-01 448785 m, 89757 m/sec, 3456263 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-0100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 8/32 Referendum-PT-0100-LTLCardinality-01 851373 m, 80517 m/sec, 6852647 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# 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-0100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 12/32 Referendum-PT-0100-LTLCardinality-01 1239408 m, 77607 m/sec, 10265771 t fired, .

Time elapsed: 15 secs. Pages in use: 12
# 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-0100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 15/32 Referendum-PT-0100-LTLCardinality-01 1582596 m, 68637 m/sec, 13674199 t fired, .

Time elapsed: 20 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-0100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 18/32 Referendum-PT-0100-LTLCardinality-01 1985978 m, 80676 m/sec, 17051451 t fired, .

Time elapsed: 25 secs. Pages in use: 18
# 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-0100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 21/32 Referendum-PT-0100-LTLCardinality-01 2367229 m, 76250 m/sec, 20450765 t fired, .

Time elapsed: 30 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-0100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 24/32 Referendum-PT-0100-LTLCardinality-01 2716927 m, 69939 m/sec, 23848776 t fired, .

Time elapsed: 35 secs. Pages in use: 24
# 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-0100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 28/32 Referendum-PT-0100-LTLCardinality-01 3100286 m, 76671 m/sec, 27286023 t fired, .

Time elapsed: 40 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-0100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 31/32 Referendum-PT-0100-LTLCardinality-01 3447770 m, 69496 m/sec, 30694734 t fired, .

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

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

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

Time elapsed: 50 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-0100-LTLCardinality-01: LTL unknown AGGR


Time elapsed: 50 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-0100"
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-0100, 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-167889199700499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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