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.r024-tall-165251918600516.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 CANConstruction-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 7.6K Apr 29 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 2.5M May 10 09:33 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 CANConstruction-PT-040-LTLFireability-00
FORMULA_NAME CANConstruction-PT-040-LTLFireability-01
FORMULA_NAME CANConstruction-PT-040-LTLFireability-02
FORMULA_NAME CANConstruction-PT-040-LTLFireability-03
FORMULA_NAME CANConstruction-PT-040-LTLFireability-04
FORMULA_NAME CANConstruction-PT-040-LTLFireability-05
FORMULA_NAME CANConstruction-PT-040-LTLFireability-06
FORMULA_NAME CANConstruction-PT-040-LTLFireability-07
FORMULA_NAME CANConstruction-PT-040-LTLFireability-08
FORMULA_NAME CANConstruction-PT-040-LTLFireability-09
FORMULA_NAME CANConstruction-PT-040-LTLFireability-10
FORMULA_NAME CANConstruction-PT-040-LTLFireability-11
FORMULA_NAME CANConstruction-PT-040-LTLFireability-12
FORMULA_NAME CANConstruction-PT-040-LTLFireability-13
FORMULA_NAME CANConstruction-PT-040-LTLFireability-14
FORMULA_NAME CANConstruction-PT-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652648639658

