Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872300004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CANInsertWithFailure-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872300004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.8K May 30 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 30 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 30 15:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 30 15:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 15:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 30 15:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 30 15:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K May 30 15:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 25 12:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 202K May 29 12:20 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-005-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654639579938

Running Version 202205111006
[2022-06-07 22:06:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-07 22:06:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-07 22:06:22] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2022-06-07 22:06:22] [INFO ] Transformed 114 places.
[2022-06-07 22:06:22] [INFO ] Transformed 180 transitions.
[2022-06-07 22:06:22] [INFO ] Parsed PT model containing 114 places and 180 transitions in 311 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 21 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:22] [INFO ] Computed 7 place invariants in 20 ms
[2022-06-07 22:06:22] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:22] [INFO ] Computed 7 place invariants in 5 ms
[2022-06-07 22:06:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:23] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:23] [INFO ] Computed 7 place invariants in 10 ms
[2022-06-07 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/114 places, 180/180 transitions.
Support contains 38 out of 113 places after structural reductions.
[2022-06-07 22:06:23] [INFO ] Flatten gal took : 91 ms
[2022-06-07 22:06:23] [INFO ] Flatten gal took : 37 ms
[2022-06-07 22:06:23] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 35 out of 113 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:24] [INFO ] Computed 7 place invariants in 6 ms
[2022-06-07 22:06:24] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-06-07 22:06:24] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-07 22:06:24] [INFO ] After 87ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-07 22:06:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:24] [INFO ] After 7ms SMT Verify possible using 45 Read/Feed constraints in real domain returned unsat :1 sat :0
[2022-06-07 22:06:24] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 22 stabilizing places and 35 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(!(G(p0) U (X(X(p1)) U p0)))||F(p2)))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:25] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-07 22:06:25] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:25] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:25] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:25] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-07 22:06:25] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 349 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(GEQ s18 1), p2:(LT s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 529 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Detected a total of 22/113 stabilizing places and 35/180 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2)
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-00 finished in 1894 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!X(X(p0))))||X(!F(p1))) U p2))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:27] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:27] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:27] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-07 22:06:27] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:27] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:27] [INFO ] Computed 7 place invariants in 7 ms
[2022-06-07 22:06:27] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 560 ms :[(NOT p2), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p1 p0), p1]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=(AND p1 p0), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 9}], [{ cond=p1, acceptance={} source=9 dest: 6}, { cond=(NOT p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(GEQ s10 1), p1:(AND (GEQ s63 1) (GEQ s87 1)), p0:(GEQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16670 reset in 252 ms.
Product exploration explored 100000 steps with 16696 reset in 449 ms.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 399 ms. Reduced automaton from 10 states, 16 edges and 3 AP to 10 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p1 p0), p1]
Incomplete random walk after 10000 steps, including 101 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:30] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:30] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-06-07 22:06:30] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 4 ms returned sat
[2022-06-07 22:06:30] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p2), (F p0), (F p1)]
Knowledge based reduction with 7 factoid took 698 ms. Reduced automaton from 10 states, 16 edges and 3 AP to 10 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 461 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p0 p1), p1]
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p0 p1), p1]
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:31] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-07 22:06:31] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:06:31] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:06:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:06:32] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-06-07 22:06:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:06:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:06:32] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:06:32] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-06-07 22:06:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:32] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2022-06-07 22:06:32] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 28 ms.
[2022-06-07 22:06:32] [INFO ] Added : 92 causal constraints over 20 iterations in 539 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 22 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:32] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:33] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:33] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-07 22:06:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:33] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:33] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:33] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 592 ms. Reduced automaton from 10 states, 15 edges and 3 AP to 10 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p0 p1), p1]
Finished random walk after 517 steps, including 4 resets, run visited all 3 properties in 4 ms. (steps per millisecond=129 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 560 ms. Reduced automaton from 10 states, 15 edges and 3 AP to 10 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p0 p1), p1]
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p0 p1), p1]
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:35] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:36] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:06:36] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:06:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:06:36] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2022-06-07 22:06:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:06:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-06-07 22:06:36] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 5 ms returned sat
[2022-06-07 22:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:06:36] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2022-06-07 22:06:36] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:36] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2022-06-07 22:06:36] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 26 ms.
[2022-06-07 22:06:37] [INFO ] Added : 92 causal constraints over 20 iterations in 556 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p0 p1), p1]
Product exploration explored 100000 steps with 16665 reset in 208 ms.
Product exploration explored 100000 steps with 16645 reset in 222 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, false, true]
Stuttering acceptance computed with spot in 570 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p0 p1), p1]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 113 transition count 180
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 22 place count 113 transition count 180
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 113 transition count 180
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 105 transition count 172
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 105 transition count 172
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 67 place count 105 transition count 202
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 90 transition count 187
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 90 transition count 187
Deduced a syphon composed of 28 places in 0 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 109 place count 90 transition count 175
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 109 rules in 73 ms. Remains 90 /113 variables (removed 23) and now considering 175/180 (removed 5) transitions.
[2022-06-07 22:06:38] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 175 rows 90 cols
[2022-06-07 22:06:38] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:39] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/113 places, 175/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/113 places, 175/180 transitions.
Product exploration explored 100000 steps with 16688 reset in 200 ms.
Product exploration explored 100000 steps with 16671 reset in 216 ms.
Built C files in :
/tmp/ltsmin13270075084268619739
[2022-06-07 22:06:39] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13270075084268619739
Running compilation step : cd /tmp/ltsmin13270075084268619739;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 828 ms.
Running link step : cd /tmp/ltsmin13270075084268619739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin13270075084268619739;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11018497308760202940.hoa' '--buchi-type=spotba'
LTSmin run took 143 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-01 finished in 13579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (F(((X(p2)&&p1) U p2))&&G(p0)))||F(p3)))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 113 transition count 148
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 81 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 80 transition count 146
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 63 transition count 130
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 109 place count 63 transition count 121
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 115 place count 63 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 61 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 61 transition count 119
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 61 transition count 116
Applied a total of 122 rules in 53 ms. Remains 61 /113 variables (removed 52) and now considering 116/180 (removed 64) transitions.
// Phase 1: matrix 116 rows 61 cols
[2022-06-07 22:06:40] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:40] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 116 rows 61 cols
[2022-06-07 22:06:40] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:40] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-07 22:06:41] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2022-06-07 22:06:41] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 116 rows 61 cols
[2022-06-07 22:06:41] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:41] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/113 places, 116/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/113 places, 116/180 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p3) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p3:(AND (GEQ s25 1) (GEQ s26 1)), p0:(AND (GEQ s30 1) (GEQ s49 1)), p2:(GEQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-02 finished in 683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U !p1)) U G(X((p0 U p1)))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:41] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:41] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:41] [INFO ] Computed 7 place invariants in 7 ms
[2022-06-07 22:06:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:41] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:41] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:42] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 376 ms :[(NOT p1), false, (NOT p1), true, (NOT p1), p1, p1, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(OR (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s95 1)), p0:(AND (GEQ s49 1) (GEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24898 reset in 297 ms.
Product exploration explored 100000 steps with 24927 reset in 304 ms.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR p1 p0))), (X (NOT p0)), true, (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 952 ms. Reduced automaton from 8 states, 20 edges and 2 AP to 7 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), true, (NOT p1), p1, p1, (NOT p1)]
Incomplete random walk after 10000 steps, including 99 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:44] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:06:44] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 4 ms returned sat
[2022-06-07 22:06:44] [INFO ] After 115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-07 22:06:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:44] [INFO ] After 25ms SMT Verify possible using 45 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-07 22:06:44] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-07 22:06:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-06-07 22:06:44] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 4 ms returned sat
[2022-06-07 22:06:44] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-07 22:06:44] [INFO ] After 35ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-07 22:06:44] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-07 22:06:44] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 80 transition count 146
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 68 place count 79 transition count 146
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 106 place count 60 transition count 127
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 60 transition count 115
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 60 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 58 transition count 113
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 144 place count 58 transition count 113
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 151 place count 58 transition count 113
Applied a total of 151 rules in 43 ms. Remains 58 /113 variables (removed 55) and now considering 113/180 (removed 67) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/113 places, 113/180 transitions.
Incomplete random walk after 10000 steps, including 397 resets, run finished after 32 ms. (steps per millisecond=312 ) 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
Probably explored full state space saw : 14935 states, properties seen :0
Probabilistic random walk after 81857 steps, saw 14935 distinct states, run finished after 275 ms. (steps per millisecond=297 ) properties seen :0
Explored full state space saw : 14935 states, properties seen :0
Exhaustive walk after 81857 steps, saw 14935 distinct states, run finished after 175 ms. (steps per millisecond=467 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR p1 p0))), (X (NOT p0)), true, (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND p1 (NOT p0))), (F (OR p1 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 18 factoid took 1043 ms. Reduced automaton from 7 states, 19 edges and 2 AP to 6 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0), p1, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0), p1, (OR (NOT p1) p0)]
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:46] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:06:47] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:06:47] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-06-07 22:06:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:06:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:06:47] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-07 22:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:06:47] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2022-06-07 22:06:47] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:47] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2022-06-07 22:06:47] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 25 ms.
[2022-06-07 22:06:47] [INFO ] Added : 45 causal constraints over 9 iterations in 237 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 80 transition count 146
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 106 place count 60 transition count 127
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 60 transition count 115
Applied a total of 118 rules in 40 ms. Remains 60 /113 variables (removed 53) and now considering 115/180 (removed 65) transitions.
// Phase 1: matrix 115 rows 60 cols
[2022-06-07 22:06:47] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:47] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 115 rows 60 cols
[2022-06-07 22:06:47] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:47] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-07 22:06:47] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2022-06-07 22:06:47] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 115 rows 60 cols
[2022-06-07 22:06:47] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:48] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/113 places, 115/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/113 places, 115/180 transitions.
Computed a total of 16 stabilizing places and 25 stable transitions
Computed a total of 16 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 765 ms. Reduced automaton from 6 states, 16 edges and 2 AP to 6 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0), p1, (OR (NOT p1) p0)]
Finished random walk after 86 steps, including 2 resets, run visited all 5 properties in 6 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1), (F (OR p0 p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 819 ms. Reduced automaton from 6 states, 16 edges and 2 AP to 6 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0), p1, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0), p1, (OR (NOT p1) p0)]
// Phase 1: matrix 115 rows 60 cols
[2022-06-07 22:06:50] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:50] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:06:50] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-07 22:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:06:50] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-06-07 22:06:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:06:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:06:50] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:06:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:06:50] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-06-07 22:06:50] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-07 22:06:50] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2022-06-07 22:06:50] [INFO ] Computed and/alt/rep : 100/253/100 causal constraints (skipped 10 transitions) in 14 ms.
[2022-06-07 22:06:50] [INFO ] Added : 10 causal constraints over 2 iterations in 58 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0), p1, (OR (NOT p1) p0)]
Entered a terminal (fully accepting) state of product in 190 steps with 68 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-03 finished in 9762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(F(p0)))))'
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 80 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 106 place count 60 transition count 127
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 118 place count 60 transition count 115
Applied a total of 118 rules in 29 ms. Remains 60 /113 variables (removed 53) and now considering 115/180 (removed 65) transitions.
// Phase 1: matrix 115 rows 60 cols
[2022-06-07 22:06:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:51] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 115 rows 60 cols
[2022-06-07 22:06:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-07 22:06:51] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2022-06-07 22:06:51] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 115 rows 60 cols
[2022-06-07 22:06:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:51] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/113 places, 115/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/113 places, 115/180 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s5 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 5898 reset in 272 ms.
Stack based approach found an accepted trace after 30 steps with 2 reset with depth 6 and stack size 6 in 2 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-04 finished in 909 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p0)&&G(p1)))&&p2)))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:52] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:52] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:52] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:52] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:52] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:52] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(LT s110 1), p1:(LT s98 1), p0:(OR (GEQ s98 1) (LT s53 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]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-05 finished in 822 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U p1)))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:52] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:53] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:53] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-07 22:06:53] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:53] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:53] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:53] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, p0, p1, p1, (AND p0 p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s30 1), p1:(AND (GEQ s13 1) (GEQ s15 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 147 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-09 finished in 1595 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(X(p0))&&p1))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 110 place count 58 transition count 125
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 58 transition count 113
Applied a total of 122 rules in 27 ms. Remains 58 /113 variables (removed 55) and now considering 113/180 (removed 67) transitions.
// Phase 1: matrix 113 rows 58 cols
[2022-06-07 22:06:54] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-07 22:06:54] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 113 rows 58 cols
[2022-06-07 22:06:54] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:54] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-07 22:06:54] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2022-06-07 22:06:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 113 rows 58 cols
[2022-06-07 22:06:54] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:54] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/113 places, 113/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/113 places, 113/180 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s42 1), p0:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-10 finished in 517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:55] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:55] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:55] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-11 finished in 915 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:56] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:56] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:56] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:56] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:56] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s50 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][false, false, false]]
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-12 finished in 688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F((X((F(p1)&&G(p2)))&&F(!p2))))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 113 transition count 149
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 82 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 81 transition count 148
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 63 transition count 130
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 111 place count 63 transition count 119
Applied a total of 111 rules in 28 ms. Remains 63 /113 variables (removed 50) and now considering 119/180 (removed 61) transitions.
// Phase 1: matrix 119 rows 63 cols
[2022-06-07 22:06:56] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-07 22:06:56] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 119 rows 63 cols
[2022-06-07 22:06:56] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:56] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-07 22:06:56] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2022-06-07 22:06:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 119 rows 63 cols
[2022-06-07 22:06:56] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:56] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/113 places, 119/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/113 places, 119/180 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p0), (OR (NOT p2) (NOT p1)), p2, (NOT p2), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s11 1), p2:(LT s54 1), p1:(LT s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-13 finished in 656 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(F(p0)))&&G(F(p1))))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 106 place count 60 transition count 127
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 116 place count 60 transition count 117
Applied a total of 116 rules in 20 ms. Remains 60 /113 variables (removed 53) and now considering 117/180 (removed 63) transitions.
// Phase 1: matrix 117 rows 60 cols
[2022-06-07 22:06:57] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:57] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 117 rows 60 cols
[2022-06-07 22:06:57] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-07 22:06:57] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-07 22:06:57] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2022-06-07 22:06:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 117 rows 60 cols
[2022-06-07 22:06:57] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:57] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/113 places, 117/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/113 places, 117/180 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-14 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s52 1), p1:(AND (GEQ s35 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-14 finished in 559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U X(p1))&&F((G(p2)||p3)))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:57] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:57] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:57] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:58] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:58] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:58] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:58] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s11 1), p3:(GEQ s105 1), p1:(GEQ s38 1), p2:(GEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-15 finished in 963 ms.
All properties solved by simple procedures.
Total runtime 36773 ms.

BK_STOP 1654639618975

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-005"
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-4028"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-005, 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 r294-smll-165463872300004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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