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.r037-tajo-167813690700724.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 itstools
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 r037-tajo-167813690700724
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 15:24:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 15:24:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:24:02] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2023-03-09 15:24:02] [INFO ] Transformed 2164 places.
[2023-03-09 15:24:02] [INFO ] Transformed 5580 transitions.
[2023-03-09 15:24:02] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 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 242 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-09 15:24:02] [INFO ] Computed 32 place invariants in 229 ms
[2023-03-09 15:24:03] [INFO ] Implicit Places using invariants in 1108 ms returned []
[2023-03-09 15:24:03] [INFO ] Invariant cache hit.
[2023-03-09 15:24:04] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:24:05] [INFO ] Implicit Places using invariants and state equation in 2078 ms returned []
Implicit Place search using SMT with State Equation took 3212 ms to find 0 implicit places.
[2023-03-09 15:24:05] [INFO ] Invariant cache hit.
[2023-03-09 15:24:08] [INFO ] Dead Transitions using invariants and state equation in 2766 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 6224 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 35 out of 2163 places after structural reductions.
[2023-03-09 15:24:08] [INFO ] Flatten gal took : 260 ms
[2023-03-09 15:24:09] [INFO ] Flatten gal took : 151 ms
[2023-03-09 15:24:09] [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 14 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 23) seen :16
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 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 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 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 15 ms. (steps per millisecond=666 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-09 15:24:10] [INFO ] Invariant cache hit.
[2023-03-09 15:24:10] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2023-03-09 15:24:10] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-09 15:24:13] [INFO ] After 2565ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-09 15:24:13] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:24:15] [INFO ] After 2348ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 15:24:15] [INFO ] After 5596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 15:24:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2023-03-09 15:24:16] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-09 15:24:19] [INFO ] After 2814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 15:24:25] [INFO ] After 5651ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 15:24:28] [INFO ] After 8906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1678 ms.
[2023-03-09 15:24:30] [INFO ] After 14260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 4 properties in 112 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 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 5 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 2 with 1736 rules applied. Total rules applied 2154 place count 1086 transition count 4503
Drop transitions removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 2 with 810 rules applied. Total rules applied 2964 place count 1086 transition count 3693
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2965 place count 1086 transition count 3692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2966 place count 1085 transition count 3692
Partial Free-agglomeration rule applied 956 times.
Drop transitions removed 956 transitions
Iterating global reduction 3 with 956 rules applied. Total rules applied 3922 place count 1085 transition count 3692
Applied a total of 3922 rules in 1163 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3692/5580 (removed 1888) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1164 ms. Remains : 1085/2163 places, 3692/5580 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3692 rows 1085 cols
[2023-03-09 15:24:31] [INFO ] Computed 32 place invariants in 70 ms
[2023-03-09 15:24:31] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-09 15:24:31] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-09 15:24:32] [INFO ] After 942ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:24:32] [INFO ] State equation strengthened by 3593 read => feed constraints.
[2023-03-09 15:24:33] [INFO ] After 474ms SMT Verify possible using 3593 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:33] [INFO ] After 1672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:24:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-09 15:24:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-09 15:24:34] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:34] [INFO ] After 466ms SMT Verify possible using 3593 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:24:35] [INFO ] After 732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-09 15:24:35] [INFO ] After 2026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 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 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 699 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-09 15:24:36] [INFO ] Computed 32 place invariants in 80 ms
[2023-03-09 15:24:37] [INFO ] Implicit Places using invariants in 730 ms returned []
[2023-03-09 15:24:37] [INFO ] Invariant cache hit.
[2023-03-09 15:24:38] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-09 15:24:43] [INFO ] Implicit Places using invariants and state equation in 6296 ms returned []
Implicit Place search using SMT with State Equation took 7030 ms to find 0 implicit places.
[2023-03-09 15:24:43] [INFO ] Redundant transitions in 369 ms returned []
[2023-03-09 15:24:43] [INFO ] Invariant cache hit.
[2023-03-09 15:24:45] [INFO ] Dead Transitions using invariants and state equation in 1350 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 9461 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 212 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 132 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-00 finished in 9787 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 1955 transition count 5372
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 2 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 2 with 1736 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2963 place count 1087 transition count 3693
Applied a total of 2963 rules in 632 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3693/5580 (removed 1887) transitions.
// Phase 1: matrix 3693 rows 1087 cols
[2023-03-09 15:24:46] [INFO ] Computed 32 place invariants in 83 ms
[2023-03-09 15:24:46] [INFO ] Implicit Places using invariants in 666 ms returned []
[2023-03-09 15:24:46] [INFO ] Invariant cache hit.
[2023-03-09 15:24:47] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-09 15:24:52] [INFO ] Implicit Places using invariants and state equation in 5987 ms returned []
Implicit Place search using SMT with State Equation took 6658 ms to find 0 implicit places.
[2023-03-09 15:24:52] [INFO ] Redundant transitions in 206 ms returned []
[2023-03-09 15:24:52] [INFO ] Invariant cache hit.
[2023-03-09 15:24:54] [INFO ] Dead Transitions using invariants and state equation in 1735 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 9241 ms. Remains : 1087/2163 places, 3693/5580 transitions.
Stuttering acceptance computed with spot in 156 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 178 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-01 finished in 9435 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 92 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-09 15:24:55] [INFO ] Computed 32 place invariants in 191 ms
[2023-03-09 15:24:56] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2023-03-09 15:24:56] [INFO ] Invariant cache hit.
[2023-03-09 15:24:57] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:24:58] [INFO ] Implicit Places using invariants and state equation in 2718 ms returned []
Implicit Place search using SMT with State Equation took 3911 ms to find 0 implicit places.
[2023-03-09 15:24:58] [INFO ] Invariant cache hit.
[2023-03-09 15:25:01] [INFO ] Dead Transitions using invariants and state equation in 2575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6581 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 185 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 1434 ms.
Product exploration explored 100000 steps with 50000 reset in 1302 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 324 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 9891 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 393 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-09 15:25:05] [INFO ] Computed 32 place invariants in 96 ms
[2023-03-09 15:25:05] [INFO ] Implicit Places using invariants in 677 ms returned []
[2023-03-09 15:25:05] [INFO ] Invariant cache hit.
[2023-03-09 15:25:06] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-09 15:25:10] [INFO ] Implicit Places using invariants and state equation in 5060 ms returned []
Implicit Place search using SMT with State Equation took 5745 ms to find 0 implicit places.
[2023-03-09 15:25:11] [INFO ] Redundant transitions in 283 ms returned []
[2023-03-09 15:25:11] [INFO ] Invariant cache hit.
[2023-03-09 15:25:12] [INFO ] Dead Transitions using invariants and state equation in 1679 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 8117 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 654 reset in 770 ms.
Product exploration explored 100000 steps with 651 reset in 786 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 182 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Finished random walk after 4666 steps, including 30 resets, run visited all 1 properties in 47 ms. (steps per millisecond=99 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(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 65 ms. Remains 1084 /1084 variables (removed 0) and now considering 3690/3690 (removed 0) transitions.
[2023-03-09 15:25:15] [INFO ] Invariant cache hit.
[2023-03-09 15:25:15] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-09 15:25:15] [INFO ] Invariant cache hit.
[2023-03-09 15:25:16] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-09 15:25:21] [INFO ] Implicit Places using invariants and state equation in 5561 ms returned []
Implicit Place search using SMT with State Equation took 6037 ms to find 0 implicit places.
[2023-03-09 15:25:21] [INFO ] Redundant transitions in 165 ms returned []
[2023-03-09 15:25:21] [INFO ] Invariant cache hit.
[2023-03-09 15:25:22] [INFO ] Dead Transitions using invariants and state equation in 1504 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7791 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 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 3661 steps, including 23 resets, run visited all 1 properties in 32 ms. (steps per millisecond=114 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Product exploration explored 100000 steps with 650 reset in 702 ms.
Product exploration explored 100000 steps with 652 reset in 689 ms.
Built C files in :
/tmp/ltsmin6891687291942890476
[2023-03-09 15:25:24] [INFO ] Too many transitions (3690) to apply POR reductions. Disabling POR matrices.
[2023-03-09 15:25:24] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6891687291942890476
Running compilation step : cd /tmp/ltsmin6891687291942890476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6891687291942890476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6891687291942890476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 97 ms. Remains 1084 /1084 variables (removed 0) and now considering 3690/3690 (removed 0) transitions.
[2023-03-09 15:25:27] [INFO ] Invariant cache hit.
[2023-03-09 15:25:28] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-09 15:25:28] [INFO ] Invariant cache hit.
[2023-03-09 15:25:29] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-09 15:25:35] [INFO ] Implicit Places using invariants and state equation in 6785 ms returned []
Implicit Place search using SMT with State Equation took 7310 ms to find 0 implicit places.
[2023-03-09 15:25:35] [INFO ] Redundant transitions in 165 ms returned []
[2023-03-09 15:25:35] [INFO ] Invariant cache hit.
[2023-03-09 15:25:36] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9079 ms. Remains : 1084/1084 places, 3690/3690 transitions.
Built C files in :
/tmp/ltsmin3183644995143119793
[2023-03-09 15:25:36] [INFO ] Too many transitions (3690) to apply POR reductions. Disabling POR matrices.
[2023-03-09 15:25:37] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3183644995143119793
Running compilation step : cd /tmp/ltsmin3183644995143119793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3183644995143119793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3183644995143119793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 15:25:40] [INFO ] Flatten gal took : 117 ms
[2023-03-09 15:25:40] [INFO ] Flatten gal took : 123 ms
[2023-03-09 15:25:40] [INFO ] Time to serialize gal into /tmp/LTL2485361487437139100.gal : 28 ms
[2023-03-09 15:25:40] [INFO ] Time to serialize properties into /tmp/LTL2376555758328976126.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2485361487437139100.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17628908709985976799.hoa' '-atoms' '/tmp/LTL2376555758328976126.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2376555758328976126.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17628908709985976799.hoa
Detected timeout of ITS tools.
[2023-03-09 15:25:55] [INFO ] Flatten gal took : 103 ms
[2023-03-09 15:25:56] [INFO ] Flatten gal took : 104 ms
[2023-03-09 15:25:56] [INFO ] Time to serialize gal into /tmp/LTL3571607270347685940.gal : 22 ms
[2023-03-09 15:25:56] [INFO ] Time to serialize properties into /tmp/LTL6459612732702277328.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3571607270347685940.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6459612732702277328.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node13GiveAnswer19<1)"))))
Formula 0 simplified : GF!"(Node13GiveAnswer19<1)"
Detected timeout of ITS tools.
[2023-03-09 15:26:11] [INFO ] Flatten gal took : 106 ms
[2023-03-09 15:26:11] [INFO ] Applying decomposition
[2023-03-09 15:26:11] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1990573345852315441.txt' '-o' '/tmp/graph1990573345852315441.bin' '-w' '/tmp/graph1990573345852315441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1990573345852315441.bin' '-l' '-1' '-v' '-w' '/tmp/graph1990573345852315441.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:26:11] [INFO ] Decomposing Gal with order
[2023-03-09 15:26:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:26:12] [INFO ] Removed a total of 2698 redundant transitions.
[2023-03-09 15:26:12] [INFO ] Flatten gal took : 573 ms
[2023-03-09 15:26:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1741 labels/synchronizations in 131 ms.
[2023-03-09 15:26:12] [INFO ] Time to serialize gal into /tmp/LTL11978907626394417553.gal : 30 ms
[2023-03-09 15:26:12] [INFO ] Time to serialize properties into /tmp/LTL13573253832507553227.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11978907626394417553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13573253832507553227.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(u20.Node13GiveAnswer19<1)"))))
Formula 0 simplified : GF!"(u20.Node13GiveAnswer19<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3499141990514799812
[2023-03-09 15:26:27] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3499141990514799812
Running compilation step : cd /tmp/ltsmin3499141990514799812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3499141990514799812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3499141990514799812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-04 finished in 85989 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 98 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-09 15:26:31] [INFO ] Computed 32 place invariants in 172 ms
[2023-03-09 15:26:32] [INFO ] Implicit Places using invariants in 1140 ms returned []
[2023-03-09 15:26:32] [INFO ] Invariant cache hit.
[2023-03-09 15:26:33] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:26:34] [INFO ] Implicit Places using invariants and state equation in 2435 ms returned []
Implicit Place search using SMT with State Equation took 3584 ms to find 0 implicit places.
[2023-03-09 15:26:34] [INFO ] Invariant cache hit.
[2023-03-09 15:26:36] [INFO ] Dead Transitions using invariants and state equation in 2407 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6093 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 217 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 886 ms.
Product exploration explored 100000 steps with 140 reset in 710 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 330 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 150 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 295 ms. (steps per millisecond=33 ) properties (out of 4) seen :1
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 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 15:26:39] [INFO ] Invariant cache hit.
[2023-03-09 15:26:39] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2023-03-09 15:26:40] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 28 ms returned sat
[2023-03-09 15:26:41] [INFO ] After 1666ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:26:41] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:26:42] [INFO ] After 605ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:26:42] [INFO ] After 2724ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:26:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 43 ms returned sat
[2023-03-09 15:26:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 49 ms returned sat
[2023-03-09 15:26:45] [INFO ] After 2037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:26:48] [INFO ] After 3289ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:26:49] [INFO ] After 4368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 623 ms.
[2023-03-09 15:26:50] [INFO ] After 7887ms 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 33 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 868 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 869 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 152409 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152409 steps, saw 28858 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2023-03-09 15:26:54] [INFO ] Computed 32 place invariants in 33 ms
[2023-03-09 15:26:54] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-09 15:26:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-09 15:26:56] [INFO ] After 1391ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:26:56] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-09 15:26:56] [INFO ] After 681ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:26:57] [INFO ] After 2412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:26:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-09 15:26:57] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-09 15:26:58] [INFO ] After 963ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:26:59] [INFO ] After 884ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:26:59] [INFO ] After 1650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 426 ms.
[2023-03-09 15:27:00] [INFO ] After 3316ms 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 5 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 113 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 92 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2023-03-09 15:27:00] [INFO ] Invariant cache hit.
[2023-03-09 15:27:02] [INFO ] Implicit Places using invariants in 1640 ms returned []
[2023-03-09 15:27:02] [INFO ] Invariant cache hit.
[2023-03-09 15:27:02] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-09 15:27:18] [INFO ] Implicit Places using invariants and state equation in 16507 ms returned []
Implicit Place search using SMT with State Equation took 18151 ms to find 0 implicit places.
[2023-03-09 15:27:18] [INFO ] Redundant transitions in 188 ms returned []
[2023-03-09 15:27:18] [INFO ] Invariant cache hit.
[2023-03-09 15:27:21] [INFO ] Dead Transitions using invariants and state equation in 2400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20852 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Graph (trivial) has 3470 edges and 1085 vertex of which 926 / 1085 are part of one of the 2 SCC in 5 ms
Free SCC test removed 924 places
Drop transitions removed 2519 transitions
Ensure Unique test removed 916 transitions
Reduce isomorphic transitions removed 3435 transitions.
Graph (complete) has 440 edges and 161 vertex of which 77 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 77 transition count 172
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 112 place count 24 transition count 67
Iterating global reduction 1 with 53 rules applied. Total rules applied 165 place count 24 transition count 67
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 191 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 22 transition count 39
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 22 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 20 transition count 33
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 19 transition count 32
Applied a total of 207 rules in 66 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-09 15:27:21] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 15:27:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:27:21] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:27:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:27:21] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:27:21] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 15:27:21] [INFO ] After 57ms 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 369 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 166 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 150 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 170 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-09 15:27:22] [INFO ] Computed 32 place invariants in 121 ms
[2023-03-09 15:27:23] [INFO ] Implicit Places using invariants in 954 ms returned []
[2023-03-09 15:27:23] [INFO ] Invariant cache hit.
[2023-03-09 15:27:24] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:27:25] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 3152 ms to find 0 implicit places.
[2023-03-09 15:27:25] [INFO ] Invariant cache hit.
[2023-03-09 15:27:27] [INFO ] Dead Transitions using invariants and state equation in 2482 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5822 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 262 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 113 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 431 ms. (steps per millisecond=23 ) properties (out of 4) seen :1
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 15:27:28] [INFO ] Invariant cache hit.
[2023-03-09 15:27:29] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2023-03-09 15:27:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 46 ms returned sat
[2023-03-09 15:27:32] [INFO ] After 2704ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:27:32] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:27:32] [INFO ] After 649ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:27:32] [INFO ] After 3978ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:27:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2023-03-09 15:27:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-09 15:27:35] [INFO ] After 2319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:27:39] [INFO ] After 3590ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:27:40] [INFO ] After 4600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 559 ms.
[2023-03-09 15:27:40] [INFO ] After 7976ms 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 26 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 3 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 1429 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 1429 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 285 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 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 133655 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133655 steps, saw 26402 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2023-03-09 15:27:45] [INFO ] Computed 32 place invariants in 90 ms
[2023-03-09 15:27:46] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-09 15:27:46] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-09 15:27:47] [INFO ] After 1423ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:27:47] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-09 15:27:48] [INFO ] After 658ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:27:48] [INFO ] After 2429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:27:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-09 15:27:48] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-09 15:27:49] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:27:50] [INFO ] After 1113ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:27:51] [INFO ] After 1921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 568 ms.
[2023-03-09 15:27:52] [INFO ] After 3776ms 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 165 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 165 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 139 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2023-03-09 15:27:52] [INFO ] Invariant cache hit.
[2023-03-09 15:27:53] [INFO ] Implicit Places using invariants in 1631 ms returned []
[2023-03-09 15:27:53] [INFO ] Invariant cache hit.
[2023-03-09 15:27:55] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-09 15:28:17] [INFO ] Implicit Places using invariants and state equation in 23216 ms returned []
Implicit Place search using SMT with State Equation took 24879 ms to find 0 implicit places.
[2023-03-09 15:28:17] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-09 15:28:17] [INFO ] Invariant cache hit.
[2023-03-09 15:28:19] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27043 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 2 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 19 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-09 15:28:19] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 15:28:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 15:28:19] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:28:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 15:28:19] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:28:19] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 15:28:19] [INFO ] After 94ms 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 372 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 212 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 205 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 224 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 140 reset in 686 ms.
Product exploration explored 100000 steps with 141 reset in 725 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 174 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 1 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 15 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 1743 ms. Remains 1990 /2163 variables (removed 173) and now considering 6274/5580 (removed -694) transitions.
[2023-03-09 15:28:24] [INFO ] Redundant transitions in 541 ms returned []
// Phase 1: matrix 6274 rows 1990 cols
[2023-03-09 15:28:24] [INFO ] Computed 32 place invariants in 172 ms
[2023-03-09 15:28:32] [INFO ] Dead Transitions using invariants and state equation in 7577 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 9913 ms. Remains : 1990/2163 places, 6274/5580 transitions.
Built C files in :
/tmp/ltsmin4017620949404997682
[2023-03-09 15:28:32] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4017620949404997682
Running compilation step : cd /tmp/ltsmin4017620949404997682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4017620949404997682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4017620949404997682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 105 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-09 15:28:35] [INFO ] Computed 32 place invariants in 184 ms
[2023-03-09 15:28:37] [INFO ] Implicit Places using invariants in 1571 ms returned []
[2023-03-09 15:28:37] [INFO ] Invariant cache hit.
[2023-03-09 15:28:37] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:28:39] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 3861 ms to find 0 implicit places.
[2023-03-09 15:28:39] [INFO ] Invariant cache hit.
[2023-03-09 15:28:42] [INFO ] Dead Transitions using invariants and state equation in 2785 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6756 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Built C files in :
/tmp/ltsmin2338419698834239123
[2023-03-09 15:28:42] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2338419698834239123
Running compilation step : cd /tmp/ltsmin2338419698834239123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2338419698834239123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2338419698834239123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 15:28:45] [INFO ] Flatten gal took : 244 ms
[2023-03-09 15:28:45] [INFO ] Flatten gal took : 265 ms
[2023-03-09 15:28:45] [INFO ] Time to serialize gal into /tmp/LTL17171643963297267209.gal : 35 ms
[2023-03-09 15:28:45] [INFO ] Time to serialize properties into /tmp/LTL4956567284723695557.prop : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17171643963297267209.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4768441662964106053.hoa' '-atoms' '/tmp/LTL4956567284723695557.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4956567284723695557.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4768441662964106053.hoa
Detected timeout of ITS tools.
[2023-03-09 15:29:01] [INFO ] Flatten gal took : 120 ms
[2023-03-09 15:29:01] [INFO ] Flatten gal took : 129 ms
[2023-03-09 15:29:01] [INFO ] Time to serialize gal into /tmp/LTL17947100859028390992.gal : 29 ms
[2023-03-09 15:29:01] [INFO ] Time to serialize properties into /tmp/LTL7950044247708070599.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17947100859028390992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7950044247708070599.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((Node4GiveAnswer9<1)||(Node3IsInserted<1))")||(("(Node0requestsent3<1)")||(G("((Node9ID2<1)&&((Node9IsInserted<1)||(Node22re...178
Formula 0 simplified : XF(!"((Node4GiveAnswer9<1)||(Node3IsInserted<1))" & !"(Node0requestsent3<1)" & F!"((Node9ID2<1)&&((Node9IsInserted<1)||(Node22reques...168
Detected timeout of ITS tools.
[2023-03-09 15:29:16] [INFO ] Flatten gal took : 110 ms
[2023-03-09 15:29:16] [INFO ] Applying decomposition
[2023-03-09 15:29:16] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph93450228011822249.txt' '-o' '/tmp/graph93450228011822249.bin' '-w' '/tmp/graph93450228011822249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph93450228011822249.bin' '-l' '-1' '-v' '-w' '/tmp/graph93450228011822249.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:29:17] [INFO ] Decomposing Gal with order
[2023-03-09 15:29:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:29:17] [INFO ] Removed a total of 2707 redundant transitions.
[2023-03-09 15:29:17] [INFO ] Flatten gal took : 359 ms
[2023-03-09 15:29:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2792 labels/synchronizations in 142 ms.
[2023-03-09 15:29:17] [INFO ] Time to serialize gal into /tmp/LTL13359204741818973541.gal : 45 ms
[2023-03-09 15:29:17] [INFO ] Time to serialize properties into /tmp/LTL7139749537218452949.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13359204741818973541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7139749537218452949.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i17.u38.Node4GiveAnswer9<1)||(i12.i1.u12.Node3IsInserted<1))")||(("(u3.Node0requestsent3<1)")||(G("((i17.u37.Node9ID2<1)&&(...220
Formula 0 simplified : XF(!"((i17.u38.Node4GiveAnswer9<1)||(i12.i1.u12.Node3IsInserted<1))" & !"(u3.Node0requestsent3<1)" & F!"((i17.u37.Node9ID2<1)&&((u35...210
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3913952591176944016
[2023-03-09 15:29:32] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3913952591176944016
Running compilation step : cd /tmp/ltsmin3913952591176944016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3913952591176944016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3913952591176944016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 185235 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 117 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:29:36] [INFO ] Invariant cache hit.
[2023-03-09 15:29:37] [INFO ] Implicit Places using invariants in 992 ms returned []
[2023-03-09 15:29:37] [INFO ] Invariant cache hit.
[2023-03-09 15:29:38] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:29:39] [INFO ] Implicit Places using invariants and state equation in 2143 ms returned []
Implicit Place search using SMT with State Equation took 3140 ms to find 0 implicit places.
[2023-03-09 15:29:39] [INFO ] Invariant cache hit.
[2023-03-09 15:29:42] [INFO ] Dead Transitions using invariants and state equation in 3084 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6357 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 177 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 757 steps with 4 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-06 finished in 6599 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 139 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:29:42] [INFO ] Invariant cache hit.
[2023-03-09 15:29:43] [INFO ] Implicit Places using invariants in 852 ms returned []
[2023-03-09 15:29:43] [INFO ] Invariant cache hit.
[2023-03-09 15:29:44] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:29:45] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 3068 ms to find 0 implicit places.
[2023-03-09 15:29:45] [INFO ] Invariant cache hit.
[2023-03-09 15:29:49] [INFO ] Dead Transitions using invariants and state equation in 3947 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7156 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 131 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 760 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-07 finished in 7330 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 124 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:29:50] [INFO ] Invariant cache hit.
[2023-03-09 15:29:51] [INFO ] Implicit Places using invariants in 961 ms returned []
[2023-03-09 15:29:51] [INFO ] Invariant cache hit.
[2023-03-09 15:29:51] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:29:53] [INFO ] Implicit Places using invariants and state equation in 2462 ms returned []
Implicit Place search using SMT with State Equation took 3433 ms to find 0 implicit places.
[2023-03-09 15:29:53] [INFO ] Invariant cache hit.
[2023-03-09 15:29:56] [INFO ] Dead Transitions using invariants and state equation in 3075 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6644 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 159 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 698 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-08 finished in 6872 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 162 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2023-03-09 15:29:56] [INFO ] Invariant cache hit.
[2023-03-09 15:29:58] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2023-03-09 15:29:58] [INFO ] Invariant cache hit.
[2023-03-09 15:29:59] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-09 15:30:00] [INFO ] Implicit Places using invariants and state equation in 2272 ms returned []
Implicit Place search using SMT with State Equation took 3350 ms to find 0 implicit places.
[2023-03-09 15:30:00] [INFO ] Invariant cache hit.
[2023-03-09 15:30:02] [INFO ] Dead Transitions using invariants and state equation in 2410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5924 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 174 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 6135 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 493 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3692/5580 (removed 1888) transitions.
// Phase 1: matrix 3692 rows 1085 cols
[2023-03-09 15:30:03] [INFO ] Computed 32 place invariants in 38 ms
[2023-03-09 15:30:03] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-09 15:30:03] [INFO ] Invariant cache hit.
[2023-03-09 15:30:04] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-09 15:30:10] [INFO ] Implicit Places using invariants and state equation in 6171 ms returned []
Implicit Place search using SMT with State Equation took 6670 ms to find 0 implicit places.
[2023-03-09 15:30:10] [INFO ] Redundant transitions in 150 ms returned []
[2023-03-09 15:30:10] [INFO ] Invariant cache hit.
[2023-03-09 15:30:11] [INFO ] Dead Transitions using invariants and state equation in 1518 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 8841 ms. Remains : 1085/2163 places, 3692/5580 transitions.
Stuttering acceptance computed with spot in 93 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 161 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 8962 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 492 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2023-03-09 15:30:12] [INFO ] Computed 32 place invariants in 88 ms
[2023-03-09 15:30:13] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2023-03-09 15:30:13] [INFO ] Invariant cache hit.
[2023-03-09 15:30:14] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-09 15:30:22] [INFO ] Implicit Places using invariants and state equation in 9362 ms returned []
Implicit Place search using SMT with State Equation took 10386 ms to find 0 implicit places.
[2023-03-09 15:30:22] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-09 15:30:22] [INFO ] Invariant cache hit.
[2023-03-09 15:30:24] [INFO ] Dead Transitions using invariants and state equation in 1520 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 12530 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 128 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 661 reset in 966 ms.
Product exploration explored 100000 steps with 649 reset in 733 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 161 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 104 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 254198 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254198 steps, saw 40158 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:30:29] [INFO ] Invariant cache hit.
[2023-03-09 15:30:29] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-09 15:30:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-09 15:30:30] [INFO ] After 790ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:30:30] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-09 15:30:30] [INFO ] After 294ms SMT Verify possible using 2667 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:30:30] [INFO ] After 1307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:30:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2023-03-09 15:30:31] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 29 ms returned sat
[2023-03-09 15:30:32] [INFO ] After 1397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:30:33] [INFO ] After 679ms SMT Verify possible using 2667 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:30:33] [INFO ] After 886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-09 15:30:33] [INFO ] After 2798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 173 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 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 71 ms. Remains 1084 /1084 variables (removed 0) and now considering 3690/3690 (removed 0) transitions.
[2023-03-09 15:30:34] [INFO ] Invariant cache hit.
[2023-03-09 15:30:34] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-09 15:30:34] [INFO ] Invariant cache hit.
[2023-03-09 15:30:36] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-09 15:30:42] [INFO ] Implicit Places using invariants and state equation in 7487 ms returned []
Implicit Place search using SMT with State Equation took 8084 ms to find 0 implicit places.
[2023-03-09 15:30:42] [INFO ] Redundant transitions in 169 ms returned []
[2023-03-09 15:30:42] [INFO ] Invariant cache hit.
[2023-03-09 15:30:44] [INFO ] Dead Transitions using invariants and state equation in 1592 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9939 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 385 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 131 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 250910 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250910 steps, saw 39790 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:30:47] [INFO ] Invariant cache hit.
[2023-03-09 15:30:47] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-09 15:30:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-09 15:30:49] [INFO ] After 1223ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:30:49] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2023-03-09 15:30:49] [INFO ] After 425ms SMT Verify possible using 2667 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:30:49] [INFO ] After 1933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:30:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-09 15:30:49] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-09 15:30:50] [INFO ] After 845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:30:51] [INFO ] After 575ms SMT Verify possible using 2667 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:30:51] [INFO ] After 752ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-09 15:30:51] [INFO ] After 1923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 654 reset in 1091 ms.
Stack based approach found an accepted trace after 78172 steps with 515 reset with depth 146 and stack size 146 in 668 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-14 finished in 41810 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 796 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3692/5580 (removed 1888) transitions.
// Phase 1: matrix 3692 rows 1085 cols
[2023-03-09 15:30:54] [INFO ] Computed 32 place invariants in 39 ms
[2023-03-09 15:30:55] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-09 15:30:55] [INFO ] Invariant cache hit.
[2023-03-09 15:30:55] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-09 15:31:01] [INFO ] Implicit Places using invariants and state equation in 5981 ms returned []
Implicit Place search using SMT with State Equation took 6527 ms to find 0 implicit places.
[2023-03-09 15:31:01] [INFO ] Redundant transitions in 153 ms returned []
[2023-03-09 15:31:01] [INFO ] Invariant cache hit.
[2023-03-09 15:31:02] [INFO ] Dead Transitions using invariants and state equation in 1436 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 8923 ms. Remains : 1085/2163 places, 3692/5580 transitions.
Stuttering acceptance computed with spot in 94 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 145 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 9044 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)))'
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 161 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 507 ms. Remains 1088 /2163 variables (removed 1075) and now considering 3694/5580 (removed 1886) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2023-03-09 15:31:03] [INFO ] Computed 32 place invariants in 37 ms
[2023-03-09 15:31:04] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-09 15:31:04] [INFO ] Invariant cache hit.
[2023-03-09 15:31:05] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-09 15:31:09] [INFO ] Implicit Places using invariants and state equation in 5469 ms returned []
Implicit Place search using SMT with State Equation took 6055 ms to find 0 implicit places.
[2023-03-09 15:31:09] [INFO ] Invariant cache hit.
[2023-03-09 15:31:11] [INFO ] Dead Transitions using invariants and state equation in 1522 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 8089 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 637 reset in 740 ms.
Product exploration explored 100000 steps with 639 reset in 702 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 319 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 121 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 201 ms. (steps per millisecond=49 ) properties (out of 4) 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 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 15:31:13] [INFO ] Invariant cache hit.
[2023-03-09 15:31:13] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-09 15:31:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-09 15:31:14] [INFO ] After 767ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:31:14] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-09 15:31:14] [INFO ] After 391ms SMT Verify possible using 2666 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:31:14] [INFO ] After 1393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:31:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-09 15:31:14] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-09 15:31:15] [INFO ] After 947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:31:16] [INFO ] After 965ms SMT Verify possible using 2666 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:31:17] [INFO ] After 1444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 425 ms.
[2023-03-09 15:31:17] [INFO ] After 3102ms 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 488 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 489 ms. Remains : 1085/1088 places, 3691/3694 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 376 ms. (steps per millisecond=26 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 145430 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145430 steps, saw 28005 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2023-03-09 15:31:21] [INFO ] Computed 32 place invariants in 44 ms
[2023-03-09 15:31:22] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-09 15:31:22] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-09 15:31:23] [INFO ] After 1135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:31:23] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-09 15:31:23] [INFO ] After 711ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:31:23] [INFO ] After 2126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:31:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-09 15:31:24] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-09 15:31:25] [INFO ] After 1133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:31:26] [INFO ] After 932ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:31:27] [INFO ] After 1650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 559 ms.
[2023-03-09 15:31:27] [INFO ] After 3643ms 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 116 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 116 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 109 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2023-03-09 15:31:27] [INFO ] Invariant cache hit.
[2023-03-09 15:31:28] [INFO ] Implicit Places using invariants in 1006 ms returned []
[2023-03-09 15:31:28] [INFO ] Invariant cache hit.
[2023-03-09 15:31:29] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-09 15:31:51] [INFO ] Implicit Places using invariants and state equation in 22793 ms returned []
Implicit Place search using SMT with State Equation took 23819 ms to find 0 implicit places.
[2023-03-09 15:31:51] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-09 15:31:51] [INFO ] Invariant cache hit.
[2023-03-09 15:31:53] [INFO ] Dead Transitions using invariants and state equation in 1453 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25507 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 13 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-09 15:31:53] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 15:31:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:31:53] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:31:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 15:31:53] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:31:53] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 15:31:53] [INFO ] After 65ms 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 441 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 174 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 55 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
// Phase 1: matrix 3694 rows 1088 cols
[2023-03-09 15:31:54] [INFO ] Computed 32 place invariants in 82 ms
[2023-03-09 15:31:54] [INFO ] Implicit Places using invariants in 706 ms returned []
[2023-03-09 15:31:54] [INFO ] Invariant cache hit.
[2023-03-09 15:31:55] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-09 15:32:01] [INFO ] Implicit Places using invariants and state equation in 6239 ms returned []
Implicit Place search using SMT with State Equation took 6973 ms to find 0 implicit places.
[2023-03-09 15:32:01] [INFO ] Invariant cache hit.
[2023-03-09 15:32:02] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8486 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 804 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 224 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
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 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 15:32:04] [INFO ] Invariant cache hit.
[2023-03-09 15:32:04] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-09 15:32:04] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-09 15:32:05] [INFO ] After 818ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:32:05] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-09 15:32:05] [INFO ] After 345ms SMT Verify possible using 2666 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:32:05] [INFO ] After 1458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:32:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-09 15:32:06] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-09 15:32:07] [INFO ] After 1094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:32:08] [INFO ] After 1127ms SMT Verify possible using 2666 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:32:09] [INFO ] After 1877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 481 ms.
[2023-03-09 15:32:09] [INFO ] After 3727ms 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 8 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 404 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 405 ms. Remains : 1085/1088 places, 3691/3694 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 116305 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116305 steps, saw 24077 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 1085 cols
[2023-03-09 15:32:13] [INFO ] Computed 32 place invariants in 33 ms
[2023-03-09 15:32:13] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-09 15:32:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-09 15:32:14] [INFO ] After 1024ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:32:14] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-09 15:32:15] [INFO ] After 593ms SMT Verify possible using 3564 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:32:15] [INFO ] After 1948ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:32:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-09 15:32:15] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-09 15:32:16] [INFO ] After 1024ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:32:17] [INFO ] After 844ms SMT Verify possible using 3564 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:32:18] [INFO ] After 1584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 540 ms.
[2023-03-09 15:32:18] [INFO ] After 3421ms 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 117 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 117 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 106 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2023-03-09 15:32:18] [INFO ] Invariant cache hit.
[2023-03-09 15:32:20] [INFO ] Implicit Places using invariants in 1055 ms returned []
[2023-03-09 15:32:20] [INFO ] Invariant cache hit.
[2023-03-09 15:32:20] [INFO ] State equation strengthened by 3564 read => feed constraints.
[2023-03-09 15:32:41] [INFO ] Implicit Places using invariants and state equation in 21101 ms returned []
Implicit Place search using SMT with State Equation took 22160 ms to find 0 implicit places.
[2023-03-09 15:32:41] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-09 15:32:41] [INFO ] Invariant cache hit.
[2023-03-09 15:32:43] [INFO ] Dead Transitions using invariants and state equation in 1995 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24463 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 12 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-09 15:32:43] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 15:32:43] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 15:32:43] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:32:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:32:43] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:32:43] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 15:32:43] [INFO ] After 84ms 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 396 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 96 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 641 reset in 936 ms.
Product exploration explored 100000 steps with 641 reset in 773 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 171 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 93 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2023-03-09 15:32:46] [INFO ] Redundant transitions in 176 ms returned []
// Phase 1: matrix 3694 rows 1088 cols
[2023-03-09 15:32:46] [INFO ] Computed 32 place invariants in 84 ms
[2023-03-09 15:32:48] [INFO ] Dead Transitions using invariants and state equation in 2002 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2292 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Built C files in :
/tmp/ltsmin9137655001095497742
[2023-03-09 15:32:48] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9137655001095497742
Running compilation step : cd /tmp/ltsmin9137655001095497742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9137655001095497742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9137655001095497742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 86 ms. Remains 1088 /1088 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2023-03-09 15:32:51] [INFO ] Invariant cache hit.
[2023-03-09 15:32:52] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-09 15:32:52] [INFO ] Invariant cache hit.
[2023-03-09 15:32:53] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2023-03-09 15:32:58] [INFO ] Implicit Places using invariants and state equation in 6798 ms returned []
Implicit Place search using SMT with State Equation took 7252 ms to find 0 implicit places.
[2023-03-09 15:32:58] [INFO ] Invariant cache hit.
[2023-03-09 15:33:00] [INFO ] Dead Transitions using invariants and state equation in 1656 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8996 ms. Remains : 1088/1088 places, 3694/3694 transitions.
Built C files in :
/tmp/ltsmin15946079850217228780
[2023-03-09 15:33:00] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15946079850217228780
Running compilation step : cd /tmp/ltsmin15946079850217228780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15946079850217228780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15946079850217228780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 15:33:03] [INFO ] Flatten gal took : 72 ms
[2023-03-09 15:33:04] [INFO ] Flatten gal took : 129 ms
[2023-03-09 15:33:04] [INFO ] Time to serialize gal into /tmp/LTL14823612743976844388.gal : 37 ms
[2023-03-09 15:33:04] [INFO ] Time to serialize properties into /tmp/LTL5922014436536171682.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14823612743976844388.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7383514904294623799.hoa' '-atoms' '/tmp/LTL5922014436536171682.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5922014436536171682.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7383514904294623799.hoa
Detected timeout of ITS tools.
[2023-03-09 15:33:19] [INFO ] Flatten gal took : 61 ms
[2023-03-09 15:33:19] [INFO ] Flatten gal took : 58 ms
[2023-03-09 15:33:19] [INFO ] Time to serialize gal into /tmp/LTL6957888038134096305.gal : 10 ms
[2023-03-09 15:33:19] [INFO ] Time to serialize properties into /tmp/LTL5470867965753173866.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6957888038134096305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5470867965753173866.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((Node4GiveAnswer9<1)||(Node3IsInserted<1))")||(("(Node0requestsent3<1)")||(G("((Node9ID2<1)&&((Node9IsInserted<1)||(Node22re...178
Formula 0 simplified : XF(!"((Node4GiveAnswer9<1)||(Node3IsInserted<1))" & !"(Node0requestsent3<1)" & F!"((Node9ID2<1)&&((Node9IsInserted<1)||(Node22reques...168
Detected timeout of ITS tools.
[2023-03-09 15:33:34] [INFO ] Flatten gal took : 84 ms
[2023-03-09 15:33:34] [INFO ] Applying decomposition
[2023-03-09 15:33:34] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17291400933733320786.txt' '-o' '/tmp/graph17291400933733320786.bin' '-w' '/tmp/graph17291400933733320786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17291400933733320786.bin' '-l' '-1' '-v' '-w' '/tmp/graph17291400933733320786.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:33:34] [INFO ] Decomposing Gal with order
[2023-03-09 15:33:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:33:34] [INFO ] Removed a total of 2702 redundant transitions.
[2023-03-09 15:33:35] [INFO ] Flatten gal took : 180 ms
[2023-03-09 15:33:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1741 labels/synchronizations in 80 ms.
[2023-03-09 15:33:35] [INFO ] Time to serialize gal into /tmp/LTL2566071122132020251.gal : 34 ms
[2023-03-09 15:33:35] [INFO ] Time to serialize properties into /tmp/LTL3320081044444134953.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2566071122132020251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3320081044444134953.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u11.Node4GiveAnswer9<1)||(u4.Node3IsInserted<1))")||(("(u1.Node0requestsent3<1)")||(G("((i0.u10.Node9ID2<1)&&((u11.Node9IsI...203
Formula 0 simplified : XF(!"((u11.Node4GiveAnswer9<1)||(u4.Node3IsInserted<1))" & !"(u1.Node0requestsent3<1)" & F!"((i0.u10.Node9ID2<1)&&((u11.Node9IsInser...193
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6462252642478896660
[2023-03-09 15:33:50] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6462252642478896660
Running compilation step : cd /tmp/ltsmin6462252642478896660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6462252642478896660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6462252642478896660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 170664 ms.
[2023-03-09 15:33:53] [INFO ] Flatten gal took : 99 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16030204343034372472
[2023-03-09 15:33:53] [INFO ] Too many transitions (5580) to apply POR reductions. Disabling POR matrices.
[2023-03-09 15:33:53] [INFO ] Applying decomposition
[2023-03-09 15:33:53] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16030204343034372472
Running compilation step : cd /tmp/ltsmin16030204343034372472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 15:33:53] [INFO ] Flatten gal took : 112 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1867828360245605464.txt' '-o' '/tmp/graph1867828360245605464.bin' '-w' '/tmp/graph1867828360245605464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1867828360245605464.bin' '-l' '-1' '-v' '-w' '/tmp/graph1867828360245605464.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:33:54] [INFO ] Decomposing Gal with order
[2023-03-09 15:33:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:33:54] [INFO ] Removed a total of 2711 redundant transitions.
[2023-03-09 15:33:54] [INFO ] Flatten gal took : 217 ms
[2023-03-09 15:33:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2671 labels/synchronizations in 87 ms.
[2023-03-09 15:33:54] [INFO ] Time to serialize gal into /tmp/LTLFireability11815345217232658402.gal : 26 ms
[2023-03-09 15:33:54] [INFO ] Time to serialize properties into /tmp/LTLFireability7949656871592824918.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11815345217232658402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7949656871592824918.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(G("(u79.Node13GiveAnswer19<1)"))))
Formula 0 simplified : GF!"(u79.Node13GiveAnswer19<1)"
Compilation finished in 17640 ms.
Running link step : cd /tmp/ltsmin16030204343034372472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 449 ms.
Running LTSmin : cd /tmp/ltsmin16030204343034372472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 15:57:13] [INFO ] Flatten gal took : 311 ms
[2023-03-09 15:57:13] [INFO ] Time to serialize gal into /tmp/LTLFireability412500992644802051.gal : 33 ms
[2023-03-09 15:57:13] [INFO ] Time to serialize properties into /tmp/LTLFireability15641790867752809977.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability412500992644802051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15641790867752809977.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((F(G("(Node13GiveAnswer19<1)"))))
Formula 0 simplified : GF!"(Node13GiveAnswer19<1)"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin16030204343034372472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16030204343034372472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 16:20:31] [INFO ] Flatten gal took : 372 ms
[2023-03-09 16:20:31] [INFO ] Input system was already deterministic with 5580 transitions.
[2023-03-09 16:20:31] [INFO ] Transformed 2163 places.
[2023-03-09 16:20:31] [INFO ] Transformed 5580 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 16:20:34] [INFO ] Time to serialize gal into /tmp/LTLFireability4792074313648613096.gal : 44 ms
[2023-03-09 16:20:34] [INFO ] Time to serialize properties into /tmp/LTLFireability1914995661167219639.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4792074313648613096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1914995661167219639.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(Node13GiveAnswer19<1)"))))
Formula 0 simplified : GF!"(Node13GiveAnswer19<1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11312132 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16027188 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-030"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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