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.r071-smll-167814397500067.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 CSRepetitions-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397500067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 36K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 202K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 91K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 381K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 504K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 87K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-00
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-01
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-02
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-03
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-04
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-05
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-06
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-07
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-08
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-09
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-10
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-11
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-12
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-13
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-14
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678232746510

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=CSRepetitions-PT-04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 23:45:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-07 23:45:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 23:45:50] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-03-07 23:45:50] [INFO ] Transformed 117 places.
[2023-03-07 23:45:50] [INFO ] Transformed 176 transitions.
[2023-03-07 23:45:50] [INFO ] Parsed PT model containing 117 places and 176 transitions and 624 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-PT-04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2023-03-07 23:45:51] [INFO ] Computed 20 place invariants in 22 ms
[2023-03-07 23:45:51] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-07 23:45:51] [INFO ] Invariant cache hit.
[2023-03-07 23:45:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:45:51] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2023-03-07 23:45:51] [INFO ] Invariant cache hit.
[2023-03-07 23:45:51] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 962 ms. Remains : 117/117 places, 176/176 transitions.
Support contains 101 out of 117 places after structural reductions.
[2023-03-07 23:45:52] [INFO ] Flatten gal took : 87 ms
[2023-03-07 23:45:52] [INFO ] Flatten gal took : 41 ms
[2023-03-07 23:45:52] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 729 ms. (steps per millisecond=13 ) properties (out of 28) seen :25
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-07 23:45:53] [INFO ] Invariant cache hit.
[2023-03-07 23:45:53] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-07 23:45:53] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA CSRepetitions-PT-04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 16 stable transitions
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(G(p1))||p0))))'
Support contains 100 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:45:54] [INFO ] Invariant cache hit.
[2023-03-07 23:45:54] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-07 23:45:54] [INFO ] Invariant cache hit.
[2023-03-07 23:45:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:45:54] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-07 23:45:54] [INFO ] Invariant cache hit.
[2023-03-07 23:45:54] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 563 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LEQ (ADD s3 s8 s15 s31 s39 s52 s53 s57 s64 s91 s92 s98 s99 s113 s114 s116) (ADD s1 s4 s6 s7 s10 s12 s16 s17 s19 s20 s22 s23 s24 s26 s27 s30 s33 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1835 reset in 1149 ms.
Product exploration explored 100000 steps with 1835 reset in 865 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 125 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 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
[2023-03-07 23:45:57] [INFO ] Invariant cache hit.
[2023-03-07 23:45:57] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-07 23:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:45:58] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-07 23:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:45:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-07 23:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:45:58] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-07 23:45:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:45:58] [INFO ] [Nat]Added 16 Read/Feed constraints in 13 ms returned sat
[2023-03-07 23:45:58] [INFO ] Computed and/alt/rep : 160/224/160 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-07 23:45:58] [INFO ] Added : 7 causal constraints over 2 iterations in 129 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 16 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 21 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:45:58] [INFO ] Invariant cache hit.
[2023-03-07 23:45:58] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-07 23:45:58] [INFO ] Invariant cache hit.
[2023-03-07 23:45:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:45:58] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-07 23:45:59] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-07 23:45:59] [INFO ] Invariant cache hit.
[2023-03-07 23:45:59] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 491 ms. Remains : 117/117 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 149 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 37 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 2 factoid took 162 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 p1)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p1)]
[2023-03-07 23:45:59] [INFO ] Invariant cache hit.
[2023-03-07 23:45:59] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-07 23:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:46:00] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-07 23:46:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:46:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-07 23:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:46:00] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-07 23:46:00] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 9 ms returned sat
[2023-03-07 23:46:00] [INFO ] Computed and/alt/rep : 160/224/160 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-07 23:46:00] [INFO ] Added : 7 causal constraints over 2 iterations in 115 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1821 reset in 587 ms.
Stack based approach found an accepted trace after 43603 steps with 800 reset with depth 4 and stack size 4 in 162 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-00 finished in 7335 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((G(p0)||(p1&&G(p2)))))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:01] [INFO ] Invariant cache hit.
[2023-03-07 23:46:01] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-07 23:46:01] [INFO ] Invariant cache hit.
[2023-03-07 23:46:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:01] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-07 23:46:01] [INFO ] Invariant cache hit.
[2023-03-07 23:46:01] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 577 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GT 2 s115) (GT 3 (ADD s2 s9 s25 s97))), p1:(GT 2 s115), p2:(AND (GT 3 (ADD s2 s9 s25 s97)) (GT 2 (ADD s2 s9 s25 s97)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-01 finished in 885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G(p1)) U X(X(X(!p2)))))'
Support contains 84 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:02] [INFO ] Invariant cache hit.
[2023-03-07 23:46:02] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-07 23:46:02] [INFO ] Invariant cache hit.
[2023-03-07 23:46:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:02] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-07 23:46:02] [INFO ] Invariant cache hit.
[2023-03-07 23:46:02] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 538 ms :[p2, (AND (NOT p0) p1 p2), p2, (AND (NOT p0) p1 p2), p2, (AND p1 (NOT p0) p2), p2, (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=true, acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 7}], [{ cond=p2, acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 7}, { cond=p2, acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 2 (ADD s1 s4 s6 s7 s10 s12 s16 s17 s19 s20 s22 s23 s24 s26 s27 s30 s33 s35 s36 s37 s38 s40 s41 s43 s44 s47 s49 s51 s56 s59 s60 s61 s62 s65 s66 s67...], 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]]
Product exploration explored 100000 steps with 36346 reset in 872 ms.
Product exploration explored 100000 steps with 36347 reset in 599 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 342 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 479 ms :[p2, p2, p2, (AND p2 (NOT p0) p1), p2, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:46:05] [INFO ] Invariant cache hit.
[2023-03-07 23:46:05] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-07 23:46:05] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND p2 (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1), (F (AND p2 (NOT p0) p1)), (F p2)]
Knowledge based reduction with 7 factoid took 584 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[false, false, false, (AND (NOT p0) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 394 ms :[false, false, false, (AND (NOT p0) p2), p2, (NOT p0), (NOT p1)]
Support contains 84 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:07] [INFO ] Invariant cache hit.
[2023-03-07 23:46:07] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-07 23:46:07] [INFO ] Invariant cache hit.
[2023-03-07 23:46:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:07] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-07 23:46:07] [INFO ] Invariant cache hit.
[2023-03-07 23:46:07] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 517 ms. Remains : 117/117 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[p2, p2, p2, (AND (NOT p0) p2), p2, (NOT p0), (NOT p1)]
Finished random walk after 1519 steps, including 33 resets, run visited all 5 properties in 13 ms. (steps per millisecond=116 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p2)), (F p0), (F p2)]
Knowledge based reduction with 3 factoid took 358 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[p2, p2, p2, (AND (NOT p0) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 407 ms :[p2, p2, p2, (AND (NOT p0) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 428 ms :[p2, p2, p2, (AND (NOT p0) p2), p2, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 418 ms.
Product exploration explored 100000 steps with 25000 reset in 446 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 429 ms :[p2, p2, p2, (AND (NOT p0) p2), p2, (NOT p0), (NOT p1)]
Support contains 84 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:11] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-07 23:46:11] [INFO ] Invariant cache hit.
[2023-03-07 23:46:12] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 352 ms. Remains : 117/117 places, 176/176 transitions.
Support contains 84 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:12] [INFO ] Invariant cache hit.
[2023-03-07 23:46:12] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-07 23:46:12] [INFO ] Invariant cache hit.
[2023-03-07 23:46:12] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:12] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-07 23:46:12] [INFO ] Invariant cache hit.
[2023-03-07 23:46:12] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 117/117 places, 176/176 transitions.
Treatment of property CSRepetitions-PT-04-LTLCardinality-02 finished in 10423 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)||G((p1 U p2)))))'
Support contains 36 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:12] [INFO ] Invariant cache hit.
[2023-03-07 23:46:12] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-07 23:46:12] [INFO ] Invariant cache hit.
[2023-03-07 23:46:12] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:13] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-07 23:46:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-07 23:46:13] [INFO ] Invariant cache hit.
[2023-03-07 23:46:13] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 589 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s3 s8 s15 s31 s39 s52 s53 s57 s64 s91 s92 s98 s99 s113 s114 s116)), p2:(LEQ (ADD s2 s9 s25 s97) (ADD s5 s11 s13 s18 s28 s34 s42 s45 s48 s50...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3510 reset in 1195 ms.
Product exploration explored 100000 steps with 3500 reset in 1013 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 760 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-07 23:46:16] [INFO ] Invariant cache hit.
[2023-03-07 23:46:17] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 23:46:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-07 23:46:17] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (OR (AND p0 p1) (AND p0 p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))]
Knowledge based reduction with 15 factoid took 1022 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[false, false]
Stuttering acceptance computed with spot in 104 ms :[false, false]
Support contains 36 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:18] [INFO ] Invariant cache hit.
[2023-03-07 23:46:18] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-07 23:46:18] [INFO ] Invariant cache hit.
[2023-03-07 23:46:18] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:18] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-07 23:46:18] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-07 23:46:18] [INFO ] Invariant cache hit.
[2023-03-07 23:46:19] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 623 ms. Remains : 117/117 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p1 (NOT p2))))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p1 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 521 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[false, false]
Finished random walk after 35 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p1 (NOT p2))))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p1 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (OR (AND p0 p2) (AND p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 9 factoid took 654 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[false, false]
Stuttering acceptance computed with spot in 106 ms :[false, false]
Stuttering acceptance computed with spot in 239 ms :[false, false]
Product exploration explored 100000 steps with 3516 reset in 934 ms.
Product exploration explored 100000 steps with 3517 reset in 620 ms.
Support contains 36 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:22] [INFO ] Invariant cache hit.
[2023-03-07 23:46:22] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-07 23:46:22] [INFO ] Invariant cache hit.
[2023-03-07 23:46:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:22] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-07 23:46:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-07 23:46:22] [INFO ] Invariant cache hit.
[2023-03-07 23:46:22] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 573 ms. Remains : 117/117 places, 176/176 transitions.
Treatment of property CSRepetitions-PT-04-LTLCardinality-03 finished in 10335 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 80 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:23] [INFO ] Invariant cache hit.
[2023-03-07 23:46:23] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-07 23:46:23] [INFO ] Invariant cache hit.
[2023-03-07 23:46:23] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:23] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-07 23:46:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 23:46:23] [INFO ] Invariant cache hit.
[2023-03-07 23:46:23] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 464 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s5 s11 s13 s18 s28 s34 s42 s45 s48 s50 s54 s55 s63 s82 s95 s108)) (LEQ 1 (ADD s1 s4 s6 s7 s10 s12 s16 s17 s19 s20 s22 s23 s24 s26 s27 s...], 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 500 ms.
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-04-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-04-LTLCardinality-04 finished in 1468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 80 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:24] [INFO ] Invariant cache hit.
[2023-03-07 23:46:24] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-07 23:46:24] [INFO ] Invariant cache hit.
[2023-03-07 23:46:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:24] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-07 23:46:24] [INFO ] Invariant cache hit.
[2023-03-07 23:46:24] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s3 s8 s15 s31 s39 s52 s53 s57 s64 s91 s92 s98 s99 s113 s114 s116) (ADD s1 s4 s6 s7 s10 s12 s16 s17 s19 s20 s22 s23 s24 s26 s27 s30 s33 s35 s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 471 ms.
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-04-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-04-LTLCardinality-06 finished in 1612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1) U X(p2))))'
Support contains 69 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-07 23:46:26] [INFO ] Invariant cache hit.
[2023-03-07 23:46:26] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-07 23:46:26] [INFO ] Invariant cache hit.
[2023-03-07 23:46:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:26] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-07 23:46:26] [INFO ] Invariant cache hit.
[2023-03-07 23:46:26] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 521 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s115 (ADD s2 s9 s25 s97)), p0:(LEQ 3 (ADD s1 s4 s6 s7 s10 s12 s16 s17 s19 s20 s22 s23 s24 s26 s27 s30 s33 s35 s36 s37 s38 s40 s41 s43 s44 s47 s49 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 601 ms.
Product exploration explored 100000 steps with 50000 reset in 402 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 12 factoid took 247 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-04-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-04-LTLCardinality-07 finished in 2179 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 U X(p1))||G(p2)))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 87 transition count 161
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 99 place count 33 transition count 107
Iterating global reduction 0 with 54 rules applied. Total rules applied 153 place count 33 transition count 107
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 162 place count 24 transition count 62
Iterating global reduction 0 with 9 rules applied. Total rules applied 171 place count 24 transition count 62
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 180 place count 24 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 186 place count 21 transition count 50
Applied a total of 186 rules in 34 ms. Remains 21 /117 variables (removed 96) and now considering 50/176 (removed 126) transitions.
[2023-03-07 23:46:28] [INFO ] Flow matrix only has 40 transitions (discarded 10 similar events)
// Phase 1: matrix 40 rows 21 cols
[2023-03-07 23:46:28] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-07 23:46:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 23:46:28] [INFO ] Flow matrix only has 40 transitions (discarded 10 similar events)
[2023-03-07 23:46:28] [INFO ] Invariant cache hit.
[2023-03-07 23:46:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 23:46:28] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-07 23:46:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 23:46:28] [INFO ] Flow matrix only has 40 transitions (discarded 10 similar events)
[2023-03-07 23:46:28] [INFO ] Invariant cache hit.
[2023-03-07 23:46:28] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/117 places, 50/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 21/117 places, 50/176 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ s20 s17), p1:(LEQ s2 s11)], 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 3738 reset in 444 ms.
Stack based approach found an accepted trace after 484 steps with 15 reset with depth 12 and stack size 12 in 3 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-08 finished in 784 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((G(p0) U p1)))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 87 transition count 161
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 100 place count 32 transition count 106
Iterating global reduction 0 with 55 rules applied. Total rules applied 155 place count 32 transition count 106
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 166 place count 21 transition count 51
Iterating global reduction 0 with 11 rules applied. Total rules applied 177 place count 21 transition count 51
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 188 place count 21 transition count 40
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 196 place count 17 transition count 36
Applied a total of 196 rules in 21 ms. Remains 17 /117 variables (removed 100) and now considering 36/176 (removed 140) transitions.
[2023-03-07 23:46:29] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
// Phase 1: matrix 25 rows 17 cols
[2023-03-07 23:46:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-07 23:46:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 23:46:29] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
[2023-03-07 23:46:29] [INFO ] Invariant cache hit.
[2023-03-07 23:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 23:46:29] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-07 23:46:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 23:46:29] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
[2023-03-07 23:46:29] [INFO ] Invariant cache hit.
[2023-03-07 23:46:29] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/117 places, 36/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 17/117 places, 36/176 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s8 s4), p0:(LEQ 1 s16)], 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]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-10 finished in 348 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 U (G(p0)||(p0&&(G(p1) U p2)))))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2023-03-07 23:46:29] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-07 23:46:29] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-07 23:46:29] [INFO ] Invariant cache hit.
[2023-03-07 23:46:29] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 23:46:29] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-07 23:46:29] [INFO ] Invariant cache hit.
[2023-03-07 23:46:29] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 330 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p1:(OR (LEQ 1 s2) (LEQ s82 s103)), p2:(LEQ s82 s103), p0:(GT s9 s95)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-12 finished in 909 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)||G(p1)))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 87 transition count 161
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 101 place count 31 transition count 105
Iterating global reduction 0 with 56 rules applied. Total rules applied 157 place count 31 transition count 105
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 168 place count 20 transition count 50
Iterating global reduction 0 with 11 rules applied. Total rules applied 179 place count 20 transition count 50
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 190 place count 20 transition count 39
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 196 place count 17 transition count 36
Applied a total of 196 rules in 24 ms. Remains 17 /117 variables (removed 100) and now considering 36/176 (removed 140) transitions.
[2023-03-07 23:46:30] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
// Phase 1: matrix 28 rows 17 cols
[2023-03-07 23:46:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-07 23:46:30] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-07 23:46:30] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
[2023-03-07 23:46:30] [INFO ] Invariant cache hit.
[2023-03-07 23:46:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 23:46:30] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-07 23:46:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 23:46:30] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
[2023-03-07 23:46:30] [INFO ] Invariant cache hit.
[2023-03-07 23:46:30] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/117 places, 36/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 17/117 places, 36/176 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s1 s16), p0:(GT s13 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-13 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G(p1)) U X(X(X(!p2)))))'
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)||G((p1 U p2)))))'
[2023-03-07 23:46:31] [INFO ] Flatten gal took : 29 ms
[2023-03-07 23:46:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-07 23:46:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 176 transitions and 624 arcs took 7 ms.
Total runtime 40761 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CSRepetitions-PT-04
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA CSRepetitions-PT-04-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678232817553

--------------------
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:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 CSRepetitions-PT-04-LTLCardinality-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CSRepetitions-PT-04-LTLCardinality-02
lola: result : true
lola: markings : 9977
lola: fired transitions : 38720
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 CSRepetitions-PT-04-LTLCardinality-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-PT-04-LTLCardinality-02: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3600 7/32 CSRepetitions-PT-04-LTLCardinality-03 974726 m, 194945 m/sec, 2072828 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-PT-04-LTLCardinality-02: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3600 12/32 CSRepetitions-PT-04-LTLCardinality-03 1701837 m, 145422 m/sec, 4259564 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-PT-04-LTLCardinality-02: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3600 19/32 CSRepetitions-PT-04-LTLCardinality-03 2767480 m, 213128 m/sec, 6134821 t fired, .

Time elapsed: 15 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-PT-04-LTLCardinality-02: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3600 26/32 CSRepetitions-PT-04-LTLCardinality-03 3739836 m, 194471 m/sec, 7872561 t fired, .

Time elapsed: 20 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for CSRepetitions-PT-04-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-PT-04-LTLCardinality-02: LTL true LTL model checker

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-PT-04-LTLCardinality-02: LTL true LTL model checker
CSRepetitions-PT-04-LTLCardinality-03: LTL unknown AGGR


Time elapsed: 25 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="CSRepetitions-PT-04"
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 CSRepetitions-PT-04, 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 r071-smll-167814397500067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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