About the Execution of 2023-gold for FireWire-PT-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
453.392 | 14191.00 | 29441.00 | 370.60 | TFFFTFFFFTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910200107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FireWire-PT-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 84K Jun 2 16:33 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 FireWire-PT-01-LTLCardinality-00
FORMULA_NAME FireWire-PT-01-LTLCardinality-01
FORMULA_NAME FireWire-PT-01-LTLCardinality-02
FORMULA_NAME FireWire-PT-01-LTLCardinality-03
FORMULA_NAME FireWire-PT-01-LTLCardinality-04
FORMULA_NAME FireWire-PT-01-LTLCardinality-05
FORMULA_NAME FireWire-PT-01-LTLCardinality-06
FORMULA_NAME FireWire-PT-01-LTLCardinality-07
FORMULA_NAME FireWire-PT-01-LTLCardinality-08
FORMULA_NAME FireWire-PT-01-LTLCardinality-09
FORMULA_NAME FireWire-PT-01-LTLCardinality-10
FORMULA_NAME FireWire-PT-01-LTLCardinality-11
FORMULA_NAME FireWire-PT-01-LTLCardinality-12
FORMULA_NAME FireWire-PT-01-LTLCardinality-13
FORMULA_NAME FireWire-PT-01-LTLCardinality-14
FORMULA_NAME FireWire-PT-01-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717369024791
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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-01
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:57:06] [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]
[2024-06-02 22:57:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:57:06] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-06-02 22:57:06] [INFO ] Transformed 107 places.
[2024-06-02 22:57:06] [INFO ] Transformed 346 transitions.
[2024-06-02 22:57:06] [INFO ] Found NUPN structural information;
[2024-06-02 22:57:06] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 128 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.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-01-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 293/293 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 291
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 106 transition count 285
Applied a total of 8 rules in 22 ms. Remains 106 /107 variables (removed 1) and now considering 285/293 (removed 8) transitions.
[2024-06-02 22:57:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 106 cols
[2024-06-02 22:57:06] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 22:57:06] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-02 22:57:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:57:06] [INFO ] Invariant cache hit.
[2024-06-02 22:57:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:57:07] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-06-02 22:57:07] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:57:07] [INFO ] Invariant cache hit.
[2024-06-02 22:57:07] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/107 places, 285/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 630 ms. Remains : 106/107 places, 285/293 transitions.
Support contains 24 out of 106 places after structural reductions.
[2024-06-02 22:57:07] [INFO ] Flatten gal took : 48 ms
[2024-06-02 22:57:07] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:57:07] [INFO ] Input system was already deterministic with 285 transitions.
Incomplete random walk after 10000 steps, including 521 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 167 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-06-02 22:57:08] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 22:57:08] [INFO ] Invariant cache hit.
[2024-06-02 22:57:08] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:57:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:57:08] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-06-02 22:57:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:57:08] [INFO ] After 86ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-06-02 22:57:08] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 5 ms to minimize.
[2024-06-02 22:57:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-06-02 22:57:08] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-06-02 22:57:08] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 285/285 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 105 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 105 transition count 280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 104 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 101 transition count 271
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 101 transition count 271
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 98 transition count 265
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 98 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 96 transition count 269
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 96 transition count 265
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 96 transition count 263
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 96 transition count 264
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 35 place count 94 transition count 262
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 94 transition count 259
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 94 transition count 283
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 42 place count 93 transition count 281
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 56 place count 93 transition count 267
Applied a total of 56 rules in 134 ms. Remains 93 /106 variables (removed 13) and now considering 267/285 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 93/106 places, 267/285 transitions.
Incomplete random walk after 10000 steps, including 608 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Finished probabilistic random walk after 836471 steps, run visited all 3 properties in 2167 ms. (steps per millisecond=386 )
Probabilistic random walk after 836471 steps, saw 174127 distinct states, run finished after 2169 ms. (steps per millisecond=385 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
FORMULA FireWire-PT-01-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA FireWire-PT-01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 7 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' '!(G((X(G(p0))||F(p1))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 285/285 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 104 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 104 transition count 279
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 102 transition count 275
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 102 transition count 275
Applied a total of 8 rules in 6 ms. Remains 102 /106 variables (removed 4) and now considering 275/285 (removed 10) transitions.
[2024-06-02 22:57:11] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 102 cols
[2024-06-02 22:57:11] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 22:57:11] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 22:57:11] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 22:57:11] [INFO ] Invariant cache hit.
[2024-06-02 22:57:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:57:11] [INFO ] Implicit Places using invariants and state equation in 249 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 361 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/106 places, 275/285 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 371 ms. Remains : 101/106 places, 275/285 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 257 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-01-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s2 0) (EQ s55 1)), p0:(OR (EQ s6 0) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 164 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 552 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:57:12] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 101 cols
[2024-06-02 22:57:12] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:57:12] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:57:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:57:12] [INFO ] After 27ms SMT Verify possible using all constraints in natural 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-01-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-01-LTLCardinality-00 finished in 1281 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 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 104 transition count 282
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 103 transition count 282
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 101 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 101 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 99 transition count 272
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 99 transition count 272
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 96 transition count 279
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 96 transition count 273
Applied a total of 24 rules in 33 ms. Remains 96 /106 variables (removed 10) and now considering 273/285 (removed 12) transitions.
[2024-06-02 22:57:12] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 96 cols
[2024-06-02 22:57:12] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:57:12] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:57:12] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 22:57:12] [INFO ] Invariant cache hit.
[2024-06-02 22:57:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:57:12] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 192 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/106 places, 273/285 transitions.
Applied a total of 0 rules in 7 ms. Remains 95 /95 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 95/106 places, 273/285 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLCardinality-01 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 s75 0) (EQ s12 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 0 reset in 83 ms.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1134 steps, including 68 resets, run visited all 1 properties in 4 ms. (steps per millisecond=283 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 273/273 transitions.
Applied a total of 0 rules in 10 ms. Remains 95 /95 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2024-06-02 22:57:13] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 95 cols
[2024-06-02 22:57:13] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:57:13] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:57:13] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 22:57:13] [INFO ] Invariant cache hit.
[2024-06-02 22:57:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:57:13] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-02 22:57:13] [INFO ] Redundant transitions in 11 ms returned []
[2024-06-02 22:57:13] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 22:57:13] [INFO ] Invariant cache hit.
[2024-06-02 22:57:13] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 95/95 places, 273/273 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 662 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished Best-First random walk after 9268 steps, including 128 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1544 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 43 ms.
Product exploration explored 100000 steps with 1 reset in 54 ms.
Built C files in :
/tmp/ltsmin16485030021847776162
[2024-06-02 22:57:14] [INFO ] Computing symmetric may disable matrix : 273 transitions.
[2024-06-02 22:57:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:57:14] [INFO ] Computing symmetric may enable matrix : 273 transitions.
[2024-06-02 22:57:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:57:14] [INFO ] Computing Do-Not-Accords matrix : 273 transitions.
[2024-06-02 22:57:14] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:57:14] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16485030021847776162
Running compilation step : cd /tmp/ltsmin16485030021847776162;'/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 597 ms.
Running link step : cd /tmp/ltsmin16485030021847776162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16485030021847776162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9279877214373196058.hoa' '--buchi-type=spotba'
LTSmin run took 366 ms.
FORMULA FireWire-PT-01-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-01-LTLCardinality-01 finished in 3025 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(G(p0))&&(X(F(p1)) U (X(X(p0))&&p2))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 285/285 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 103 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 100 transition count 270
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 100 transition count 270
Applied a total of 12 rules in 5 ms. Remains 100 /106 variables (removed 6) and now considering 270/285 (removed 15) transitions.
[2024-06-02 22:57:15] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 100 cols
[2024-06-02 22:57:15] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:57:15] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:57:15] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 22:57:15] [INFO ] Invariant cache hit.
[2024-06-02 22:57:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:57:15] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/106 places, 270/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 99/106 places, 270/285 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (OR (EQ s93 0) (EQ s92 1)) (EQ s80 1)), p0:(OR (EQ s93 0) (EQ s92 1)), p1:(EQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-01-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLCardinality-03 finished in 379 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((X(p0)||G(p1))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 285/285 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 103 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 102 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 102 transition count 274
Applied a total of 8 rules in 5 ms. Remains 102 /106 variables (removed 4) and now considering 274/285 (removed 11) transitions.
[2024-06-02 22:57:15] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
// Phase 1: matrix 248 rows 102 cols
[2024-06-02 22:57:15] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:57:16] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:57:16] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2024-06-02 22:57:16] [INFO ] Invariant cache hit.
[2024-06-02 22:57:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:57:16] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 204 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/106 places, 274/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 101/106 places, 274/285 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-01-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (NEQ s60 0) (NEQ s43 1)), p0:(OR (AND (EQ s35 0) (EQ s57 1)) (EQ s88 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 107 ms.
Product exploration explored 100000 steps with 1 reset in 75 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 122 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 556 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 132 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 156 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 22:57:16] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
// Phase 1: matrix 248 rows 101 cols
[2024-06-02 22:57:16] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:57:17] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:57:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:57:17] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-06-02 22:57:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:57:17] [INFO ] After 37ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-06-02 22:57:17] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-06-02 22:57:17] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 274/274 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 100 transition count 269
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 99 transition count 269
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 96 transition count 276
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19 place count 96 transition count 270
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 96 transition count 267
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 96 transition count 270
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 29 place count 94 transition count 267
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 94 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 93 transition count 264
Applied a total of 32 rules in 62 ms. Remains 93 /101 variables (removed 8) and now considering 264/274 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 93/101 places, 264/274 transitions.
Incomplete random walk after 10000 steps, including 630 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3911 steps, run visited all 2 properties in 25 ms. (steps per millisecond=156 )
Probabilistic random walk after 3911 steps, saw 1916 distinct states, run finished after 25 ms. (steps per millisecond=156 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 14 factoid took 235 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-01-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-01-LTLCardinality-06 finished in 1775 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(G(p0)))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 104 transition count 282
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 103 transition count 282
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 101 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 101 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 99 transition count 272
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 99 transition count 272
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 96 transition count 279
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 96 transition count 273
Applied a total of 24 rules in 25 ms. Remains 96 /106 variables (removed 10) and now considering 273/285 (removed 12) transitions.
[2024-06-02 22:57:17] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 96 cols
[2024-06-02 22:57:17] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 22:57:17] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:57:17] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 22:57:17] [INFO ] Invariant cache hit.
[2024-06-02 22:57:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:57:17] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 181 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/106 places, 273/285 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 95/106 places, 273/285 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s20 0) (NEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-01-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLCardinality-14 finished in 264 ms.
All properties solved by simple procedures.
Total runtime 11687 ms.
BK_STOP 1717369038982
--------------------
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="FireWire-PT-01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FireWire-PT-01, 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 r571-tall-171734910200107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-01.tgz
mv FireWire-PT-01 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 '
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 ;