Running Version 202205111006
[2022-05-15 21:04:00] [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-05-15 21:04:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:04:01] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2022-05-15 21:04:01] [INFO ] Transformed 3682 places.
[2022-05-15 21:04:01] [INFO ] Transformed 6720 transitions.
[2022-05-15 21:04:01] [INFO ] Parsed PT model containing 3682 places and 6720 transitions in 367 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 1 formulas.
FORMULA CANConstruction-PT-040-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 3682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Discarding 1507 places :
Symmetric choice reduction at 0 with 1507 rule applications. Total rules 1507 place count 2175 transition count 3706
Iterating global reduction 0 with 1507 rules applied. Total rules applied 3014 place count 2175 transition count 3706
Applied a total of 3014 rules in 424 ms. Remains 2175 /3682 variables (removed 1507) and now considering 3706/6720 (removed 3014) transitions.
// Phase 1: matrix 3706 rows 2175 cols
[2022-05-15 21:04:01] [INFO ] Computed 81 place invariants in 68 ms
[2022-05-15 21:04:03] [INFO ] Implicit Places using invariants in 1814 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1846 ms to find 40 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2135/3682 places, 3706/6720 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 2096 transition count 3667
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 2096 transition count 3667
Applied a total of 78 rules in 487 ms. Remains 2096 /2135 variables (removed 39) and now considering 3667/3706 (removed 39) transitions.
// Phase 1: matrix 3667 rows 2096 cols
[2022-05-15 21:04:04] [INFO ] Computed 41 place invariants in 35 ms
[2022-05-15 21:04:05] [INFO ] Implicit Places using invariants in 1463 ms returned []
// Phase 1: matrix 3667 rows 2096 cols
[2022-05-15 21:04:05] [INFO ] Computed 41 place invariants in 20 ms
[2022-05-15 21:04:06] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:04:31] [INFO ] Implicit Places using invariants and state equation in 25690 ms returned []
Implicit Place search using SMT with State Equation took 27156 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2096/3682 places, 3667/6720 transitions.
Finished structural reductions, in 2 iterations. Remains : 2096/3682 places, 3667/6720 transitions.
Support contains 44 out of 2096 places after structural reductions.
[2022-05-15 21:04:31] [INFO ] Flatten gal took : 235 ms
[2022-05-15 21:04:31] [INFO ] Flatten gal took : 173 ms
[2022-05-15 21:04:32] [INFO ] Input system was already deterministic with 3667 transitions.
Support contains 42 out of 2096 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 30) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 3667 rows 2096 cols
[2022-05-15 21:04:32] [INFO ] Computed 41 place invariants in 29 ms
[2022-05-15 21:04:33] [INFO ] [Real]Absence check using 41 positive place invariants in 35 ms returned sat
[2022-05-15 21:04:35] [INFO ] After 1939ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10
[2022-05-15 21:04:35] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:04:37] [INFO ] After 1443ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-15 21:04:37] [INFO ] After 4445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-15 21:04:37] [INFO ] [Nat]Absence check using 41 positive place invariants in 35 ms returned sat
[2022-05-15 21:04:40] [INFO ] After 1906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-15 21:04:41] [INFO ] After 1642ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-05-15 21:04:43] [INFO ] After 3596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1162 ms.
[2022-05-15 21:04:44] [INFO ] After 7566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 48 ms.
Support contains 11 out of 2096 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 270 place count 2096 transition count 3397
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 1 with 270 rules applied. Total rules applied 540 place count 1826 transition count 3397
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 540 place count 1826 transition count 3357
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 620 place count 1786 transition count 3357
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 628 place count 1778 transition count 3341
Iterating global reduction 2 with 8 rules applied. Total rules applied 636 place count 1778 transition count 3341
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 6 rules applied. Total rules applied 642 place count 1778 transition count 3335
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 648 place count 1772 transition count 3335
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 730 place count 1731 transition count 3294
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 733 place count 1731 transition count 3291
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 736 place count 1728 transition count 3291
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 737 place count 1728 transition count 3291
Applied a total of 737 rules in 1126 ms. Remains 1728 /2096 variables (removed 368) and now considering 3291/3667 (removed 376) transitions.
Finished structural reductions, in 1 iterations. Remains : 1728/2096 places, 3291/3667 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
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 :1
Running SMT prover for 2 properties.
// Phase 1: matrix 3291 rows 1728 cols
[2022-05-15 21:04:46] [INFO ] Computed 41 place invariants in 32 ms
[2022-05-15 21:04:46] [INFO ] [Real]Absence check using 41 positive place invariants in 32 ms returned sat
[2022-05-15 21:04:47] [INFO ] After 972ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-15 21:04:47] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:04:48] [INFO ] After 458ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:04:48] [INFO ] After 1758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:04:48] [INFO ] [Nat]Absence check using 41 positive place invariants in 31 ms returned sat
[2022-05-15 21:04:49] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:04:50] [INFO ] After 490ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 21:04:50] [INFO ] After 840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 226 ms.
[2022-05-15 21:04:50] [INFO ] After 2298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 2 properties in 9 ms.
Computed a total of 122 stabilizing places and 161 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2096 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Drop transitions removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 271 place count 2096 transition count 3396
Reduce places removed 271 places and 0 transitions.
Iterating post reduction 1 with 271 rules applied. Total rules applied 542 place count 1825 transition count 3396
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 542 place count 1825 transition count 3356
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 622 place count 1785 transition count 3356
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 634 place count 1773 transition count 3332
Iterating global reduction 2 with 12 rules applied. Total rules applied 646 place count 1773 transition count 3332
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 656 place count 1773 transition count 3322
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 666 place count 1763 transition count 3322
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 746 place count 1723 transition count 3282
Applied a total of 746 rules in 531 ms. Remains 1723 /2096 variables (removed 373) and now considering 3282/3667 (removed 385) transitions.
// Phase 1: matrix 3282 rows 1723 cols
[2022-05-15 21:04:51] [INFO ] Computed 41 place invariants in 28 ms
[2022-05-15 21:04:52] [INFO ] Implicit Places using invariants in 962 ms returned []
// Phase 1: matrix 3282 rows 1723 cols
[2022-05-15 21:04:52] [INFO ] Computed 41 place invariants in 26 ms
[2022-05-15 21:04:53] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:05:16] [INFO ] Implicit Places using invariants and state equation in 23808 ms returned []
Implicit Place search using SMT with State Equation took 24774 ms to find 0 implicit places.
[2022-05-15 21:05:16] [INFO ] Redundant transitions in 193 ms returned []
// Phase 1: matrix 3282 rows 1723 cols
[2022-05-15 21:05:16] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-15 21:05:17] [INFO ] Dead Transitions using invariants and state equation in 1244 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1723/2096 places, 3282/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 1723/2096 places, 3282/3667 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1218 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 268 steps with 0 reset in 11 ms.
FORMULA CANConstruction-PT-040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-00 finished in 27002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(X(!G(p0)) U !X(p0)))))'
Support contains 2 out of 2096 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 270 place count 2096 transition count 3397
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 1 with 270 rules applied. Total rules applied 540 place count 1826 transition count 3397
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 540 place count 1826 transition count 3357
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 620 place count 1786 transition count 3357
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 633 place count 1773 transition count 3331
Iterating global reduction 2 with 13 rules applied. Total rules applied 646 place count 1773 transition count 3331
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 657 place count 1773 transition count 3320
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 668 place count 1762 transition count 3320
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 744 place count 1724 transition count 3282
Applied a total of 744 rules in 349 ms. Remains 1724 /2096 variables (removed 372) and now considering 3282/3667 (removed 385) transitions.
// Phase 1: matrix 3282 rows 1724 cols
[2022-05-15 21:05:18] [INFO ] Computed 41 place invariants in 34 ms
[2022-05-15 21:05:19] [INFO ] Implicit Places using invariants in 989 ms returned []
// Phase 1: matrix 3282 rows 1724 cols
[2022-05-15 21:05:19] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-15 21:05:20] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:05:44] [INFO ] Implicit Places using invariants and state equation in 25113 ms returned []
Implicit Place search using SMT with State Equation took 26108 ms to find 0 implicit places.
[2022-05-15 21:05:44] [INFO ] Redundant transitions in 162 ms returned []
// Phase 1: matrix 3282 rows 1724 cols
[2022-05-15 21:05:44] [INFO ] Computed 41 place invariants in 24 ms
[2022-05-15 21:05:45] [INFO ] Dead Transitions using invariants and state equation in 1258 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1724/2096 places, 3282/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 1724/2096 places, 3282/3667 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 276 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-01 finished in 27954 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 1 out of 2096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2083 transition count 3642
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2083 transition count 3642
Applied a total of 26 rules in 203 ms. Remains 2083 /2096 variables (removed 13) and now considering 3642/3667 (removed 25) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:05:46] [INFO ] Computed 41 place invariants in 24 ms
[2022-05-15 21:05:47] [INFO ] Implicit Places using invariants in 993 ms returned []
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:05:47] [INFO ] Computed 41 place invariants in 20 ms
[2022-05-15 21:05:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:06:11] [INFO ] Implicit Places using invariants and state equation in 23993 ms returned []
Implicit Place search using SMT with State Equation took 24988 ms to find 0 implicit places.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:06:11] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-15 21:06:12] [INFO ] Dead Transitions using invariants and state equation in 1497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2096 places, 3642/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 2083/2096 places, 3642/3667 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-02 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: 2}]], initial=3, aps=[p0:(GEQ s1551 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 2 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-040-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-02 finished in 26812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(F(G(F(p0))))&&F((G(p2)&&p1))))))'
Support contains 4 out of 2096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2082 transition count 3640
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2082 transition count 3640
Applied a total of 28 rules in 200 ms. Remains 2082 /2096 variables (removed 14) and now considering 3640/3667 (removed 27) transitions.
// Phase 1: matrix 3640 rows 2082 cols
[2022-05-15 21:06:12] [INFO ] Computed 41 place invariants in 19 ms
[2022-05-15 21:06:13] [INFO ] Implicit Places using invariants in 985 ms returned []
// Phase 1: matrix 3640 rows 2082 cols
[2022-05-15 21:06:13] [INFO ] Computed 41 place invariants in 20 ms
[2022-05-15 21:06:15] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:06:38] [INFO ] Implicit Places using invariants and state equation in 24442 ms returned []
Implicit Place search using SMT with State Equation took 25431 ms to find 0 implicit places.
// Phase 1: matrix 3640 rows 2082 cols
[2022-05-15 21:06:38] [INFO ] Computed 41 place invariants in 24 ms
[2022-05-15 21:06:39] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2082/2096 places, 3640/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 2082/2096 places, 3640/3667 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s318 1) (LT s1093 1)), p1:(AND (GEQ s318 1) (GEQ s1093 1)), p2:(AND (GEQ s119 1) (GEQ s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 679 steps with 0 reset in 6 ms.
FORMULA CANConstruction-PT-040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-03 finished in 27443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(G(p0)))))'
Support contains 1 out of 2096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2083 transition count 3642
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2083 transition count 3642
Applied a total of 26 rules in 212 ms. Remains 2083 /2096 variables (removed 13) and now considering 3642/3667 (removed 25) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:06:40] [INFO ] Computed 41 place invariants in 19 ms
[2022-05-15 21:06:41] [INFO ] Implicit Places using invariants in 960 ms returned []
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:06:41] [INFO ] Computed 41 place invariants in 15 ms
[2022-05-15 21:06:42] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:07:05] [INFO ] Implicit Places using invariants and state equation in 24641 ms returned []
Implicit Place search using SMT with State Equation took 25603 ms to find 0 implicit places.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:07:06] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-15 21:07:07] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2096 places, 3642/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 2083/2096 places, 3642/3667 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-04 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: 2}]], initial=3, aps=[p0:(LT s1973 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 11538 steps with 16 reset in 72 ms.
FORMULA CANConstruction-PT-040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-04 finished in 27541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 1 out of 2096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2083 transition count 3642
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2083 transition count 3642
Applied a total of 26 rules in 215 ms. Remains 2083 /2096 variables (removed 13) and now considering 3642/3667 (removed 25) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:07:07] [INFO ] Computed 41 place invariants in 20 ms
[2022-05-15 21:07:08] [INFO ] Implicit Places using invariants in 972 ms returned []
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:07:08] [INFO ] Computed 41 place invariants in 15 ms
[2022-05-15 21:07:10] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:07:33] [INFO ] Implicit Places using invariants and state equation in 24598 ms returned []
Implicit Place search using SMT with State Equation took 25571 ms to find 0 implicit places.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:07:33] [INFO ] Computed 41 place invariants in 19 ms
[2022-05-15 21:07:34] [INFO ] Dead Transitions using invariants and state equation in 1475 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2096 places, 3642/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 2083/2096 places, 3642/3667 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-05 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 s972 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 589 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-05 finished in 27394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(G(p1)))&&p0))))'
Support contains 5 out of 2096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2083 transition count 3642
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2083 transition count 3642
Applied a total of 26 rules in 206 ms. Remains 2083 /2096 variables (removed 13) and now considering 3642/3667 (removed 25) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:07:35] [INFO ] Computed 41 place invariants in 15 ms
[2022-05-15 21:07:36] [INFO ] Implicit Places using invariants in 960 ms returned []
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:07:36] [INFO ] Computed 41 place invariants in 15 ms
[2022-05-15 21:07:37] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:08:00] [INFO ] Implicit Places using invariants and state equation in 24607 ms returned []
Implicit Place search using SMT with State Equation took 25569 ms to find 0 implicit places.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:08:00] [INFO ] Computed 41 place invariants in 16 ms
[2022-05-15 21:08:02] [INFO ] Dead Transitions using invariants and state equation in 1503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2096 places, 3642/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 2083/2096 places, 3642/3667 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s318 1) (LT s1055 1)) (OR (LT s426 1) (LT s479 1))), p1:(LT s549 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 141 reset in 595 ms.
Product exploration explored 100000 steps with 141 reset in 601 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 383 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Finished random walk after 3257 steps, including 4 resets, run visited all 1 properties in 29 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Support contains 1 out of 2083 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 : 2083/2083 places, 3642/3642 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 2083 transition count 3364
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1805 transition count 3364
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 556 place count 1805 transition count 3324
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 636 place count 1765 transition count 3324
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 714 place count 1726 transition count 3285
Applied a total of 714 rules in 298 ms. Remains 1726 /2083 variables (removed 357) and now considering 3285/3642 (removed 357) transitions.
// Phase 1: matrix 3285 rows 1726 cols
[2022-05-15 21:08:04] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-15 21:08:05] [INFO ] Implicit Places using invariants in 948 ms returned []
// Phase 1: matrix 3285 rows 1726 cols
[2022-05-15 21:08:05] [INFO ] Computed 41 place invariants in 21 ms
[2022-05-15 21:08:06] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:08:29] [INFO ] Implicit Places using invariants and state equation in 24169 ms returned []
Implicit Place search using SMT with State Equation took 25120 ms to find 0 implicit places.
[2022-05-15 21:08:29] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 3285 rows 1726 cols
[2022-05-15 21:08:30] [INFO ] Computed 41 place invariants in 39 ms
[2022-05-15 21:08:31] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1726/2083 places, 3285/3642 transitions.
Finished structural reductions, in 1 iterations. Remains : 1726/2083 places, 3285/3642 transitions.
Computed a total of 41 stabilizing places and 80 stable transitions
Computed a total of 41 stabilizing places and 80 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 35 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 123558 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123558 steps, saw 36128 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3285 rows 1726 cols
[2022-05-15 21:08:34] [INFO ] Computed 41 place invariants in 25 ms
[2022-05-15 21:08:34] [INFO ] [Real]Absence check using 41 positive place invariants in 29 ms returned sat
[2022-05-15 21:08:35] [INFO ] After 889ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 21:08:35] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:08:36] [INFO ] After 310ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:08:36] [INFO ] After 1484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:08:36] [INFO ] [Nat]Absence check using 41 positive place invariants in 25 ms returned sat
[2022-05-15 21:08:37] [INFO ] After 859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 21:08:37] [INFO ] After 281ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 21:08:37] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-05-15 21:08:37] [INFO ] After 1612ms 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 356 reset in 867 ms.
Stack based approach found an accepted trace after 16338 steps with 58 reset with depth 280 and stack size 279 in 147 ms.
FORMULA CANConstruction-PT-040-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-06 finished in 63998 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (!(p0 U p2)&&p1)))'
Support contains 6 out of 2096 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Drop transitions removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 267 rules applied. Total rules applied 267 place count 2096 transition count 3400
Reduce places removed 267 places and 0 transitions.
Iterating post reduction 1 with 267 rules applied. Total rules applied 534 place count 1829 transition count 3400
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 534 place count 1829 transition count 3360
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 614 place count 1789 transition count 3360
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 628 place count 1775 transition count 3333
Iterating global reduction 2 with 14 rules applied. Total rules applied 642 place count 1775 transition count 3333
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 653 place count 1775 transition count 3322
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 664 place count 1764 transition count 3322
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 738 place count 1727 transition count 3285
Applied a total of 738 rules in 350 ms. Remains 1727 /2096 variables (removed 369) and now considering 3285/3667 (removed 382) transitions.
// Phase 1: matrix 3285 rows 1727 cols
[2022-05-15 21:08:39] [INFO ] Computed 41 place invariants in 24 ms
[2022-05-15 21:08:40] [INFO ] Implicit Places using invariants in 969 ms returned []
// Phase 1: matrix 3285 rows 1727 cols
[2022-05-15 21:08:40] [INFO ] Computed 41 place invariants in 17 ms
[2022-05-15 21:08:41] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:09:05] [INFO ] Implicit Places using invariants and state equation in 25419 ms returned []
Implicit Place search using SMT with State Equation took 26390 ms to find 0 implicit places.
[2022-05-15 21:09:05] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 3285 rows 1727 cols
[2022-05-15 21:09:05] [INFO ] Computed 41 place invariants in 25 ms
[2022-05-15 21:09:07] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1727/2096 places, 3285/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 1727/2096 places, 3285/3667 transitions.
Stuttering acceptance computed with spot in 77 ms :[p2, true, (OR (NOT p1) p2)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND p0 p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(AND (GEQ s90 1) (GEQ s126 1)), p2:(AND (GEQ s7 1) (GEQ s1650 1)), p1:(AND (GEQ s75 1) (GEQ s124 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 253 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-07 finished in 28240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)&&F(p2)))'
Support contains 5 out of 2096 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 270 place count 2096 transition count 3397
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 1 with 270 rules applied. Total rules applied 540 place count 1826 transition count 3397
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 540 place count 1826 transition count 3357
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 620 place count 1786 transition count 3357
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 632 place count 1774 transition count 3333
Iterating global reduction 2 with 12 rules applied. Total rules applied 644 place count 1774 transition count 3333
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 654 place count 1774 transition count 3323
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 664 place count 1764 transition count 3323
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 740 place count 1726 transition count 3285
Applied a total of 740 rules in 322 ms. Remains 1726 /2096 variables (removed 370) and now considering 3285/3667 (removed 382) transitions.
// Phase 1: matrix 3285 rows 1726 cols
[2022-05-15 21:09:07] [INFO ] Computed 41 place invariants in 30 ms
[2022-05-15 21:09:08] [INFO ] Implicit Places using invariants in 926 ms returned []
// Phase 1: matrix 3285 rows 1726 cols
[2022-05-15 21:09:08] [INFO ] Computed 41 place invariants in 21 ms
[2022-05-15 21:09:09] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:09:31] [INFO ] Implicit Places using invariants and state equation in 23170 ms returned []
Implicit Place search using SMT with State Equation took 24099 ms to find 0 implicit places.
[2022-05-15 21:09:31] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 3285 rows 1726 cols
[2022-05-15 21:09:31] [INFO ] Computed 41 place invariants in 19 ms
[2022-05-15 21:09:33] [INFO ] Dead Transitions using invariants and state equation in 1303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1726/2096 places, 3285/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 1726/2096 places, 3285/3667 transitions.
Stuttering acceptance computed with spot in 144 ms :[p1, true, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(AND (GEQ s120 1) (GEQ s1412 1)), p1:(GEQ s291 1), p2:(AND (GEQ s55 1) (GEQ s96 1) (GEQ s291 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, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 220 steps with 0 reset in 6 ms.
FORMULA CANConstruction-PT-040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-08 finished in 26011 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U (X(p1) U p2))))'
Support contains 4 out of 2096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2084 transition count 3644
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2084 transition count 3644
Applied a total of 24 rules in 205 ms. Remains 2084 /2096 variables (removed 12) and now considering 3644/3667 (removed 23) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2022-05-15 21:09:33] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-15 21:09:34] [INFO ] Implicit Places using invariants in 990 ms returned []
// Phase 1: matrix 3644 rows 2084 cols
[2022-05-15 21:09:34] [INFO ] Computed 41 place invariants in 21 ms
[2022-05-15 21:09:35] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:09:59] [INFO ] Implicit Places using invariants and state equation in 25183 ms returned []
Implicit Place search using SMT with State Equation took 26175 ms to find 0 implicit places.
// Phase 1: matrix 3644 rows 2084 cols
[2022-05-15 21:09:59] [INFO ] Computed 41 place invariants in 21 ms
[2022-05-15 21:10:01] [INFO ] Dead Transitions using invariants and state equation in 1517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2096 places, 3644/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 2084/2096 places, 3644/3667 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LT s1609 1), p1:(AND (GEQ s66 1) (GEQ s383 1)), p0:(GEQ s1758 1)], nbAcceptance=0, 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1901 ms.
Product exploration explored 100000 steps with 50000 reset in 1898 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-040-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLFireability-10 finished in 32053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U X((G(!p0)||X(p1)||p1))))'
Support contains 2 out of 2096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2084 transition count 3644
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2084 transition count 3644
Applied a total of 24 rules in 190 ms. Remains 2084 /2096 variables (removed 12) and now considering 3644/3667 (removed 23) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2022-05-15 21:10:05] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-15 21:10:06] [INFO ] Implicit Places using invariants in 992 ms returned []
// Phase 1: matrix 3644 rows 2084 cols
[2022-05-15 21:10:06] [INFO ] Computed 41 place invariants in 16 ms
[2022-05-15 21:10:07] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:10:30] [INFO ] Implicit Places using invariants and state equation in 23688 ms returned []
Implicit Place search using SMT with State Equation took 24682 ms to find 0 implicit places.
// Phase 1: matrix 3644 rows 2084 cols
[2022-05-15 21:10:30] [INFO ] Computed 41 place invariants in 23 ms
[2022-05-15 21:10:31] [INFO ] Dead Transitions using invariants and state equation in 1475 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2096 places, 3644/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 2084/2096 places, 3644/3667 transitions.
Stuttering acceptance computed with spot in 1243 ms :[true, (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s825 1), p1:(GEQ s1026 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]]
Stuttering criterion allowed to conclude after 742 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-11 finished in 27612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X((X(G(X(F(p0))))||p1))))))'
Support contains 3 out of 2096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2083 transition count 3642
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2083 transition count 3642
Applied a total of 26 rules in 208 ms. Remains 2083 /2096 variables (removed 13) and now considering 3642/3667 (removed 25) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:10:33] [INFO ] Computed 41 place invariants in 19 ms
[2022-05-15 21:10:34] [INFO ] Implicit Places using invariants in 992 ms returned []
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:10:34] [INFO ] Computed 41 place invariants in 15 ms
[2022-05-15 21:10:35] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:10:59] [INFO ] Implicit Places using invariants and state equation in 25327 ms returned []
Implicit Place search using SMT with State Equation took 26322 ms to find 0 implicit places.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:10:59] [INFO ] Computed 41 place invariants in 27 ms
[2022-05-15 21:11:01] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2096 places, 3642/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 2083/2096 places, 3642/3667 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s1363 1), p0:(AND (GEQ s222 1) (GEQ s443 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 967 steps with 1 reset in 8 ms.
FORMULA CANConstruction-PT-040-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-12 finished in 28232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((X(p1)||p2) U p3)&&p0))))'
Support contains 4 out of 2096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2083 transition count 3642
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2083 transition count 3642
Applied a total of 26 rules in 201 ms. Remains 2083 /2096 variables (removed 13) and now considering 3642/3667 (removed 25) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:11:01] [INFO ] Computed 41 place invariants in 20 ms
[2022-05-15 21:11:02] [INFO ] Implicit Places using invariants in 993 ms returned []
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:11:02] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-15 21:11:03] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:11:28] [INFO ] Implicit Places using invariants and state equation in 26051 ms returned []
Implicit Place search using SMT with State Equation took 27045 ms to find 0 implicit places.
// Phase 1: matrix 3642 rows 2083 cols
[2022-05-15 21:11:28] [INFO ] Computed 41 place invariants in 24 ms
[2022-05-15 21:11:29] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2096 places, 3642/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 2083/2096 places, 3642/3667 transitions.
Stuttering acceptance computed with spot in 792 ms :[(OR (NOT p3) (NOT p0)), (NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p3) p2) (AND (NOT p3) p2 p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p3) p2), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(GEQ s1131 1), p2:(LT s436 1), p0:(AND (LT s1131 1) (LT s436 1)), p1:(AND (GEQ s54 1) (GEQ s799 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 625 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-040-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-13 finished in 29527 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 2096 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 270 place count 2096 transition count 3397
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 1 with 270 rules applied. Total rules applied 540 place count 1826 transition count 3397
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 540 place count 1826 transition count 3357
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 620 place count 1786 transition count 3357
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 632 place count 1774 transition count 3333
Iterating global reduction 2 with 12 rules applied. Total rules applied 644 place count 1774 transition count 3333
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 654 place count 1774 transition count 3323
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 664 place count 1764 transition count 3323
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 742 place count 1725 transition count 3284
Applied a total of 742 rules in 317 ms. Remains 1725 /2096 variables (removed 371) and now considering 3284/3667 (removed 383) transitions.
// Phase 1: matrix 3284 rows 1725 cols
[2022-05-15 21:11:31] [INFO ] Computed 41 place invariants in 26 ms
[2022-05-15 21:11:32] [INFO ] Implicit Places using invariants in 918 ms returned []
// Phase 1: matrix 3284 rows 1725 cols
[2022-05-15 21:11:32] [INFO ] Computed 41 place invariants in 30 ms
[2022-05-15 21:11:33] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:11:57] [INFO ] Implicit Places using invariants and state equation in 25826 ms returned []
Implicit Place search using SMT with State Equation took 26745 ms to find 0 implicit places.
[2022-05-15 21:11:57] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 3284 rows 1725 cols
[2022-05-15 21:11:57] [INFO ] Computed 41 place invariants in 19 ms
[2022-05-15 21:11:59] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1725/2096 places, 3284/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 1725/2096 places, 3284/3667 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-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:(OR (GEQ s1071 1) (AND (GEQ s13 1) (GEQ s93 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 337 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-14 finished in 28446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 2096 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2096/2096 places, 3667/3667 transitions.
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 269 place count 2096 transition count 3398
Reduce places removed 269 places and 0 transitions.
Iterating post reduction 1 with 269 rules applied. Total rules applied 538 place count 1827 transition count 3398
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 538 place count 1827 transition count 3358
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 618 place count 1787 transition count 3358
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 631 place count 1774 transition count 3332
Iterating global reduction 2 with 13 rules applied. Total rules applied 644 place count 1774 transition count 3332
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 655 place count 1774 transition count 3321
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 666 place count 1763 transition count 3321
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 740 place count 1726 transition count 3284
Applied a total of 740 rules in 325 ms. Remains 1726 /2096 variables (removed 370) and now considering 3284/3667 (removed 383) transitions.
// Phase 1: matrix 3284 rows 1726 cols
[2022-05-15 21:11:59] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-15 21:12:00] [INFO ] Implicit Places using invariants in 939 ms returned []
// Phase 1: matrix 3284 rows 1726 cols
[2022-05-15 21:12:00] [INFO ] Computed 41 place invariants in 18 ms
[2022-05-15 21:12:01] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-05-15 21:12:24] [INFO ] Implicit Places using invariants and state equation in 23780 ms returned []
Implicit Place search using SMT with State Equation took 24720 ms to find 0 implicit places.
[2022-05-15 21:12:24] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 3284 rows 1726 cols
[2022-05-15 21:12:24] [INFO ] Computed 41 place invariants in 21 ms
[2022-05-15 21:12:25] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1726/2096 places, 3284/3667 transitions.
Finished structural reductions, in 1 iterations. Remains : 1726/2096 places, 3284/3667 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s109 1) (GEQ s112 1)), p0:(AND (GEQ s25 1) (GEQ s105 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 304 steps with 0 reset in 8 ms.
FORMULA CANConstruction-PT-040-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-15 finished in 26443 ms.
All properties solved by simple procedures.
Total runtime 504910 ms.

BK_STOP 1652649145740

--------------------
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="CANConstruction-PT-040"
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 CANConstruction-PT-040, 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 r024-tall-165251918600516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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