Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100724.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K Feb 26 00:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 00:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.6M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678660323266

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:32:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 22:32:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:32:05] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2023-03-12 22:32:05] [INFO ] Transformed 2164 places.
[2023-03-12 22:32:05] [INFO ] Transformed 5580 transitions.
[2023-03-12 22:32:05] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2163 transition count 5580
Applied a total of 1 rules in 334 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-12 22:32:06] [INFO ] Computed 32 place invariants in 235 ms
[2023-03-12 22:32:07] [INFO ] Implicit Places using invariants in 1339 ms returned []
[2023-03-12 22:32:07] [INFO ] Invariant cache hit.
[2023-03-12 22:32:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:32:09] [INFO ] Implicit Places using invariants and state equation in 2399 ms returned []
Implicit Place search using SMT with State Equation took 3774 ms to find 0 implicit places.
[2023-03-12 22:32:09] [INFO ] Invariant cache hit.
[2023-03-12 22:32:12] [INFO ] Dead Transitions using invariants and state equation in 2844 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2163/2164 places, 5580/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6959 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 35 out of 2163 places after structural reductions.
[2023-03-12 22:32:13] [INFO ] Flatten gal took : 303 ms
[2023-03-12 22:32:13] [INFO ] Flatten gal took : 193 ms
[2023-03-12 22:32:13] [INFO ] Input system was already deterministic with 5580 transitions.
Support contains 33 out of 2163 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 23) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 22:32:14] [INFO ] Invariant cache hit.
[2023-03-12 22:32:15] [INFO ] [Real]Absence check using 30 positive place invariants in 33 ms returned sat
[2023-03-12 22:32:15] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 29 ms returned sat
[2023-03-12 22:32:18] [INFO ] After 2911ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-12 22:32:18] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:32:19] [INFO ] After 1485ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 22:32:19] [INFO ] After 5083ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 22:32:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2023-03-12 22:32:20] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-12 22:32:23] [INFO ] After 3062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 22:32:28] [INFO ] After 4689ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 22:32:30] [INFO ] After 7071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1575 ms.
[2023-03-12 22:32:32] [INFO ] After 12507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 3 properties in 83 ms.
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 7 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2969 place count 1085 transition count 3689
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2971 place count 1083 transition count 3689
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 3 with 930 rules applied. Total rules applied 3901 place count 1083 transition count 3689
Applied a total of 3901 rules in 1181 ms. Remains 1083 /2163 variables (removed 1080) and now considering 3689/5580 (removed 1891) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1194 ms. Remains : 1083/2163 places, 3689/5580 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3689 rows 1083 cols
[2023-03-12 22:32:33] [INFO ] Computed 32 place invariants in 44 ms
[2023-03-12 22:32:34] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-12 22:32:34] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-12 22:32:34] [INFO ] After 826ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 22:32:35] [INFO ] State equation strengthened by 3596 read => feed constraints.
[2023-03-12 22:32:35] [INFO ] After 448ms SMT Verify possible using 3596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:32:35] [INFO ] After 1582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:32:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-12 22:32:35] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-12 22:32:36] [INFO ] After 841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:32:36] [INFO ] After 332ms SMT Verify possible using 3596 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:32:37] [INFO ] After 527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-12 22:32:37] [INFO ] After 1678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 2 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!(X(p0)&&p1) U !p1))))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 2 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 717 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-12 22:32:38] [INFO ] Computed 32 place invariants in 42 ms
[2023-03-12 22:32:38] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-12 22:32:38] [INFO ] Invariant cache hit.
[2023-03-12 22:32:39] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-12 22:32:45] [INFO ] Implicit Places using invariants and state equation in 6082 ms returned []
Implicit Place search using SMT with State Equation took 6679 ms to find 0 implicit places.
[2023-03-12 22:32:45] [INFO ] Redundant transitions in 351 ms returned []
[2023-03-12 22:32:45] [INFO ] Invariant cache hit.
[2023-03-12 22:32:46] [INFO ] Dead Transitions using invariants and state equation in 1436 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9193 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 169 ms :[p1, p1]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s582 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]]
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-00 finished in 9446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 2163 transition count 5373
Reduce places removed 207 places and 0 transitions.
Iterating post reduction 1 with 207 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 414 place count 1956 transition count 5372
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 416 place count 1955 transition count 5372
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 2 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 2 with 1736 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2963 place count 1087 transition count 3693
Applied a total of 2963 rules in 504 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3693/5580 (removed 1887) transitions.
// Phase 1: matrix 3693 rows 1087 cols
[2023-03-12 22:32:47] [INFO ] Computed 32 place invariants in 52 ms
[2023-03-12 22:32:48] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-12 22:32:48] [INFO ] Invariant cache hit.
[2023-03-12 22:32:48] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-12 22:32:54] [INFO ] Implicit Places using invariants and state equation in 6704 ms returned []
Implicit Place search using SMT with State Equation took 7245 ms to find 0 implicit places.
[2023-03-12 22:32:55] [INFO ] Redundant transitions in 251 ms returned []
[2023-03-12 22:32:55] [INFO ] Invariant cache hit.
[2023-03-12 22:32:56] [INFO ] Dead Transitions using invariants and state equation in 1484 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1087/2163 places, 3693/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9493 ms. Remains : 1087/2163 places, 3693/5580 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s460 1) (AND (GEQ s95 1) (GEQ s176 1))), p1:(OR (LT s126 1) (LT s596 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 141 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-01 finished in 9647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(G(p2)&&p1))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 65 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-12 22:32:56] [INFO ] Computed 32 place invariants in 143 ms
[2023-03-12 22:32:57] [INFO ] Implicit Places using invariants in 1097 ms returned []
[2023-03-12 22:32:57] [INFO ] Invariant cache hit.
[2023-03-12 22:32:58] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:33:00] [INFO ] Implicit Places using invariants and state equation in 2314 ms returned []
Implicit Place search using SMT with State Equation took 3418 ms to find 0 implicit places.
[2023-03-12 22:33:00] [INFO ] Invariant cache hit.
[2023-03-12 22:33:02] [INFO ] Dead Transitions using invariants and state equation in 2549 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6038 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LT s1575 1) (OR (LT s119 1) (LT s362 1))), p2:(OR (LT s161 1) (LT s1895 1)), p0:(OR (LT s119 1) (LT s362 1))], 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]]
Product exploration explored 100000 steps with 50000 reset in 2080 ms.
Product exploration explored 100000 steps with 50000 reset in 2107 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p2 p0)
Knowledge based reduction with 9 factoid took 346 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-030-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-02 finished in 10747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 2 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 485 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-12 22:33:07] [INFO ] Computed 32 place invariants in 51 ms
[2023-03-12 22:33:08] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-12 22:33:08] [INFO ] Invariant cache hit.
[2023-03-12 22:33:09] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-12 22:33:15] [INFO ] Implicit Places using invariants and state equation in 6540 ms returned []
Implicit Place search using SMT with State Equation took 7116 ms to find 0 implicit places.
[2023-03-12 22:33:15] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-12 22:33:15] [INFO ] Invariant cache hit.
[2023-03-12 22:33:16] [INFO ] Dead Transitions using invariants and state equation in 1404 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9113 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s592 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 652 reset in 828 ms.
Stack based approach found an accepted trace after 901 steps with 5 reset with depth 69 and stack size 69 in 8 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-04 finished in 10005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 74 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-12 22:33:17] [INFO ] Computed 32 place invariants in 135 ms
[2023-03-12 22:33:18] [INFO ] Implicit Places using invariants in 902 ms returned []
[2023-03-12 22:33:18] [INFO ] Invariant cache hit.
[2023-03-12 22:33:19] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:33:20] [INFO ] Implicit Places using invariants and state equation in 2087 ms returned []
Implicit Place search using SMT with State Equation took 2991 ms to find 0 implicit places.
[2023-03-12 22:33:20] [INFO ] Invariant cache hit.
[2023-03-12 22:33:22] [INFO ] Dead Transitions using invariants and state equation in 2398 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5466 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (LT s135 1) (OR (LT s133 1) (LT s1717 1))), p0:(OR (LT s672 1) (LT s49 1) (LT s427 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 141 reset in 610 ms.
Product exploration explored 100000 steps with 140 reset in 717 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 386 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 22:33:25] [INFO ] Invariant cache hit.
[2023-03-12 22:33:25] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2023-03-12 22:33:25] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-12 22:33:27] [INFO ] After 1666ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 22:33:27] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:33:27] [INFO ] After 574ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:33:27] [INFO ] After 2616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:33:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2023-03-12 22:33:28] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 19 ms returned sat
[2023-03-12 22:33:30] [INFO ] After 1958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:33:33] [INFO ] After 3049ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:33:34] [INFO ] After 3805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 454 ms.
[2023-03-12 22:33:34] [INFO ] After 6710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 2 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 2964 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 4 with 930 rules applied. Total rules applied 3897 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 3927 place count 1085 transition count 3691
Applied a total of 3927 rules in 776 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 777 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 173990 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173990 steps, saw 31561 distinct states, run finished after 3003 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2023-03-12 22:33:38] [INFO ] Computed 32 place invariants in 59 ms
[2023-03-12 22:33:38] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-12 22:33:38] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-12 22:33:39] [INFO ] After 966ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 22:33:39] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-12 22:33:40] [INFO ] After 643ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:33:40] [INFO ] After 1831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:33:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-12 22:33:40] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-12 22:33:41] [INFO ] After 1054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:33:42] [INFO ] After 1035ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:33:43] [INFO ] After 1771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 395 ms.
[2023-03-12 22:33:43] [INFO ] After 3465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 81 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 78 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2023-03-12 22:33:44] [INFO ] Invariant cache hit.
[2023-03-12 22:33:45] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2023-03-12 22:33:45] [INFO ] Invariant cache hit.
[2023-03-12 22:33:46] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-12 22:34:08] [INFO ] Implicit Places using invariants and state equation in 23807 ms returned []
Implicit Place search using SMT with State Equation took 24862 ms to find 0 implicit places.
[2023-03-12 22:34:09] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-12 22:34:09] [INFO ] Invariant cache hit.
[2023-03-12 22:34:10] [INFO ] Dead Transitions using invariants and state equation in 1488 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26550 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 5 ms
Free SCC test removed 924 places
Drop transitions removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 24 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2023-03-12 22:34:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 22:34:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 22:34:10] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:34:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 22:34:10] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:34:10] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 22:34:10] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 367 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 101 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-12 22:34:11] [INFO ] Computed 32 place invariants in 107 ms
[2023-03-12 22:34:12] [INFO ] Implicit Places using invariants in 1083 ms returned []
[2023-03-12 22:34:12] [INFO ] Invariant cache hit.
[2023-03-12 22:34:13] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:34:14] [INFO ] Implicit Places using invariants and state equation in 2414 ms returned []
Implicit Place search using SMT with State Equation took 3500 ms to find 0 implicit places.
[2023-03-12 22:34:14] [INFO ] Invariant cache hit.
[2023-03-12 22:34:17] [INFO ] Dead Transitions using invariants and state equation in 2355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5959 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 316 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 22:34:18] [INFO ] Invariant cache hit.
[2023-03-12 22:34:18] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2023-03-12 22:34:18] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-12 22:34:20] [INFO ] After 1718ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 22:34:20] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:34:20] [INFO ] After 594ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:34:20] [INFO ] After 2706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:34:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2023-03-12 22:34:21] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-12 22:34:23] [INFO ] After 1940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:34:26] [INFO ] After 3109ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:34:27] [INFO ] After 4174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 585 ms.
[2023-03-12 22:34:27] [INFO ] After 7095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 2 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 2964 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 4 with 930 rules applied. Total rules applied 3897 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 3927 place count 1085 transition count 3691
Applied a total of 3927 rules in 733 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 174125 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174125 steps, saw 31585 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2023-03-12 22:34:32] [INFO ] Computed 32 place invariants in 35 ms
[2023-03-12 22:34:32] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-12 22:34:32] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-12 22:34:33] [INFO ] After 860ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 22:34:33] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-12 22:34:33] [INFO ] After 600ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:34:33] [INFO ] After 1696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:34:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-12 22:34:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-12 22:34:35] [INFO ] After 1029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:34:36] [INFO ] After 1023ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:34:36] [INFO ] After 1706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 490 ms.
[2023-03-12 22:34:37] [INFO ] After 3500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 91 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 77 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2023-03-12 22:34:37] [INFO ] Invariant cache hit.
[2023-03-12 22:34:38] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2023-03-12 22:34:38] [INFO ] Invariant cache hit.
[2023-03-12 22:34:39] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-12 22:34:57] [INFO ] Implicit Places using invariants and state equation in 18573 ms returned []
Implicit Place search using SMT with State Equation took 19676 ms to find 0 implicit places.
[2023-03-12 22:34:57] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-12 22:34:57] [INFO ] Invariant cache hit.
[2023-03-12 22:34:58] [INFO ] Dead Transitions using invariants and state equation in 1558 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21443 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 1 ms
Free SCC test removed 924 places
Drop transitions removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 10 ms. Remains 19 /1085 variables (removed 1066) and now considering 32/3691 (removed 3659) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 19 cols
[2023-03-12 22:34:58] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 22:34:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 22:34:58] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:34:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-12 22:34:58] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:34:58] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 22:34:58] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 316 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 140 reset in 635 ms.
Product exploration explored 100000 steps with 138 reset in 587 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 2163 transition count 5580
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 147 place count 2163 transition count 5580
Deduced a syphon composed of 178 places in 2 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 178 place count 2163 transition count 5580
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 236 place count 2105 transition count 5522
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 294 place count 2105 transition count 5522
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: -1678
Deduced a syphon composed of 1017 places in 2 ms
Iterating global reduction 1 with 897 rules applied. Total rules applied 1191 place count 2105 transition count 7200
Discarding 115 places :
Symmetric choice reduction at 1 with 115 rule applications. Total rules 1306 place count 1990 transition count 7085
Deduced a syphon composed of 902 places in 1 ms
Iterating global reduction 1 with 115 rules applied. Total rules applied 1421 place count 1990 transition count 7085
Deduced a syphon composed of 902 places in 1 ms
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 1 with 811 rules applied. Total rules applied 2232 place count 1990 transition count 6274
Deduced a syphon composed of 902 places in 2 ms
Applied a total of 2232 rules in 1440 ms. Remains 1990 /2163 variables (removed 173) and now considering 6274/5580 (removed -694) transitions.
[2023-03-12 22:35:03] [INFO ] Redundant transitions in 480 ms returned []
// Phase 1: matrix 6274 rows 1990 cols
[2023-03-12 22:35:03] [INFO ] Computed 32 place invariants in 147 ms
[2023-03-12 22:35:06] [INFO ] Dead Transitions using invariants and state equation in 3119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1990/2163 places, 6274/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5085 ms. Remains : 1990/2163 places, 6274/5580 transitions.
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 69 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-12 22:35:06] [INFO ] Computed 32 place invariants in 120 ms
[2023-03-12 22:35:07] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2023-03-12 22:35:07] [INFO ] Invariant cache hit.
[2023-03-12 22:35:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:35:09] [INFO ] Implicit Places using invariants and state equation in 2448 ms returned []
Implicit Place search using SMT with State Equation took 3531 ms to find 0 implicit places.
[2023-03-12 22:35:09] [INFO ] Invariant cache hit.
[2023-03-12 22:35:12] [INFO ] Dead Transitions using invariants and state equation in 2371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5989 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 115200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1||X(G(p1))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 99 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:35:12] [INFO ] Invariant cache hit.
[2023-03-12 22:35:13] [INFO ] Implicit Places using invariants in 819 ms returned []
[2023-03-12 22:35:13] [INFO ] Invariant cache hit.
[2023-03-12 22:35:14] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:35:15] [INFO ] Implicit Places using invariants and state equation in 2073 ms returned []
Implicit Place search using SMT with State Equation took 2893 ms to find 0 implicit places.
[2023-03-12 22:35:15] [INFO ] Invariant cache hit.
[2023-03-12 22:35:17] [INFO ] Dead Transitions using invariants and state equation in 2333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5330 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 123 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-030-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s157 1)), p1:(AND (GEQ s250 1) (GEQ s287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 939 steps with 42 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-06 finished in 5488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F(p1))))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 77 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:35:18] [INFO ] Invariant cache hit.
[2023-03-12 22:35:18] [INFO ] Implicit Places using invariants in 755 ms returned []
[2023-03-12 22:35:18] [INFO ] Invariant cache hit.
[2023-03-12 22:35:19] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:35:20] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 2715 ms to find 0 implicit places.
[2023-03-12 22:35:20] [INFO ] Invariant cache hit.
[2023-03-12 22:35:23] [INFO ] Dead Transitions using invariants and state equation in 2143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4938 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1414 1), p0:(LT s1002 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 769 steps with 1 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-07 finished in 5091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||X(p2))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 77 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:35:23] [INFO ] Invariant cache hit.
[2023-03-12 22:35:24] [INFO ] Implicit Places using invariants in 753 ms returned []
[2023-03-12 22:35:24] [INFO ] Invariant cache hit.
[2023-03-12 22:35:24] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:35:26] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 2884 ms to find 0 implicit places.
[2023-03-12 22:35:26] [INFO ] Invariant cache hit.
[2023-03-12 22:35:28] [INFO ] Dead Transitions using invariants and state equation in 2275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5240 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s687 1), p1:(AND (GEQ s96 1) (GEQ s133 1)), p2:(GEQ s430 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 756 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-08 finished in 5417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 73 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-12 22:35:28] [INFO ] Invariant cache hit.
[2023-03-12 22:35:29] [INFO ] Implicit Places using invariants in 922 ms returned []
[2023-03-12 22:35:29] [INFO ] Invariant cache hit.
[2023-03-12 22:35:30] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 22:35:31] [INFO ] Implicit Places using invariants and state equation in 1978 ms returned []
Implicit Place search using SMT with State Equation took 2902 ms to find 0 implicit places.
[2023-03-12 22:35:31] [INFO ] Invariant cache hit.
[2023-03-12 22:35:34] [INFO ] Dead Transitions using invariants and state equation in 2478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5454 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s217 1) (GEQ s973 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-09 finished in 5629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 2 with 1736 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 2 with 810 rules applied. Total rules applied 2966 place count 1085 transition count 3692
Applied a total of 2966 rules in 351 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3692/5580 (removed 1888) transitions.
// Phase 1: matrix 3692 rows 1085 cols
[2023-03-12 22:35:34] [INFO ] Computed 32 place invariants in 37 ms
[2023-03-12 22:35:35] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-12 22:35:35] [INFO ] Invariant cache hit.
[2023-03-12 22:35:35] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-12 22:35:41] [INFO ] Implicit Places using invariants and state equation in 6627 ms returned []
Implicit Place search using SMT with State Equation took 7175 ms to find 0 implicit places.
[2023-03-12 22:35:41] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-12 22:35:41] [INFO ] Invariant cache hit.
[2023-03-12 22:35:43] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/2163 places, 3692/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9116 ms. Remains : 1085/2163 places, 3692/5580 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s989 1), p1:(GEQ s668 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 168 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-13 finished in 9246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 2 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 454 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-12 22:35:44] [INFO ] Computed 32 place invariants in 85 ms
[2023-03-12 22:35:44] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-12 22:35:44] [INFO ] Invariant cache hit.
[2023-03-12 22:35:45] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-12 22:35:51] [INFO ] Implicit Places using invariants and state equation in 6737 ms returned []
Implicit Place search using SMT with State Equation took 7285 ms to find 0 implicit places.
[2023-03-12 22:35:51] [INFO ] Redundant transitions in 141 ms returned []
[2023-03-12 22:35:51] [INFO ] Invariant cache hit.
[2023-03-12 22:35:52] [INFO ] Dead Transitions using invariants and state equation in 1334 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9230 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-14 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:(LT s537 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 656 reset in 664 ms.
Product exploration explored 100000 steps with 661 reset in 656 ms.
Computed a total of 93 stabilizing places and 150 stable transitions
Computed a total of 93 stabilizing places and 150 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 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 107 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 213599 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213599 steps, saw 35560 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 22:35:57] [INFO ] Invariant cache hit.
[2023-03-12 22:35:57] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-12 22:35:57] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-12 22:35:58] [INFO ] After 765ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 22:35:58] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-12 22:35:58] [INFO ] After 324ms SMT Verify possible using 2667 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:35:58] [INFO ] After 1320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:35:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-12 22:35:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-12 22:35:59] [INFO ] After 839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:36:00] [INFO ] After 558ms SMT Verify possible using 2667 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:36:00] [INFO ] After 684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-12 22:36:00] [INFO ] After 1858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 3690/3690 transitions.
Applied a total of 0 rules in 81 ms. Remains 1084 /1084 variables (removed 0) and now considering 3690/3690 (removed 0) transitions.
[2023-03-12 22:36:01] [INFO ] Invariant cache hit.
[2023-03-12 22:36:01] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-12 22:36:01] [INFO ] Invariant cache hit.
[2023-03-12 22:36:02] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-12 22:36:08] [INFO ] Implicit Places using invariants and state equation in 7055 ms returned []
Implicit Place search using SMT with State Equation took 7523 ms to find 0 implicit places.
[2023-03-12 22:36:08] [INFO ] Redundant transitions in 168 ms returned []
[2023-03-12 22:36:08] [INFO ] Invariant cache hit.
[2023-03-12 22:36:10] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9101 ms. Remains : 1084/1084 places, 3690/3690 transitions.
Computed a total of 93 stabilizing places and 150 stable transitions
Computed a total of 93 stabilizing places and 150 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219085 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219085 steps, saw 36188 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 22:36:13] [INFO ] Invariant cache hit.
[2023-03-12 22:36:13] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-12 22:36:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-12 22:36:14] [INFO ] After 844ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 22:36:14] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-12 22:36:14] [INFO ] After 401ms SMT Verify possible using 2667 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:36:14] [INFO ] After 1518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 22:36:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-12 22:36:15] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-12 22:36:15] [INFO ] After 792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 22:36:16] [INFO ] After 526ms SMT Verify possible using 2667 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 22:36:16] [INFO ] After 721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-12 22:36:16] [INFO ] After 1865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 170 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 658 reset in 783 ms.
Product exploration explored 100000 steps with 653 reset in 673 ms.
Support contains 1 out of 1084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 3690/3690 transitions.
Applied a total of 0 rules in 64 ms. Remains 1084 /1084 variables (removed 0) and now considering 3690/3690 (removed 0) transitions.
[2023-03-12 22:36:18] [INFO ] Invariant cache hit.
[2023-03-12 22:36:19] [INFO ] Implicit Places using invariants in 553 ms returned []
[2023-03-12 22:36:19] [INFO ] Invariant cache hit.
[2023-03-12 22:36:20] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-12 22:36:25] [INFO ] Implicit Places using invariants and state equation in 6281 ms returned []
Implicit Place search using SMT with State Equation took 6851 ms to find 0 implicit places.
[2023-03-12 22:36:25] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-12 22:36:25] [INFO ] Invariant cache hit.
[2023-03-12 22:36:27] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8386 ms. Remains : 1084/1084 places, 3690/3690 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-14 finished in 43683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 2 with 1736 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 2 with 810 rules applied. Total rules applied 2966 place count 1085 transition count 3692
Applied a total of 2966 rules in 388 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3692/5580 (removed 1888) transitions.
// Phase 1: matrix 3692 rows 1085 cols
[2023-03-12 22:36:27] [INFO ] Computed 32 place invariants in 78 ms
[2023-03-12 22:36:28] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-12 22:36:28] [INFO ] Invariant cache hit.
[2023-03-12 22:36:28] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-12 22:36:34] [INFO ] Implicit Places using invariants and state equation in 6273 ms returned []
Implicit Place search using SMT with State Equation took 6812 ms to find 0 implicit places.
[2023-03-12 22:36:34] [INFO ] Redundant transitions in 165 ms returned []
[2023-03-12 22:36:34] [INFO ] Invariant cache hit.
[2023-03-12 22:36:35] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/2163 places, 3692/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8719 ms. Remains : 1085/2163 places, 3692/5580 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s568 1), p1:(GEQ s432 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-15 finished in 8899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-030-LTLFireability-05
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 2163 transition count 5374
Reduce places removed 206 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 413 place count 1957 transition count 5373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 3 with 1736 rules applied. Total rules applied 2150 place count 1088 transition count 4505
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2961 place count 1088 transition count 3694
Applied a total of 2961 rules in 445 ms. Remains 1088 /2163 variables (removed 1075) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2023-03-12 22:36:36] [INFO ] Computed 32 place invariants in 89 ms
[2023-03-12 22:36:37] [INFO ] Implicit Places using invariants in 624 ms returned []
[2023-03-12 22:36:37] [INFO ] Invariant cache hit.
[2023-03-12 22:36:38] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-12 22:36:42] [INFO ] Implicit Places using invariants and state equation in 5544 ms returned []
Implicit Place search using SMT with State Equation took 6170 ms to find 0 implicit places.
[2023-03-12 22:36:42] [INFO ] Invariant cache hit.
[2023-03-12 22:36:44] [INFO ] Dead Transitions using invariants and state equation in 1461 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1088/2163 places, 3694/5580 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8078 ms. Remains : 1088/2163 places, 3694/5580 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (LT s62 1) (OR (LT s60 1) (LT s857 1))), p0:(OR (LT s316 1) (LT s23 1) (LT s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 641 reset in 844 ms.
Entered a terminal (fully accepting) state of product in 95195 steps with 607 reset in 812 ms.
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 9971 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 22:36:46] [INFO ] Flatten gal took : 164 ms
[2023-03-12 22:36:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 22:36:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2163 places, 5580 transitions and 14940 arcs took 50 ms.
Total runtime 281327 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1356/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1356/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-030-LTLFireability-05
Could not compute solution for formula : CANInsertWithFailure-PT-030-LTLFireability-14

BK_STOP 1678660612076

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-030-LTLFireability-05
ltl formula formula --ltl=/tmp/1356/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2163 places, 5580 transitions and 14940 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1356/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1356/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.260 real 0.150 user 0.290 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1356/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1356/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name CANInsertWithFailure-PT-030-LTLFireability-14
ltl formula formula --ltl=/tmp/1356/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2163 places, 5580 transitions and 14940 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1356/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1356/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.080 real 0.230 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1356/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1356/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-030"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-030, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;