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.r517-tall-167987243300011.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 itstools
Input is Anderson-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243300011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 185K Mar 31 16:48 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 Anderson-PT-05-LTLCardinality-00
FORMULA_NAME Anderson-PT-05-LTLCardinality-01
FORMULA_NAME Anderson-PT-05-LTLCardinality-02
FORMULA_NAME Anderson-PT-05-LTLCardinality-03
FORMULA_NAME Anderson-PT-05-LTLCardinality-04
FORMULA_NAME Anderson-PT-05-LTLCardinality-05
FORMULA_NAME Anderson-PT-05-LTLCardinality-06
FORMULA_NAME Anderson-PT-05-LTLCardinality-07
FORMULA_NAME Anderson-PT-05-LTLCardinality-08
FORMULA_NAME Anderson-PT-05-LTLCardinality-09
FORMULA_NAME Anderson-PT-05-LTLCardinality-10
FORMULA_NAME Anderson-PT-05-LTLCardinality-11
FORMULA_NAME Anderson-PT-05-LTLCardinality-12
FORMULA_NAME Anderson-PT-05-LTLCardinality-13
FORMULA_NAME Anderson-PT-05-LTLCardinality-14
FORMULA_NAME Anderson-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680841152782

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-07 04:19:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 04:19:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:19:14] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-04-07 04:19:14] [INFO ] Transformed 161 places.
[2023-04-07 04:19:14] [INFO ] Transformed 365 transitions.
[2023-04-07 04:19:14] [INFO ] Found NUPN structural information;
[2023-04-07 04:19:14] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-05-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 132 transition count 224
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 132 transition count 224
Applied a total of 58 rules in 30 ms. Remains 132 /161 variables (removed 29) and now considering 224/365 (removed 141) transitions.
// Phase 1: matrix 224 rows 132 cols
[2023-04-07 04:19:14] [INFO ] Computed 13 invariants in 20 ms
[2023-04-07 04:19:15] [INFO ] Implicit Places using invariants in 265 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/161 places, 224/365 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 326 ms. Remains : 131/161 places, 224/365 transitions.
Support contains 33 out of 131 places after structural reductions.
[2023-04-07 04:19:15] [INFO ] Flatten gal took : 40 ms
[2023-04-07 04:19:15] [INFO ] Flatten gal took : 24 ms
[2023-04-07 04:19:15] [INFO ] Input system was already deterministic with 224 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 131 cols
[2023-04-07 04:19:15] [INFO ] Computed 12 invariants in 14 ms
[2023-04-07 04:19:16] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:19:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-04-07 04:19:16] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2023-04-07 04:19:16] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:19:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:16] [INFO ] After 34ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:19:16] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 04:19:16] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 224/224 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 131 transition count 199
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 106 transition count 199
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 50 place count 106 transition count 180
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 88 place count 87 transition count 180
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 98 place count 77 transition count 122
Iterating global reduction 2 with 10 rules applied. Total rules applied 108 place count 77 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 76 transition count 121
Applied a total of 110 rules in 25 ms. Remains 76 /131 variables (removed 55) and now considering 121/224 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 76/131 places, 121/224 transitions.
Finished random walk after 2121 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=303 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Anderson-PT-05-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p1))&&G(p2))||p0)))'
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 224/224 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 123 transition count 192
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 123 transition count 192
Applied a total of 16 rules in 10 ms. Remains 123 /131 variables (removed 8) and now considering 192/224 (removed 32) transitions.
// Phase 1: matrix 192 rows 123 cols
[2023-04-07 04:19:16] [INFO ] Computed 12 invariants in 3 ms
[2023-04-07 04:19:16] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-04-07 04:19:16] [INFO ] Invariant cache hit.
[2023-04-07 04:19:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:16] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-04-07 04:19:16] [INFO ] Invariant cache hit.
[2023-04-07 04:19:17] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/131 places, 192/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 123/131 places, 192/224 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 287 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Anderson-PT-05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(OR (EQ s22 0) (EQ s73 1)), p0:(OR (EQ s20 0) (EQ s15 1)), p1:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLCardinality-00 finished in 1247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 224/224 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 121 transition count 166
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 121 transition count 166
Applied a total of 20 rules in 11 ms. Remains 121 /131 variables (removed 10) and now considering 166/224 (removed 58) transitions.
// Phase 1: matrix 166 rows 121 cols
[2023-04-07 04:19:17] [INFO ] Computed 12 invariants in 2 ms
[2023-04-07 04:19:17] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-04-07 04:19:17] [INFO ] Invariant cache hit.
[2023-04-07 04:19:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:18] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-04-07 04:19:18] [INFO ] Invariant cache hit.
[2023-04-07 04:19:18] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/131 places, 166/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 121/131 places, 166/224 transitions.
Stuttering acceptance computed with spot in 1711 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Anderson-PT-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s78 0) (EQ s57 1)), p0:(OR (EQ s35 0) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 82 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLCardinality-01 finished in 2438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 224/224 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 131 transition count 201
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 108 transition count 201
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 46 place count 108 transition count 181
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 86 place count 88 transition count 181
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 96 place count 78 transition count 131
Iterating global reduction 2 with 10 rules applied. Total rules applied 106 place count 78 transition count 131
Applied a total of 106 rules in 21 ms. Remains 78 /131 variables (removed 53) and now considering 131/224 (removed 93) transitions.
// Phase 1: matrix 131 rows 78 cols
[2023-04-07 04:19:20] [INFO ] Computed 12 invariants in 2 ms
[2023-04-07 04:19:20] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-04-07 04:19:20] [INFO ] Invariant cache hit.
[2023-04-07 04:19:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:20] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-04-07 04:19:20] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 04:19:20] [INFO ] Invariant cache hit.
[2023-04-07 04:19:20] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/131 places, 131/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 279 ms. Remains : 78/131 places, 131/224 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2737 reset in 126 ms.
Product exploration explored 100000 steps with 2911 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 290 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
[2023-04-07 04:19:21] [INFO ] Invariant cache hit.
[2023-04-07 04:19:21] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-07 04:19:21] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 8 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLCardinality-06 finished in 1690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(p1)))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 224/224 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 131 transition count 201
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 108 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 107 transition count 200
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 48 place count 107 transition count 182
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 84 place count 89 transition count 182
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 93 place count 80 transition count 133
Iterating global reduction 3 with 9 rules applied. Total rules applied 102 place count 80 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 79 transition count 132
Applied a total of 104 rules in 21 ms. Remains 79 /131 variables (removed 52) and now considering 132/224 (removed 92) transitions.
// Phase 1: matrix 132 rows 79 cols
[2023-04-07 04:19:21] [INFO ] Computed 12 invariants in 3 ms
[2023-04-07 04:19:22] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-04-07 04:19:22] [INFO ] Invariant cache hit.
[2023-04-07 04:19:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:22] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-04-07 04:19:22] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 04:19:22] [INFO ] Invariant cache hit.
[2023-04-07 04:19:22] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/131 places, 132/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 79/131 places, 132/224 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s18 1), p1:(AND (NOT (OR (EQ s28 0) (EQ s66 1))) (NEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 728 steps with 0 reset in 3 ms.
FORMULA Anderson-PT-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLCardinality-08 finished in 425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 224/224 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 120 transition count 165
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 120 transition count 165
Applied a total of 22 rules in 7 ms. Remains 120 /131 variables (removed 11) and now considering 165/224 (removed 59) transitions.
// Phase 1: matrix 165 rows 120 cols
[2023-04-07 04:19:22] [INFO ] Computed 12 invariants in 3 ms
[2023-04-07 04:19:22] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-04-07 04:19:22] [INFO ] Invariant cache hit.
[2023-04-07 04:19:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:22] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-04-07 04:19:22] [INFO ] Invariant cache hit.
[2023-04-07 04:19:22] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/131 places, 165/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 120/131 places, 165/224 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLCardinality-09 finished in 718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 224/224 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 120 transition count 165
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 120 transition count 165
Applied a total of 22 rules in 3 ms. Remains 120 /131 variables (removed 11) and now considering 165/224 (removed 59) transitions.
[2023-04-07 04:19:23] [INFO ] Invariant cache hit.
[2023-04-07 04:19:23] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-04-07 04:19:23] [INFO ] Invariant cache hit.
[2023-04-07 04:19:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:23] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-04-07 04:19:23] [INFO ] Invariant cache hit.
[2023-04-07 04:19:23] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/131 places, 165/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 120/131 places, 165/224 transitions.
Stuttering acceptance computed with spot in 548 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s69 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 119 ms.
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLCardinality-11 finished in 1194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||X(p1)))))'
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 224/224 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 120 transition count 165
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 120 transition count 165
Applied a total of 22 rules in 8 ms. Remains 120 /131 variables (removed 11) and now considering 165/224 (removed 59) transitions.
[2023-04-07 04:19:24] [INFO ] Invariant cache hit.
[2023-04-07 04:19:24] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 04:19:24] [INFO ] Invariant cache hit.
[2023-04-07 04:19:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:24] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-04-07 04:19:24] [INFO ] Invariant cache hit.
[2023-04-07 04:19:24] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/131 places, 165/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 120/131 places, 165/224 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s83 0) (EQ s12 1)), p1:(AND (NOT (OR (EQ s76 0) (EQ s113 1))) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22 reset in 98 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA Anderson-PT-05-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLCardinality-12 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)&&p0))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 224/224 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 121 transition count 166
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 121 transition count 166
Applied a total of 20 rules in 3 ms. Remains 121 /131 variables (removed 10) and now considering 166/224 (removed 58) transitions.
// Phase 1: matrix 166 rows 121 cols
[2023-04-07 04:19:24] [INFO ] Computed 12 invariants in 1 ms
[2023-04-07 04:19:24] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-04-07 04:19:24] [INFO ] Invariant cache hit.
[2023-04-07 04:19:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:25] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-04-07 04:19:25] [INFO ] Invariant cache hit.
[2023-04-07 04:19:25] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/131 places, 166/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 121/131 places, 166/224 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s60 0) (EQ s35 1)), p0:(AND (NEQ s66 0) (NEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 127 reset in 94 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA Anderson-PT-05-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLCardinality-14 finished in 566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0&&G(p1)))&&G(p2))))'
Support contains 6 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 224/224 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 124 transition count 185
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 124 transition count 185
Applied a total of 14 rules in 4 ms. Remains 124 /131 variables (removed 7) and now considering 185/224 (removed 39) transitions.
// Phase 1: matrix 185 rows 124 cols
[2023-04-07 04:19:25] [INFO ] Computed 12 invariants in 1 ms
[2023-04-07 04:19:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-04-07 04:19:25] [INFO ] Invariant cache hit.
[2023-04-07 04:19:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:25] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-04-07 04:19:25] [INFO ] Invariant cache hit.
[2023-04-07 04:19:25] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/131 places, 185/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 124/131 places, 185/224 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=p2, acceptance={0, 1} source=0 dest: 1}, { cond=p2, acceptance={1} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 0}, { cond=p2, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NEQ s17 0) (NEQ s119 1)), p0:(OR (EQ s40 0) (EQ s20 1)), p1:(OR (EQ s14 0) (EQ s46 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 10 factoid took 249 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 04:19:27] [INFO ] Invariant cache hit.
[2023-04-07 04:19:27] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:19:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-04-07 04:19:27] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 5 ms returned sat
[2023-04-07 04:19:27] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-04-07 04:19:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:27] [INFO ] After 27ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-04-07 04:19:27] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 04:19:27] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 185/185 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 124 transition count 162
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 101 transition count 162
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 46 place count 101 transition count 143
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 84 place count 82 transition count 143
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 80 transition count 133
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 80 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 79 transition count 132
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 79 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 78 transition count 131
Applied a total of 92 rules in 16 ms. Remains 78 /124 variables (removed 46) and now considering 131/185 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 78/124 places, 131/185 transitions.
Finished random walk after 709 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=88 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p2)), (F (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 852 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 1782 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 185/185 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-04-07 04:19:30] [INFO ] Invariant cache hit.
[2023-04-07 04:19:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 04:19:30] [INFO ] Invariant cache hit.
[2023-04-07 04:19:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 04:19:30] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-04-07 04:19:30] [INFO ] Invariant cache hit.
[2023-04-07 04:19:30] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 124/124 places, 185/185 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 10 factoid took 310 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 6) seen :4
Finished Best-First random walk after 231 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=115 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1 p2)), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) p2)), (F (OR (AND (NOT p0) (NOT p2)) (NOT p1)))]
Knowledge based reduction with 10 factoid took 423 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 127 ms.
Built C files in :
/tmp/ltsmin7865285563434686295
[2023-04-07 04:19:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7865285563434686295
Running compilation step : cd /tmp/ltsmin7865285563434686295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 396 ms.
Running link step : cd /tmp/ltsmin7865285563434686295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7865285563434686295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4828486761812133483.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA Anderson-PT-05-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-05-LTLCardinality-15 finished in 8002 ms.
All properties solved by simple procedures.
Total runtime 18950 ms.

BK_STOP 1680841186481

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Anderson-PT-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Anderson-PT-05, 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 r517-tall-167987243300011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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