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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 30K Feb 26 17:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 191K Feb 26 17:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 17:26 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 12K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 26 17:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 267K Feb 26 17:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 41K Feb 26 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 26 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K 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 23K 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-0020-LTLCardinality-00
FORMULA_NAME Referendum-PT-0020-LTLCardinality-01
FORMULA_NAME Referendum-PT-0020-LTLCardinality-02
FORMULA_NAME Referendum-PT-0020-LTLCardinality-03
FORMULA_NAME Referendum-PT-0020-LTLCardinality-04
FORMULA_NAME Referendum-PT-0020-LTLCardinality-05
FORMULA_NAME Referendum-PT-0020-LTLCardinality-06
FORMULA_NAME Referendum-PT-0020-LTLCardinality-07
FORMULA_NAME Referendum-PT-0020-LTLCardinality-08
FORMULA_NAME Referendum-PT-0020-LTLCardinality-09
FORMULA_NAME Referendum-PT-0020-LTLCardinality-10
FORMULA_NAME Referendum-PT-0020-LTLCardinality-11
FORMULA_NAME Referendum-PT-0020-LTLCardinality-12
FORMULA_NAME Referendum-PT-0020-LTLCardinality-13
FORMULA_NAME Referendum-PT-0020-LTLCardinality-14
FORMULA_NAME Referendum-PT-0020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679049682939

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-0020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 10:41:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 10:41:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:41:24] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-17 10:41:24] [INFO ] Transformed 61 places.
[2023-03-17 10:41:24] [INFO ] Transformed 41 transitions.
[2023-03-17 10:41:24] [INFO ] Found NUPN structural information;
[2023-03-17 10:41:24] [INFO ] Parsed PT model containing 61 places and 41 transitions and 101 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-PT-0020-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2023-03-17 10:41:24] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-17 10:41:24] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-17 10:41:24] [INFO ] Invariant cache hit.
[2023-03-17 10:41:24] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-17 10:41:24] [INFO ] Invariant cache hit.
[2023-03-17 10:41:24] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 61/61 places, 41/41 transitions.
Support contains 61 out of 61 places after structural reductions.
[2023-03-17 10:41:25] [INFO ] Flatten gal took : 17 ms
[2023-03-17 10:41:25] [INFO ] Flatten gal took : 6 ms
[2023-03-17 10:41:25] [INFO ] Input system was already deterministic with 41 transitions.
Finished random walk after 140 steps, including 6 resets, run visited all 19 properties in 27 ms. (steps per millisecond=5 )
Computed a total of 61 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 41 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 2 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2023-03-17 10:41:25] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-17 10:41:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 10:41:25] [INFO ] Invariant cache hit.
[2023-03-17 10:41:25] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-17 10:41:25] [INFO ] Invariant cache hit.
[2023-03-17 10:41:25] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40)), p1:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s...], 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][false, false, false]]
Product exploration explored 100000 steps with 4545 reset in 338 ms.
Product exploration explored 100000 steps with 4545 reset in 288 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 448 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 12 factoid took 561 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-17 10:41:28] [INFO ] Invariant cache hit.
[2023-03-17 10:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-17 10:41:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:41:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:28] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-17 10:41:28] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-17 10:41:28] [INFO ] Added : 0 causal constraints over 0 iterations in 36 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 10:41:28] [INFO ] Invariant cache hit.
[2023-03-17 10:41:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:41:28] [INFO ] Invariant cache hit.
[2023-03-17 10:41:28] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-17 10:41:28] [INFO ] Invariant cache hit.
[2023-03-17 10:41:28] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 41/41 places, 41/41 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 435 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 12 factoid took 544 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-17 10:41:29] [INFO ] Invariant cache hit.
[2023-03-17 10:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:41:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-17 10:41:29] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 10:41:29] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4545 reset in 276 ms.
Product exploration explored 100000 steps with 4545 reset in 277 ms.
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 10:41:30] [INFO ] Invariant cache hit.
[2023-03-17 10:41:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 10:41:30] [INFO ] Invariant cache hit.
[2023-03-17 10:41:30] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-17 10:41:30] [INFO ] Invariant cache hit.
[2023-03-17 10:41:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 41/41 places, 41/41 transitions.
Treatment of property Referendum-PT-0020-LTLCardinality-00 finished in 5075 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))'
Support contains 20 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 21 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 0 output transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 21 transition count 21
Applied a total of 21 rules in 5 ms. Remains 21 /61 variables (removed 40) and now considering 21/41 (removed 20) transitions.
// Phase 1: matrix 21 rows 21 cols
[2023-03-17 10:41:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:41:30] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:41:30] [INFO ] Invariant cache hit.
[2023-03-17 10:41:30] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-17 10:41:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:41:30] [INFO ] Invariant cache hit.
[2023-03-17 10:41:30] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/61 places, 21/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 21/61 places, 21/41 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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 p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0020-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLCardinality-01 finished in 564 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(X(F(!p1)))))))'
Support contains 60 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2023-03-17 10:41:31] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-17 10:41:31] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-17 10:41:31] [INFO ] Invariant cache hit.
[2023-03-17 10:41:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-17 10:41:31] [INFO ] Invariant cache hit.
[2023-03-17 10:41:31] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 188 ms :[p1, p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true, (OR (NOT p0) p1)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(LEQ 1 (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60)), p0:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-02 finished in 330 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) U X((p1||X(X(!p0))))))'
Support contains 20 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 3 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2023-03-17 10:41:31] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:41:31] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-17 10:41:31] [INFO ] Invariant cache hit.
[2023-03-17 10:41:31] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-17 10:41:31] [INFO ] Invariant cache hit.
[2023-03-17 10:41:31] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 418 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, p0, true, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=p0, acceptance={} source=7 dest: 9}], [{ cond=p0, acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p1:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 191 ms.
Product exploration explored 100000 steps with 25000 reset in 204 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 307 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[p0, p0, p0, p0, true]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 286 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 166 ms :[p0, p0, p0, p0, true]
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 10:41:33] [INFO ] Invariant cache hit.
[2023-03-17 10:41:33] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 10:41:33] [INFO ] Invariant cache hit.
[2023-03-17 10:41:33] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-17 10:41:33] [INFO ] Invariant cache hit.
[2023-03-17 10:41:33] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 41/41 places, 41/41 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p0, p0, p0, p0, true]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 140 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 176 ms.
Product exploration explored 100000 steps with 25000 reset in 182 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, p0, true]
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 10:41:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 10:41:35] [INFO ] Invariant cache hit.
[2023-03-17 10:41:35] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 41/41 places, 41/41 transitions.
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 10:41:35] [INFO ] Invariant cache hit.
[2023-03-17 10:41:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 10:41:35] [INFO ] Invariant cache hit.
[2023-03-17 10:41:35] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-17 10:41:35] [INFO ] Invariant cache hit.
[2023-03-17 10:41:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 41/41 places, 41/41 transitions.
Treatment of property Referendum-PT-0020-LTLCardinality-03 finished in 3884 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 21 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 41 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 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 41 transition count 41
Applied a total of 2 rules in 9 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2023-03-17 10:41:35] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:41:35] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 10:41:35] [INFO ] Invariant cache hit.
[2023-03-17 10:41:35] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-17 10:41:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:41:35] [INFO ] Invariant cache hit.
[2023-03-17 10:41:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-04 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 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) s0)], 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 20 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-04 finished in 183 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((X((F(p0) U X(!X(p1)))) U p2))))'
Support contains 60 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2023-03-17 10:41:35] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-17 10:41:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-17 10:41:35] [INFO ] Invariant cache hit.
[2023-03-17 10:41:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-17 10:41:35] [INFO ] Invariant cache hit.
[2023-03-17 10:41:35] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=true, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 6}, { cond=p1, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(OR (LEQ (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-05 finished in 499 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 U p1))))'
Support contains 21 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 41 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 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 41 transition count 41
Applied a total of 2 rules in 8 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2023-03-17 10:41:36] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:41:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:41:36] [INFO ] Invariant cache hit.
[2023-03-17 10:41:36] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-17 10:41:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:41:36] [INFO ] Invariant cache hit.
[2023-03-17 10:41:36] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], 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)), p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4651 reset in 396 ms.
Product exploration explored 100000 steps with 4651 reset in 285 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
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 (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 277 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 391 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
[2023-03-17 10:41:37] [INFO ] Invariant cache hit.
[2023-03-17 10:41:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:37] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:41:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:41:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:37] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:41:37] [INFO ] Computed and/alt/rep : 39/77/39 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 10:41:38] [INFO ] Added : 19 causal constraints over 4 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 10:41:38] [INFO ] Invariant cache hit.
[2023-03-17 10:41:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:41:38] [INFO ] Invariant cache hit.
[2023-03-17 10:41:38] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-17 10:41:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:41:38] [INFO ] Invariant cache hit.
[2023-03-17 10:41:38] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 41/41 places, 41/41 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
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 (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 362 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 408 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
[2023-03-17 10:41:39] [INFO ] Invariant cache hit.
[2023-03-17 10:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-17 10:41:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-17 10:41:39] [INFO ] Computed and/alt/rep : 39/77/39 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 10:41:39] [INFO ] Added : 19 causal constraints over 4 iterations in 25 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4652 reset in 248 ms.
Product exploration explored 100000 steps with 4651 reset in 273 ms.
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 10:41:39] [INFO ] Invariant cache hit.
[2023-03-17 10:41:39] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-17 10:41:39] [INFO ] Invariant cache hit.
[2023-03-17 10:41:39] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-17 10:41:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:41:39] [INFO ] Invariant cache hit.
[2023-03-17 10:41:39] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 41/41 places, 41/41 transitions.
Treatment of property Referendum-PT-0020-LTLCardinality-06 finished in 3885 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(G(p1))) U (F(G(!p2))||((F(G(!p2))||(!p0&&F(G(p1))))&&G(p3))||G((!p0&&F(G(p1)))))))))'
Support contains 61 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2023-03-17 10:41:40] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-17 10:41:40] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-17 10:41:40] [INFO ] Invariant cache hit.
[2023-03-17 10:41:40] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-17 10:41:40] [INFO ] Invariant cache hit.
[2023-03-17 10:41:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), (AND p2 (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3)))]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={1} source=3 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={1, 2} source=3 dest: 1}, { cond=(AND p2 (NOT p3) p0), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p3 p0), acceptance={2} source=3 dest: 3}, { cond=(AND p2 p3 p0), acceptance={0, 2} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40) s0), p3:(GT (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4545 reset in 606 ms.
Product exploration explored 100000 steps with 4545 reset in 615 ms.
Computed a total of 61 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 41
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 p2 (NOT p3) (NOT p0) (NOT p1)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p2 p3 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p3 p0))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (AND p2 p3 p0))), (X (X (NOT (AND p2 p3 p0))))]
Knowledge based reduction with 22 factoid took 1462 ms. Reduced automaton from 4 states, 21 edges and 4 AP (stutter sensitive) to 4 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), (AND p2 (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3)))]
Incomplete random walk after 10000 steps, including 454 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-17 10:41:43] [INFO ] Invariant cache hit.
[2023-03-17 10:41:43] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 10:41:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-17 10:41:43] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) (NOT p1)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p2 p3 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p2))), (G (NOT (AND p3 (NOT p0) p2))), (G (NOT (AND p3 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p3 p0))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (AND p2 p3 p0))), (X (X (NOT (AND p2 p3 p0)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p3 p0 p2)), (F (NOT (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0))))), (F (AND p3 p0 (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (F (AND (NOT p3) p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) p2))), (F (AND (NOT p3) p0 (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 26 factoid took 1813 ms. Reduced automaton from 4 states, 21 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[p2, p2, p2]
Stuttering acceptance computed with spot in 102 ms :[p2, p2, p2]
[2023-03-17 10:41:45] [INFO ] Invariant cache hit.
[2023-03-17 10:41:45] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-17 10:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-17 10:41:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:41:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned unsat
Proved EG p2
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) (NOT p1)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p2 p3 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p2))), (G (NOT (AND p3 (NOT p0) p2))), (G (NOT (AND p3 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p3 p0))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (AND p2 p3 p0))), (X (X (NOT (AND p2 p3 p0)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p3 p0 p2)), (F (NOT (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0))))), (F (AND p3 p0 (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (F (AND (NOT p3) p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) p2))), (F (AND (NOT p3) p0 (NOT p2))), (F (NOT (AND (NOT p1) p2))), (G p2)]
Property proved to be false thanks to negative knowledge :(G p2)
Knowledge based reduction with 26 factoid took 836 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0020-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLCardinality-07 finished in 6790 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(F(p0))||G(p1))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 7 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.0 ms
Discarding 54 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 7 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 7 transition count 7
Applied a total of 4 rules in 2 ms. Remains 7 /61 variables (removed 54) and now considering 7/41 (removed 34) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-17 10:41:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:41:46] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:41:46] [INFO ] Invariant cache hit.
[2023-03-17 10:41:46] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-17 10:41:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:41:46] [INFO ] Invariant cache hit.
[2023-03-17 10:41:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/61 places, 7/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 7/61 places, 7/41 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s5 0) (EQ s1 1)), p0:(AND (EQ s2 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 2 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-09 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(X(!p2)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))))))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 26 transition count 26
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 64 place count 12 transition count 12
Iterating global reduction 1 with 14 rules applied. Total rules applied 78 place count 12 transition count 12
Applied a total of 78 rules in 3 ms. Remains 12 /61 variables (removed 49) and now considering 12/41 (removed 29) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-17 10:41:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:41:47] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-17 10:41:47] [INFO ] Invariant cache hit.
[2023-03-17 10:41:47] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-17 10:41:47] [INFO ] Invariant cache hit.
[2023-03-17 10:41:47] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 12/61 places, 12/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 12/61 places, 12/41 transitions.
Stuttering acceptance computed with spot in 158 ms :[p0, (AND p0 p2), p0, p0, true]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s0 1)), p2:(OR (EQ s1 0) (EQ s5 1)), p0:(OR (EQ s2 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-11 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(X((X(p1) U G(p2)))))))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 24 transition count 24
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 70 place count 8 transition count 8
Iterating global reduction 1 with 16 rules applied. Total rules applied 86 place count 8 transition count 8
Applied a total of 86 rules in 2 ms. Remains 8 /61 variables (removed 53) and now considering 8/41 (removed 33) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-17 10:41:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:41:47] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 10:41:47] [INFO ] Invariant cache hit.
[2023-03-17 10:41:47] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-17 10:41:47] [INFO ] Invariant cache hit.
[2023-03-17 10:41:47] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/61 places, 8/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 8/61 places, 8/41 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}, { cond=p2, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 3}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s5 1), p2:(EQ s1 1), p1:(OR (EQ s2 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 3 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-13 finished in 363 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(p1))))'
Found a Lengthening insensitive property : Referendum-PT-0020-LTLCardinality-00
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 41 out of 61 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 41 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2023-03-17 10:41:47] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:41:47] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 10:41:47] [INFO ] Invariant cache hit.
[2023-03-17 10:41:47] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-17 10:41:47] [INFO ] Invariant cache hit.
[2023-03-17 10:41:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 95 ms. Remains : 41/61 places, 41/41 transitions.
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40)), p1:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4545 reset in 247 ms.
Product exploration explored 100000 steps with 4545 reset in 239 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 446 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 12 factoid took 429 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-17 10:41:49] [INFO ] Invariant cache hit.
[2023-03-17 10:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:41:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:49] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-17 10:41:49] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 10:41:49] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 10:41:49] [INFO ] Invariant cache hit.
[2023-03-17 10:41:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 10:41:49] [INFO ] Invariant cache hit.
[2023-03-17 10:41:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-17 10:41:49] [INFO ] Invariant cache hit.
[2023-03-17 10:41:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 41/41 places, 41/41 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 436 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 12 factoid took 526 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-17 10:41:51] [INFO ] Invariant cache hit.
[2023-03-17 10:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 10:41:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:41:51] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-17 10:41:51] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 10:41:51] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 62 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4545 reset in 229 ms.
Product exploration explored 100000 steps with 4545 reset in 242 ms.
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-17 10:41:51] [INFO ] Invariant cache hit.
[2023-03-17 10:41:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 10:41:51] [INFO ] Invariant cache hit.
[2023-03-17 10:41:51] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-17 10:41:51] [INFO ] Invariant cache hit.
[2023-03-17 10:41:51] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 41/41 places, 41/41 transitions.
Treatment of property Referendum-PT-0020-LTLCardinality-00 finished in 4208 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) U X((p1||X(X(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
[2023-03-17 10:41:52] [INFO ] Flatten gal took : 7 ms
[2023-03-17 10:41:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-17 10:41:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 61 places, 41 transitions and 101 arcs took 1 ms.
Total runtime 28020 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Referendum-PT-0020
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA Referendum-PT-0020-LTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0020-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0020-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679049713979

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 9 (type SKEL/SRCH) for 0 Referendum-PT-0020-LTLCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 9 (type SKEL/SRCH) for Referendum-PT-0020-LTLCardinality-00
lola: result : true
lola: markings : 254
lola: fired transitions : 464
lola: time used : 0.000000
lola: memory pages used : 1
lola: NOTDEADLOCKFREE
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: planning for Referendum-PT-0020-LTLCardinality-00 stopped (result already fixed).
lola: LAUNCH task # 7 (type EXCL) for 6 Referendum-PT-0020-LTLCardinality-06
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for Referendum-PT-0020-LTLCardinality-06
lola: result : false
lola: markings : 58158
lola: fired transitions : 385293
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 Referendum-PT-0020-LTLCardinality-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Referendum-PT-0020-LTLCardinality-03
lola: result : true
lola: markings : 2404
lola: fired transitions : 6243
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Referendum-PT-0020-LTLCardinality-00: LTL true skeleton: LTL model checker
Referendum-PT-0020-LTLCardinality-03: LTL true LTL model checker
Referendum-PT-0020-LTLCardinality-06: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-PT-0020"
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-0020, 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-167889199700483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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