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.r087-tall-171620521400062.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 CANInsertWithFailure-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 698K May 18 16:42 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 CANInsertWithFailure-PT-010-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716223547189

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=CANInsertWithFailure-PT-010
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 16:45:48] [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-05-20 16:45:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:45:52] [INFO ] Load time of PNML (sax parser for PT used): 4024 ms
[2024-05-20 16:45:52] [INFO ] Transformed 324 places.
[2024-05-20 16:45:52] [INFO ] Transformed 660 transitions.
[2024-05-20 16:45:52] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 4094 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 6 formulas.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Applied a total of 0 rules in 30 ms. Remains 324 /324 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 324 cols
[2024-05-20 16:45:53] [INFO ] Computed 13 invariants in 27 ms
[2024-05-20 16:45:53] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-20 16:45:53] [INFO ] Invariant cache hit.
[2024-05-20 16:45:53] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:45:53] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2024-05-20 16:45:53] [INFO ] Invariant cache hit.
[2024-05-20 16:45:53] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1005 ms. Remains : 324/324 places, 660/660 transitions.
Support contains 36 out of 324 places after structural reductions.
[2024-05-20 16:45:54] [INFO ] Flatten gal took : 62 ms
[2024-05-20 16:45:54] [INFO ] Flatten gal took : 32 ms
[2024-05-20 16:45:54] [INFO ] Input system was already deterministic with 660 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:45:54] [INFO ] Invariant cache hit.
[2024-05-20 16:45:54] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-20 16:45:54] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-20 16:45:54] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:45:54] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:45:54] [INFO ] After 44ms SMT Verify possible using 190 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:45:54] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:45:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-20 16:45:54] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 16:45:55] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:45:55] [INFO ] After 77ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:45:55] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-20 16:45:55] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 319 place count 164 transition count 501
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 2 with 71 rules applied. Total rules applied 390 place count 164 transition count 430
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 164 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 163 transition count 429
Partial Free-agglomeration rule applied 111 times.
Drop transitions removed 111 transitions
Iterating global reduction 3 with 111 rules applied. Total rules applied 503 place count 163 transition count 429
Applied a total of 503 rules in 109 ms. Remains 163 /324 variables (removed 161) and now considering 429/660 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 163/324 places, 429/660 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1464797 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :{}
Probabilistic random walk after 1464797 steps, saw 193327 distinct states, run finished after 3002 ms. (steps per millisecond=487 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 429 rows 163 cols
[2024-05-20 16:45:58] [INFO ] Computed 12 invariants in 10 ms
[2024-05-20 16:45:58] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 16:45:58] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-20 16:45:58] [INFO ] After 90ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:45:58] [INFO ] State equation strengthened by 397 read => feed constraints.
[2024-05-20 16:45:58] [INFO ] After 42ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:45:58] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:45:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 16:45:58] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 16:45:58] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:45:58] [INFO ] After 50ms SMT Verify possible using 397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:45:58] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-20 16:45:58] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 429/429 transitions.
Applied a total of 0 rules in 10 ms. Remains 163 /163 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 163/163 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 429/429 transitions.
Applied a total of 0 rules in 9 ms. Remains 163 /163 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-05-20 16:45:58] [INFO ] Invariant cache hit.
[2024-05-20 16:45:59] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-20 16:45:59] [INFO ] Invariant cache hit.
[2024-05-20 16:45:59] [INFO ] State equation strengthened by 397 read => feed constraints.
[2024-05-20 16:45:59] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-20 16:45:59] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-20 16:45:59] [INFO ] Invariant cache hit.
[2024-05-20 16:45:59] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 869 ms. Remains : 163/163 places, 429/429 transitions.
Graph (trivial) has 366 edges and 163 vertex of which 119 / 163 are part of one of the 2 SCC in 2 ms
Free SCC test removed 117 places
Drop transitions removed 278 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 380 transitions.
Graph (complete) has 111 edges and 46 vertex of which 15 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 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 22 rules applied. Total rules applied 24 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 14 transition count 18
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 6 transition count 10
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 4 transition count 5
Applied a total of 47 rules in 10 ms. Remains 4 /163 variables (removed 159) and now considering 5/429 (removed 424) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-20 16:45:59] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 16:45:59] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:45:59] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:45:59] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:45:59] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 43 stabilizing places and 70 stable transitions
Graph (complete) has 1152 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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))'
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 1152 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 321 place count 163 transition count 500
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 2 with 72 rules applied. Total rules applied 393 place count 163 transition count 428
Applied a total of 393 rules in 42 ms. Remains 163 /324 variables (removed 161) and now considering 428/660 (removed 232) transitions.
// Phase 1: matrix 428 rows 163 cols
[2024-05-20 16:46:00] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 16:46:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-20 16:46:00] [INFO ] Invariant cache hit.
[2024-05-20 16:46:00] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-20 16:46:00] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-20 16:46:00] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-20 16:46:00] [INFO ] Invariant cache hit.
[2024-05-20 16:46:00] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/324 places, 428/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 613 ms. Remains : 163/324 places, 428/660 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 172 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s158 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 79 steps with 1 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-01 finished in 859 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 X(p0))))'
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 4 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 16:46:00] [INFO ] Computed 12 invariants in 6 ms
[2024-05-20 16:46:01] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-20 16:46:01] [INFO ] Invariant cache hit.
[2024-05-20 16:46:01] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:01] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-20 16:46:01] [INFO ] Invariant cache hit.
[2024-05-20 16:46:01] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 770 ms. Remains : 323/324 places, 660/660 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(LEQ s165 s291)], 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 33333 reset in 319 ms.
Product exploration explored 100000 steps with 33333 reset in 291 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-02 finished in 1612 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(F((p0||G(p1)))) U p0)))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 7 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
[2024-05-20 16:46:02] [INFO ] Invariant cache hit.
[2024-05-20 16:46:02] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-20 16:46:02] [INFO ] Invariant cache hit.
[2024-05-20 16:46:02] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:03] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-20 16:46:03] [INFO ] Invariant cache hit.
[2024-05-20 16:46:03] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 776 ms. Remains : 323/324 places, 660/660 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s217 s71), p1:(LEQ 1 s125)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 371 ms.
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-03 finished in 1752 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 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 1152 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 317 place count 165 transition count 502
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 2 with 70 rules applied. Total rules applied 387 place count 165 transition count 432
Applied a total of 387 rules in 33 ms. Remains 165 /324 variables (removed 159) and now considering 432/660 (removed 228) transitions.
// Phase 1: matrix 432 rows 165 cols
[2024-05-20 16:46:04] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 16:46:04] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-20 16:46:04] [INFO ] Invariant cache hit.
[2024-05-20 16:46:04] [INFO ] State equation strengthened by 286 read => feed constraints.
[2024-05-20 16:46:04] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2024-05-20 16:46:04] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-20 16:46:04] [INFO ] Invariant cache hit.
[2024-05-20 16:46:04] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/324 places, 432/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 601 ms. Remains : 165/324 places, 432/660 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s74 s152)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-04 finished in 702 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((G(p0)||(p0&&F(p1))))))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 324 cols
[2024-05-20 16:46:05] [INFO ] Computed 13 invariants in 3 ms
[2024-05-20 16:46:05] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-20 16:46:05] [INFO ] Invariant cache hit.
[2024-05-20 16:46:05] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:05] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-20 16:46:05] [INFO ] Invariant cache hit.
[2024-05-20 16:46:05] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 789 ms. Remains : 324/324 places, 660/660 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), 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}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT s2 s153), p1:(GT s262 s316)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1513 steps with 6 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-06 finished in 948 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(F(p0))||G(p1))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 9 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 16:46:05] [INFO ] Computed 12 invariants in 6 ms
[2024-05-20 16:46:06] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-20 16:46:06] [INFO ] Invariant cache hit.
[2024-05-20 16:46:06] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:06] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2024-05-20 16:46:06] [INFO ] Invariant cache hit.
[2024-05-20 16:46:06] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 323/324 places, 660/660 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s109 s302), p1:(AND (LEQ 1 s181) (LEQ s14 s133))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 337 ms.
Product exploration explored 100000 steps with 33333 reset in 320 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-07 finished in 1705 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(G((p0 U X((G(p2)||p1)))))))'
Support contains 7 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 3 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
[2024-05-20 16:46:07] [INFO ] Invariant cache hit.
[2024-05-20 16:46:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-20 16:46:07] [INFO ] Invariant cache hit.
[2024-05-20 16:46:07] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:08] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-20 16:46:08] [INFO ] Invariant cache hit.
[2024-05-20 16:46:08] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 323/324 places, 660/660 transitions.
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s150 s147), p1:(OR (LEQ s55 s251) (LEQ s71 s264)), p2:(LEQ 2 s113)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19980 reset in 224 ms.
Product exploration explored 100000 steps with 20042 reset in 226 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 45 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:46:09] [INFO ] Invariant cache hit.
[2024-05-20 16:46:09] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:46:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 16:46:09] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 16:46:09] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:46:09] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:10] [INFO ] After 75ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:46:10] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-20 16:46:10] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 323 transition count 593
Reduce places removed 67 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 69 rules applied. Total rules applied 136 place count 256 transition count 591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 254 transition count 590
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 140 place count 253 transition count 590
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 282 place count 182 transition count 519
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 3 with 55 rules applied. Total rules applied 337 place count 182 transition count 464
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 338 place count 182 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 339 place count 181 transition count 463
Partial Free-agglomeration rule applied 131 times.
Drop transitions removed 131 transitions
Iterating global reduction 4 with 131 rules applied. Total rules applied 470 place count 181 transition count 463
Applied a total of 470 rules in 53 ms. Remains 181 /323 variables (removed 142) and now considering 463/660 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 181/323 places, 463/660 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1250866 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :{}
Probabilistic random walk after 1250866 steps, saw 168198 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 181 cols
[2024-05-20 16:46:13] [INFO ] Computed 12 invariants in 2 ms
[2024-05-20 16:46:13] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:46:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 16:46:13] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 16:46:13] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:46:13] [INFO ] State equation strengthened by 370 read => feed constraints.
[2024-05-20 16:46:13] [INFO ] After 57ms SMT Verify possible using 370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:46:13] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-20 16:46:13] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 463/463 transitions.
Applied a total of 0 rules in 10 ms. Remains 181 /181 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 181/181 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 463/463 transitions.
Applied a total of 0 rules in 5 ms. Remains 181 /181 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2024-05-20 16:46:13] [INFO ] Invariant cache hit.
[2024-05-20 16:46:13] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-20 16:46:13] [INFO ] Invariant cache hit.
[2024-05-20 16:46:13] [INFO ] State equation strengthened by 370 read => feed constraints.
[2024-05-20 16:46:14] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2024-05-20 16:46:14] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-20 16:46:14] [INFO ] Invariant cache hit.
[2024-05-20 16:46:14] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 767 ms. Remains : 181/181 places, 463/463 transitions.
Graph (trivial) has 336 edges and 181 vertex of which 102 / 181 are part of one of the 2 SCC in 0 ms
Free SCC test removed 100 places
Drop transitions removed 219 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 303 transitions.
Graph (complete) has 234 edges and 81 vertex of which 52 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 52 transition count 119
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 53 place count 34 transition count 84
Iterating global reduction 1 with 18 rules applied. Total rules applied 71 place count 34 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 34 transition count 78
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 29 transition count 68
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 29 transition count 68
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 92 place count 29 transition count 63
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 94 place count 28 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 26 transition count 63
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 107 place count 26 transition count 54
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 26 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 25 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 109 place count 25 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 111 place count 24 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 112 place count 23 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 23 transition count 51
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 5 with 2 rules applied. Total rules applied 115 place count 22 transition count 50
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 117 place count 22 transition count 48
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 120 place count 20 transition count 47
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 121 place count 20 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 122 place count 19 transition count 46
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 124 place count 19 transition count 46
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 125 place count 19 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 126 place count 18 transition count 44
Applied a total of 126 rules in 18 ms. Remains 18 /181 variables (removed 163) and now considering 44/463 (removed 419) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 18 cols
[2024-05-20 16:46:14] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 16:46:14] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:46:14] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:46:14] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 16:46:14] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0 p2)), (F p2), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 16:46:15] [INFO ] Computed 12 invariants in 10 ms
[2024-05-20 16:46:15] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-20 16:46:15] [INFO ] Invariant cache hit.
[2024-05-20 16:46:15] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:15] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2024-05-20 16:46:15] [INFO ] Invariant cache hit.
[2024-05-20 16:46:16] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 805 ms. Remains : 323/323 places, 660/660 transitions.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 931 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:46:17] [INFO ] Invariant cache hit.
[2024-05-20 16:46:17] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:46:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 16:46:17] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 16:46:17] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:46:17] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:17] [INFO ] After 80ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:46:17] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-20 16:46:17] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 323 transition count 593
Reduce places removed 67 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 69 rules applied. Total rules applied 136 place count 256 transition count 591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 254 transition count 590
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 140 place count 253 transition count 590
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 282 place count 182 transition count 519
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 3 with 55 rules applied. Total rules applied 337 place count 182 transition count 464
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 338 place count 182 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 339 place count 181 transition count 463
Partial Free-agglomeration rule applied 131 times.
Drop transitions removed 131 transitions
Iterating global reduction 4 with 131 rules applied. Total rules applied 470 place count 181 transition count 463
Applied a total of 470 rules in 63 ms. Remains 181 /323 variables (removed 142) and now considering 463/660 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 181/323 places, 463/660 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1217708 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :{}
Probabilistic random walk after 1217708 steps, saw 163531 distinct states, run finished after 3001 ms. (steps per millisecond=405 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 181 cols
[2024-05-20 16:46:20] [INFO ] Computed 12 invariants in 7 ms
[2024-05-20 16:46:20] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:46:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 16:46:20] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 16:46:21] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:46:21] [INFO ] State equation strengthened by 370 read => feed constraints.
[2024-05-20 16:46:21] [INFO ] After 73ms SMT Verify possible using 370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 16:46:21] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-20 16:46:21] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 463/463 transitions.
Applied a total of 0 rules in 9 ms. Remains 181 /181 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 181/181 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 181 /181 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2024-05-20 16:46:21] [INFO ] Invariant cache hit.
[2024-05-20 16:46:21] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-20 16:46:21] [INFO ] Invariant cache hit.
[2024-05-20 16:46:21] [INFO ] State equation strengthened by 370 read => feed constraints.
[2024-05-20 16:46:21] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2024-05-20 16:46:21] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-20 16:46:21] [INFO ] Invariant cache hit.
[2024-05-20 16:46:22] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 939 ms. Remains : 181/181 places, 463/463 transitions.
Graph (trivial) has 336 edges and 181 vertex of which 102 / 181 are part of one of the 2 SCC in 0 ms
Free SCC test removed 100 places
Drop transitions removed 219 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 303 transitions.
Graph (complete) has 234 edges and 81 vertex of which 52 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 52 transition count 119
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 53 place count 34 transition count 84
Iterating global reduction 1 with 18 rules applied. Total rules applied 71 place count 34 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 34 transition count 78
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 29 transition count 68
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 29 transition count 68
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 92 place count 29 transition count 63
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 94 place count 28 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 26 transition count 63
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 107 place count 26 transition count 54
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 26 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 25 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 109 place count 25 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 111 place count 24 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 112 place count 23 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 23 transition count 51
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 5 with 2 rules applied. Total rules applied 115 place count 22 transition count 50
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 117 place count 22 transition count 48
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 120 place count 20 transition count 47
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 121 place count 20 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 122 place count 19 transition count 46
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 124 place count 19 transition count 46
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 125 place count 19 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 126 place count 18 transition count 44
Applied a total of 126 rules in 30 ms. Remains 18 /181 variables (removed 163) and now considering 44/463 (removed 419) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 18 cols
[2024-05-20 16:46:22] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 16:46:22] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:46:22] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:46:22] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 16:46:22] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0 p2)), (F p2), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 256 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 19994 reset in 228 ms.
Product exploration explored 100000 steps with 20057 reset in 232 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 323 transition count 660
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 49 place count 323 transition count 660
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 323 transition count 660
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 80 place count 303 transition count 640
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 100 place count 303 transition count 640
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 167 place count 303 transition count 736
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 205 place count 265 transition count 698
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 243 place count 265 transition count 698
Deduced a syphon composed of 69 places in 0 ms
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 1 with 42 rules applied. Total rules applied 285 place count 265 transition count 656
Deduced a syphon composed of 69 places in 0 ms
Applied a total of 285 rules in 42 ms. Remains 265 /323 variables (removed 58) and now considering 656/660 (removed 4) transitions.
[2024-05-20 16:46:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 656 rows 265 cols
[2024-05-20 16:46:24] [INFO ] Computed 12 invariants in 5 ms
[2024-05-20 16:46:24] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 265/323 places, 656/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 298 ms. Remains : 265/323 places, 656/660 transitions.
Built C files in :
/tmp/ltsmin2544432156957219518
[2024-05-20 16:46:24] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2544432156957219518
Running compilation step : cd /tmp/ltsmin2544432156957219518;'/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 954 ms.
Running link step : cd /tmp/ltsmin2544432156957219518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2544432156957219518;'/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/stateBased6639080928270328309.hoa' '--buchi-type=spotba'
LTSmin run took 307 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-09 finished in 18236 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((G(F(p0))&&F(p1)))))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 7 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 16:46:25] [INFO ] Computed 12 invariants in 4 ms
[2024-05-20 16:46:26] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-20 16:46:26] [INFO ] Invariant cache hit.
[2024-05-20 16:46:26] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:26] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-20 16:46:26] [INFO ] Invariant cache hit.
[2024-05-20 16:46:26] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 323/324 places, 660/660 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 s150), p1:(LEQ s61 s216)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 284 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-10 finished in 1065 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)) U (p1&&F(G((p2||X(p3)))))))'
Support contains 7 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 8 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
[2024-05-20 16:46:27] [INFO ] Invariant cache hit.
[2024-05-20 16:46:27] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-20 16:46:27] [INFO ] Invariant cache hit.
[2024-05-20 16:46:27] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:27] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-20 16:46:27] [INFO ] Invariant cache hit.
[2024-05-20 16:46:27] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 323/324 places, 660/660 transitions.
Stuttering acceptance computed with spot in 1112 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s81 s275), p2:(GT s8 s264), p0:(GT s129 s61), p3:(GT 1 s294)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-12 finished in 1908 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(G(p0))||F(p1))))'
Support contains 7 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 4 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
[2024-05-20 16:46:28] [INFO ] Invariant cache hit.
[2024-05-20 16:46:28] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-20 16:46:28] [INFO ] Invariant cache hit.
[2024-05-20 16:46:29] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 16:46:29] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-20 16:46:29] [INFO ] Invariant cache hit.
[2024-05-20 16:46:29] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 753 ms. Remains : 323/324 places, 660/660 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), 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: 3}]], initial=1, aps=[p1:(OR (LEQ s34 s0) (GT s26 s104)), p0:(OR (GT s195 s190) (LEQ 2 s66))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Product exploration explored 100000 steps with 50000 reset in 363 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (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 knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-13 finished in 1670 ms.
All properties solved by simple procedures.
Total runtime 41853 ms.

BK_STOP 1716223602553

--------------------
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="CANInsertWithFailure-PT-010"
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 CANInsertWithFailure-PT-010, 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 r087-tall-171620521400062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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