Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280000138.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is EnergyBus-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280000138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 18:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.2M May 18 16:42 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 EnergyBus-PT-none-LTLFireability-00
FORMULA_NAME EnergyBus-PT-none-LTLFireability-01
FORMULA_NAME EnergyBus-PT-none-LTLFireability-02
FORMULA_NAME EnergyBus-PT-none-LTLFireability-03
FORMULA_NAME EnergyBus-PT-none-LTLFireability-04
FORMULA_NAME EnergyBus-PT-none-LTLFireability-05
FORMULA_NAME EnergyBus-PT-none-LTLFireability-06
FORMULA_NAME EnergyBus-PT-none-LTLFireability-07
FORMULA_NAME EnergyBus-PT-none-LTLFireability-08
FORMULA_NAME EnergyBus-PT-none-LTLFireability-09
FORMULA_NAME EnergyBus-PT-none-LTLFireability-10
FORMULA_NAME EnergyBus-PT-none-LTLFireability-11
FORMULA_NAME EnergyBus-PT-none-LTLFireability-12
FORMULA_NAME EnergyBus-PT-none-LTLFireability-13
FORMULA_NAME EnergyBus-PT-none-LTLFireability-14
FORMULA_NAME EnergyBus-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716578476426

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 19:21:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 19:21:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:21:19] [INFO ] Load time of PNML (sax parser for PT used): 543 ms
[2024-05-24 19:21:19] [INFO ] Transformed 157 places.
[2024-05-24 19:21:19] [INFO ] Transformed 4430 transitions.
[2024-05-24 19:21:19] [INFO ] Found NUPN structural information;
[2024-05-24 19:21:19] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 710 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 28 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 130 transition count 1808
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 130 transition count 1808
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 130 transition count 1805
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 130 transition count 1797
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 129 transition count 1796
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 129 transition count 1796
Applied a total of 59 rules in 102 ms. Remains 129 /153 variables (removed 24) and now considering 1796/1913 (removed 117) transitions.
[2024-05-24 19:21:20] [INFO ] Flow matrix only has 586 transitions (discarded 1210 similar events)
// Phase 1: matrix 586 rows 129 cols
[2024-05-24 19:21:20] [INFO ] Computed 23 invariants in 31 ms
[2024-05-24 19:21:20] [INFO ] Implicit Places using invariants in 366 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 411 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/153 places, 1796/1913 transitions.
Applied a total of 0 rules in 15 ms. Remains 128 /128 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 530 ms. Remains : 128/153 places, 1796/1913 transitions.
Support contains 32 out of 128 places after structural reductions.
[2024-05-24 19:21:21] [INFO ] Flatten gal took : 433 ms
[2024-05-24 19:21:21] [INFO ] Flatten gal took : 224 ms
[2024-05-24 19:21:21] [INFO ] Input system was already deterministic with 1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 935 ms. (steps per millisecond=10 ) properties (out of 26) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2024-05-24 19:21:23] [INFO ] Flow matrix only has 586 transitions (discarded 1210 similar events)
// Phase 1: matrix 586 rows 128 cols
[2024-05-24 19:21:23] [INFO ] Computed 22 invariants in 9 ms
[2024-05-24 19:21:23] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-24 19:21:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2024-05-24 19:21:24] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 19:21:26] [INFO ] After 2683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2024-05-24 19:21:27] [INFO ] State equation strengthened by 445 read => feed constraints.
[2024-05-24 19:21:29] [INFO ] After 2337ms SMT Verify possible using 445 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2024-05-24 19:21:30] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 8 ms to minimize.
[2024-05-24 19:21:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-24 19:21:32] [INFO ] After 5273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 2310 ms.
[2024-05-24 19:21:34] [INFO ] After 10641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 1400 ms.
Support contains 30 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 57 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 722 edges and 122 vertex of which 119 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.31 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 119 transition count 1767
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 115 transition count 1767
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 115 transition count 1763
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 111 transition count 1763
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 102 transition count 1754
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 102 transition count 1752
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 50 place count 97 transition count 1761
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 58 place count 97 transition count 1753
Drop transitions removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 4 with 79 rules applied. Total rules applied 137 place count 97 transition count 1674
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 141 place count 95 transition count 1672
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 144 place count 93 transition count 1671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 145 place count 92 transition count 1671
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 145 place count 92 transition count 1669
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 149 place count 90 transition count 1669
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 153 place count 90 transition count 1665
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 158 place count 86 transition count 1664
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 159 place count 86 transition count 1663
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 160 place count 86 transition count 1725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 161 place count 85 transition count 1725
Applied a total of 161 rules in 2129 ms. Remains 85 /128 variables (removed 43) and now considering 1725/1796 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2130 ms. Remains : 85/128 places, 1725/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2024-05-24 19:21:39] [INFO ] Flow matrix only has 519 transitions (discarded 1206 similar events)
// Phase 1: matrix 519 rows 85 cols
[2024-05-24 19:21:39] [INFO ] Computed 19 invariants in 6 ms
[2024-05-24 19:21:39] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-24 19:21:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-24 19:21:39] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 19:21:41] [INFO ] After 2260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2024-05-24 19:21:41] [INFO ] State equation strengthened by 456 read => feed constraints.
[2024-05-24 19:21:44] [INFO ] After 2140ms SMT Verify possible using 456 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2024-05-24 19:21:45] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 2 ms to minimize.
[2024-05-24 19:21:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-24 19:21:46] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
[2024-05-24 19:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-24 19:21:46] [INFO ] After 4642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 2041 ms.
[2024-05-24 19:21:48] [INFO ] After 9148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 11 ms.
Support contains 29 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1725/1725 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 1724
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 84 transition count 1723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 1723
Applied a total of 4 rules in 669 ms. Remains 83 /85 variables (removed 2) and now considering 1723/1725 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 673 ms. Remains : 83/85 places, 1723/1725 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 96358 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{16=1}
Probabilistic random walk after 96358 steps, saw 55036 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :1
Running SMT prover for 19 properties.
[2024-05-24 19:21:53] [INFO ] Flow matrix only has 516 transitions (discarded 1207 similar events)
// Phase 1: matrix 516 rows 83 cols
[2024-05-24 19:21:53] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 19:21:53] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-24 19:21:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-24 19:21:53] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 19:21:55] [INFO ] After 1934ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-24 19:21:55] [INFO ] State equation strengthened by 456 read => feed constraints.
[2024-05-24 19:21:57] [INFO ] After 1798ms SMT Verify possible using 456 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2024-05-24 19:21:58] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-24 19:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-05-24 19:21:59] [INFO ] After 3921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 1931 ms.
[2024-05-24 19:22:01] [INFO ] After 8034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 10 ms.
Support contains 28 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1723/1723 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 83 transition count 1722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 82 transition count 1722
Applied a total of 2 rules in 326 ms. Remains 82 /83 variables (removed 1) and now considering 1722/1723 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 82/83 places, 1722/1723 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 99898 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99898 steps, saw 58342 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 18 properties.
[2024-05-24 19:22:05] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
// Phase 1: matrix 515 rows 82 cols
[2024-05-24 19:22:05] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 19:22:06] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-24 19:22:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-24 19:22:06] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 19:22:08] [INFO ] After 1937ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-24 19:22:08] [INFO ] State equation strengthened by 456 read => feed constraints.
[2024-05-24 19:22:10] [INFO ] After 1914ms SMT Verify possible using 456 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-24 19:22:10] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 2 ms to minimize.
[2024-05-24 19:22:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-05-24 19:22:12] [INFO ] After 4128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1868 ms.
[2024-05-24 19:22:14] [INFO ] After 8104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 10 ms.
Support contains 28 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 1722/1722 transitions.
Applied a total of 0 rules in 307 ms. Remains 82 /82 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 82/82 places, 1722/1722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 96931 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96931 steps, saw 56577 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 18 properties.
[2024-05-24 19:22:18] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:22:18] [INFO ] Invariant cache hit.
[2024-05-24 19:22:18] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-24 19:22:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-24 19:22:18] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 19:22:20] [INFO ] After 1952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-24 19:22:20] [INFO ] State equation strengthened by 456 read => feed constraints.
[2024-05-24 19:22:22] [INFO ] After 2041ms SMT Verify possible using 456 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-24 19:22:25] [INFO ] After 4449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 2084 ms.
[2024-05-24 19:22:27] [INFO ] After 8663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 3 ms.
Support contains 28 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 1722/1722 transitions.
Applied a total of 0 rules in 309 ms. Remains 82 /82 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 82/82 places, 1722/1722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 1722/1722 transitions.
Applied a total of 0 rules in 304 ms. Remains 82 /82 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
[2024-05-24 19:22:27] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:22:27] [INFO ] Invariant cache hit.
[2024-05-24 19:22:28] [INFO ] Implicit Places using invariants in 101 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 81/82 places, 1722/1722 transitions.
Applied a total of 0 rules in 307 ms. Remains 81 /81 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 718 ms. Remains : 81/82 places, 1722/1722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 98531 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98531 steps, saw 57551 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 18 properties.
[2024-05-24 19:22:32] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
// Phase 1: matrix 515 rows 81 cols
[2024-05-24 19:22:32] [INFO ] Computed 18 invariants in 3 ms
[2024-05-24 19:22:32] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-24 19:22:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 19:22:32] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 19:22:34] [INFO ] After 1845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-24 19:22:34] [INFO ] State equation strengthened by 448 read => feed constraints.
[2024-05-24 19:22:36] [INFO ] After 1898ms SMT Verify possible using 448 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-24 19:22:36] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-24 19:22:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2024-05-24 19:22:38] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-24 19:22:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-24 19:22:38] [INFO ] After 4234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1967 ms.
[2024-05-24 19:22:40] [INFO ] After 8277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 28 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 1722/1722 transitions.
Applied a total of 0 rules in 326 ms. Remains 81 /81 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 81/81 places, 1722/1722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 1722/1722 transitions.
Applied a total of 0 rules in 313 ms. Remains 81 /81 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
[2024-05-24 19:22:41] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:22:41] [INFO ] Invariant cache hit.
[2024-05-24 19:22:41] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-24 19:22:41] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:22:41] [INFO ] Invariant cache hit.
[2024-05-24 19:22:41] [INFO ] State equation strengthened by 448 read => feed constraints.
[2024-05-24 19:22:42] [INFO ] Implicit Places using invariants and state equation in 660 ms returned [13, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 766 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 79/81 places, 1722/1722 transitions.
Applied a total of 0 rules in 304 ms. Remains 79 /79 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1386 ms. Remains : 79/81 places, 1722/1722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 105781 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105781 steps, saw 61349 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 18 properties.
[2024-05-24 19:22:46] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
// Phase 1: matrix 515 rows 79 cols
[2024-05-24 19:22:46] [INFO ] Computed 16 invariants in 4 ms
[2024-05-24 19:22:46] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-24 19:22:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-24 19:22:46] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 19:22:48] [INFO ] After 1761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-24 19:22:48] [INFO ] State equation strengthened by 448 read => feed constraints.
[2024-05-24 19:22:50] [INFO ] After 1617ms SMT Verify possible using 448 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-24 19:22:50] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-24 19:22:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-24 19:22:51] [INFO ] After 3512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1704 ms.
[2024-05-24 19:22:53] [INFO ] After 7149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 4 ms.
Support contains 28 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 1722/1722 transitions.
Applied a total of 0 rules in 379 ms. Remains 79 /79 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 79/79 places, 1722/1722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 1722/1722 transitions.
Applied a total of 0 rules in 310 ms. Remains 79 /79 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
[2024-05-24 19:22:54] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:22:54] [INFO ] Invariant cache hit.
[2024-05-24 19:22:54] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-24 19:22:54] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:22:54] [INFO ] Invariant cache hit.
[2024-05-24 19:22:54] [INFO ] State equation strengthened by 448 read => feed constraints.
[2024-05-24 19:22:55] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-24 19:22:55] [INFO ] Redundant transitions in 761 ms returned []
[2024-05-24 19:22:55] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:22:55] [INFO ] Invariant cache hit.
[2024-05-24 19:22:57] [INFO ] Dead Transitions using invariants and state equation in 1236 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3004 ms. Remains : 79/79 places, 1722/1722 transitions.
Graph (trivial) has 13 edges and 79 vertex of which 2 / 79 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 4 transitions
Ensure Unique test removed 1206 transitions
Reduce isomorphic transitions removed 1210 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 78 transition count 510
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 76 transition count 510
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 76 transition count 509
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 76 transition count 509
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 76 transition count 508
Applied a total of 13 rules in 51 ms. Remains 76 /79 variables (removed 3) and now considering 508/1722 (removed 1214) transitions.
Running SMT prover for 18 properties.
// Phase 1: matrix 508 rows 76 cols
[2024-05-24 19:22:57] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 19:22:57] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-24 19:22:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-24 19:22:57] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 19:22:58] [INFO ] After 1251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-24 19:22:58] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-24 19:22:59] [INFO ] After 1067ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-24 19:23:01] [INFO ] After 2356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1079 ms.
[2024-05-24 19:23:02] [INFO ] After 4835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Computed a total of 3 stabilizing places and 130 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 84 edges and 128 vertex of which 12 / 128 are part of one of the 5 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 425 transitions
Reduce isomorphic transitions removed 425 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 121 transition count 1367
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 117 transition count 1367
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 117 transition count 1362
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 112 transition count 1362
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 25 place count 106 transition count 858
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 106 transition count 858
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 97 transition count 849
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 97 transition count 847
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 61 place count 92 transition count 855
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 65 place count 92 transition count 851
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 79 place count 92 transition count 837
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 92 transition count 836
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 91 transition count 836
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 89 place count 87 transition count 832
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 90 place count 87 transition count 831
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 91 place count 86 transition count 831
Applied a total of 91 rules in 562 ms. Remains 86 /128 variables (removed 42) and now considering 831/1796 (removed 965) transitions.
[2024-05-24 19:23:02] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
// Phase 1: matrix 263 rows 86 cols
[2024-05-24 19:23:02] [INFO ] Computed 21 invariants in 8 ms
[2024-05-24 19:23:03] [INFO ] Implicit Places using invariants in 173 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 176 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/128 places, 831/1796 transitions.
Applied a total of 0 rules in 132 ms. Remains 85 /85 variables (removed 0) and now considering 831/831 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 872 ms. Remains : 85/128 places, 831/1796 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 304 ms :[(NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-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:(OR (EQ s6 0) (EQ s8 0) (EQ s23 0) (EQ s29 0) (EQ s42 0) (EQ s56 0) (EQ s60 0) (EQ s74 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1045 ms.
Product exploration explored 100000 steps with 0 reset in 928 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 596667 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596667 steps, saw 236918 distinct states, run finished after 3005 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 19:23:08] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
// Phase 1: matrix 263 rows 85 cols
[2024-05-24 19:23:08] [INFO ] Computed 20 invariants in 2 ms
[2024-05-24 19:23:08] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:23:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-24 19:23:08] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-24 19:23:09] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:09] [INFO ] State equation strengthened by 186 read => feed constraints.
[2024-05-24 19:23:09] [INFO ] After 96ms SMT Verify possible using 186 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:09] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-24 19:23:09] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 831/831 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 85 transition count 821
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 10 place count 85 transition count 816
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 22 place count 78 transition count 816
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 78 transition count 815
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 77 transition count 814
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 77 transition count 813
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 75 transition count 813
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 3 with 50 rules applied. Total rules applied 78 place count 75 transition count 763
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 75 transition count 762
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 74 transition count 762
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 91 place count 74 transition count 751
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 103 place count 63 transition count 750
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 4 with 73 rules applied. Total rules applied 176 place count 63 transition count 677
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 63 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 62 transition count 723
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 182 place count 62 transition count 723
Applied a total of 182 rules in 400 ms. Remains 62 /85 variables (removed 23) and now considering 723/831 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 62/85 places, 723/831 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 656452 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 656452 steps, saw 267771 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 19:23:12] [INFO ] Flow matrix only has 162 transitions (discarded 561 similar events)
// Phase 1: matrix 162 rows 62 cols
[2024-05-24 19:23:12] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 19:23:12] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:23:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 19:23:12] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:12] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 19:23:13] [INFO ] After 71ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:13] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-24 19:23:13] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 723/723 transitions.
Applied a total of 0 rules in 53 ms. Remains 62 /62 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 62/62 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 723/723 transitions.
Applied a total of 0 rules in 53 ms. Remains 62 /62 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-05-24 19:23:13] [INFO ] Flow matrix only has 162 transitions (discarded 561 similar events)
[2024-05-24 19:23:13] [INFO ] Invariant cache hit.
[2024-05-24 19:23:13] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-24 19:23:13] [INFO ] Flow matrix only has 162 transitions (discarded 561 similar events)
[2024-05-24 19:23:13] [INFO ] Invariant cache hit.
[2024-05-24 19:23:13] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 19:23:13] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [13, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 384 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 723/723 transitions.
Graph (complete) has 390 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 59 transition count 718
Applied a total of 6 rules in 56 ms. Remains 59 /60 variables (removed 1) and now considering 718/723 (removed 5) transitions.
[2024-05-24 19:23:13] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
// Phase 1: matrix 161 rows 59 cols
[2024-05-24 19:23:13] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:23:13] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-24 19:23:13] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
[2024-05-24 19:23:13] [INFO ] Invariant cache hit.
[2024-05-24 19:23:13] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-24 19:23:14] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/62 places, 718/723 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 846 ms. Remains : 59/62 places, 718/723 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 663747 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 663747 steps, saw 273921 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 19:23:17] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
[2024-05-24 19:23:17] [INFO ] Invariant cache hit.
[2024-05-24 19:23:17] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:23:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-24 19:23:17] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-24 19:23:17] [INFO ] After 68ms SMT Verify possible using 111 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:17] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-24 19:23:17] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 718/718 transitions.
Applied a total of 0 rules in 55 ms. Remains 59 /59 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 59/59 places, 718/718 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 718/718 transitions.
Applied a total of 0 rules in 52 ms. Remains 59 /59 variables (removed 0) and now considering 718/718 (removed 0) transitions.
[2024-05-24 19:23:17] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
[2024-05-24 19:23:17] [INFO ] Invariant cache hit.
[2024-05-24 19:23:17] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-24 19:23:17] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
[2024-05-24 19:23:17] [INFO ] Invariant cache hit.
[2024-05-24 19:23:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-24 19:23:17] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-24 19:23:17] [INFO ] Redundant transitions in 30 ms returned [32]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2024-05-24 19:23:17] [INFO ] Flow matrix only has 160 transitions (discarded 557 similar events)
// Phase 1: matrix 160 rows 59 cols
[2024-05-24 19:23:17] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:23:18] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/59 places, 717/718 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 716
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 58 transition count 715
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 58 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 57 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 57 transition count 712
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 57 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 56 transition count 711
Applied a total of 8 rules in 172 ms. Remains 56 /59 variables (removed 3) and now considering 711/717 (removed 6) transitions.
[2024-05-24 19:23:18] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
// Phase 1: matrix 154 rows 56 cols
[2024-05-24 19:23:18] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:23:18] [INFO ] Implicit Places using invariants in 107 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 55/59 places, 711/718 transitions.
Applied a total of 0 rules in 53 ms. Remains 55 /55 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1321 ms. Remains : 55/59 places, 711/718 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 702056 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 702056 steps, saw 220484 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 19:23:21] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
// Phase 1: matrix 154 rows 55 cols
[2024-05-24 19:23:21] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 19:23:21] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:23:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-24 19:23:22] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:22] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-24 19:23:22] [INFO ] After 74ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:22] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-24 19:23:22] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 711/711 transitions.
Applied a total of 0 rules in 53 ms. Remains 55 /55 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 55/55 places, 711/711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 711/711 transitions.
Applied a total of 0 rules in 53 ms. Remains 55 /55 variables (removed 0) and now considering 711/711 (removed 0) transitions.
[2024-05-24 19:23:22] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
[2024-05-24 19:23:22] [INFO ] Invariant cache hit.
[2024-05-24 19:23:22] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-24 19:23:22] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
[2024-05-24 19:23:22] [INFO ] Invariant cache hit.
[2024-05-24 19:23:22] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-24 19:23:22] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-24 19:23:22] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 19:23:22] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
[2024-05-24 19:23:22] [INFO ] Invariant cache hit.
[2024-05-24 19:23:23] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 946 ms. Remains : 55/55 places, 711/711 transitions.
Graph (trivial) has 22 edges and 55 vertex of which 2 / 55 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 4 transitions
Ensure Unique test removed 557 transitions
Reduce isomorphic transitions removed 561 transitions.
Graph (complete) has 245 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 53 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 51 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 15 place count 47 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 47 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 46 transition count 141
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 27 place count 46 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 45 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 44 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 44 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 43 transition count 130
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 43 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 42 transition count 129
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 42 transition count 128
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 42 transition count 128
Applied a total of 40 rules in 27 ms. Remains 42 /55 variables (removed 13) and now considering 128/711 (removed 583) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 42 cols
[2024-05-24 19:23:23] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 19:23:23] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:23:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-24 19:23:23] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 19:23:23] [INFO ] After 20ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:23] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-24 19:23:23] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 831/831 transitions.
Applied a total of 0 rules in 77 ms. Remains 85 /85 variables (removed 0) and now considering 831/831 (removed 0) transitions.
[2024-05-24 19:23:23] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
// Phase 1: matrix 263 rows 85 cols
[2024-05-24 19:23:23] [INFO ] Computed 20 invariants in 2 ms
[2024-05-24 19:23:23] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-24 19:23:23] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
[2024-05-24 19:23:23] [INFO ] Invariant cache hit.
[2024-05-24 19:23:23] [INFO ] State equation strengthened by 186 read => feed constraints.
[2024-05-24 19:23:24] [INFO ] Implicit Places using invariants and state equation in 442 ms returned [13, 64]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 610 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/85 places, 831/831 transitions.
Applied a total of 0 rules in 74 ms. Remains 83 /83 variables (removed 0) and now considering 831/831 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 763 ms. Remains : 83/85 places, 831/831 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 635435 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 635435 steps, saw 251075 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 19:23:27] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
// Phase 1: matrix 263 rows 83 cols
[2024-05-24 19:23:27] [INFO ] Computed 18 invariants in 7 ms
[2024-05-24 19:23:27] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:23:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-24 19:23:27] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 19:23:27] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:27] [INFO ] State equation strengthened by 186 read => feed constraints.
[2024-05-24 19:23:27] [INFO ] After 95ms SMT Verify possible using 186 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:28] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-24 19:23:28] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 831/831 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 83 transition count 821
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 10 place count 83 transition count 816
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 22 place count 76 transition count 816
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 76 transition count 815
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 75 transition count 814
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 75 transition count 813
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 73 transition count 813
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 3 with 50 rules applied. Total rules applied 78 place count 73 transition count 763
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 73 transition count 762
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 72 transition count 762
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 91 place count 72 transition count 751
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 396 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 13 rules applied. Total rules applied 104 place count 60 transition count 750
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 109 place count 60 transition count 745
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 5 with 73 rules applied. Total rules applied 182 place count 60 transition count 672
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 60 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 59 transition count 718
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 188 place count 59 transition count 718
Applied a total of 188 rules in 367 ms. Remains 59 /83 variables (removed 24) and now considering 718/831 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 59/83 places, 718/831 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 651503 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651503 steps, saw 270232 distinct states, run finished after 3005 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 19:23:31] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
// Phase 1: matrix 161 rows 59 cols
[2024-05-24 19:23:31] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 19:23:31] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:23:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-24 19:23:31] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:31] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-24 19:23:31] [INFO ] After 66ms SMT Verify possible using 111 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:31] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-24 19:23:31] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 718/718 transitions.
Applied a total of 0 rules in 52 ms. Remains 59 /59 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 59/59 places, 718/718 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 718/718 transitions.
Applied a total of 0 rules in 51 ms. Remains 59 /59 variables (removed 0) and now considering 718/718 (removed 0) transitions.
[2024-05-24 19:23:31] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
[2024-05-24 19:23:31] [INFO ] Invariant cache hit.
[2024-05-24 19:23:32] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-24 19:23:32] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
[2024-05-24 19:23:32] [INFO ] Invariant cache hit.
[2024-05-24 19:23:32] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-24 19:23:32] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-24 19:23:32] [INFO ] Redundant transitions in 95 ms returned [32]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2024-05-24 19:23:32] [INFO ] Flow matrix only has 160 transitions (discarded 557 similar events)
// Phase 1: matrix 160 rows 59 cols
[2024-05-24 19:23:32] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:23:33] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/59 places, 717/718 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 716
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 58 transition count 715
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 58 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 57 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 57 transition count 712
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 57 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 56 transition count 711
Applied a total of 8 rules in 167 ms. Remains 56 /59 variables (removed 3) and now considering 711/717 (removed 6) transitions.
[2024-05-24 19:23:33] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
// Phase 1: matrix 154 rows 56 cols
[2024-05-24 19:23:33] [INFO ] Computed 15 invariants in 0 ms
[2024-05-24 19:23:33] [INFO ] Implicit Places using invariants in 124 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 55/59 places, 711/718 transitions.
Applied a total of 0 rules in 52 ms. Remains 55 /55 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1638 ms. Remains : 55/59 places, 711/718 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 720326 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :{}
Probabilistic random walk after 720326 steps, saw 224180 distinct states, run finished after 3004 ms. (steps per millisecond=239 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 19:23:36] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
// Phase 1: matrix 154 rows 55 cols
[2024-05-24 19:23:36] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 19:23:36] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:23:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-24 19:23:36] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:36] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-24 19:23:36] [INFO ] After 63ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:36] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-24 19:23:36] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 711/711 transitions.
Applied a total of 0 rules in 52 ms. Remains 55 /55 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 55/55 places, 711/711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 711/711 transitions.
Applied a total of 0 rules in 52 ms. Remains 55 /55 variables (removed 0) and now considering 711/711 (removed 0) transitions.
[2024-05-24 19:23:37] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
[2024-05-24 19:23:37] [INFO ] Invariant cache hit.
[2024-05-24 19:23:37] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-24 19:23:37] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
[2024-05-24 19:23:37] [INFO ] Invariant cache hit.
[2024-05-24 19:23:37] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-24 19:23:37] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-24 19:23:37] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 19:23:37] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
[2024-05-24 19:23:37] [INFO ] Invariant cache hit.
[2024-05-24 19:23:37] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 892 ms. Remains : 55/55 places, 711/711 transitions.
Graph (trivial) has 22 edges and 55 vertex of which 2 / 55 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 4 transitions
Ensure Unique test removed 557 transitions
Reduce isomorphic transitions removed 561 transitions.
Graph (complete) has 245 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 53 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 51 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 15 place count 47 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 47 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 46 transition count 141
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 27 place count 46 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 45 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 44 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 44 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 43 transition count 130
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 43 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 42 transition count 129
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 42 transition count 128
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 42 transition count 128
Applied a total of 40 rules in 22 ms. Remains 42 /55 variables (removed 13) and now considering 128/711 (removed 583) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 42 cols
[2024-05-24 19:23:37] [INFO ] Computed 13 invariants in 0 ms
[2024-05-24 19:23:37] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:23:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 19:23:38] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 19:23:38] [INFO ] After 18ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:23:38] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-24 19:23:38] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 803 ms.
Product exploration explored 100000 steps with 0 reset in 807 ms.
Built C files in :
/tmp/ltsmin3956665789899165492
[2024-05-24 19:23:40] [INFO ] Computing symmetric may disable matrix : 831 transitions.
[2024-05-24 19:23:40] [INFO ] Computation of Complete disable matrix. took 90 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:23:40] [INFO ] Computing symmetric may enable matrix : 831 transitions.
[2024-05-24 19:23:40] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:23:40] [INFO ] Computing Do-Not-Accords matrix : 831 transitions.
[2024-05-24 19:23:40] [INFO ] Computation of Completed DNA matrix. took 69 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:23:40] [INFO ] Built C files in 454ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3956665789899165492
Running compilation step : cd /tmp/ltsmin3956665789899165492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3956665789899165492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3956665789899165492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 831/831 transitions.
Applied a total of 0 rules in 78 ms. Remains 83 /83 variables (removed 0) and now considering 831/831 (removed 0) transitions.
[2024-05-24 19:23:43] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
// Phase 1: matrix 263 rows 83 cols
[2024-05-24 19:23:43] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 19:23:43] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-24 19:23:43] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
[2024-05-24 19:23:43] [INFO ] Invariant cache hit.
[2024-05-24 19:23:43] [INFO ] State equation strengthened by 186 read => feed constraints.
[2024-05-24 19:23:44] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-24 19:23:45] [INFO ] Redundant transitions in 1709 ms returned [64]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2024-05-24 19:23:45] [INFO ] Flow matrix only has 262 transitions (discarded 568 similar events)
// Phase 1: matrix 262 rows 83 cols
[2024-05-24 19:23:45] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 19:23:46] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/83 places, 830/831 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 82 transition count 829
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 827
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 81 transition count 825
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 81 transition count 825
Applied a total of 6 rules in 159 ms. Remains 81 /83 variables (removed 2) and now considering 825/830 (removed 5) transitions.
[2024-05-24 19:23:46] [INFO ] Flow matrix only has 257 transitions (discarded 568 similar events)
// Phase 1: matrix 257 rows 81 cols
[2024-05-24 19:23:46] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 19:23:46] [INFO ] Implicit Places using invariants in 156 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/83 places, 825/831 transitions.
Applied a total of 0 rules in 74 ms. Remains 80 /80 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3352 ms. Remains : 80/83 places, 825/831 transitions.
Built C files in :
/tmp/ltsmin2392897841973587393
[2024-05-24 19:23:46] [INFO ] Computing symmetric may disable matrix : 825 transitions.
[2024-05-24 19:23:46] [INFO ] Computation of Complete disable matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:23:47] [INFO ] Computing symmetric may enable matrix : 825 transitions.
[2024-05-24 19:23:47] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:23:47] [INFO ] Computing Do-Not-Accords matrix : 825 transitions.
[2024-05-24 19:23:47] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:23:47] [INFO ] Built C files in 376ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2392897841973587393
Running compilation step : cd /tmp/ltsmin2392897841973587393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2392897841973587393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2392897841973587393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 19:23:50] [INFO ] Flatten gal took : 88 ms
[2024-05-24 19:23:50] [INFO ] Flatten gal took : 83 ms
[2024-05-24 19:23:50] [INFO ] Time to serialize gal into /tmp/LTL4887680928052051855.gal : 22 ms
[2024-05-24 19:23:50] [INFO ] Time to serialize properties into /tmp/LTL13813059795424373932.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4887680928052051855.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5945024303111036114.hoa' '-atoms' '/tmp/LTL13813059795424373932.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13813059795424373932.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5945024303111036114.hoa
Reverse transition relation is NOT exact ! Due to transitions t52, t53, t68, t69, t70, t72, t95, t117, t1750, t1759, t1760, t1768, t1771, t94.t1780.t93, t9...363
Detected timeout of ITS tools.
[2024-05-24 19:24:06] [INFO ] Flatten gal took : 71 ms
[2024-05-24 19:24:06] [INFO ] Flatten gal took : 74 ms
[2024-05-24 19:24:06] [INFO ] Time to serialize gal into /tmp/LTL17198332899067201803.gal : 12 ms
[2024-05-24 19:24:06] [INFO ] Time to serialize properties into /tmp/LTL17252541105954069654.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17198332899067201803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17252541105954069654.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p16==0)||(p19==0))||((p41==0)||(p58==0)))||(((p86==0)||(p108==0))||((p113==0)||(p140==0))))"))))
Formula 0 simplified : GF!"((((p16==0)||(p19==0))||((p41==0)||(p58==0)))||(((p86==0)||(p108==0))||((p113==0)||(p140==0))))"
Reverse transition relation is NOT exact ! Due to transitions t52, t53, t68, t69, t70, t72, t95, t117, t1750, t1759, t1760, t1768, t1771, t1786.t76, t1789....410
Detected timeout of ITS tools.
[2024-05-24 19:24:21] [INFO ] Flatten gal took : 59 ms
[2024-05-24 19:24:21] [INFO ] Applying decomposition
[2024-05-24 19:24:21] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15163593803924491934.txt' '-o' '/tmp/graph15163593803924491934.bin' '-w' '/tmp/graph15163593803924491934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15163593803924491934.bin' '-l' '-1' '-v' '-w' '/tmp/graph15163593803924491934.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:24:21] [INFO ] Decomposing Gal with order
[2024-05-24 19:24:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:24:21] [INFO ] Removed a total of 4095 redundant transitions.
[2024-05-24 19:24:22] [INFO ] Flatten gal took : 277 ms
[2024-05-24 19:24:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 48 ms.
[2024-05-24 19:24:22] [INFO ] Time to serialize gal into /tmp/LTL1336734251595170636.gal : 9 ms
[2024-05-24 19:24:22] [INFO ] Time to serialize properties into /tmp/LTL1794115980317934608.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1336734251595170636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1794115980317934608.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i0.u13.p16==0)||(i0.u2.p19==0))||((i2.u7.p41==0)||(i2.u10.p58==0)))||(((i6.u17.p86==0)||(i7.u18.p108==0))||((i0.u2.p113==0...182
Formula 0 simplified : GF!"((((i0.u13.p16==0)||(i0.u2.p19==0))||((i2.u7.p41==0)||(i2.u10.p58==0)))||(((i6.u17.p86==0)||(i7.u18.p108==0))||((i0.u2.p113==0)|...176
Reverse transition relation is NOT exact ! Due to transitions t69, t117, t1750, t1768, t1764_t3, t108_t54_t58, t108_t55, t1769_t9, t1767_t6, u23.t1771, i0....475
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
944 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.49794,216460,1,0,384307,2648,4188,1.19943e+06,634,19449,319529
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA EnergyBus-PT-none-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property EnergyBus-PT-none-LTLFireability-00 finished in 90590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)&&p0))))'
Support contains 16 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 71 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 122 transition count 1780
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 118 transition count 1780
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 118 transition count 1775
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 113 transition count 1775
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 109 transition count 1359
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 109 transition count 1359
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 45 place count 100 transition count 1350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 100 transition count 1348
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 94 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 94 transition count 1356
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 82 place count 94 transition count 1337
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 94 transition count 1336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 84 place count 93 transition count 1336
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 92 place count 89 transition count 1332
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 93 place count 89 transition count 1331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 94 place count 88 transition count 1331
Applied a total of 94 rules in 759 ms. Remains 88 /128 variables (removed 40) and now considering 1331/1796 (removed 465) transitions.
[2024-05-24 19:24:33] [INFO ] Flow matrix only has 311 transitions (discarded 1020 similar events)
// Phase 1: matrix 311 rows 88 cols
[2024-05-24 19:24:33] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 19:24:33] [INFO ] Implicit Places using invariants in 175 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/128 places, 1331/1796 transitions.
Applied a total of 0 rules in 189 ms. Remains 87 /87 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1125 ms. Remains : 87/128 places, 1331/1796 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s6 1) (EQ s8 1) (EQ s31 1) (EQ s37 1) (EQ s40 1) (EQ s59 1) (EQ s62 1) (EQ s76 1)), p0:(AND (EQ s6 1) (EQ s8 1) (EQ s31 1) (EQ s37 1) (EQ s44 ...], 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 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-01 finished in 1257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&((!p2||F(!p1)) U (!p1||G((!p2||F(!p1)))))))))'
Support contains 14 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 1316
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 1316
Applied a total of 8 rules in 36 ms. Remains 124 /128 variables (removed 4) and now considering 1316/1796 (removed 480) transitions.
[2024-05-24 19:24:34] [INFO ] Flow matrix only has 466 transitions (discarded 850 similar events)
// Phase 1: matrix 466 rows 124 cols
[2024-05-24 19:24:34] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 19:24:34] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-24 19:24:34] [INFO ] Flow matrix only has 466 transitions (discarded 850 similar events)
[2024-05-24 19:24:34] [INFO ] Invariant cache hit.
[2024-05-24 19:24:34] [INFO ] State equation strengthened by 325 read => feed constraints.
[2024-05-24 19:24:35] [INFO ] Implicit Places using invariants and state equation in 711 ms returned [20, 96]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 892 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/128 places, 1316/1796 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 934 ms. Remains : 122/128 places, 1316/1796 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p0), (OR (NOT p1) p2), true, p1, (AND p1 p2)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s15 0) (EQ s48 0) (EQ s60 0) (EQ s73 0) (EQ s86 0) (EQ s91 0) (EQ s104 0)), p1:(EQ s47 1), p2:(AND (EQ s13 1) (EQ s15 1) (EQ s34 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11116 reset in 3347 ms.
Product exploration explored 100000 steps with 11161 reset in 3197 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), true, (X (X p0)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 226 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 337 ms :[p1, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 19:24:42] [INFO ] Flow matrix only has 466 transitions (discarded 850 similar events)
// Phase 1: matrix 466 rows 122 cols
[2024-05-24 19:24:42] [INFO ] Computed 20 invariants in 3 ms
[2024-05-24 19:24:42] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-24 19:24:42] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 19:24:42] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-24 19:24:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-24 19:24:42] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 19:24:43] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 19:24:43] [INFO ] State equation strengthened by 325 read => feed constraints.
[2024-05-24 19:24:43] [INFO ] After 118ms SMT Verify possible using 325 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-24 19:24:43] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-24 19:24:43] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 9 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 1316/1316 transitions.
Graph (trivial) has 81 edges and 122 vertex of which 10 / 122 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 662 edges and 116 vertex of which 113 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 113 transition count 1287
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 109 transition count 1287
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 109 transition count 1281
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 103 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 102 transition count 1201
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 102 transition count 1201
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 93 transition count 1192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 93 transition count 1190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 87 transition count 1202
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 67 place count 87 transition count 1193
Drop transitions removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 4 with 84 rules applied. Total rules applied 151 place count 87 transition count 1109
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 155 place count 85 transition count 1107
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 159 place count 83 transition count 1105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 161 place count 81 transition count 1105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 161 place count 81 transition count 1104
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 163 place count 80 transition count 1104
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 169 place count 77 transition count 1101
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 178 place count 77 transition count 1092
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 187 place count 68 transition count 1092
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 188 place count 68 transition count 1154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 189 place count 67 transition count 1154
Applied a total of 189 rules in 609 ms. Remains 67 /122 variables (removed 55) and now considering 1154/1316 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 67/122 places, 1154/1316 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 393334 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 393334 steps, saw 85455 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 19:24:47] [INFO ] Flow matrix only has 262 transitions (discarded 892 similar events)
// Phase 1: matrix 262 rows 67 cols
[2024-05-24 19:24:47] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 19:24:47] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-24 19:24:47] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 19:24:47] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:24:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-24 19:24:47] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 19:24:47] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:24:47] [INFO ] State equation strengthened by 213 read => feed constraints.
[2024-05-24 19:24:47] [INFO ] After 97ms SMT Verify possible using 213 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:24:47] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-24 19:24:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-24 19:24:47] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-24 19:24:47] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1154/1154 transitions.
Applied a total of 0 rules in 125 ms. Remains 67 /67 variables (removed 0) and now considering 1154/1154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 67/67 places, 1154/1154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1154/1154 transitions.
Applied a total of 0 rules in 123 ms. Remains 67 /67 variables (removed 0) and now considering 1154/1154 (removed 0) transitions.
[2024-05-24 19:24:48] [INFO ] Flow matrix only has 262 transitions (discarded 892 similar events)
[2024-05-24 19:24:48] [INFO ] Invariant cache hit.
[2024-05-24 19:24:48] [INFO ] Implicit Places using invariants in 530 ms returned [28, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 533 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/67 places, 1154/1154 transitions.
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 0 with 128 rules applied. Total rules applied 128 place count 65 transition count 1026
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 65 transition count 1024
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 132 place count 63 transition count 1024
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 63 transition count 1024
Applied a total of 138 rules in 423 ms. Remains 63 /65 variables (removed 2) and now considering 1024/1154 (removed 130) transitions.
[2024-05-24 19:24:49] [INFO ] Flow matrix only has 228 transitions (discarded 796 similar events)
// Phase 1: matrix 228 rows 63 cols
[2024-05-24 19:24:49] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:24:49] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-24 19:24:49] [INFO ] Flow matrix only has 228 transitions (discarded 796 similar events)
[2024-05-24 19:24:49] [INFO ] Invariant cache hit.
[2024-05-24 19:24:49] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-05-24 19:24:49] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/67 places, 1024/1154 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1475 ms. Remains : 63/67 places, 1024/1154 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 436612 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 436612 steps, saw 91857 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 19:24:52] [INFO ] Flow matrix only has 228 transitions (discarded 796 similar events)
[2024-05-24 19:24:52] [INFO ] Invariant cache hit.
[2024-05-24 19:24:52] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-24 19:24:52] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:24:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-24 19:24:52] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:24:52] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-05-24 19:24:53] [INFO ] After 89ms SMT Verify possible using 173 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:24:53] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-24 19:24:53] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1024/1024 transitions.
Applied a total of 0 rules in 102 ms. Remains 63 /63 variables (removed 0) and now considering 1024/1024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 63/63 places, 1024/1024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1024/1024 transitions.
Applied a total of 0 rules in 106 ms. Remains 63 /63 variables (removed 0) and now considering 1024/1024 (removed 0) transitions.
[2024-05-24 19:24:53] [INFO ] Flow matrix only has 228 transitions (discarded 796 similar events)
[2024-05-24 19:24:53] [INFO ] Invariant cache hit.
[2024-05-24 19:24:53] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-24 19:24:53] [INFO ] Flow matrix only has 228 transitions (discarded 796 similar events)
[2024-05-24 19:24:53] [INFO ] Invariant cache hit.
[2024-05-24 19:24:53] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-05-24 19:24:53] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-24 19:24:53] [INFO ] Redundant transitions in 46 ms returned [32]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2024-05-24 19:24:53] [INFO ] Flow matrix only has 227 transitions (discarded 796 similar events)
// Phase 1: matrix 227 rows 63 cols
[2024-05-24 19:24:53] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:24:54] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/63 places, 1023/1024 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 1022
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 1021
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 62 transition count 1020
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 61 transition count 1018
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 61 transition count 1018
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 61 transition count 1017
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 60 transition count 1017
Applied a total of 8 rules in 457 ms. Remains 60 /63 variables (removed 3) and now considering 1017/1023 (removed 6) transitions.
[2024-05-24 19:24:55] [INFO ] Flow matrix only has 221 transitions (discarded 796 similar events)
// Phase 1: matrix 221 rows 60 cols
[2024-05-24 19:24:55] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:24:55] [INFO ] Implicit Places using invariants in 140 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/63 places, 1017/1024 transitions.
Applied a total of 0 rules in 102 ms. Remains 59 /59 variables (removed 0) and now considering 1017/1017 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2056 ms. Remains : 59/63 places, 1017/1024 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 428034 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 428034 steps, saw 62397 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 19:24:58] [INFO ] Flow matrix only has 221 transitions (discarded 796 similar events)
// Phase 1: matrix 221 rows 59 cols
[2024-05-24 19:24:58] [INFO ] Computed 14 invariants in 0 ms
[2024-05-24 19:24:58] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-24 19:24:58] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:24:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-24 19:24:58] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:24:58] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-05-24 19:24:58] [INFO ] After 92ms SMT Verify possible using 171 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:24:58] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-24 19:24:58] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1017/1017 transitions.
Applied a total of 0 rules in 102 ms. Remains 59 /59 variables (removed 0) and now considering 1017/1017 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 59/59 places, 1017/1017 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1017/1017 transitions.
Applied a total of 0 rules in 101 ms. Remains 59 /59 variables (removed 0) and now considering 1017/1017 (removed 0) transitions.
[2024-05-24 19:24:59] [INFO ] Flow matrix only has 221 transitions (discarded 796 similar events)
[2024-05-24 19:24:59] [INFO ] Invariant cache hit.
[2024-05-24 19:24:59] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-24 19:24:59] [INFO ] Flow matrix only has 221 transitions (discarded 796 similar events)
[2024-05-24 19:24:59] [INFO ] Invariant cache hit.
[2024-05-24 19:24:59] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-05-24 19:24:59] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-05-24 19:24:59] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-24 19:24:59] [INFO ] Flow matrix only has 221 transitions (discarded 796 similar events)
[2024-05-24 19:24:59] [INFO ] Invariant cache hit.
[2024-05-24 19:25:00] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1126 ms. Remains : 59/59 places, 1017/1017 transitions.
Graph (trivial) has 21 edges and 59 vertex of which 2 / 59 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 8 transitions
Ensure Unique test removed 793 transitions
Reduce isomorphic transitions removed 801 transitions.
Graph (complete) has 314 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 57 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 57 transition count 213
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 55 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 53 transition count 211
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 1 with 26 rules applied. Total rules applied 37 place count 53 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 52 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 51 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 51 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 49 transition count 182
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 51 place count 49 transition count 182
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 49 transition count 181
Applied a total of 52 rules in 68 ms. Remains 49 /59 variables (removed 10) and now considering 181/1017 (removed 836) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 181 rows 49 cols
[2024-05-24 19:25:00] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 19:25:00] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 19:25:00] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 19:25:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 19:25:00] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 19:25:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 19:25:00] [INFO ] After 34ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 19:25:00] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 19:25:00] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), true, (X (X p0)), (X (X (NOT (AND p1 p2)))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EnergyBus-PT-none-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EnergyBus-PT-none-LTLFireability-02 finished in 26462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(X(p0)))||X(p1)) U X((X(X(G(p0))) U p1))))'
Support contains 11 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 1364
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 1364
Applied a total of 8 rules in 11 ms. Remains 124 /128 variables (removed 4) and now considering 1364/1796 (removed 432) transitions.
[2024-05-24 19:25:00] [INFO ] Flow matrix only has 478 transitions (discarded 886 similar events)
// Phase 1: matrix 478 rows 124 cols
[2024-05-24 19:25:00] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 19:25:00] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-24 19:25:00] [INFO ] Flow matrix only has 478 transitions (discarded 886 similar events)
[2024-05-24 19:25:00] [INFO ] Invariant cache hit.
[2024-05-24 19:25:01] [INFO ] State equation strengthened by 337 read => feed constraints.
[2024-05-24 19:25:01] [INFO ] Implicit Places using invariants and state equation in 671 ms returned [20, 96]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 894 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/128 places, 1364/1796 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 1364/1364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 910 ms. Remains : 122/128 places, 1364/1796 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (EQ s13 1) (EQ s15 1) (EQ s48 1) (EQ s60 1) (EQ s79 1) (EQ s87 1) (EQ s90 1) (EQ s112 1)), p1:(AND (EQ s13 1) (EQ s15 1) (EQ s48 1) (EQ s60 1) (EQ...], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-03 finished in 1151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 10 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 123 transition count 1204
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 123 transition count 1204
Applied a total of 10 rules in 12 ms. Remains 123 /128 variables (removed 5) and now considering 1204/1796 (removed 592) transitions.
[2024-05-24 19:25:01] [INFO ] Flow matrix only has 438 transitions (discarded 766 similar events)
// Phase 1: matrix 438 rows 123 cols
[2024-05-24 19:25:01] [INFO ] Computed 22 invariants in 1 ms
[2024-05-24 19:25:01] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-24 19:25:01] [INFO ] Flow matrix only has 438 transitions (discarded 766 similar events)
[2024-05-24 19:25:01] [INFO ] Invariant cache hit.
[2024-05-24 19:25:02] [INFO ] State equation strengthened by 297 read => feed constraints.
[2024-05-24 19:25:02] [INFO ] Implicit Places using invariants and state equation in 658 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 846 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/128 places, 1204/1796 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 865 ms. Remains : 121/128 places, 1204/1796 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s15 1) (EQ s34 1) (EQ s46 1) (EQ s74 1) (EQ s82 1) (EQ s89 1) (EQ s103 1)), p1:(AND (EQ s13 1) (EQ s15 1) (EQ s34 1) (EQ s46 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-06 finished in 1012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(G(p2)&&p1))))'
Support contains 14 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 123 transition count 1236
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 123 transition count 1236
Applied a total of 10 rules in 12 ms. Remains 123 /128 variables (removed 5) and now considering 1236/1796 (removed 560) transitions.
[2024-05-24 19:25:02] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
// Phase 1: matrix 446 rows 123 cols
[2024-05-24 19:25:02] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 19:25:02] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-24 19:25:02] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
[2024-05-24 19:25:02] [INFO ] Invariant cache hit.
[2024-05-24 19:25:03] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-24 19:25:03] [INFO ] Implicit Places using invariants and state equation in 626 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 800 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/128 places, 1236/1796 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 818 ms. Remains : 121/128 places, 1236/1796 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(OR (EQ s13 0) (EQ s15 0) (EQ s34 0) (EQ s46 0) (EQ s68 0) (EQ s86 0) (EQ s90 0) (EQ s110 0)), p0:(AND (EQ s13 1) (EQ s15 1) (EQ s48 1) (EQ s60 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-07 finished in 1056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p1&&X(p0)))&&X(p2))))'
Support contains 17 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 1460
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 1460
Applied a total of 6 rules in 13 ms. Remains 125 /128 variables (removed 3) and now considering 1460/1796 (removed 336) transitions.
[2024-05-24 19:25:03] [INFO ] Flow matrix only has 502 transitions (discarded 958 similar events)
// Phase 1: matrix 502 rows 125 cols
[2024-05-24 19:25:03] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 19:25:04] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-24 19:25:04] [INFO ] Flow matrix only has 502 transitions (discarded 958 similar events)
[2024-05-24 19:25:04] [INFO ] Invariant cache hit.
[2024-05-24 19:25:04] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-24 19:25:04] [INFO ] Implicit Places using invariants and state equation in 657 ms returned [20, 97]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 822 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1460/1796 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1460/1460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 852 ms. Remains : 123/128 places, 1460/1796 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (EQ s13 1) (EQ s15 1) (EQ s34 1) (EQ s46 1) (EQ s80 1) (EQ s87 1) (EQ s91 1) (EQ s104 1)) (AND (EQ s13 1) (EQ s15 1) (EQ s48 1) (EQ s60 1) (EQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-08 finished in 1143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))&&F(p2)))'
Support contains 13 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 76 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 122 transition count 1780
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 118 transition count 1780
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 118 transition count 1776
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 114 transition count 1776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 109 transition count 1184
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 109 transition count 1184
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 45 place count 100 transition count 1175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 100 transition count 1173
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 94 transition count 1185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 94 transition count 1181
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 83 place count 94 transition count 1161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 94 transition count 1160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 85 place count 93 transition count 1160
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 91 place count 90 transition count 1157
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 92 place count 90 transition count 1156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 93 place count 89 transition count 1156
Applied a total of 93 rules in 592 ms. Remains 89 /128 variables (removed 39) and now considering 1156/1796 (removed 640) transitions.
[2024-05-24 19:25:05] [INFO ] Flow matrix only has 330 transitions (discarded 826 similar events)
// Phase 1: matrix 330 rows 89 cols
[2024-05-24 19:25:05] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 19:25:05] [INFO ] Implicit Places using invariants in 139 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/128 places, 1156/1796 transitions.
Applied a total of 0 rules in 141 ms. Remains 88 /88 variables (removed 0) and now considering 1156/1156 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 891 ms. Remains : 88/128 places, 1156/1796 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(OR (EQ s6 0) (EQ s8 0) (EQ s31 0) (EQ s37 0) (EQ s41 0) (EQ s54 0) (EQ s62 0) (EQ s76 0)), p2:(AND (EQ s6 1) (EQ s8 1) (EQ s23 1) (EQ s29 1) (EQ s49 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-09 finished in 1075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 12 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 75 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 122 transition count 1780
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 118 transition count 1780
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 118 transition count 1776
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 114 transition count 1776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 109 transition count 1232
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 109 transition count 1232
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 45 place count 100 transition count 1223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 100 transition count 1221
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 94 transition count 1233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 94 transition count 1229
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 81 place count 94 transition count 1211
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 94 transition count 1210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 83 place count 93 transition count 1210
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 89 place count 90 transition count 1207
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 90 place count 90 transition count 1206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 91 place count 89 transition count 1206
Applied a total of 91 rules in 603 ms. Remains 89 /128 variables (removed 39) and now considering 1206/1796 (removed 590) transitions.
[2024-05-24 19:25:06] [INFO ] Flow matrix only has 343 transitions (discarded 863 similar events)
// Phase 1: matrix 343 rows 89 cols
[2024-05-24 19:25:06] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 19:25:06] [INFO ] Implicit Places using invariants in 191 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 193 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/128 places, 1206/1796 transitions.
Applied a total of 0 rules in 163 ms. Remains 88 /88 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 961 ms. Remains : 88/128 places, 1206/1796 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s8 1) (EQ s31 1) (EQ s37 1) (EQ s50 1) (EQ s59 1) (EQ s63 1) (EQ s73 1)), p1:(OR (NEQ s6 1) (NEQ s8 1) (NEQ s31 1) (NEQ s37 1) (NEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1172 ms.
Stuttering criterion allowed to conclude after 64903 steps with 0 reset in 791 ms.
FORMULA EnergyBus-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-12 finished in 3129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 8 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 81 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 122 transition count 1780
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 118 transition count 1780
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 118 transition count 1775
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 113 transition count 1775
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 25 place count 107 transition count 1103
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 107 transition count 1103
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 98 transition count 1094
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 98 transition count 1092
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 63 place count 92 transition count 1104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 67 place count 92 transition count 1100
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 85 place count 92 transition count 1082
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 92 transition count 1081
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 91 transition count 1081
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 93 place count 88 transition count 1078
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 88 transition count 1077
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 95 place count 87 transition count 1077
Applied a total of 95 rules in 504 ms. Remains 87 /128 variables (removed 41) and now considering 1077/1796 (removed 719) transitions.
[2024-05-24 19:25:09] [INFO ] Flow matrix only has 314 transitions (discarded 763 similar events)
// Phase 1: matrix 314 rows 87 cols
[2024-05-24 19:25:09] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 19:25:09] [INFO ] Implicit Places using invariants in 192 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 194 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/128 places, 1077/1796 transitions.
Applied a total of 0 rules in 126 ms. Remains 86 /86 variables (removed 0) and now considering 1077/1077 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 824 ms. Remains : 86/128 places, 1077/1796 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s8 1) (EQ s23 1) (EQ s29 1) (EQ s42 1) (EQ s57 1) (EQ s60 1) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-13 finished in 879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(G(!p1) U p2))))'
Support contains 13 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 77 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 122 transition count 1780
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 118 transition count 1780
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 118 transition count 1775
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 113 transition count 1775
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 108 transition count 1215
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 108 transition count 1215
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 45 place count 100 transition count 1207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 100 transition count 1205
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 94 transition count 1217
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 94 transition count 1213
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 82 place count 94 transition count 1194
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 88 place count 91 transition count 1191
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 91 transition count 1190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 90 transition count 1190
Applied a total of 90 rules in 574 ms. Remains 90 /128 variables (removed 38) and now considering 1190/1796 (removed 606) transitions.
[2024-05-24 19:25:10] [INFO ] Flow matrix only has 340 transitions (discarded 850 similar events)
// Phase 1: matrix 340 rows 90 cols
[2024-05-24 19:25:10] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 19:25:10] [INFO ] Implicit Places using invariants in 191 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 193 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/128 places, 1190/1796 transitions.
Applied a total of 0 rules in 148 ms. Remains 89 /89 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 916 ms. Remains : 89/128 places, 1190/1796 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p2 p1), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s8 1) (EQ s33 1) (EQ s39 1) (EQ s53 1) (EQ s55 1) (EQ s64 1) (EQ s80 1)), p2:(EQ s24 1), p1:(OR (EQ s24 1) (AND (EQ s6 1) (EQ s8 1) ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-15 finished in 1151 ms.
All properties solved by simple procedures.
Total runtime 232447 ms.

BK_STOP 1716578712201

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EnergyBus-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is EnergyBus-PT-none, 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 r175-smll-171636280000138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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