About the Execution of 2023-gold for CloudReconfiguration-PT-316
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2987.008 | 263025.00 | 515571.00 | 955.20 | FFFTFFFFTFFTTFFF | normal |
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.r109-tall-171624207900147.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 CloudReconfiguration-PT-316, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624207900147
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 19:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 19:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 19:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-316-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716307469879
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-316
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 16:04:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 16:04:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:04:31] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-21 16:04:31] [INFO ] Transformed 2585 places.
[2024-05-21 16:04:31] [INFO ] Transformed 3095 transitions.
[2024-05-21 16:04:31] [INFO ] Found NUPN structural information;
[2024-05-21 16:04:31] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 513 places :
Symmetric choice reduction at 0 with 513 rule applications. Total rules 513 place count 2072 transition count 2582
Iterating global reduction 0 with 513 rules applied. Total rules applied 1026 place count 2072 transition count 2582
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1055 place count 2072 transition count 2553
Discarding 235 places :
Symmetric choice reduction at 1 with 235 rule applications. Total rules 1290 place count 1837 transition count 2318
Iterating global reduction 1 with 235 rules applied. Total rules applied 1525 place count 1837 transition count 2318
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 1610 place count 1752 transition count 2233
Iterating global reduction 1 with 85 rules applied. Total rules applied 1695 place count 1752 transition count 2233
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1711 place count 1752 transition count 2217
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1753 place count 1710 transition count 2175
Iterating global reduction 2 with 42 rules applied. Total rules applied 1795 place count 1710 transition count 2175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1801 place count 1710 transition count 2169
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1834 place count 1677 transition count 2132
Iterating global reduction 3 with 33 rules applied. Total rules applied 1867 place count 1677 transition count 2132
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1892 place count 1652 transition count 2107
Iterating global reduction 3 with 25 rules applied. Total rules applied 1917 place count 1652 transition count 2107
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1941 place count 1628 transition count 2083
Iterating global reduction 3 with 24 rules applied. Total rules applied 1965 place count 1628 transition count 2083
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1988 place count 1605 transition count 2060
Iterating global reduction 3 with 23 rules applied. Total rules applied 2011 place count 1605 transition count 2060
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2031 place count 1585 transition count 2027
Iterating global reduction 3 with 20 rules applied. Total rules applied 2051 place count 1585 transition count 2027
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2058 place count 1578 transition count 2015
Iterating global reduction 3 with 7 rules applied. Total rules applied 2065 place count 1578 transition count 2015
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2072 place count 1571 transition count 2006
Iterating global reduction 3 with 7 rules applied. Total rules applied 2079 place count 1571 transition count 2006
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2082 place count 1571 transition count 2003
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2084 place count 1569 transition count 2001
Iterating global reduction 4 with 2 rules applied. Total rules applied 2086 place count 1569 transition count 2001
Applied a total of 2086 rules in 1380 ms. Remains 1569 /2585 variables (removed 1016) and now considering 2001/3095 (removed 1094) transitions.
// Phase 1: matrix 2001 rows 1569 cols
[2024-05-21 16:04:33] [INFO ] Computed 4 invariants in 38 ms
[2024-05-21 16:04:33] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-21 16:04:33] [INFO ] Invariant cache hit.
[2024-05-21 16:04:34] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
[2024-05-21 16:04:34] [INFO ] Invariant cache hit.
[2024-05-21 16:04:35] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1569/2585 places, 2001/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3502 ms. Remains : 1569/2585 places, 2001/3095 transitions.
Support contains 40 out of 1569 places after structural reductions.
[2024-05-21 16:04:35] [INFO ] Flatten gal took : 123 ms
[2024-05-21 16:04:35] [INFO ] Flatten gal took : 70 ms
[2024-05-21 16:04:35] [INFO ] Input system was already deterministic with 2001 transitions.
Support contains 38 out of 1569 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 322 ms. (steps per millisecond=31 ) 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 1000 steps, including 3 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
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 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 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 7 ms. (steps per millisecond=142 ) 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 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
Incomplete Best-First random walk after 1001 steps, including 3 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 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 3 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 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 241907 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241907 steps, saw 69867 distinct states, run finished after 3004 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 20 properties.
[2024-05-21 16:04:39] [INFO ] Invariant cache hit.
[2024-05-21 16:04:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 16:04:40] [INFO ] After 1485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-21 16:04:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 16:04:43] [INFO ] After 1933ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2024-05-21 16:04:46] [INFO ] After 4185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1244 ms.
[2024-05-21 16:04:47] [INFO ] After 6655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 8 properties in 240 ms.
Support contains 24 out of 1569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Graph (trivial) has 1865 edges and 1569 vertex of which 658 / 1569 are part of one of the 62 SCC in 8 ms
Free SCC test removed 596 places
Drop transitions removed 748 transitions
Reduce isomorphic transitions removed 748 transitions.
Graph (complete) has 1426 edges and 973 vertex of which 964 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 526 transitions
Trivial Post-agglo rules discarded 526 transitions
Performed 526 trivial Post agglomeration. Transition count delta: 526
Iterating post reduction 0 with 533 rules applied. Total rules applied 535 place count 964 transition count 716
Reduce places removed 526 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 572 rules applied. Total rules applied 1107 place count 438 transition count 670
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 1139 place count 408 transition count 668
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 1144 place count 407 transition count 664
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1149 place count 403 transition count 663
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 50 Pre rules applied. Total rules applied 1149 place count 403 transition count 613
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 1249 place count 353 transition count 613
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1256 place count 346 transition count 605
Iterating global reduction 5 with 7 rules applied. Total rules applied 1263 place count 346 transition count 605
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1264 place count 346 transition count 604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1265 place count 345 transition count 604
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1271 place count 339 transition count 598
Iterating global reduction 7 with 6 rules applied. Total rules applied 1277 place count 339 transition count 598
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1283 place count 339 transition count 592
Performed 165 Post agglomeration using F-continuation condition with reduction of 105 identical transitions.
Deduced a syphon composed of 165 places in 1 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 8 with 330 rules applied. Total rules applied 1613 place count 174 transition count 322
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 1632 place count 174 transition count 303
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1635 place count 171 transition count 300
Iterating global reduction 9 with 3 rules applied. Total rules applied 1638 place count 171 transition count 300
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1660 place count 160 transition count 288
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1671 place count 160 transition count 277
Performed 38 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 10 with 76 rules applied. Total rules applied 1747 place count 122 transition count 317
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 10 with 29 rules applied. Total rules applied 1776 place count 122 transition count 288
Discarding 18 places :
Symmetric choice reduction at 11 with 18 rule applications. Total rules 1794 place count 104 transition count 252
Iterating global reduction 11 with 18 rules applied. Total rules applied 1812 place count 104 transition count 252
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1821 place count 104 transition count 243
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1826 place count 99 transition count 233
Iterating global reduction 12 with 5 rules applied. Total rules applied 1831 place count 99 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1835 place count 99 transition count 229
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 13 with 11 rules applied. Total rules applied 1846 place count 99 transition count 218
Free-agglomeration rule applied 10 times.
Iterating global reduction 13 with 10 rules applied. Total rules applied 1856 place count 99 transition count 208
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 1868 place count 89 transition count 206
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1871 place count 89 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1872 place count 88 transition count 205
Applied a total of 1872 rules in 148 ms. Remains 88 /1569 variables (removed 1481) and now considering 205/2001 (removed 1796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 88/1569 places, 205/2001 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 16:04:47] [INFO ] Flow matrix only has 192 transitions (discarded 13 similar events)
// Phase 1: matrix 192 rows 88 cols
[2024-05-21 16:04:47] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 16:04:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 16:04:47] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 16:04:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 16:04:48] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 16:04:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:04:48] [INFO ] After 8ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2024-05-21 16:04:48] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-21 16:04:48] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2179 edges and 1569 vertex of which 1560 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.27 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)))'
Support contains 2 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Graph (trivial) has 1910 edges and 1569 vertex of which 706 / 1569 are part of one of the 63 SCC in 4 ms
Free SCC test removed 643 places
Ensure Unique test removed 747 transitions
Reduce isomorphic transitions removed 747 transitions.
Graph (complete) has 1426 edges and 926 vertex of which 917 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 515 place count 916 transition count 735
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 537 rules applied. Total rules applied 1052 place count 403 transition count 711
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1064 place count 392 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1065 place count 391 transition count 710
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1065 place count 391 transition count 665
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1155 place count 346 transition count 665
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1168 place count 333 transition count 646
Iterating global reduction 4 with 13 rules applied. Total rules applied 1181 place count 333 transition count 646
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 1182 place count 333 transition count 645
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1183 place count 332 transition count 645
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1192 place count 323 transition count 633
Iterating global reduction 6 with 9 rules applied. Total rules applied 1201 place count 323 transition count 633
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1207 place count 323 transition count 627
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1208 place count 322 transition count 625
Iterating global reduction 7 with 1 rules applied. Total rules applied 1209 place count 322 transition count 625
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1210 place count 321 transition count 623
Iterating global reduction 7 with 1 rules applied. Total rules applied 1211 place count 321 transition count 623
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1212 place count 320 transition count 621
Iterating global reduction 7 with 1 rules applied. Total rules applied 1213 place count 320 transition count 621
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1214 place count 319 transition count 619
Iterating global reduction 7 with 1 rules applied. Total rules applied 1215 place count 319 transition count 619
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1216 place count 318 transition count 617
Iterating global reduction 7 with 1 rules applied. Total rules applied 1217 place count 318 transition count 617
Performed 151 Post agglomeration using F-continuation condition with reduction of 91 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 7 with 302 rules applied. Total rules applied 1519 place count 167 transition count 375
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1534 place count 167 transition count 360
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1540 place count 161 transition count 351
Iterating global reduction 8 with 6 rules applied. Total rules applied 1546 place count 161 transition count 351
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1547 place count 160 transition count 349
Iterating global reduction 8 with 1 rules applied. Total rules applied 1548 place count 160 transition count 349
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1549 place count 159 transition count 347
Iterating global reduction 8 with 1 rules applied. Total rules applied 1550 place count 159 transition count 347
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1551 place count 158 transition count 345
Iterating global reduction 8 with 1 rules applied. Total rules applied 1552 place count 158 transition count 345
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1553 place count 157 transition count 343
Iterating global reduction 8 with 1 rules applied. Total rules applied 1554 place count 157 transition count 343
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1574 place count 147 transition count 332
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1584 place count 147 transition count 322
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1586 place count 145 transition count 316
Iterating global reduction 9 with 2 rules applied. Total rules applied 1588 place count 145 transition count 316
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 9 with 2 rules applied. Total rules applied 1590 place count 144 transition count 315
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1591 place count 143 transition count 309
Iterating global reduction 9 with 1 rules applied. Total rules applied 1592 place count 143 transition count 309
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1626 place count 126 transition count 344
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 1644 place count 126 transition count 326
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1653 place count 117 transition count 308
Iterating global reduction 10 with 9 rules applied. Total rules applied 1662 place count 117 transition count 308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1667 place count 117 transition count 303
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 11 with 35 rules applied. Total rules applied 1702 place count 117 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1703 place count 116 transition count 267
Applied a total of 1703 rules in 167 ms. Remains 116 /1569 variables (removed 1453) and now considering 267/2001 (removed 1734) transitions.
[2024-05-21 16:04:48] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 116 cols
[2024-05-21 16:04:48] [INFO ] Computed 0 invariants in 7 ms
[2024-05-21 16:04:48] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-21 16:04:48] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2024-05-21 16:04:48] [INFO ] Invariant cache hit.
[2024-05-21 16:04:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:04:48] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 334 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1569 places, 267/2001 transitions.
Reduce places removed 1 places and 1 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 112 transition count 265
Applied a total of 2 rules in 7 ms. Remains 112 /114 variables (removed 2) and now considering 265/267 (removed 2) transitions.
[2024-05-21 16:04:48] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 112 cols
[2024-05-21 16:04:48] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 16:04:48] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 16:04:48] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-21 16:04:48] [INFO ] Invariant cache hit.
[2024-05-21 16:04:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:04:49] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1569 places, 265/2001 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 731 ms. Remains : 112/1569 places, 265/2001 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 150 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-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:(AND (EQ s73 0) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-00 finished in 934 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((X(G(p0))&&F(p1))))'
Support contains 3 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1545 transition count 1977
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1545 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1545 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 1530 transition count 1959
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 1530 transition count 1959
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 1530 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 1524 transition count 1950
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 1524 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 1524 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 1521 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 1518 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 1518 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 1515 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 1509 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 1507 transition count 1929
Applied a total of 129 rules in 766 ms. Remains 1507 /1569 variables (removed 62) and now considering 1929/2001 (removed 72) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 16:04:50] [INFO ] Computed 4 invariants in 12 ms
[2024-05-21 16:04:50] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-21 16:04:50] [INFO ] Invariant cache hit.
[2024-05-21 16:04:51] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
[2024-05-21 16:04:51] [INFO ] Invariant cache hit.
[2024-05-21 16:04:51] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1569 places, 1929/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2670 ms. Remains : 1507/1569 places, 1929/2001 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(EQ s151 1), p1:(OR (EQ s567 0) (EQ s1370 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-01 finished in 2878 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(F(p0)))'
Support contains 3 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Graph (trivial) has 1907 edges and 1569 vertex of which 695 / 1569 are part of one of the 63 SCC in 2 ms
Free SCC test removed 632 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1440 edges and 937 vertex of which 928 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 519 rules applied. Total rules applied 521 place count 927 transition count 743
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 540 rules applied. Total rules applied 1061 place count 408 transition count 722
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 1072 place count 398 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1073 place count 397 transition count 721
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1073 place count 397 transition count 675
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1165 place count 351 transition count 675
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1178 place count 338 transition count 657
Iterating global reduction 4 with 13 rules applied. Total rules applied 1191 place count 338 transition count 657
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 1192 place count 338 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1193 place count 337 transition count 656
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1202 place count 328 transition count 644
Iterating global reduction 6 with 9 rules applied. Total rules applied 1211 place count 328 transition count 644
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1217 place count 328 transition count 638
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1219 place count 326 transition count 634
Iterating global reduction 7 with 2 rules applied. Total rules applied 1221 place count 326 transition count 634
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1222 place count 325 transition count 632
Iterating global reduction 7 with 1 rules applied. Total rules applied 1223 place count 325 transition count 632
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1224 place count 324 transition count 630
Iterating global reduction 7 with 1 rules applied. Total rules applied 1225 place count 324 transition count 630
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1226 place count 323 transition count 628
Iterating global reduction 7 with 1 rules applied. Total rules applied 1227 place count 323 transition count 628
Performed 151 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 7 with 302 rules applied. Total rules applied 1529 place count 172 transition count 390
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 1546 place count 172 transition count 373
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1552 place count 166 transition count 364
Iterating global reduction 8 with 6 rules applied. Total rules applied 1558 place count 166 transition count 364
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1559 place count 165 transition count 362
Iterating global reduction 8 with 1 rules applied. Total rules applied 1560 place count 165 transition count 362
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1561 place count 164 transition count 360
Iterating global reduction 8 with 1 rules applied. Total rules applied 1562 place count 164 transition count 360
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1563 place count 163 transition count 358
Iterating global reduction 8 with 1 rules applied. Total rules applied 1564 place count 163 transition count 358
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1565 place count 162 transition count 356
Iterating global reduction 8 with 1 rules applied. Total rules applied 1566 place count 162 transition count 356
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1590 place count 150 transition count 343
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1603 place count 150 transition count 330
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1604 place count 149 transition count 328
Iterating global reduction 9 with 1 rules applied. Total rules applied 1605 place count 149 transition count 328
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1643 place count 130 transition count 368
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1668 place count 130 transition count 343
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 1678 place count 120 transition count 320
Iterating global reduction 10 with 10 rules applied. Total rules applied 1688 place count 120 transition count 320
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1694 place count 120 transition count 314
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 11 with 38 rules applied. Total rules applied 1732 place count 120 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1733 place count 119 transition count 275
Applied a total of 1733 rules in 95 ms. Remains 119 /1569 variables (removed 1450) and now considering 275/2001 (removed 1726) transitions.
[2024-05-21 16:04:52] [INFO ] Flow matrix only has 218 transitions (discarded 57 similar events)
// Phase 1: matrix 218 rows 119 cols
[2024-05-21 16:04:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 16:04:52] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 16:04:52] [INFO ] Flow matrix only has 218 transitions (discarded 57 similar events)
[2024-05-21 16:04:52] [INFO ] Invariant cache hit.
[2024-05-21 16:04:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:04:52] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [12, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 227 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1569 places, 275/2001 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 273
Applied a total of 2 rules in 9 ms. Remains 115 /117 variables (removed 2) and now considering 273/275 (removed 2) transitions.
[2024-05-21 16:04:52] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
// Phase 1: matrix 216 rows 115 cols
[2024-05-21 16:04:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 16:04:52] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 16:04:52] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-21 16:04:52] [INFO ] Invariant cache hit.
[2024-05-21 16:04:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:04:52] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1569 places, 273/2001 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 480 ms. Remains : 115/1569 places, 273/2001 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s8 1) (EQ s99 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9616 reset in 216 ms.
Product exploration explored 100000 steps with 9655 reset in 168 ms.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1213 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 28176 steps, run visited all 1 properties in 37 ms. (steps per millisecond=761 )
Probabilistic random walk after 28176 steps, saw 6921 distinct states, run finished after 38 ms. (steps per millisecond=741 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 273/273 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2024-05-21 16:04:53] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-21 16:04:53] [INFO ] Invariant cache hit.
[2024-05-21 16:04:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 16:04:53] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-21 16:04:53] [INFO ] Invariant cache hit.
[2024-05-21 16:04:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:04:53] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-21 16:04:53] [INFO ] Redundant transitions in 53 ms returned []
[2024-05-21 16:04:53] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-21 16:04:53] [INFO ] Invariant cache hit.
[2024-05-21 16:04:53] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 115/115 places, 273/273 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1193 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 28176 steps, run visited all 1 properties in 38 ms. (steps per millisecond=741 )
Probabilistic random walk after 28176 steps, saw 6921 distinct states, run finished after 39 ms. (steps per millisecond=722 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9580 reset in 116 ms.
Product exploration explored 100000 steps with 9732 reset in 120 ms.
Built C files in :
/tmp/ltsmin9268835093387419569
[2024-05-21 16:04:54] [INFO ] Computing symmetric may disable matrix : 273 transitions.
[2024-05-21 16:04:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:04:54] [INFO ] Computing symmetric may enable matrix : 273 transitions.
[2024-05-21 16:04:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:04:54] [INFO ] Computing Do-Not-Accords matrix : 273 transitions.
[2024-05-21 16:04:54] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:04:54] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9268835093387419569
Running compilation step : cd /tmp/ltsmin9268835093387419569;'/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'
Compilation finished in 540 ms.
Running link step : cd /tmp/ltsmin9268835093387419569;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9268835093387419569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5022871882449552672.hoa' '--buchi-type=spotba'
LTSmin run took 4962 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-02 finished in 8197 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))'
Support contains 2 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1545 transition count 1977
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1545 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1545 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 1530 transition count 1959
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 1530 transition count 1959
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 1530 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 1524 transition count 1950
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 1524 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 1524 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 1521 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 1518 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 1518 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 1515 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 1509 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 1507 transition count 1929
Applied a total of 129 rules in 662 ms. Remains 1507 /1569 variables (removed 62) and now considering 1929/2001 (removed 72) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 16:05:01] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 16:05:01] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-21 16:05:01] [INFO ] Invariant cache hit.
[2024-05-21 16:05:02] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2024-05-21 16:05:02] [INFO ] Invariant cache hit.
[2024-05-21 16:05:02] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1569 places, 1929/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2499 ms. Remains : 1507/1569 places, 1929/2001 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s195 0) (EQ s733 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1097 ms.
Product exploration explored 100000 steps with 50000 reset in 1041 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-316-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-03 finished in 4806 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((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Graph (trivial) has 1905 edges and 1569 vertex of which 688 / 1569 are part of one of the 62 SCC in 2 ms
Free SCC test removed 626 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1446 edges and 943 vertex of which 934 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 524 transitions
Trivial Post-agglo rules discarded 524 transitions
Performed 524 trivial Post agglomeration. Transition count delta: 524
Iterating post reduction 0 with 524 rules applied. Total rules applied 526 place count 933 transition count 744
Reduce places removed 524 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 550 rules applied. Total rules applied 1076 place count 409 transition count 718
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 1090 place count 397 transition count 716
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1091 place count 396 transition count 716
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1091 place count 396 transition count 670
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1183 place count 350 transition count 670
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1196 place count 337 transition count 652
Iterating global reduction 4 with 13 rules applied. Total rules applied 1209 place count 337 transition count 652
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 1210 place count 337 transition count 651
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1211 place count 336 transition count 651
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1220 place count 327 transition count 639
Iterating global reduction 6 with 9 rules applied. Total rules applied 1229 place count 327 transition count 639
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1235 place count 327 transition count 633
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1237 place count 325 transition count 629
Iterating global reduction 7 with 2 rules applied. Total rules applied 1239 place count 325 transition count 629
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1240 place count 324 transition count 627
Iterating global reduction 7 with 1 rules applied. Total rules applied 1241 place count 324 transition count 627
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1242 place count 323 transition count 625
Iterating global reduction 7 with 1 rules applied. Total rules applied 1243 place count 323 transition count 625
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1244 place count 322 transition count 623
Iterating global reduction 7 with 1 rules applied. Total rules applied 1245 place count 322 transition count 623
Performed 150 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 7 with 300 rules applied. Total rules applied 1545 place count 172 transition count 386
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1561 place count 172 transition count 370
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1566 place count 167 transition count 363
Iterating global reduction 8 with 5 rules applied. Total rules applied 1571 place count 167 transition count 363
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1572 place count 166 transition count 361
Iterating global reduction 8 with 1 rules applied. Total rules applied 1573 place count 166 transition count 361
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1574 place count 165 transition count 359
Iterating global reduction 8 with 1 rules applied. Total rules applied 1575 place count 165 transition count 359
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1576 place count 164 transition count 357
Iterating global reduction 8 with 1 rules applied. Total rules applied 1577 place count 164 transition count 357
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1578 place count 163 transition count 355
Iterating global reduction 8 with 1 rules applied. Total rules applied 1579 place count 163 transition count 355
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1601 place count 152 transition count 343
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1613 place count 152 transition count 331
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 151 transition count 329
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 151 transition count 329
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1653 place count 132 transition count 367
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 1676 place count 132 transition count 344
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1685 place count 123 transition count 326
Iterating global reduction 10 with 9 rules applied. Total rules applied 1694 place count 123 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1700 place count 123 transition count 320
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 11 with 40 rules applied. Total rules applied 1740 place count 123 transition count 280
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1741 place count 123 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1742 place count 122 transition count 279
Applied a total of 1742 rules in 87 ms. Remains 122 /1569 variables (removed 1447) and now considering 279/2001 (removed 1722) transitions.
[2024-05-21 16:05:05] [INFO ] Flow matrix only has 223 transitions (discarded 56 similar events)
// Phase 1: matrix 223 rows 122 cols
[2024-05-21 16:05:05] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 16:05:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 16:05:05] [INFO ] Flow matrix only has 223 transitions (discarded 56 similar events)
[2024-05-21 16:05:05] [INFO ] Invariant cache hit.
[2024-05-21 16:05:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:05:05] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [16, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 149 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/1569 places, 279/2001 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 277
Applied a total of 2 rules in 6 ms. Remains 118 /120 variables (removed 2) and now considering 277/279 (removed 2) transitions.
[2024-05-21 16:05:05] [INFO ] Flow matrix only has 221 transitions (discarded 56 similar events)
// Phase 1: matrix 221 rows 118 cols
[2024-05-21 16:05:05] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 16:05:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 16:05:05] [INFO ] Flow matrix only has 221 transitions (discarded 56 similar events)
[2024-05-21 16:05:05] [INFO ] Invariant cache hit.
[2024-05-21 16:05:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:05:05] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/1569 places, 277/2001 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 359 ms. Remains : 118/1569 places, 277/2001 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s13 0) (NEQ s4 1)), p1:(AND (NEQ s7 0) (NEQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-04 finished in 466 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(X(G(p0))))'
Support contains 1 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1545 transition count 1977
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1545 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1545 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 1530 transition count 1959
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 1530 transition count 1959
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 1530 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 1524 transition count 1950
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 1524 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 1524 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 1521 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 1518 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 1518 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 1515 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 1509 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 1507 transition count 1929
Applied a total of 129 rules in 627 ms. Remains 1507 /1569 variables (removed 62) and now considering 1929/2001 (removed 72) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 16:05:06] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 16:05:06] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 16:05:06] [INFO ] Invariant cache hit.
[2024-05-21 16:05:07] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
[2024-05-21 16:05:07] [INFO ] Invariant cache hit.
[2024-05-21 16:05:08] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1569 places, 1929/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2544 ms. Remains : 1507/1569 places, 1929/2001 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s464 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4275 steps with 30 reset in 10 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-06 finished in 2700 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||X(X(p1))))||G(p2)))'
Support contains 5 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1548 transition count 1980
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1548 transition count 1980
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 1535 transition count 1965
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 1535 transition count 1965
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 71 place count 1535 transition count 1962
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 1530 transition count 1957
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 1530 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 1530 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 1528 transition count 1954
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 1528 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 1526 transition count 1952
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 1526 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 1524 transition count 1949
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 1524 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 1523 transition count 1948
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 1523 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 1522 transition count 1947
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 1522 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 1521 transition count 1945
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 1521 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1520 transition count 1943
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1520 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1519 transition count 1942
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1519 transition count 1942
Applied a total of 104 rules in 628 ms. Remains 1519 /1569 variables (removed 50) and now considering 1942/2001 (removed 59) transitions.
// Phase 1: matrix 1942 rows 1519 cols
[2024-05-21 16:05:08] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 16:05:09] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-21 16:05:09] [INFO ] Invariant cache hit.
[2024-05-21 16:05:10] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2024-05-21 16:05:10] [INFO ] Invariant cache hit.
[2024-05-21 16:05:10] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1519/1569 places, 1942/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2500 ms. Remains : 1519/1569 places, 1942/2001 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s876 1), p0:(AND (EQ s654 0) (EQ s1456 1)), p1:(OR (EQ s581 0) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25114 reset in 657 ms.
Product exploration explored 100000 steps with 24972 reset in 705 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2119 edges and 1519 vertex of which 1510 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 78 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 293619 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293619 steps, saw 81166 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 16:05:16] [INFO ] Invariant cache hit.
[2024-05-21 16:05:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 16:05:16] [INFO ] After 875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 16:05:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 16:05:17] [INFO ] After 673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 16:05:18] [INFO ] After 882ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-05-21 16:05:18] [INFO ] After 1235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 282 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=141 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 190 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 4 out of 1519 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1519/1519 places, 1942/1942 transitions.
Applied a total of 0 rules in 53 ms. Remains 1519 /1519 variables (removed 0) and now considering 1942/1942 (removed 0) transitions.
[2024-05-21 16:05:18] [INFO ] Invariant cache hit.
[2024-05-21 16:05:18] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-21 16:05:18] [INFO ] Invariant cache hit.
[2024-05-21 16:05:19] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2024-05-21 16:05:19] [INFO ] Invariant cache hit.
[2024-05-21 16:05:20] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1944 ms. Remains : 1519/1519 places, 1942/1942 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2119 edges and 1519 vertex of which 1510 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 297655 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 297655 steps, saw 82021 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 16:05:24] [INFO ] Invariant cache hit.
[2024-05-21 16:05:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 16:05:24] [INFO ] After 839ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 16:05:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 17 ms returned sat
[2024-05-21 16:05:25] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 16:05:26] [INFO ] After 901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-21 16:05:26] [INFO ] After 1262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 282 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=141 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 19925 reset in 499 ms.
Product exploration explored 100000 steps with 19958 reset in 499 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 4 out of 1519 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1519/1519 places, 1942/1942 transitions.
Graph (trivial) has 1848 edges and 1519 vertex of which 693 / 1519 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1381 edges and 889 vertex of which 880 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 482 rules applied. Total rules applied 484 place count 880 transition count 1205
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 496 place count 880 transition count 1193
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 496 place count 880 transition count 1206
Deduced a syphon composed of 503 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 517 place count 880 transition count 1206
Discarding 291 places :
Symmetric choice reduction at 2 with 291 rule applications. Total rules 808 place count 589 transition count 906
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 2 with 291 rules applied. Total rules applied 1099 place count 589 transition count 906
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1111 place count 577 transition count 890
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1123 place count 577 transition count 890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1129 place count 577 transition count 884
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1141 place count 565 transition count 872
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1153 place count 565 transition count 872
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1155 place count 563 transition count 868
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 563 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1159 place count 561 transition count 864
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1161 place count 561 transition count 864
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 557 transition count 860
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 557 transition count 860
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1171 place count 555 transition count 856
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1173 place count 555 transition count 856
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1175 place count 553 transition count 852
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1177 place count 553 transition count 852
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1181 place count 549 transition count 846
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1185 place count 549 transition count 846
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1188 place count 546 transition count 837
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1191 place count 546 transition count 837
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1193 place count 544 transition count 835
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1195 place count 544 transition count 835
Performed 108 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 317 places in 1 ms
Iterating global reduction 3 with 108 rules applied. Total rules applied 1303 place count 544 transition count 912
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 1345 place count 544 transition count 870
Discarding 99 places :
Symmetric choice reduction at 4 with 99 rule applications. Total rules 1444 place count 445 transition count 762
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 4 with 99 rules applied. Total rules applied 1543 place count 445 transition count 762
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1547 place count 441 transition count 756
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1551 place count 441 transition count 756
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1558 place count 441 transition count 756
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1564 place count 441 transition count 750
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1580 place count 425 transition count 730
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 1596 place count 425 transition count 730
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1600 place count 425 transition count 726
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1604 place count 421 transition count 722
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1608 place count 421 transition count 722
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 1610 place count 421 transition count 722
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1614 place count 421 transition count 718
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1616 place count 419 transition count 716
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 1618 place count 419 transition count 716
Performed 70 Post agglomeration using F-continuation condition with reduction of 113 identical transitions.
Deduced a syphon composed of 284 places in 1 ms
Iterating global reduction 7 with 70 rules applied. Total rules applied 1688 place count 419 transition count 1042
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 7 with 121 rules applied. Total rules applied 1809 place count 419 transition count 921
Discarding 122 places :
Symmetric choice reduction at 8 with 122 rule applications. Total rules 1931 place count 297 transition count 598
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 8 with 122 rules applied. Total rules applied 2053 place count 297 transition count 598
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 2065 place count 297 transition count 586
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 2086 place count 276 transition count 545
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 9 with 21 rules applied. Total rules applied 2107 place count 276 transition count 545
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2110 place count 276 transition count 594
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2114 place count 276 transition count 590
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2118 place count 272 transition count 559
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2122 place count 272 transition count 559
Deduced a syphon composed of 148 places in 0 ms
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 10 with 52 rules applied. Total rules applied 2174 place count 272 transition count 507
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2179 place count 267 transition count 502
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 5 rules applied. Total rules applied 2184 place count 267 transition count 502
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2187 place count 267 transition count 562
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2190 place count 264 transition count 547
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2193 place count 264 transition count 547
Deduced a syphon composed of 143 places in 0 ms
Applied a total of 2193 rules in 351 ms. Remains 264 /1519 variables (removed 1255) and now considering 547/1942 (removed 1395) transitions.
[2024-05-21 16:05:28] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-21 16:05:28] [INFO ] Flow matrix only has 491 transitions (discarded 56 similar events)
// Phase 1: matrix 491 rows 264 cols
[2024-05-21 16:05:28] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 16:05:28] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 264/1519 places, 547/1942 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 587 ms. Remains : 264/1519 places, 547/1942 transitions.
Built C files in :
/tmp/ltsmin5344791845351414679
[2024-05-21 16:05:28] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5344791845351414679
Running compilation step : cd /tmp/ltsmin5344791845351414679;'/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/ltsmin5344791845351414679;'/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/ltsmin5344791845351414679;'/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 4 out of 1519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1519/1519 places, 1942/1942 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1518 transition count 1941
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1518 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1517 transition count 1940
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1517 transition count 1940
Applied a total of 4 rules in 150 ms. Remains 1517 /1519 variables (removed 2) and now considering 1940/1942 (removed 2) transitions.
// Phase 1: matrix 1940 rows 1517 cols
[2024-05-21 16:05:32] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 16:05:32] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 16:05:32] [INFO ] Invariant cache hit.
[2024-05-21 16:05:33] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2024-05-21 16:05:33] [INFO ] Invariant cache hit.
[2024-05-21 16:05:33] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1517/1519 places, 1940/1942 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1945 ms. Remains : 1517/1519 places, 1940/1942 transitions.
Built C files in :
/tmp/ltsmin17158433443180431551
[2024-05-21 16:05:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17158433443180431551
Running compilation step : cd /tmp/ltsmin17158433443180431551;'/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/ltsmin17158433443180431551;'/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/ltsmin17158433443180431551;'/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-21 16:05:36] [INFO ] Flatten gal took : 51 ms
[2024-05-21 16:05:37] [INFO ] Flatten gal took : 46 ms
[2024-05-21 16:05:37] [INFO ] Time to serialize gal into /tmp/LTL18310680589070919733.gal : 13 ms
[2024-05-21 16:05:37] [INFO ] Time to serialize properties into /tmp/LTL16141928301525212393.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/LTL18310680589070919733.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9463315990006458383.hoa' '-atoms' '/tmp/LTL16141928301525212393.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...319
Loading property file /tmp/LTL16141928301525212393.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9463315990006458383.hoa
Detected timeout of ITS tools.
[2024-05-21 16:05:52] [INFO ] Flatten gal took : 43 ms
[2024-05-21 16:05:52] [INFO ] Flatten gal took : 40 ms
[2024-05-21 16:05:52] [INFO ] Time to serialize gal into /tmp/LTL1522296761144741156.gal : 7 ms
[2024-05-21 16:05:52] [INFO ] Time to serialize properties into /tmp/LTL13490496033044461193.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1522296761144741156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13490496033044461193.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...276
Read 1 LTL properties
Checking formula 0 : !(((G(("((p1157==0)&&(p2457==1))")||(X(X("((p994==0)||(p207==1))")))))||(G("(p1478==1)"))))
Formula 0 simplified : F(!"((p1157==0)&&(p2457==1))" & XX!"((p994==0)||(p207==1))") & F!"(p1478==1)"
Detected timeout of ITS tools.
[2024-05-21 16:06:07] [INFO ] Flatten gal took : 37 ms
[2024-05-21 16:06:07] [INFO ] Applying decomposition
[2024-05-21 16:06:07] [INFO ] Flatten gal took : 38 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/graph11001770919031598851.txt' '-o' '/tmp/graph11001770919031598851.bin' '-w' '/tmp/graph11001770919031598851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11001770919031598851.bin' '-l' '-1' '-v' '-w' '/tmp/graph11001770919031598851.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:06:07] [INFO ] Decomposing Gal with order
[2024-05-21 16:06:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:06:07] [INFO ] Removed a total of 499 redundant transitions.
[2024-05-21 16:06:07] [INFO ] Flatten gal took : 125 ms
[2024-05-21 16:06:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 28 ms.
[2024-05-21 16:06:07] [INFO ] Time to serialize gal into /tmp/LTL12407294384493613161.gal : 18 ms
[2024-05-21 16:06:07] [INFO ] Time to serialize properties into /tmp/LTL17385801119694186687.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12407294384493613161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17385801119694186687.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...256
Read 1 LTL properties
Checking formula 0 : !(((G(("((i14.i3.i0.u260.p1157==0)&&(i38.i3.i0.u599.p2457==1))")||(X(X("((i0.i0.i2.u229.p994==0)||(i1.i1.i2.u37.p207==1))")))))||(G("(...178
Formula 0 simplified : F(!"((i14.i3.i0.u260.p1157==0)&&(i38.i3.i0.u599.p2457==1))" & XX!"((i0.i0.i2.u229.p994==0)||(i1.i1.i2.u37.p207==1))") & F!"(i24.u355...166
Reverse transition relation is NOT exact ! Due to transitions t26, t189, t219, t272, t303, t381, t452, t501, t668, t697, t749, t780, t784, t860, t984, t117...2206
Computing Next relation with stutter on 89440 deadlock states
8 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
623 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,6.39336,238780,1,0,396906,14085,23055,766061,747,69439,1942513
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-07 finished in 66960 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((X((!p0||X(p1))) U ((X((!p0||X(p1)))&&(!p0||G(p2)))||X(G((!p0||X(p1))))))))'
Support contains 6 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1548 transition count 1980
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1548 transition count 1980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1548 transition count 1979
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 1536 transition count 1966
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 1536 transition count 1966
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 1536 transition count 1964
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 1530 transition count 1958
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 1530 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 1530 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 85 place count 1527 transition count 1954
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 1527 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 1524 transition count 1951
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 1524 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 1521 transition count 1947
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 1521 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 1519 transition count 1945
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 1519 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 1517 transition count 1943
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 1517 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 1515 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 1514 transition count 1938
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 1513 transition count 1937
Applied a total of 116 rules in 602 ms. Remains 1513 /1569 variables (removed 56) and now considering 1937/2001 (removed 64) transitions.
// Phase 1: matrix 1937 rows 1513 cols
[2024-05-21 16:06:15] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 16:06:16] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-21 16:06:16] [INFO ] Invariant cache hit.
[2024-05-21 16:06:17] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
[2024-05-21 16:06:17] [INFO ] Invariant cache hit.
[2024-05-21 16:06:17] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1513/1569 places, 1937/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2582 ms. Remains : 1513/1569 places, 1937/2001 transitions.
Stuttering acceptance computed with spot in 438 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 p2), acceptance={1} source=2 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=3 dest: 6}, { cond=(AND p0 p2 p1), acceptance={1} source=3 dest: 7}, { cond=(AND p2 p1), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=7 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=7 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p0 p2), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p2), acceptance={} source=10 dest: 5}, { cond=p2, acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s79 1)), p2:(OR (EQ s1467 0) (EQ s1463 1)), p1:(OR (EQ s431 0) (EQ s262 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25006 reset in 721 ms.
Product exploration explored 100000 steps with 24980 reset in 739 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2114 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 173 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 78 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 215674 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215674 steps, saw 58849 distinct states, run finished after 3003 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 13 properties.
[2024-05-21 16:06:24] [INFO ] Invariant cache hit.
[2024-05-21 16:06:25] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-21 16:06:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 16:06:27] [INFO ] After 1660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-21 16:06:28] [INFO ] After 3062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 761 ms.
[2024-05-21 16:06:29] [INFO ] After 4517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 10 different solutions.
Finished Parikh walk after 338 steps, including 2 resets, run visited all 2 properties in 5 ms. (steps per millisecond=67 )
Parikh walk visited 13 properties in 27 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) p1)), (F (NOT (AND p2 p1))), (F (NOT p2)), (F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2))), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 16 factoid took 781 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 435 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 409 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Applied a total of 0 rules in 54 ms. Remains 1513 /1513 variables (removed 0) and now considering 1937/1937 (removed 0) transitions.
[2024-05-21 16:06:31] [INFO ] Invariant cache hit.
[2024-05-21 16:06:31] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-21 16:06:31] [INFO ] Invariant cache hit.
[2024-05-21 16:06:32] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
[2024-05-21 16:06:32] [INFO ] Invariant cache hit.
[2024-05-21 16:06:33] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1872 ms. Remains : 1513/1513 places, 1937/1937 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2114 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 163 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-21 16:06:34] [INFO ] Invariant cache hit.
[2024-05-21 16:06:35] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-21 16:06:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 16:06:37] [INFO ] After 1407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-21 16:06:38] [INFO ] After 2467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 571 ms.
[2024-05-21 16:06:38] [INFO ] After 3668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Finished Parikh walk after 397 steps, including 2 resets, run visited all 10 properties in 7 ms. (steps per millisecond=56 )
Parikh walk visited 10 properties in 7 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) p1)), (F (NOT (AND p2 p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2))), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 16 factoid took 748 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 430 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 467 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25016 reset in 629 ms.
Product exploration explored 100000 steps with 25052 reset in 631 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 440 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Graph (trivial) has 1835 edges and 1513 vertex of which 687 / 1513 are part of one of the 62 SCC in 2 ms
Free SCC test removed 625 places
Ensure Unique test removed 726 transitions
Reduce isomorphic transitions removed 726 transitions.
Graph (complete) has 1382 edges and 888 vertex of which 879 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 474 rules applied. Total rules applied 476 place count 879 transition count 1206
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 488 place count 879 transition count 1194
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 488 place count 879 transition count 1207
Deduced a syphon composed of 496 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 510 place count 879 transition count 1207
Discarding 281 places :
Symmetric choice reduction at 2 with 281 rule applications. Total rules 791 place count 598 transition count 918
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 2 with 281 rules applied. Total rules applied 1072 place count 598 transition count 918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1082 place count 588 transition count 906
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1092 place count 588 transition count 906
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1098 place count 588 transition count 900
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1106 place count 580 transition count 892
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1114 place count 580 transition count 892
Performed 113 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 332 places in 1 ms
Iterating global reduction 3 with 113 rules applied. Total rules applied 1227 place count 580 transition count 967
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1270 place count 580 transition count 924
Discarding 107 places :
Symmetric choice reduction at 4 with 107 rule applications. Total rules 1377 place count 473 transition count 807
Deduced a syphon composed of 235 places in 1 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1484 place count 473 transition count 807
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1490 place count 467 transition count 798
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1496 place count 467 transition count 798
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 236 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1503 place count 467 transition count 798
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1509 place count 467 transition count 792
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1524 place count 452 transition count 773
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1539 place count 452 transition count 773
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1545 place count 452 transition count 767
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1549 place count 448 transition count 763
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1553 place count 448 transition count 763
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1556 place count 448 transition count 763
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1561 place count 448 transition count 758
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1564 place count 445 transition count 755
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1567 place count 445 transition count 755
Performed 78 Post agglomeration using F-continuation condition with reduction of 115 identical transitions.
Deduced a syphon composed of 299 places in 0 ms
Iterating global reduction 7 with 78 rules applied. Total rules applied 1645 place count 445 transition count 1120
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 7 with 122 rules applied. Total rules applied 1767 place count 445 transition count 998
Discarding 130 places :
Symmetric choice reduction at 8 with 130 rule applications. Total rules 1897 place count 315 transition count 646
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 8 with 130 rules applied. Total rules applied 2027 place count 315 transition count 646
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 2039 place count 315 transition count 634
Discarding 24 places :
Symmetric choice reduction at 9 with 24 rule applications. Total rules 2063 place count 291 transition count 587
Deduced a syphon composed of 154 places in 0 ms
Iterating global reduction 9 with 24 rules applied. Total rules applied 2087 place count 291 transition count 587
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2090 place count 291 transition count 639
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2093 place count 288 transition count 610
Deduced a syphon composed of 154 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2096 place count 288 transition count 610
Deduced a syphon composed of 154 places in 0 ms
Drop transitions removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 9 with 74 rules applied. Total rules applied 2170 place count 288 transition count 536
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2175 place count 283 transition count 529
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 2180 place count 283 transition count 529
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2183 place count 283 transition count 589
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2186 place count 280 transition count 574
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2189 place count 280 transition count 574
Deduced a syphon composed of 149 places in 0 ms
Applied a total of 2189 rules in 168 ms. Remains 280 /1513 variables (removed 1233) and now considering 574/1937 (removed 1363) transitions.
[2024-05-21 16:06:42] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 16:06:42] [INFO ] Flow matrix only has 514 transitions (discarded 60 similar events)
// Phase 1: matrix 514 rows 280 cols
[2024-05-21 16:06:42] [INFO ] Computed 0 invariants in 4 ms
[2024-05-21 16:06:43] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/1513 places, 574/1937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 ms. Remains : 280/1513 places, 574/1937 transitions.
Built C files in :
/tmp/ltsmin5051851945253224643
[2024-05-21 16:06:43] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5051851945253224643
Running compilation step : cd /tmp/ltsmin5051851945253224643;'/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/ltsmin5051851945253224643;'/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/ltsmin5051851945253224643;'/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 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Applied a total of 0 rules in 51 ms. Remains 1513 /1513 variables (removed 0) and now considering 1937/1937 (removed 0) transitions.
// Phase 1: matrix 1937 rows 1513 cols
[2024-05-21 16:06:46] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 16:06:46] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 16:06:46] [INFO ] Invariant cache hit.
[2024-05-21 16:06:47] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2024-05-21 16:06:47] [INFO ] Invariant cache hit.
[2024-05-21 16:06:48] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2000 ms. Remains : 1513/1513 places, 1937/1937 transitions.
Built C files in :
/tmp/ltsmin3672224019072075245
[2024-05-21 16:06:48] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3672224019072075245
Running compilation step : cd /tmp/ltsmin3672224019072075245;'/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/ltsmin3672224019072075245;'/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/ltsmin3672224019072075245;'/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-21 16:06:51] [INFO ] Flatten gal took : 37 ms
[2024-05-21 16:06:51] [INFO ] Flatten gal took : 33 ms
[2024-05-21 16:06:51] [INFO ] Time to serialize gal into /tmp/LTL6996986719297948391.gal : 7 ms
[2024-05-21 16:06:51] [INFO ] Time to serialize properties into /tmp/LTL13582337359366345471.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/LTL6996986719297948391.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4432373162248500683.hoa' '-atoms' '/tmp/LTL13582337359366345471.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/LTL13582337359366345471.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4432373162248500683.hoa
Detected timeout of ITS tools.
[2024-05-21 16:07:06] [INFO ] Flatten gal took : 34 ms
[2024-05-21 16:07:06] [INFO ] Flatten gal took : 36 ms
[2024-05-21 16:07:06] [INFO ] Time to serialize gal into /tmp/LTL12566899837305054430.gal : 6 ms
[2024-05-21 16:07:06] [INFO ] Time to serialize properties into /tmp/LTL5186880585322728028.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12566899837305054430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5186880585322728028.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...276
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((p216==0)||(p149==1))"))||(X("((p765==0)||(p529==1))"))))U((X(G((!("((p216==0)||(p149==1))"))||(X("((p765==0)||(p529==1))...300
Formula 0 simplified : X(X("((p216==0)||(p149==1))" & X!"((p765==0)||(p529==1))") R (XF("((p216==0)||(p149==1))" & X!"((p765==0)||(p529==1))") & (X("((p216...265
Detected timeout of ITS tools.
[2024-05-21 16:07:21] [INFO ] Flatten gal took : 31 ms
[2024-05-21 16:07:21] [INFO ] Applying decomposition
[2024-05-21 16:07:21] [INFO ] Flatten gal took : 32 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/graph9990484680931815812.txt' '-o' '/tmp/graph9990484680931815812.bin' '-w' '/tmp/graph9990484680931815812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9990484680931815812.bin' '-l' '-1' '-v' '-w' '/tmp/graph9990484680931815812.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:07:21] [INFO ] Decomposing Gal with order
[2024-05-21 16:07:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:07:22] [INFO ] Removed a total of 502 redundant transitions.
[2024-05-21 16:07:22] [INFO ] Flatten gal took : 69 ms
[2024-05-21 16:07:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 20 ms.
[2024-05-21 16:07:22] [INFO ] Time to serialize gal into /tmp/LTL3747918289273389506.gal : 14 ms
[2024-05-21 16:07:22] [INFO ] Time to serialize properties into /tmp/LTL16314551843613174223.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3747918289273389506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16314551843613174223.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...255
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((i1.i1.i1.u47.p216==0)||(i3.u30.p149==1))"))||(X("((i12.u163.p765==0)||(i6.i0.i1.u102.p529==1))"))))U((X(G((!("((i1.i1.i1...479
Formula 0 simplified : X(X("((i1.i1.i1.u47.p216==0)||(i3.u30.p149==1))" & X!"((i12.u163.p765==0)||(i6.i0.i1.u102.p529==1))") R (XF("((i1.i1.i1.u47.p216==0)...444
Reverse transition relation is NOT exact ! Due to transitions t26, t189, t272, t332, t381, t452, t697, t749, t780, t860, t984, t1148, t1177, t1229, t1260, ...2216
Computing Next relation with stutter on 89440 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14169673049496152946
[2024-05-21 16:07:37] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14169673049496152946
Running compilation step : cd /tmp/ltsmin14169673049496152946;'/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/ltsmin14169673049496152946;'/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/ltsmin14169673049496152946;'/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)
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-13 finished in 84951 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(X(G(p0))))'
Support contains 3 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1545 transition count 1977
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1545 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1545 transition count 1976
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 1531 transition count 1960
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 1531 transition count 1960
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 1531 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 1526 transition count 1952
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 1526 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 1526 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 1523 transition count 1948
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 1523 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 1520 transition count 1945
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 1520 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 1517 transition count 1941
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 1517 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 1515 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1511 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 1510 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 1509 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 1509 transition count 1931
Applied a total of 125 rules in 617 ms. Remains 1509 /1569 variables (removed 60) and now considering 1931/2001 (removed 70) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2024-05-21 16:07:40] [INFO ] Computed 4 invariants in 20 ms
[2024-05-21 16:07:41] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-21 16:07:41] [INFO ] Invariant cache hit.
[2024-05-21 16:07:42] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2024-05-21 16:07:42] [INFO ] Invariant cache hit.
[2024-05-21 16:07:42] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1569 places, 1931/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2574 ms. Remains : 1509/1569 places, 1931/2001 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s28 0) (EQ s270 1) (EQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 769 reset in 146 ms.
Entered a terminal (fully accepting) state of product in 18222 steps with 142 reset in 25 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-14 finished in 2900 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(F(p0))&&F((G(p1)||X(p2)))))'
Support contains 5 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1546 transition count 1978
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1546 transition count 1978
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1546 transition count 1977
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 1533 transition count 1963
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 1533 transition count 1963
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 76 place count 1533 transition count 1960
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 1528 transition count 1955
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 1528 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 1528 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 1525 transition count 1951
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 1525 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 1522 transition count 1948
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 1522 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 1519 transition count 1944
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 1519 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 1517 transition count 1942
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 1517 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 1515 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 1515 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 1512 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 1511 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 1511 transition count 1934
Applied a total of 121 rules in 650 ms. Remains 1511 /1569 variables (removed 58) and now considering 1934/2001 (removed 67) transitions.
// Phase 1: matrix 1934 rows 1511 cols
[2024-05-21 16:07:43] [INFO ] Computed 4 invariants in 12 ms
[2024-05-21 16:07:44] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 16:07:44] [INFO ] Invariant cache hit.
[2024-05-21 16:07:44] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2024-05-21 16:07:44] [INFO ] Invariant cache hit.
[2024-05-21 16:07:45] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1569 places, 1934/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2471 ms. Remains : 1511/1569 places, 1934/2001 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s891 0) (EQ s564 1)), p1:(OR (EQ s121 0) (EQ s615 1)), p2:(EQ s651 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-15 finished in 2669 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((X((!p0||X(p1))) U ((X((!p0||X(p1)))&&(!p0||G(p2)))||X(G((!p0||X(p1))))))))'
[2024-05-21 16:07:45] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6268241514599053080
[2024-05-21 16:07:45] [INFO ] Too many transitions (2001) to apply POR reductions. Disabling POR matrices.
[2024-05-21 16:07:45] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6268241514599053080
Running compilation step : cd /tmp/ltsmin6268241514599053080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
[2024-05-21 16:07:45] [INFO ] Applying decomposition
[2024-05-21 16:07:46] [INFO ] Flatten gal took : 30 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/graph7695050271830946843.txt' '-o' '/tmp/graph7695050271830946843.bin' '-w' '/tmp/graph7695050271830946843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7695050271830946843.bin' '-l' '-1' '-v' '-w' '/tmp/graph7695050271830946843.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:07:46] [INFO ] Decomposing Gal with order
[2024-05-21 16:07:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:07:46] [INFO ] Removed a total of 528 redundant transitions.
[2024-05-21 16:07:46] [INFO ] Flatten gal took : 64 ms
[2024-05-21 16:07:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 17 ms.
[2024-05-21 16:07:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality16371591452936755228.gal : 16 ms
[2024-05-21 16:07:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality7727026778910034760.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16371591452936755228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7727026778910034760.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...277
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((i5.i0.i2.u49.p216==0)||(i4.u34.p149==1))"))||(X("((i13.u182.p765==0)||(i8.u109.p529==1))"))))U(((X((!("((i5.i0.i2.u49.p2...461
Formula 0 simplified : X(X("((i5.i0.i2.u49.p216==0)||(i4.u34.p149==1))" & X!"((i13.u182.p765==0)||(i8.u109.p529==1))") R (XF("((i5.i0.i2.u49.p216==0)||(i4....426
Compilation finished in 3559 ms.
Running link step : cd /tmp/ltsmin6268241514599053080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6268241514599053080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((!(LTLAPp0==true)||X((LTLAPp1==true)))) U ((X((!(LTLAPp0==true)||X((LTLAPp1==true))))&&(!(LTLAPp0==true)||[]((LTLAPp2==true))))||X([]((!(LTLAPp0==true)||X((LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t26, t189, t219, t272, t286, t291, t303, t332, t452, t501, t697, t749, t780, t860, t984, t117...2317
Computing Next relation with stutter on 93832 deadlock states
51 unique states visited
8 strongly connected components in search stack
96 transitions explored
51 items max in DFS search stack
2477 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,24.9497,897216,1,0,1.90597e+06,8336,23782,3.41412e+06,649,51300,3694096
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 260639 ms.
BK_STOP 1716307732904
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="CloudReconfiguration-PT-316"
export BK_EXAMINATION="LTLCardinality"
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 CloudReconfiguration-PT-316, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624207900147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-316.tgz
mv CloudReconfiguration-PT-316 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;