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.r039-tajo-167813692900724.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 lolaxred
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 r039-tajo-167813692900724
=====================================================================

--------------------
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 1678506085324

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:41:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:41:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:41:28] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2023-03-11 03:41:28] [INFO ] Transformed 2164 places.
[2023-03-11 03:41:28] [INFO ] Transformed 5580 transitions.
[2023-03-11 03:41:28] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 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 257 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-11 03:41:28] [INFO ] Computed 32 place invariants in 321 ms
[2023-03-11 03:41:30] [INFO ] Implicit Places using invariants in 1869 ms returned []
[2023-03-11 03:41:30] [INFO ] Invariant cache hit.
[2023-03-11 03:41:31] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:41:33] [INFO ] Implicit Places using invariants and state equation in 2770 ms returned []
Implicit Place search using SMT with State Equation took 4669 ms to find 0 implicit places.
[2023-03-11 03:41:33] [INFO ] Invariant cache hit.
[2023-03-11 03:41:36] [INFO ] Dead Transitions using invariants and state equation in 3272 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 8203 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 35 out of 2163 places after structural reductions.
[2023-03-11 03:41:37] [INFO ] Flatten gal took : 251 ms
[2023-03-11 03:41:37] [INFO ] Flatten gal took : 153 ms
[2023-03-11 03:41:37] [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 12 resets, run finished after 723 ms. (steps per millisecond=13 ) properties (out of 23) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) 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 8) 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 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 03:41:38] [INFO ] Invariant cache hit.
[2023-03-11 03:41:39] [INFO ] [Real]Absence check using 30 positive place invariants in 28 ms returned sat
[2023-03-11 03:41:39] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-11 03:41:42] [INFO ] After 3024ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:1
[2023-03-11 03:41:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:41:43] [INFO ] After 1544ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:41:43] [INFO ] After 5407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:41:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 46 ms returned sat
[2023-03-11 03:41:44] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 29 ms returned sat
[2023-03-11 03:41:47] [INFO ] After 2939ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 03:41:55] [INFO ] After 7360ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 03:41:58] [INFO ] After 10605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2229 ms.
[2023-03-11 03:42:00] [INFO ] After 16802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 4 properties in 117 ms.
Support contains 5 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 867 Post agglomeration using F-continuation condition.Transition count delta: 867
Deduced a syphon composed of 867 places in 4 ms
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 2 with 1734 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions removed 809 transitions
Redundant transition composition rules discarded 809 transitions
Iterating global reduction 2 with 809 rules applied. Total rules applied 2961 place count 1087 transition count 3695
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2963 place count 1087 transition count 3693
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2965 place count 1085 transition count 3693
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 3 with 930 rules applied. Total rules applied 3895 place count 1085 transition count 3693
Applied a total of 3895 rules in 1341 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3693/5580 (removed 1887) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1343 ms. Remains : 1085/2163 places, 3693/5580 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3693 rows 1085 cols
[2023-03-11 03:42:02] [INFO ] Computed 32 place invariants in 132 ms
[2023-03-11 03:42:02] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 03:42:02] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-11 03:42:03] [INFO ] After 833ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:42:03] [INFO ] State equation strengthened by 3594 read => feed constraints.
[2023-03-11 03:42:04] [INFO ] After 693ms SMT Verify possible using 3594 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:42:04] [INFO ] After 1840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:42:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 03:42:04] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-11 03:42:05] [INFO ] After 959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:42:06] [INFO ] After 742ms SMT Verify possible using 3594 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:42:06] [INFO ] After 1234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 304 ms.
[2023-03-11 03:42:07] [INFO ] After 2748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 3 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 3 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 584 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-11 03:42:08] [INFO ] Computed 32 place invariants in 82 ms
[2023-03-11 03:42:08] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-11 03:42:08] [INFO ] Invariant cache hit.
[2023-03-11 03:42:09] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-11 03:42:14] [INFO ] Implicit Places using invariants and state equation in 5750 ms returned []
Implicit Place search using SMT with State Equation took 6453 ms to find 0 implicit places.
[2023-03-11 03:42:14] [INFO ] Redundant transitions in 322 ms returned []
[2023-03-11 03:42:14] [INFO ] Invariant cache hit.
[2023-03-11 03:42:16] [INFO ] Dead Transitions using invariants and state equation in 1496 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 8866 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 160 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 135 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-00 finished in 9104 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 1 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 373 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3693/5580 (removed 1887) transitions.
// Phase 1: matrix 3693 rows 1087 cols
[2023-03-11 03:42:17] [INFO ] Computed 32 place invariants in 38 ms
[2023-03-11 03:42:17] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-11 03:42:17] [INFO ] Invariant cache hit.
[2023-03-11 03:42:18] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-11 03:42:23] [INFO ] Implicit Places using invariants and state equation in 5736 ms returned []
Implicit Place search using SMT with State Equation took 6218 ms to find 0 implicit places.
[2023-03-11 03:42:23] [INFO ] Redundant transitions in 268 ms returned []
[2023-03-11 03:42:23] [INFO ] Invariant cache hit.
[2023-03-11 03:42:25] [INFO ] Dead Transitions using invariants and state equation in 1812 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 8693 ms. Remains : 1087/2163 places, 3693/5580 transitions.
Stuttering acceptance computed with spot in 134 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 170 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-01 finished in 8857 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 68 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-11 03:42:25] [INFO ] Computed 32 place invariants in 193 ms
[2023-03-11 03:42:26] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2023-03-11 03:42:26] [INFO ] Invariant cache hit.
[2023-03-11 03:42:27] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:42:28] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2937 ms to find 0 implicit places.
[2023-03-11 03:42:28] [INFO ] Invariant cache hit.
[2023-03-11 03:42:31] [INFO ] Dead Transitions using invariants and state equation in 2739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5747 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 103 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 1746 ms.
Product exploration explored 100000 steps with 50000 reset in 2373 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 281 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 10306 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 406 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-11 03:42:36] [INFO ] Computed 32 place invariants in 70 ms
[2023-03-11 03:42:36] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-11 03:42:36] [INFO ] Invariant cache hit.
[2023-03-11 03:42:37] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-11 03:42:42] [INFO ] Implicit Places using invariants and state equation in 5805 ms returned []
Implicit Place search using SMT with State Equation took 6331 ms to find 0 implicit places.
[2023-03-11 03:42:42] [INFO ] Redundant transitions in 167 ms returned []
[2023-03-11 03:42:42] [INFO ] Invariant cache hit.
[2023-03-11 03:42:44] [INFO ] Dead Transitions using invariants and state equation in 1411 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 8332 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 35 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 651 reset in 702 ms.
Stack based approach found an accepted trace after 83446 steps with 545 reset with depth 124 and stack size 124 in 652 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-04 finished in 9741 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 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-11 03:42:45] [INFO ] Computed 32 place invariants in 187 ms
[2023-03-11 03:42:46] [INFO ] Implicit Places using invariants in 1131 ms returned []
[2023-03-11 03:42:46] [INFO ] Invariant cache hit.
[2023-03-11 03:42:47] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:42:49] [INFO ] Implicit Places using invariants and state equation in 2499 ms returned []
Implicit Place search using SMT with State Equation took 3632 ms to find 0 implicit places.
[2023-03-11 03:42:49] [INFO ] Invariant cache hit.
[2023-03-11 03:42:51] [INFO ] Dead Transitions using invariants and state equation in 2416 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6117 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 114 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 140 reset in 711 ms.
Product exploration explored 100000 steps with 139 reset in 776 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 292 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 130 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 4) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:42:54] [INFO ] Invariant cache hit.
[2023-03-11 03:42:54] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2023-03-11 03:42:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-11 03:42:56] [INFO ] After 1601ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:42:56] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:42:56] [INFO ] After 648ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:42:56] [INFO ] After 2644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:42:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-11 03:42:57] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-11 03:42:58] [INFO ] After 1656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:43:01] [INFO ] After 2930ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:43:02] [INFO ] After 3930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 599 ms.
[2023-03-11 03:43:03] [INFO ] After 6531ms 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 18 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 782 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 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 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 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 155699 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155699 steps, saw 29265 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2023-03-11 03:43:07] [INFO ] Computed 32 place invariants in 74 ms
[2023-03-11 03:43:07] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-11 03:43:07] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-11 03:43:08] [INFO ] After 937ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:43:08] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-11 03:43:09] [INFO ] After 598ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:43:09] [INFO ] After 1855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:43:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 03:43:09] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-11 03:43:10] [INFO ] After 1067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:43:11] [INFO ] After 1018ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:43:12] [INFO ] After 1737ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 494 ms.
[2023-03-11 03:43:13] [INFO ] After 3590ms 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 4 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 120 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 121 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 104 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2023-03-11 03:43:13] [INFO ] Invariant cache hit.
[2023-03-11 03:43:14] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2023-03-11 03:43:14] [INFO ] Invariant cache hit.
[2023-03-11 03:43:15] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-11 03:43:32] [INFO ] Implicit Places using invariants and state equation in 18440 ms returned []
Implicit Place search using SMT with State Equation took 19481 ms to find 0 implicit places.
[2023-03-11 03:43:32] [INFO ] Redundant transitions in 151 ms returned []
[2023-03-11 03:43:32] [INFO ] Invariant cache hit.
[2023-03-11 03:43:34] [INFO ] Dead Transitions using invariants and state equation in 1416 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21169 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.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 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-11 03:43:34] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 03:43:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 03:43:34] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:43:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 03:43:34] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:43:34] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 03:43:34] [INFO ] After 45ms 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 223 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 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 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 77 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-11 03:43:35] [INFO ] Computed 32 place invariants in 187 ms
[2023-03-11 03:43:35] [INFO ] Implicit Places using invariants in 1088 ms returned []
[2023-03-11 03:43:35] [INFO ] Invariant cache hit.
[2023-03-11 03:43:36] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:43:37] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 3031 ms to find 0 implicit places.
[2023-03-11 03:43:37] [INFO ] Invariant cache hit.
[2023-03-11 03:43:40] [INFO ] Dead Transitions using invariants and state equation in 2460 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5573 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 206 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 104 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 172 ms. (steps per millisecond=58 ) properties (out of 4) seen :1
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
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
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-11 03:43:40] [INFO ] Invariant cache hit.
[2023-03-11 03:43:41] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2023-03-11 03:43:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-11 03:43:42] [INFO ] After 1512ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:43:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:43:43] [INFO ] After 534ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:43:43] [INFO ] After 2443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:43:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2023-03-11 03:43:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 41 ms returned sat
[2023-03-11 03:43:45] [INFO ] After 1973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:43:49] [INFO ] After 3101ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:43:50] [INFO ] After 4090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 600 ms.
[2023-03-11 03:43:50] [INFO ] After 7223ms 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 15 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 767 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 768 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 148 ms. (steps per millisecond=67 ) 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
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
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
Interrupted probabilistic random walk after 176765 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176765 steps, saw 31908 distinct states, run finished after 3004 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2023-03-11 03:43:54] [INFO ] Computed 32 place invariants in 50 ms
[2023-03-11 03:43:54] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-11 03:43:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-11 03:43:55] [INFO ] After 1061ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:43:56] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-11 03:43:56] [INFO ] After 682ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:43:56] [INFO ] After 2012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:43:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-11 03:43:56] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-11 03:43:57] [INFO ] After 914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:43:58] [INFO ] After 785ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:43:59] [INFO ] After 1492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 432 ms.
[2023-03-11 03:43:59] [INFO ] After 3100ms 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 104 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 104 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 94 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2023-03-11 03:44:00] [INFO ] Invariant cache hit.
[2023-03-11 03:44:01] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2023-03-11 03:44:01] [INFO ] Invariant cache hit.
[2023-03-11 03:44:01] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-11 03:44:15] [INFO ] Implicit Places using invariants and state equation in 14638 ms returned []
Implicit Place search using SMT with State Equation took 15743 ms to find 0 implicit places.
[2023-03-11 03:44:15] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-11 03:44:15] [INFO ] Invariant cache hit.
[2023-03-11 03:44:17] [INFO ] Dead Transitions using invariants and state equation in 1503 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17463 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.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 16 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-11 03:44:17] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 03:44:17] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 03:44:17] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:44:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 03:44:17] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:44:17] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 03:44:17] [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 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 214 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 78 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 139 reset in 675 ms.
Product exploration explored 100000 steps with 143 reset in 784 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 111 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 2 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 1 ms
Applied a total of 2232 rules in 1158 ms. Remains 1990 /2163 variables (removed 173) and now considering 6274/5580 (removed -694) transitions.
[2023-03-11 03:44:21] [INFO ] Redundant transitions in 411 ms returned []
// Phase 1: matrix 6274 rows 1990 cols
[2023-03-11 03:44:21] [INFO ] Computed 32 place invariants in 146 ms
[2023-03-11 03:44:23] [INFO ] Dead Transitions using invariants and state equation in 2545 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 4140 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 76 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-11 03:44:24] [INFO ] Computed 32 place invariants in 165 ms
[2023-03-11 03:44:24] [INFO ] Implicit Places using invariants in 874 ms returned []
[2023-03-11 03:44:24] [INFO ] Invariant cache hit.
[2023-03-11 03:44:26] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:44:32] [INFO ] Implicit Places using invariants and state equation in 7896 ms returned []
Implicit Place search using SMT with State Equation took 8786 ms to find 0 implicit places.
[2023-03-11 03:44:32] [INFO ] Invariant cache hit.
[2023-03-11 03:44:35] [INFO ] Dead Transitions using invariants and state equation in 2336 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11200 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 109779 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 106 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:44:35] [INFO ] Invariant cache hit.
[2023-03-11 03:44:36] [INFO ] Implicit Places using invariants in 656 ms returned []
[2023-03-11 03:44:36] [INFO ] Invariant cache hit.
[2023-03-11 03:44:36] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:44:38] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2581 ms to find 0 implicit places.
[2023-03-11 03:44:38] [INFO ] Invariant cache hit.
[2023-03-11 03:44:40] [INFO ] Dead Transitions using invariants and state equation in 2313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5006 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 201 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 895 steps with 14 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-06 finished in 5258 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 86 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:44:40] [INFO ] Invariant cache hit.
[2023-03-11 03:44:41] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-11 03:44:41] [INFO ] Invariant cache hit.
[2023-03-11 03:44:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:44:43] [INFO ] Implicit Places using invariants and state equation in 1925 ms returned []
Implicit Place search using SMT with State Equation took 2632 ms to find 0 implicit places.
[2023-03-11 03:44:43] [INFO ] Invariant cache hit.
[2023-03-11 03:44:45] [INFO ] Dead Transitions using invariants and state equation in 2502 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5222 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 109 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 669 steps with 1 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-07 finished in 5363 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 102 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:44:46] [INFO ] Invariant cache hit.
[2023-03-11 03:44:46] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-11 03:44:46] [INFO ] Invariant cache hit.
[2023-03-11 03:44:47] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:44:49] [INFO ] Implicit Places using invariants and state equation in 2268 ms returned []
Implicit Place search using SMT with State Equation took 3004 ms to find 0 implicit places.
[2023-03-11 03:44:49] [INFO ] Invariant cache hit.
[2023-03-11 03:44:52] [INFO ] Dead Transitions using invariants and state equation in 3166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6274 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 124 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 609 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-08 finished in 6422 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 81 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-11 03:44:52] [INFO ] Invariant cache hit.
[2023-03-11 03:44:53] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-11 03:44:53] [INFO ] Invariant cache hit.
[2023-03-11 03:44:54] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:44:56] [INFO ] Implicit Places using invariants and state equation in 2987 ms returned []
Implicit Place search using SMT with State Equation took 3750 ms to find 0 implicit places.
[2023-03-11 03:44:56] [INFO ] Invariant cache hit.
[2023-03-11 03:44:58] [INFO ] Dead Transitions using invariants and state equation in 2207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6060 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 130 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 6220 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 420 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3692/5580 (removed 1888) transitions.
// Phase 1: matrix 3692 rows 1085 cols
[2023-03-11 03:44:59] [INFO ] Computed 32 place invariants in 86 ms
[2023-03-11 03:44:59] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-11 03:44:59] [INFO ] Invariant cache hit.
[2023-03-11 03:45:00] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-11 03:45:05] [INFO ] Implicit Places using invariants and state equation in 5539 ms returned []
Implicit Place search using SMT with State Equation took 6226 ms to find 0 implicit places.
[2023-03-11 03:45:05] [INFO ] Redundant transitions in 150 ms returned []
[2023-03-11 03:45:05] [INFO ] Invariant cache hit.
[2023-03-11 03:45:06] [INFO ] Dead Transitions using invariants and state equation in 1393 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 8208 ms. Remains : 1085/2163 places, 3692/5580 transitions.
Stuttering acceptance computed with spot in 114 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 123 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-13 finished in 8352 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 1 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 421 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-11 03:45:07] [INFO ] Computed 32 place invariants in 81 ms
[2023-03-11 03:45:07] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-11 03:45:07] [INFO ] Invariant cache hit.
[2023-03-11 03:45:08] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-11 03:45:13] [INFO ] Implicit Places using invariants and state equation in 5442 ms returned []
Implicit Place search using SMT with State Equation took 6019 ms to find 0 implicit places.
[2023-03-11 03:45:13] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-11 03:45:13] [INFO ] Invariant cache hit.
[2023-03-11 03:45:14] [INFO ] Dead Transitions using invariants and state equation in 1301 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 7837 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 98 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 631 ms.
Product exploration explored 100000 steps with 660 reset in 806 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 151 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 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 110 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 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 87 ms. Remains 1084 /1084 variables (removed 0) and now considering 3690/3690 (removed 0) transitions.
[2023-03-11 03:45:16] [INFO ] Invariant cache hit.
[2023-03-11 03:45:17] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-11 03:45:17] [INFO ] Invariant cache hit.
[2023-03-11 03:45:18] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-11 03:45:23] [INFO ] Implicit Places using invariants and state equation in 6385 ms returned []
Implicit Place search using SMT with State Equation took 6933 ms to find 0 implicit places.
[2023-03-11 03:45:24] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-11 03:45:24] [INFO ] Invariant cache hit.
[2023-03-11 03:45:25] [INFO ] Dead Transitions using invariants and state equation in 1300 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8428 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 101 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 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4924 steps, including 31 resets, run visited all 1 properties in 36 ms. (steps per millisecond=136 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 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)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 657 reset in 613 ms.
Stack based approach found an accepted trace after 47502 steps with 312 reset with depth 155 and stack size 155 in 326 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-14 finished in 19823 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 439 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3692/5580 (removed 1888) transitions.
// Phase 1: matrix 3692 rows 1085 cols
[2023-03-11 03:45:27] [INFO ] Computed 32 place invariants in 68 ms
[2023-03-11 03:45:27] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-11 03:45:27] [INFO ] Invariant cache hit.
[2023-03-11 03:45:28] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-11 03:45:33] [INFO ] Implicit Places using invariants and state equation in 5310 ms returned []
Implicit Place search using SMT with State Equation took 5878 ms to find 0 implicit places.
[2023-03-11 03:45:33] [INFO ] Redundant transitions in 178 ms returned []
[2023-03-11 03:45:33] [INFO ] Invariant cache hit.
[2023-03-11 03:45:34] [INFO ] Dead Transitions using invariants and state equation in 1393 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 7895 ms. Remains : 1085/2163 places, 3692/5580 transitions.
Stuttering acceptance computed with spot in 71 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 166 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-15 finished in 8005 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 102 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 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
Applied a total of 2961 rules in 453 ms. Remains 1088 /2163 variables (removed 1075) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2023-03-11 03:45:35] [INFO ] Computed 32 place invariants in 70 ms
[2023-03-11 03:45:35] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-03-11 03:45:35] [INFO ] Invariant cache hit.
[2023-03-11 03:45:36] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-11 03:45:41] [INFO ] Implicit Places using invariants and state equation in 5285 ms returned []
Implicit Place search using SMT with State Equation took 5826 ms to find 0 implicit places.
[2023-03-11 03:45:41] [INFO ] Invariant cache hit.
[2023-03-11 03:45:42] [INFO ] Dead Transitions using invariants and state equation in 1427 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 7710 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 633 reset in 644 ms.
Product exploration explored 100000 steps with 639 reset in 624 ms.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 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 292 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 122 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 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 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 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:45:44] [INFO ] Invariant cache hit.
[2023-03-11 03:45:44] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-11 03:45:44] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-11 03:45:45] [INFO ] After 749ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:45:45] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-11 03:45:46] [INFO ] After 310ms SMT Verify possible using 2666 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:45:46] [INFO ] After 1302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:45:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 03:45:46] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-11 03:45:47] [INFO ] After 901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:45:47] [INFO ] After 753ms SMT Verify possible using 2666 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:45:48] [INFO ] After 1291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 347 ms.
[2023-03-11 03:45:48] [INFO ] After 2807ms 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 9 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 369 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 1085/1088 places, 3691/3694 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 275 ms. (steps per millisecond=36 ) 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 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
Interrupted probabilistic random walk after 152741 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152741 steps, saw 28914 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2023-03-11 03:45:52] [INFO ] Computed 32 place invariants in 45 ms
[2023-03-11 03:45:52] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-11 03:45:52] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-11 03:45:53] [INFO ] After 975ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:45:53] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-11 03:45:54] [INFO ] After 504ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:45:54] [INFO ] After 1813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:45:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-11 03:45:54] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-11 03:45:55] [INFO ] After 880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:45:56] [INFO ] After 698ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:45:56] [INFO ] After 1210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 321 ms.
[2023-03-11 03:45:57] [INFO ] After 2613ms 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 112 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 113 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 94 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2023-03-11 03:45:57] [INFO ] Invariant cache hit.
[2023-03-11 03:45:58] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2023-03-11 03:45:58] [INFO ] Invariant cache hit.
[2023-03-11 03:45:58] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-11 03:46:17] [INFO ] Implicit Places using invariants and state equation in 18793 ms returned []
Implicit Place search using SMT with State Equation took 19855 ms to find 0 implicit places.
[2023-03-11 03:46:17] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-11 03:46:17] [INFO ] Invariant cache hit.
[2023-03-11 03:46:18] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21278 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 9 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-11 03:46:18] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 03:46:18] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 03:46:18] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:46:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 03:46:18] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:46:18] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 03:46:18] [INFO ] After 73ms 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 228 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 111 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 61 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2023-03-11 03:46:19] [INFO ] Computed 32 place invariants in 55 ms
[2023-03-11 03:46:19] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-11 03:46:19] [INFO ] Invariant cache hit.
[2023-03-11 03:46:20] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-11 03:46:24] [INFO ] Implicit Places using invariants and state equation in 4773 ms returned []
Implicit Place search using SMT with State Equation took 5289 ms to find 0 implicit places.
[2023-03-11 03:46:24] [INFO ] Invariant cache hit.
[2023-03-11 03:46:25] [INFO ] Dead Transitions using invariants and state equation in 1261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6626 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Computed a total of 92 stabilizing places and 151 stable transitions
Computed a total of 92 stabilizing places and 151 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 218 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 106 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 63 resets, run finished after 224 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 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:46:26] [INFO ] Invariant cache hit.
[2023-03-11 03:46:26] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-11 03:46:26] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-11 03:46:27] [INFO ] After 835ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:46:27] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-11 03:46:27] [INFO ] After 366ms SMT Verify possible using 2666 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:46:27] [INFO ] After 1453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:46:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-11 03:46:27] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-11 03:46:28] [INFO ] After 901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:46:29] [INFO ] After 758ms SMT Verify possible using 2666 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:46:30] [INFO ] After 1396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 468 ms.
[2023-03-11 03:46:30] [INFO ] After 2992ms 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 6 ms.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1088 transition count 3691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 936 place count 1085 transition count 3691
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1085 transition count 3691
Applied a total of 966 rules in 360 ms. Remains 1085 /1088 variables (removed 3) and now considering 3691/3694 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 1085/1088 places, 3691/3694 transitions.
Incomplete random walk after 10000 steps, including 71 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 18 ms. (steps per millisecond=555 ) 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
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
Interrupted probabilistic random walk after 153938 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153938 steps, saw 29059 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2023-03-11 03:46:34] [INFO ] Computed 32 place invariants in 29 ms
[2023-03-11 03:46:34] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-11 03:46:34] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-11 03:46:35] [INFO ] After 812ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:46:35] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-11 03:46:36] [INFO ] After 538ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:46:36] [INFO ] After 1574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:46:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-11 03:46:36] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-11 03:46:37] [INFO ] After 907ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:46:37] [INFO ] After 827ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:46:38] [INFO ] After 1467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 468 ms.
[2023-03-11 03:46:39] [INFO ] After 3090ms 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 4 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 107 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 107 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 93 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2023-03-11 03:46:39] [INFO ] Invariant cache hit.
[2023-03-11 03:46:40] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2023-03-11 03:46:40] [INFO ] Invariant cache hit.
[2023-03-11 03:46:41] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-11 03:46:57] [INFO ] Implicit Places using invariants and state equation in 17582 ms returned []
Implicit Place search using SMT with State Equation took 18609 ms to find 0 implicit places.
[2023-03-11 03:46:58] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-11 03:46:58] [INFO ] Invariant cache hit.
[2023-03-11 03:46:59] [INFO ] Dead Transitions using invariants and state equation in 1416 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20227 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 0 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 9 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-11 03:46:59] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 03:46:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 03:46:59] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:46:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 03:46:59] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:46:59] [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 7 ms.
[2023-03-11 03:46:59] [INFO ] After 62ms 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 357 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 137 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 635 reset in 612 ms.
Product exploration explored 100000 steps with 634 reset in 629 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 119 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2023-03-11 03:47:01] [INFO ] Redundant transitions in 132 ms returned []
// Phase 1: matrix 3694 rows 1088 cols
[2023-03-11 03:47:01] [INFO ] Computed 32 place invariants in 53 ms
[2023-03-11 03:47:03] [INFO ] Dead Transitions using invariants and state equation in 1412 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1671 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Support contains 6 out of 1088 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1088/1088 places, 3694/3694 transitions.
Applied a total of 0 rules in 35 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2023-03-11 03:47:03] [INFO ] Invariant cache hit.
[2023-03-11 03:47:03] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-11 03:47:03] [INFO ] Invariant cache hit.
[2023-03-11 03:47:04] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-11 03:47:08] [INFO ] Implicit Places using invariants and state equation in 4959 ms returned []
Implicit Place search using SMT with State Equation took 5376 ms to find 0 implicit places.
[2023-03-11 03:47:08] [INFO ] Invariant cache hit.
[2023-03-11 03:47:09] [INFO ] Dead Transitions using invariants and state equation in 1244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6669 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 95320 ms.
[2023-03-11 03:47:10] [INFO ] Flatten gal took : 213 ms
[2023-03-11 03:47:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 03:47:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2163 places, 5580 transitions and 14940 arcs took 24 ms.
Total runtime 342687 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANInsertWithFailure-PT-030
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLFireability

BK_STOP 1678506551093

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 3 (type SKEL/SRCH) for 0 CANInsertWithFailure-PT-030-LTLFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 1 (type EXCL) for 0 CANInsertWithFailure-PT-030-LTLFireability-05
lola: time limit : 3598 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 3/3598 7/32 CANInsertWithFailure-PT-030-LTLFireability-05 150668 m, 30133 m/sec, 356829 t fired, .
3 LTL SRCH 4/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 549004 m, 109800 m/sec, 3027272 t fired, .

Time elapsed: 5 secs. Pages in use: 8
# running tasks: 2 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 8/3598 15/32 CANInsertWithFailure-PT-030-LTLFireability-05 321607 m, 34187 m/sec, 821182 t fired, .
3 LTL SRCH 9/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 977989 m, 85797 m/sec, 6178249 t fired, .

Time elapsed: 10 secs. Pages in use: 16
# running tasks: 2 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 13/3598 22/32 CANInsertWithFailure-PT-030-LTLFireability-05 487820 m, 33242 m/sec, 1282673 t fired, .
3 LTL SRCH 14/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 1414290 m, 87260 m/sec, 9032543 t fired, .

Time elapsed: 15 secs. Pages in use: 23
# running tasks: 2 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3598 26/32 CANInsertWithFailure-PT-030-LTLFireability-05 617890 m, 26014 m/sec, 1734211 t fired, .
3 LTL SRCH 20/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 1648968 m, 46935 m/sec, 11494017 t fired, .

Time elapsed: 21 secs. Pages in use: 27
# running tasks: 2 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3598 29/32 CANInsertWithFailure-PT-030-LTLFireability-05 718318 m, 20085 m/sec, 2186991 t fired, .
3 LTL SRCH 25/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 2057970 m, 81800 m/sec, 14478503 t fired, .

Time elapsed: 26 secs. Pages in use: 30
# running tasks: 2 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3598 30/32 CANInsertWithFailure-PT-030-LTLFireability-05 800185 m, 16373 m/sec, 2605189 t fired, .
3 LTL SRCH 30/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 2423817 m, 73169 m/sec, 17274183 t fired, .

Time elapsed: 31 secs. Pages in use: 31
# running tasks: 2 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3598 32/32 CANInsertWithFailure-PT-030-LTLFireability-05 874026 m, 14768 m/sec, 3023221 t fired, .
3 LTL SRCH 35/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 2816790 m, 78594 m/sec, 20102922 t fired, .

Time elapsed: 36 secs. Pages in use: 33
# running tasks: 2 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for CANInsertWithFailure-PT-030-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 40/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 3182563 m, 73154 m/sec, 22835360 t fired, .

Time elapsed: 41 secs. Pages in use: 33
# running tasks: 2 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 45/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 3529636 m, 69414 m/sec, 25340477 t fired, .

Time elapsed: 46 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 50/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 3836740 m, 61420 m/sec, 27859507 t fired, .

Time elapsed: 51 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 55/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 4140938 m, 60839 m/sec, 30077786 t fired, .

Time elapsed: 56 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 60/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 4194180 m, 10648 m/sec, 32323461 t fired, .

Time elapsed: 61 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 65/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 4547402 m, 70644 m/sec, 35100469 t fired, .

Time elapsed: 66 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 70/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 4883325 m, 67184 m/sec, 37515428 t fired, .

Time elapsed: 71 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 75/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 5108371 m, 45009 m/sec, 39632632 t fired, .

Time elapsed: 76 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 80/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 5363620 m, 51049 m/sec, 42189353 t fired, .

Time elapsed: 81 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 85/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 5695002 m, 66276 m/sec, 44975928 t fired, .

Time elapsed: 86 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 90/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 5996496 m, 60298 m/sec, 47578004 t fired, .

Time elapsed: 91 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 95/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 6363728 m, 73446 m/sec, 50507537 t fired, .

Time elapsed: 96 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 100/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 6684610 m, 64176 m/sec, 53193331 t fired, .

Time elapsed: 101 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 105/3599 1/5 CANInsertWithFailure-PT-030-LTLFireability-05 7129411 m, 88960 m/sec, 56096980 t fired, .

Time elapsed: 106 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 110/3599 3/5 CANInsertWithFailure-PT-030-LTLFireability-05 7351785 m, 44474 m/sec, 58608533 t fired, .

Time elapsed: 111 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL SRCH 115/3599 5/5 CANInsertWithFailure-PT-030-LTLFireability-05 7763571 m, 82357 m/sec, 61439546 t fired, .

Time elapsed: 116 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 3 (type SRCH) for CANInsertWithFailure-PT-030-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-030-LTLFireability-05: LTL 0 0 0 0 0 0 2 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-030-LTLFireability-05: LTL unknown AGGR


Time elapsed: 121 secs. Pages in use: 33

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is 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 r039-tajo-167813692900724"
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 ;