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.r087-tall-171620522100392.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 CloudDeployment-PT-7b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620522100392
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 20M 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 CloudDeployment-PT-7b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716263520018

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=CloudDeployment-PT-7b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 03:52:01] [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 03:52:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:52:02] [INFO ] Load time of PNML (sax parser for PT used): 1005 ms
[2024-05-21 03:52:02] [INFO ] Transformed 2271 places.
[2024-05-21 03:52:02] [INFO ] Transformed 19752 transitions.
[2024-05-21 03:52:02] [INFO ] Found NUPN structural information;
[2024-05-21 03:52:02] [INFO ] Parsed PT model containing 2271 places and 19752 transitions and 389666 arcs in 1240 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 1 formulas.
FORMULA CloudDeployment-PT-7b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-7b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 2271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2271/2271 places, 19752/19752 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 2263 transition count 19752
Discarding 649 places :
Symmetric choice reduction at 1 with 649 rule applications. Total rules 657 place count 1614 transition count 2734
Iterating global reduction 1 with 649 rules applied. Total rules applied 1306 place count 1614 transition count 2734
Discarding 253 places :
Symmetric choice reduction at 1 with 253 rule applications. Total rules 1559 place count 1361 transition count 2481
Iterating global reduction 1 with 253 rules applied. Total rules applied 1812 place count 1361 transition count 2481
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 1848 place count 1361 transition count 2445
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1873 place count 1336 transition count 2420
Iterating global reduction 2 with 25 rules applied. Total rules applied 1898 place count 1336 transition count 2420
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1901 place count 1333 transition count 2417
Iterating global reduction 2 with 3 rules applied. Total rules applied 1904 place count 1333 transition count 2417
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1906 place count 1331 transition count 2415
Iterating global reduction 2 with 2 rules applied. Total rules applied 1908 place count 1331 transition count 2415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1909 place count 1330 transition count 2414
Iterating global reduction 2 with 1 rules applied. Total rules applied 1910 place count 1330 transition count 2414
Applied a total of 1910 rules in 3836 ms. Remains 1330 /2271 variables (removed 941) and now considering 2414/19752 (removed 17338) transitions.
// Phase 1: matrix 2414 rows 1330 cols
[2024-05-21 03:52:07] [INFO ] Computed 21 invariants in 33 ms
[2024-05-21 03:52:07] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-05-21 03:52:07] [INFO ] Invariant cache hit.
[2024-05-21 03:52:09] [INFO ] Implicit Places using invariants and state equation in 1654 ms returned [13, 23, 190, 202, 368, 376, 547, 556, 722, 732, 899, 907, 1073, 1083]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 2324 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1316/2271 places, 2414/19752 transitions.
Applied a total of 0 rules in 32 ms. Remains 1316 /1316 variables (removed 0) and now considering 2414/2414 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6193 ms. Remains : 1316/2271 places, 2414/19752 transitions.
Support contains 42 out of 1316 places after structural reductions.
[2024-05-21 03:52:09] [INFO ] Flatten gal took : 248 ms
[2024-05-21 03:52:09] [INFO ] Flatten gal took : 145 ms
[2024-05-21 03:52:10] [INFO ] Input system was already deterministic with 2414 transitions.
Support contains 40 out of 1316 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 21) seen :10
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2414 rows 1316 cols
[2024-05-21 03:52:10] [INFO ] Computed 7 invariants in 12 ms
[2024-05-21 03:52:11] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-21 03:52:11] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-21 03:52:13] [INFO ] After 1424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-21 03:52:14] [INFO ] After 2539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 619 ms.
[2024-05-21 03:52:15] [INFO ] After 3783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 8 properties in 177 ms.
Support contains 4 out of 1316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Graph (trivial) has 1364 edges and 1316 vertex of which 498 / 1316 are part of one of the 56 SCC in 5 ms
Free SCC test removed 442 places
Drop transitions removed 577 transitions
Reduce isomorphic transitions removed 577 transitions.
Graph (complete) has 3613 edges and 874 vertex of which 865 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 374 rules applied. Total rules applied 376 place count 865 transition count 1463
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 736 place count 505 transition count 1463
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 736 place count 505 transition count 1390
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 882 place count 432 transition count 1390
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 898 place count 416 transition count 1374
Iterating global reduction 2 with 16 rules applied. Total rules applied 914 place count 416 transition count 1374
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 914 place count 416 transition count 1362
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 938 place count 404 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 939 place count 403 transition count 1361
Iterating global reduction 2 with 1 rules applied. Total rules applied 940 place count 403 transition count 1361
Performed 116 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 116 places in 9 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 1172 place count 287 transition count 1241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1173 place count 287 transition count 1240
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -329
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1257 place count 245 transition count 1569
Drop transitions removed 21 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 1313 place count 245 transition count 1513
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1327 place count 238 transition count 1597
Drop transitions removed 288 transitions
Redundant transition composition rules discarded 288 transitions
Iterating global reduction 4 with 288 rules applied. Total rules applied 1615 place count 238 transition count 1309
Free-agglomeration rule applied 71 times with reduction of 41 identical transitions.
Iterating global reduction 4 with 71 rules applied. Total rules applied 1686 place count 238 transition count 1197
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 186 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 284 transitions.
Graph (complete) has 1576 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 356 rules applied. Total rules applied 2042 place count 166 transition count 913
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2043 place count 166 transition count 912
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2050 place count 159 transition count 856
Iterating global reduction 6 with 7 rules applied. Total rules applied 2057 place count 159 transition count 856
Drop transitions removed 147 transitions
Redundant transition composition rules discarded 147 transitions
Iterating global reduction 6 with 147 rules applied. Total rules applied 2204 place count 159 transition count 709
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2205 place count 158 transition count 708
Applied a total of 2205 rules in 491 ms. Remains 158 /1316 variables (removed 1158) and now considering 708/2414 (removed 1706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 158/1316 places, 708/2414 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :1
Finished Best-First random walk after 7373 steps, including 2 resets, run visited all 1 properties in 10 ms. (steps per millisecond=737 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 197 stabilizing places and 869 stable transitions
Graph (complete) has 4378 edges and 1316 vertex of which 1307 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(p1)&&(p2 U (p3||G(p2))))))'
Support contains 6 out of 1316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1300 transition count 2398
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1300 transition count 2398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1300 transition count 2397
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 1294 transition count 2391
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 1294 transition count 2391
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 1294 transition count 2386
Applied a total of 50 rules in 112 ms. Remains 1294 /1316 variables (removed 22) and now considering 2386/2414 (removed 28) transitions.
// Phase 1: matrix 2386 rows 1294 cols
[2024-05-21 03:52:16] [INFO ] Computed 7 invariants in 13 ms
[2024-05-21 03:52:16] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-21 03:52:16] [INFO ] Invariant cache hit.
[2024-05-21 03:52:18] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2024-05-21 03:52:18] [INFO ] Invariant cache hit.
[2024-05-21 03:52:19] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1294/1316 places, 2386/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2775 ms. Remains : 1294/1316 places, 2386/2414 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 245 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s26 1), p3:(AND (NEQ s511 1) (NOT (OR (EQ s460 0) (EQ s933 1)))), p2:(NEQ s511 1), p1:(OR (EQ s734 0) (EQ s727 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2145 steps with 16 reset in 39 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-00 finished in 3126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Graph (trivial) has 1366 edges and 1316 vertex of which 498 / 1316 are part of one of the 56 SCC in 3 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 3788 edges and 874 vertex of which 865 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 864 transition count 1554
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 706 place count 512 transition count 1554
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 706 place count 512 transition count 1488
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 838 place count 446 transition count 1488
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 849 place count 435 transition count 1477
Iterating global reduction 2 with 11 rules applied. Total rules applied 860 place count 435 transition count 1477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 861 place count 435 transition count 1476
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 861 place count 435 transition count 1471
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 871 place count 430 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 872 place count 429 transition count 1470
Iterating global reduction 3 with 1 rules applied. Total rules applied 873 place count 429 transition count 1470
Performed 137 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 1147 place count 292 transition count 1329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1148 place count 292 transition count 1328
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1204 place count 264 transition count 1398
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1211 place count 264 transition count 1391
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1225 place count 257 transition count 1475
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 1282 place count 257 transition count 1418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1283 place count 256 transition count 1417
Applied a total of 1283 rules in 287 ms. Remains 256 /1316 variables (removed 1060) and now considering 1417/2414 (removed 997) transitions.
[2024-05-21 03:52:19] [INFO ] Flow matrix only has 1117 transitions (discarded 300 similar events)
// Phase 1: matrix 1117 rows 256 cols
[2024-05-21 03:52:19] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 03:52:19] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-21 03:52:19] [INFO ] Flow matrix only has 1117 transitions (discarded 300 similar events)
[2024-05-21 03:52:19] [INFO ] Invariant cache hit.
[2024-05-21 03:52:20] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 03:52:20] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-05-21 03:52:21] [INFO ] Redundant transitions in 1092 ms returned []
[2024-05-21 03:52:21] [INFO ] Flow matrix only has 1117 transitions (discarded 300 similar events)
[2024-05-21 03:52:21] [INFO ] Invariant cache hit.
[2024-05-21 03:52:21] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/1316 places, 1417/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2499 ms. Remains : 256/1316 places, 1417/2414 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-02 finished in 2557 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' '!(((p0&&(p1 U G((p2 U X(X(X(p3))))))) U X(G(p4))))'
Support contains 10 out of 1316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1301 transition count 2399
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1301 transition count 2399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1301 transition count 2398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1299 transition count 2396
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1299 transition count 2396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 1299 transition count 2394
Applied a total of 37 rules in 106 ms. Remains 1299 /1316 variables (removed 17) and now considering 2394/2414 (removed 20) transitions.
// Phase 1: matrix 2394 rows 1299 cols
[2024-05-21 03:52:22] [INFO ] Computed 7 invariants in 19 ms
[2024-05-21 03:52:22] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-21 03:52:22] [INFO ] Invariant cache hit.
[2024-05-21 03:52:23] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
[2024-05-21 03:52:23] [INFO ] Invariant cache hit.
[2024-05-21 03:52:24] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1299/1316 places, 2394/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2510 ms. Remains : 1299/1316 places, 2394/2414 transitions.
Stuttering acceptance computed with spot in 1937 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p4, acceptance={} source=0 dest: 0}, { cond=(NOT p4), acceptance={} source=0 dest: 8}], [{ cond=(NOT p4), acceptance={} source=1 dest: 9}, { cond=p4, acceptance={} source=1 dest: 10}], [{ cond=(AND (NOT p2) p4), acceptance={} source=2 dest: 1}, { cond=p4, acceptance={} source=2 dest: 2}, { cond=(AND p2 p4), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=2 dest: 12}, { cond=(NOT p4), acceptance={} source=2 dest: 13}, { cond=(AND p2 (NOT p4)), acceptance={} source=2 dest: 14}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p4), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p4)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=4 dest: 15}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=4 dest: 16}, { cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=4 dest: 17}, { cond=(AND (NOT p1) p4), acceptance={} source=4 dest: 18}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=4 dest: 19}, { cond=(AND p1 (NOT p4)), acceptance={} source=4 dest: 20}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=4 dest: 21}, { cond=(AND p1 p4), acceptance={} source=4 dest: 22}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=4 dest: 23}, { cond=(AND p2 (NOT p1) p4), acceptance={} source=4 dest: 24}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=4 dest: 25}, { cond=(AND p2 p1 p4), acceptance={} source=4 dest: 26}], [{ cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p4), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=5 dest: 4}, { cond=(AND p1 p4), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) p4), acceptance={} source=5 dest: 6}, { cond=(AND p2 p1 p4), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=5 dest: 13}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=5 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=5 dest: 27}, { cond=(AND p1 (NOT p4)), acceptance={} source=5 dest: 28}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=5 dest: 29}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=6 dest: 15}, { cond=(AND (NOT p2) p4), acceptance={} source=6 dest: 17}, { cond=(AND p2 (NOT p4)), acceptance={} source=6 dest: 23}, { cond=(AND p2 p4), acceptance={} source=6 dest: 24}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=7 dest: 15}, { cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=7 dest: 17}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=7 dest: 19}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=7 dest: 21}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=7 dest: 23}, { cond=(AND p2 (NOT p1) p4), acceptance={} source=7 dest: 24}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=7 dest: 25}, { cond=(AND p2 p1 p4), acceptance={} source=7 dest: 26}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={} source=9 dest: 11}], [{ cond=(NOT p4), acceptance={} source=10 dest: 11}, { cond=p4, acceptance={} source=10 dest: 30}], [{ cond=(NOT p3), acceptance={} source=11 dest: 8}], [{ cond=true, acceptance={} source=12 dest: 9}], [{ cond=(NOT p2), acceptance={} source=13 dest: 12}, { cond=true, acceptance={} source=13 dest: 13}, { cond=p2, acceptance={} source=13 dest: 14}], [{ cond=(NOT p2), acceptance={} source=14 dest: 15}, { cond=p2, acceptance={} source=14 dest: 23}], [{ cond=true, acceptance={} source=15 dest: 31}], [{ cond=(NOT p2), acceptance={} source=16 dest: 32}, { cond=true, acceptance={} source=16 dest: 33}, { cond=p2, acceptance={} source=16 dest: 34}], [{ cond=(NOT p4), acceptance={} source=17 dest: 31}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=18 dest: 32}, { cond=(NOT p4), acceptance={} source=18 dest: 33}, { cond=(AND p2 (NOT p4)), acceptance={} source=18 dest: 34}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=19 dest: 35}, { cond=(NOT p1), acceptance={} source=19 dest: 36}, { cond=(AND (NOT p2) p1), acceptance={0} source=19 dest: 37}, { cond=p1, acceptance={} source=19 dest: 38}, { cond=(AND p2 (NOT p1)), acceptance={} source=19 dest: 39}, { cond=(AND p2 p1), acceptance={0} source=19 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=20 dest: 32}, { cond=(NOT p1), acceptance={} source=20 dest: 33}, { cond=(AND p2 (NOT p1)), acceptance={} source=20 dest: 34}, { cond=(AND (NOT p2) p1), acceptance={0} source=20 dest: 41}, { cond=p1, acceptance={} source=20 dest: 42}, { cond=(AND p2 p1), acceptance={0} source=20 dest: 43}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=21 dest: 35}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=21 dest: 36}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=21 dest: 37}, { cond=(AND p1 (NOT p4)), acceptance={} source=21 dest: 38}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=21 dest: 39}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=21 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=22 dest: 32}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=22 dest: 33}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=22 dest: 34}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=22 dest: 41}, { cond=(AND p1 (NOT p4)), acceptance={} source=22 dest: 42}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=22 dest: 43}], [{ cond=(NOT p2), acceptance={} source=23 dest: 35}, { cond=p2, acceptance={} source=23 dest: 39}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=24 dest: 35}, { cond=(AND p2 (NOT p4)), acceptance={} source=24 dest: 39}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=25 dest: 35}, { cond=(AND (NOT p2) p1), acceptance={0} source=25 dest: 37}, { cond=(AND p2 (NOT p1)), acceptance={} source=25 dest: 39}, { cond=(AND p2 p1), acceptance={0} source=25 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=26 dest: 35}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=26 dest: 37}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=26 dest: 39}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=26 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=27 dest: 15}, { cond=(NOT p1), acceptance={} source=27 dest: 16}, { cond=(AND (NOT p2) p1), acceptance={0} source=27 dest: 19}, { cond=p1, acceptance={} source=27 dest: 20}, { cond=(AND p2 (NOT p1)), acceptance={} source=27 dest: 23}, { cond=(AND p2 p1), acceptance={0} source=27 dest: 25}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=28 dest: 12}, { cond=(NOT p1), acceptance={} source=28 dest: 13}, { cond=(AND p2 (NOT p1)), acceptance={} source=28 dest: 14}, { cond=(AND (NOT p2) p1), acceptance={0} source=28 dest: 27}, { cond=p1, acceptance={} source=28 dest: 28}, { cond=(AND p2 p1), acceptance={0} source=28 dest: 29}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=29 dest: 15}, { cond=(AND (NOT p2) p1), acceptance={0} source=29 dest: 19}, { cond=(AND p2 (NOT p1)), acceptance={} source=29 dest: 23}, { cond=(AND p2 p1), acceptance={0} source=29 dest: 25}], [{ cond=(AND p4 (NOT p3)), acceptance={} source=30 dest: 0}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=30 dest: 8}], [{ cond=(NOT p3), acceptance={} source=31 dest: 11}], [{ cond=(NOT p3), acceptance={} source=32 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=33 dest: 12}, { cond=(NOT p3), acceptance={} source=33 dest: 13}, { cond=(AND p2 (NOT p3)), acceptance={} source=33 dest: 14}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=34 dest: 15}, { cond=(AND p2 (NOT p3)), acceptance={} source=34 dest: 23}], [{ cond=(NOT p3), acceptance={} source=35 dest: 31}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=36 dest: 32}, { cond=(NOT p3), acceptance={} source=36 dest: 33}, { cond=(AND p2 (NOT p3)), acceptance={} source=36 dest: 34}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=37 dest: 35}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=37 dest: 36}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=37 dest: 37}, { cond=(AND p1 (NOT p3)), acceptance={} source=37 dest: 38}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=37 dest: 39}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=37 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=38 dest: 32}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=38 dest: 33}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=38 dest: 34}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=38 dest: 41}, { cond=(AND p1 (NOT p3)), acceptance={} source=38 dest: 42}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=38 dest: 43}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=39 dest: 35}, { cond=(AND p2 (NOT p3)), acceptance={0} source=39 dest: 39}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=40 dest: 35}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=40 dest: 37}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=40 dest: 39}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=40 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=41 dest: 15}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=41 dest: 16}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=41 dest: 19}, { cond=(AND p1 (NOT p3)), acceptance={} source=41 dest: 20}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=41 dest: 23}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=41 dest: 25}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=42 dest: 12}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=42 dest: 13}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=42 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=42 dest: 27}, { cond=(AND p1 (NOT p3)), acceptance={} source=42 dest: 28}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=42 dest: 29}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=43 dest: 15}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=43 dest: 19}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=43 dest: 23}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=43 dest: 25}]], initial=3, aps=[p4:(OR (EQ s914 0) (EQ s1225 1)), p2:(OR (EQ s26 0) (EQ s1118 1)), p0:(OR (EQ s1086 0) (EQ s266 1)), p1:(OR (EQ s188 0) (EQ s1046 1)), p3:(OR (EQ s284 0) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22210 reset in 746 ms.
Product exploration explored 100000 steps with 22270 reset in 737 ms.
Computed a total of 193 stabilizing places and 865 stable transitions
Graph (complete) has 4343 edges and 1299 vertex of which 1290 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.11 ms
Computed a total of 193 stabilizing places and 865 stable transitions
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X (NOT (AND p0 p2 (NOT p1)))), (X p4), (X (AND p2 p1 p4)), (X (NOT (AND p0 (NOT p4)))), (X (AND p1 p4)), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2 p1)), (X (AND p0 p4)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p2) p1 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1) p4))), (X (NOT (AND p2 (NOT p1) p4))), (X p0), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND p1 (NOT p4)))), (X (AND p0 p1)), (X (NOT (AND p2 p1 (NOT p4)))), (X (AND p2 p4)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND (NOT p2) p1 p4))), (X (NOT (AND p2 (NOT p1) (NOT p4)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p1)), (X (X p4)), (X (X (AND p2 p1 p4))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (AND p1 p4))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND p0 (NOT p2) p1)))), true, (X (X (AND p0 p2 p1))), (X (X (AND p0 p4))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) p1 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p1) p4)))), (X (X (NOT (AND p2 (NOT p1) p4)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p0 p1))), (X (X p2)), (X (X (NOT (AND p2 p1 (NOT p4))))), (X (X (AND p2 p4))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND (NOT p2) p1 p4)))), (X (X (NOT (AND p2 (NOT p1) (NOT p4))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 60 factoid took 4141 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1812 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 43) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2024-05-21 03:52:34] [INFO ] Invariant cache hit.
[2024-05-21 03:52:34] [INFO ] After 691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2024-05-21 03:52:35] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-21 03:52:38] [INFO ] After 2392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2024-05-21 03:52:41] [INFO ] After 5202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 1597 ms.
[2024-05-21 03:52:42] [INFO ] After 7936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Fused 26 Parikh solutions to 23 different solutions.
Parikh walk visited 23 properties in 364 ms.
Support contains 6 out of 1299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1299/1299 places, 2394/2394 transitions.
Graph (trivial) has 1341 edges and 1299 vertex of which 497 / 1299 are part of one of the 56 SCC in 2 ms
Free SCC test removed 441 places
Drop transitions removed 576 transitions
Reduce isomorphic transitions removed 576 transitions.
Graph (complete) has 3575 edges and 858 vertex of which 849 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 363 rules applied. Total rules applied 365 place count 849 transition count 1455
Reduce places removed 349 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 350 rules applied. Total rules applied 715 place count 500 transition count 1454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 499 transition count 1454
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 716 place count 499 transition count 1380
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 864 place count 425 transition count 1380
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 873 place count 416 transition count 1371
Iterating global reduction 3 with 9 rules applied. Total rules applied 882 place count 416 transition count 1371
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 882 place count 416 transition count 1363
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 898 place count 408 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 899 place count 407 transition count 1362
Iterating global reduction 3 with 1 rules applied. Total rules applied 900 place count 407 transition count 1362
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 1128 place count 293 transition count 1248
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -329
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1212 place count 251 transition count 1577
Drop transitions removed 21 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 1268 place count 251 transition count 1521
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1282 place count 244 transition count 1605
Drop transitions removed 287 transitions
Redundant transition composition rules discarded 287 transitions
Iterating global reduction 4 with 287 rules applied. Total rules applied 1569 place count 244 transition count 1318
Free-agglomeration rule applied 70 times with reduction of 35 identical transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1639 place count 244 transition count 1213
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 180 transitions
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 271 transitions.
Graph (complete) has 1611 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 342 rules applied. Total rules applied 1981 place count 173 transition count 942
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1982 place count 173 transition count 941
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1988 place count 167 transition count 893
Iterating global reduction 6 with 6 rules applied. Total rules applied 1994 place count 167 transition count 893
Drop transitions removed 147 transitions
Redundant transition composition rules discarded 147 transitions
Iterating global reduction 6 with 147 rules applied. Total rules applied 2141 place count 167 transition count 746
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2142 place count 166 transition count 745
Applied a total of 2142 rules in 203 ms. Remains 166 /1299 variables (removed 1133) and now considering 745/2394 (removed 1649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 166/1299 places, 745/2394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 715702 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 715702 steps, saw 98377 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 03:52:46] [INFO ] Flow matrix only has 339 transitions (discarded 406 similar events)
// Phase 1: matrix 339 rows 166 cols
[2024-05-21 03:52:46] [INFO ] Computed 27 invariants in 1 ms
[2024-05-21 03:52:46] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:52:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-21 03:52:46] [INFO ] [Nat]Absence check using 7 positive and 20 generalized place invariants in 6 ms returned sat
[2024-05-21 03:52:46] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 03:52:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:52:47] [INFO ] After 42ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 03:52:47] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-21 03:52:47] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 745/745 transitions.
Applied a total of 0 rules in 14 ms. Remains 166 /166 variables (removed 0) and now considering 745/745 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 166/166 places, 745/745 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 745/745 transitions.
Applied a total of 0 rules in 12 ms. Remains 166 /166 variables (removed 0) and now considering 745/745 (removed 0) transitions.
[2024-05-21 03:52:47] [INFO ] Flow matrix only has 339 transitions (discarded 406 similar events)
[2024-05-21 03:52:47] [INFO ] Invariant cache hit.
[2024-05-21 03:52:47] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 03:52:47] [INFO ] Flow matrix only has 339 transitions (discarded 406 similar events)
[2024-05-21 03:52:47] [INFO ] Invariant cache hit.
[2024-05-21 03:52:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:52:47] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-21 03:52:47] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-21 03:52:47] [INFO ] Flow matrix only has 339 transitions (discarded 406 similar events)
[2024-05-21 03:52:47] [INFO ] Invariant cache hit.
[2024-05-21 03:52:47] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 757 ms. Remains : 166/166 places, 745/745 transitions.
Graph (trivial) has 165 edges and 166 vertex of which 48 / 166 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 67 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 473 transitions.
Graph (complete) has 408 edges and 124 vertex of which 113 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 113 transition count 247
Reduce places removed 25 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 1 with 27 rules applied. Total rules applied 54 place count 88 transition count 245
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 87 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 86 transition count 244
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 57 place count 86 transition count 231
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 83 place count 73 transition count 231
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 89 place count 67 transition count 225
Iterating global reduction 4 with 6 rules applied. Total rules applied 95 place count 67 transition count 225
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 101 place count 61 transition count 183
Iterating global reduction 4 with 6 rules applied. Total rules applied 107 place count 61 transition count 183
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 4 with 54 rules applied. Total rules applied 161 place count 61 transition count 129
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 181 place count 51 transition count 119
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 196 place count 51 transition count 104
Performed 8 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 212 place count 43 transition count 147
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 268 place count 43 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 283 place count 33 transition count 86
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 315 place count 33 transition count 54
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 323 place count 33 transition count 46
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 325 place count 33 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 327 place count 31 transition count 44
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 335 place count 31 transition count 44
Applied a total of 335 rules in 15 ms. Remains 31 /166 variables (removed 135) and now considering 44/745 (removed 701) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 44 rows 31 cols
[2024-05-21 03:52:47] [INFO ] Computed 12 invariants in 0 ms
[2024-05-21 03:52:47] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:52:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-21 03:52:47] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 03:52:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-21 03:52:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-21 03:52:48] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 03:52:48] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X (NOT (AND p0 p2 (NOT p1)))), (X p4), (X (AND p2 p1 p4)), (X (NOT (AND p0 (NOT p4)))), (X (AND p1 p4)), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2 p1)), (X (AND p0 p4)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p2) p1 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1) p4))), (X (NOT (AND p2 (NOT p1) p4))), (X p0), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND p1 (NOT p4)))), (X (AND p0 p1)), (X (NOT (AND p2 p1 (NOT p4)))), (X (AND p2 p4)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND (NOT p2) p1 p4))), (X (NOT (AND p2 (NOT p1) (NOT p4)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p1)), (X (X p4)), (X (X (AND p2 p1 p4))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (AND p1 p4))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND p0 (NOT p2) p1)))), true, (X (X (AND p0 p2 p1))), (X (X (AND p0 p4))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) p1 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p1) p4)))), (X (X (NOT (AND p2 (NOT p1) p4)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p0 p1))), (X (X p2)), (X (X (NOT (AND p2 p1 (NOT p4))))), (X (X (AND p2 p4))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND (NOT p2) p1 p4)))), (X (X (NOT (AND p2 (NOT p1) (NOT p4))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p2 (NOT p4))), (F (NOT (AND p1 p2 p4))), (F (AND (NOT p2) (NOT p4))), (F (AND p1 p2 (NOT p4))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) p2 p4)), (F (NOT p0)), (F (NOT p4)), (F (NOT p1)), (F (NOT (AND p2 p4))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p2) p4)), (F (AND p1 (NOT p3))), (F (AND (NOT p1) p2 (NOT p4))), (F (NOT (AND p1 p4))), (F (AND p1 (NOT p2) p4)), (F (AND p1 p2 (NOT p3))), (F (NOT (AND p0 p4))), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p4))), (F (AND (NOT p1) (NOT p4))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p4))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p4) (NOT p3))), (F (AND p1 (NOT p4))), (F (AND p1 (NOT p2) (NOT p4))), (F (AND (NOT p1) p4)), (F (AND p1 (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2) p4)), (F (NOT (AND p0 p1))), (F (AND p4 (NOT p3))), (F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 60 factoid took 7692 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1960 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 1830 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 10 out of 1299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1299/1299 places, 2394/2394 transitions.
Applied a total of 0 rules in 35 ms. Remains 1299 /1299 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
// Phase 1: matrix 2394 rows 1299 cols
[2024-05-21 03:52:59] [INFO ] Computed 7 invariants in 15 ms
[2024-05-21 03:52:59] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-21 03:52:59] [INFO ] Invariant cache hit.
[2024-05-21 03:53:01] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
[2024-05-21 03:53:01] [INFO ] Invariant cache hit.
[2024-05-21 03:53:02] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2571 ms. Remains : 1299/1299 places, 2394/2394 transitions.
Computed a total of 193 stabilizing places and 865 stable transitions
Graph (complete) has 4343 edges and 1299 vertex of which 1290 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 193 stabilizing places and 865 stable transitions
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X p4), (X (NOT (AND p0 (NOT p4)))), (X (AND p1 p4)), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p4))), (X (NOT (AND p1 p2 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p4))), (X (AND p0 p4)), (X (NOT (AND (NOT p1) p2 p4))), (X (NOT (AND (NOT p2) (NOT p4)))), (X p0), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p4)))), (X (AND p0 p1)), (X (AND p1 p2 p4)), (X (AND p2 p4)), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p4)))), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p4)), (X (X (NOT (AND p0 (NOT p4))))), (X (X (AND p1 p4))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p4)))), (X (X (AND p1 p2))), true, (X (X (NOT (AND p1 p2 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p4)))), (X (X (AND p0 p4))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p4)))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p0 p1))), (X (X (AND p1 p2 p4))), (X (X p2)), (X (X (AND p2 p4))), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p4))))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 60 factoid took 4093 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2116 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 42 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 43) seen :17
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2024-05-21 03:53:08] [INFO ] Invariant cache hit.
[2024-05-21 03:53:09] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2024-05-21 03:53:10] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-21 03:53:13] [INFO ] After 2692ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2024-05-21 03:53:16] [INFO ] After 5479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 1639 ms.
[2024-05-21 03:53:17] [INFO ] After 8307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Fused 26 Parikh solutions to 24 different solutions.
Parikh walk visited 18 properties in 538 ms.
Support contains 10 out of 1299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1299/1299 places, 2394/2394 transitions.
Graph (trivial) has 1333 edges and 1299 vertex of which 485 / 1299 are part of one of the 55 SCC in 2 ms
Free SCC test removed 430 places
Drop transitions removed 562 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 563 transitions.
Graph (complete) has 3590 edges and 869 vertex of which 860 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 364 rules applied. Total rules applied 366 place count 860 transition count 1467
Reduce places removed 350 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 353 rules applied. Total rules applied 719 place count 510 transition count 1464
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 722 place count 507 transition count 1464
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 722 place count 507 transition count 1388
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 874 place count 431 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 881 place count 424 transition count 1381
Iterating global reduction 3 with 7 rules applied. Total rules applied 888 place count 424 transition count 1381
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 888 place count 424 transition count 1374
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 902 place count 417 transition count 1374
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 1 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 1136 place count 300 transition count 1257
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -314
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1220 place count 258 transition count 1571
Drop transitions removed 20 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 1275 place count 258 transition count 1516
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1289 place count 251 transition count 1600
Drop transitions removed 272 transitions
Redundant transition composition rules discarded 272 transitions
Iterating global reduction 4 with 272 rules applied. Total rules applied 1561 place count 251 transition count 1328
Free-agglomeration rule applied 69 times with reduction of 35 identical transitions.
Iterating global reduction 4 with 69 rules applied. Total rules applied 1630 place count 251 transition count 1224
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 179 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 263 transitions.
Graph (complete) has 1639 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 333 rules applied. Total rules applied 1963 place count 181 transition count 961
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1964 place count 181 transition count 960
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1969 place count 176 transition count 920
Iterating global reduction 6 with 5 rules applied. Total rules applied 1974 place count 176 transition count 920
Drop transitions removed 147 transitions
Redundant transition composition rules discarded 147 transitions
Iterating global reduction 6 with 147 rules applied. Total rules applied 2121 place count 176 transition count 773
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2122 place count 175 transition count 772
Applied a total of 2122 rules in 191 ms. Remains 175 /1299 variables (removed 1124) and now considering 772/2394 (removed 1622) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 175/1299 places, 772/2394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:53:18] [INFO ] Flow matrix only has 366 transitions (discarded 406 similar events)
// Phase 1: matrix 366 rows 175 cols
[2024-05-21 03:53:18] [INFO ] Computed 27 invariants in 1 ms
[2024-05-21 03:53:18] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:53:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-21 03:53:18] [INFO ] [Nat]Absence check using 7 positive and 20 generalized place invariants in 6 ms returned sat
[2024-05-21 03:53:18] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:53:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:53:18] [INFO ] After 37ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:53:19] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 03:53:19] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 8 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 772/772 transitions.
Graph (trivial) has 57 edges and 175 vertex of which 2 / 175 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 1 rules applied. Total rules applied 2 place count 174 transition count 769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 173 transition count 769
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 172 transition count 776
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 172 transition count 775
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 172 transition count 767
Applied a total of 14 rules in 38 ms. Remains 172 /175 variables (removed 3) and now considering 767/772 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 172/175 places, 767/772 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 651470 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651470 steps, saw 91346 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:53:22] [INFO ] Flow matrix only has 354 transitions (discarded 413 similar events)
// Phase 1: matrix 354 rows 172 cols
[2024-05-21 03:53:22] [INFO ] Computed 27 invariants in 4 ms
[2024-05-21 03:53:22] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:53:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 03:53:22] [INFO ] [Nat]Absence check using 7 positive and 20 generalized place invariants in 6 ms returned sat
[2024-05-21 03:53:22] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:53:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:53:22] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:53:22] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-21 03:53:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-21 03:53:22] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 03:53:22] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 767/767 transitions.
Applied a total of 0 rules in 13 ms. Remains 172 /172 variables (removed 0) and now considering 767/767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 172/172 places, 767/767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 767/767 transitions.
Applied a total of 0 rules in 11 ms. Remains 172 /172 variables (removed 0) and now considering 767/767 (removed 0) transitions.
[2024-05-21 03:53:22] [INFO ] Flow matrix only has 354 transitions (discarded 413 similar events)
[2024-05-21 03:53:22] [INFO ] Invariant cache hit.
[2024-05-21 03:53:22] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 03:53:22] [INFO ] Flow matrix only has 354 transitions (discarded 413 similar events)
[2024-05-21 03:53:22] [INFO ] Invariant cache hit.
[2024-05-21 03:53:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:53:23] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-05-21 03:53:23] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-21 03:53:23] [INFO ] Flow matrix only has 354 transitions (discarded 413 similar events)
[2024-05-21 03:53:23] [INFO ] Invariant cache hit.
[2024-05-21 03:53:23] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 760 ms. Remains : 172/172 places, 767/767 transitions.
Graph (trivial) has 167 edges and 172 vertex of which 49 / 172 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 66 transitions
Ensure Unique test removed 413 transitions
Reduce isomorphic transitions removed 479 transitions.
Graph (complete) has 426 edges and 130 vertex of which 119 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 119 transition count 262
Reduce places removed 26 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 1 with 28 rules applied. Total rules applied 56 place count 93 transition count 260
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 92 transition count 258
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 90 transition count 257
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 62 place count 90 transition count 244
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 88 place count 77 transition count 244
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 93 place count 72 transition count 239
Iterating global reduction 4 with 5 rules applied. Total rules applied 98 place count 72 transition count 239
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 103 place count 67 transition count 204
Iterating global reduction 4 with 5 rules applied. Total rules applied 108 place count 67 transition count 204
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 4 with 50 rules applied. Total rules applied 158 place count 67 transition count 154
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 178 place count 57 transition count 144
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 192 place count 57 transition count 130
Performed 8 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 208 place count 49 transition count 181
Drop transitions removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 6 with 69 rules applied. Total rules applied 277 place count 49 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 289 place count 41 transition count 108
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 316 place count 41 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 318 place count 40 transition count 89
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 337 place count 40 transition count 70
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 339 place count 40 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 341 place count 38 transition count 68
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 351 place count 38 transition count 68
Applied a total of 351 rules in 15 ms. Remains 38 /172 variables (removed 134) and now considering 68/767 (removed 699) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 68 rows 38 cols
[2024-05-21 03:53:23] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 03:53:23] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:53:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-21 03:53:23] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:53:23] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 03:53:23] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X p4), (X (NOT (AND p0 (NOT p4)))), (X (AND p1 p4)), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p4))), (X (NOT (AND p1 p2 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p4))), (X (AND p0 p4)), (X (NOT (AND (NOT p1) p2 p4))), (X (NOT (AND (NOT p2) (NOT p4)))), (X p0), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p4)))), (X (AND p0 p1)), (X (AND p1 p2 p4)), (X (AND p2 p4)), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p4)))), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p4)), (X (X (NOT (AND p0 (NOT p4))))), (X (X (AND p1 p4))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p4)))), (X (X (AND p1 p2))), true, (X (X (NOT (AND p1 p2 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p4)))), (X (X (AND p0 p4))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p4)))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (AND p0 p1))), (X (X (AND p1 p2 p4))), (X (X p2)), (X (X (AND p2 p4))), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p4))))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p4) p2)), (F (NOT (AND p4 p1 p2))), (F (AND (NOT p4) (NOT p2))), (F (AND (NOT p4) p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p4 (NOT p1) p2)), (F (NOT p0)), (F (NOT p4)), (F (NOT p1)), (F (NOT (AND p4 p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p4 (NOT p2))), (F (AND p1 (NOT p3))), (F (AND (NOT p4) (NOT p1) p2)), (F (NOT (AND p4 p1))), (F (AND p4 p1 (NOT p2))), (F (AND p1 p2 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3))), (F (NOT (AND p0 p4))), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p4))), (F (AND (NOT p4) (NOT p1))), (F (AND p2 (NOT p3))), (F (AND (NOT p4) (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p4) p1)), (F (AND (NOT p4) p1 (NOT p2))), (F (AND p4 (NOT p1))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (AND p4 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1))), (F (AND p4 (NOT p3))), (F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 60 factoid took 7776 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1989 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 2003 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 2009 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 22229 reset in 587 ms.
Product exploration explored 100000 steps with 22213 reset in 583 ms.
Applying partial POR strategy [true, false, false, false, false, false, false, false, true, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1808 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 10 out of 1299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1299/1299 places, 2394/2394 transitions.
Graph (trivial) has 1333 edges and 1299 vertex of which 485 / 1299 are part of one of the 55 SCC in 1 ms
Free SCC test removed 430 places
Ensure Unique test removed 492 transitions
Reduce isomorphic transitions removed 492 transitions.
Graph (complete) has 3764 edges and 869 vertex of which 860 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 346 rules applied. Total rules applied 348 place count 860 transition count 1900
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 348 place count 860 transition count 1942
Deduced a syphon composed of 395 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 397 place count 860 transition count 1942
Discarding 184 places :
Symmetric choice reduction at 1 with 184 rule applications. Total rules 581 place count 676 transition count 1758
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 1 with 184 rules applied. Total rules applied 765 place count 676 transition count 1758
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 355 places in 1 ms
Iterating global reduction 1 with 144 rules applied. Total rules applied 909 place count 676 transition count 1758
Discarding 108 places :
Symmetric choice reduction at 1 with 108 rule applications. Total rules 1017 place count 568 transition count 1650
Deduced a syphon composed of 247 places in 0 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 1125 place count 568 transition count 1650
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -314
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 1169 place count 568 transition count 1964
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 1176 place count 568 transition count 1957
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 1229 place count 515 transition count 1788
Deduced a syphon composed of 238 places in 1 ms
Iterating global reduction 2 with 53 rules applied. Total rules applied 1282 place count 515 transition count 1788
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 1289 place count 515 transition count 1886
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1296 place count 508 transition count 1872
Deduced a syphon composed of 238 places in 1 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 1303 place count 508 transition count 1872
Deduced a syphon composed of 238 places in 1 ms
Drop transitions removed 113 transitions
Redundant transition composition rules discarded 113 transitions
Iterating global reduction 2 with 113 rules applied. Total rules applied 1416 place count 508 transition count 1759
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1430 place count 494 transition count 1745
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 1444 place count 494 transition count 1745
Deduced a syphon composed of 224 places in 0 ms
Applied a total of 1444 rules in 274 ms. Remains 494 /1299 variables (removed 805) and now considering 1745/2394 (removed 649) transitions.
[2024-05-21 03:53:42] [INFO ] Redundant transitions in 930 ms returned []
[2024-05-21 03:53:42] [INFO ] Flow matrix only has 1439 transitions (discarded 306 similar events)
// Phase 1: matrix 1439 rows 494 cols
[2024-05-21 03:53:42] [INFO ] Computed 7 invariants in 16 ms
[2024-05-21 03:53:42] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 494/1299 places, 1745/2394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1788 ms. Remains : 494/1299 places, 1745/2394 transitions.
Built C files in :
/tmp/ltsmin2721820790734813007
[2024-05-21 03:53:42] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2721820790734813007
Running compilation step : cd /tmp/ltsmin2721820790734813007;'/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/ltsmin2721820790734813007;'/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/ltsmin2721820790734813007;'/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 10 out of 1299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1299/1299 places, 2394/2394 transitions.
Applied a total of 0 rules in 44 ms. Remains 1299 /1299 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
// Phase 1: matrix 2394 rows 1299 cols
[2024-05-21 03:53:45] [INFO ] Computed 7 invariants in 9 ms
[2024-05-21 03:53:46] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-21 03:53:46] [INFO ] Invariant cache hit.
[2024-05-21 03:53:47] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2024-05-21 03:53:47] [INFO ] Invariant cache hit.
[2024-05-21 03:53:48] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2507 ms. Remains : 1299/1299 places, 2394/2394 transitions.
Built C files in :
/tmp/ltsmin8592166848855559812
[2024-05-21 03:53:48] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8592166848855559812
Running compilation step : cd /tmp/ltsmin8592166848855559812;'/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/ltsmin8592166848855559812;'/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/ltsmin8592166848855559812;'/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 03:53:51] [INFO ] Flatten gal took : 109 ms
[2024-05-21 03:53:51] [INFO ] Flatten gal took : 98 ms
[2024-05-21 03:53:51] [INFO ] Time to serialize gal into /tmp/LTL14556598736113510771.gal : 22 ms
[2024-05-21 03:53:51] [INFO ] Time to serialize properties into /tmp/LTL8090895897098138982.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14556598736113510771.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13723758584624679795.hoa' '-atoms' '/tmp/LTL8090895897098138982.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/LTL8090895897098138982.prop.
Loaded 5 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13723758584624679795.hoa
Detected timeout of ITS tools.
[2024-05-21 03:54:07] [INFO ] Flatten gal took : 89 ms
[2024-05-21 03:54:07] [INFO ] Flatten gal took : 93 ms
[2024-05-21 03:54:07] [INFO ] Time to serialize gal into /tmp/LTL14576699319397528576.gal : 14 ms
[2024-05-21 03:54:07] [INFO ] Time to serialize properties into /tmp/LTL9567221959360599171.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14576699319397528576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9567221959360599171.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 : !((((("((p351==0)||(p1869==1))")U(G(("((p99==0)||(p2029==1))")U(X(X(X("((p522==0)||(p367==1))")))))))&&("((p1984==0)||(p496==1))"))U(X...189
Formula 0 simplified : (!"((p1984==0)||(p496==1))" | (!"((p351==0)||(p1869==1))" R F(!"((p99==0)||(p2029==1))" R XXX!"((p522==0)||(p367==1))"))) R XF!"((p1...176
Detected timeout of ITS tools.
[2024-05-21 03:54:22] [INFO ] Flatten gal took : 79 ms
[2024-05-21 03:54:22] [INFO ] Applying decomposition
[2024-05-21 03:54:22] [INFO ] Flatten gal took : 80 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/graph11745519550668304154.txt' '-o' '/tmp/graph11745519550668304154.bin' '-w' '/tmp/graph11745519550668304154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11745519550668304154.bin' '-l' '-1' '-v' '-w' '/tmp/graph11745519550668304154.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:54:22] [INFO ] Decomposing Gal with order
[2024-05-21 03:54:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:54:23] [INFO ] Removed a total of 4319 redundant transitions.
[2024-05-21 03:54:23] [INFO ] Flatten gal took : 221 ms
[2024-05-21 03:54:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 64 ms.
[2024-05-21 03:54:23] [INFO ] Time to serialize gal into /tmp/LTL13245927679062243027.gal : 19 ms
[2024-05-21 03:54:23] [INFO ] Time to serialize properties into /tmp/LTL14177908145107470054.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13245927679062243027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14177908145107470054.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 : !((((("((i8.i2.i2.u71.p351==0)||(i24.u395.p1869==1))")U(G(("((i1.u8.p99==0)||(i26.i0.i2.u423.p2029==1))")U(X(X(X("((i6.u106.p522==0)||...287
Formula 0 simplified : (!"((i25.u408.p1984==0)||(i6.u99.p496==1))" | (!"((i8.i2.i2.u71.p351==0)||(i24.u395.p1869==1))" R F(!"((i1.u8.p99==0)||(i26.i0.i2.u4...274
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2607087311903874311
[2024-05-21 03:54:38] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2607087311903874311
Running compilation step : cd /tmp/ltsmin2607087311903874311;'/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/ltsmin2607087311903874311;'/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/ltsmin2607087311903874311;'/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 CloudDeployment-PT-7b-LTLCardinality-03 finished in 139483 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 2 out of 1316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Graph (trivial) has 1365 edges and 1316 vertex of which 498 / 1316 are part of one of the 56 SCC in 1 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 3788 edges and 874 vertex of which 865 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 864 transition count 1554
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 706 place count 512 transition count 1554
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 706 place count 512 transition count 1488
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 838 place count 446 transition count 1488
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 849 place count 435 transition count 1477
Iterating global reduction 2 with 11 rules applied. Total rules applied 860 place count 435 transition count 1477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 861 place count 435 transition count 1476
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 861 place count 435 transition count 1471
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 871 place count 430 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 872 place count 429 transition count 1470
Iterating global reduction 3 with 1 rules applied. Total rules applied 873 place count 429 transition count 1470
Performed 137 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 1147 place count 292 transition count 1329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1148 place count 292 transition count 1328
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1204 place count 264 transition count 1398
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1210 place count 264 transition count 1392
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1222 place count 258 transition count 1464
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 1279 place count 258 transition count 1407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1280 place count 257 transition count 1406
Applied a total of 1280 rules in 175 ms. Remains 257 /1316 variables (removed 1059) and now considering 1406/2414 (removed 1008) transitions.
[2024-05-21 03:54:41] [INFO ] Flow matrix only has 1106 transitions (discarded 300 similar events)
// Phase 1: matrix 1106 rows 257 cols
[2024-05-21 03:54:41] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 03:54:41] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 03:54:41] [INFO ] Flow matrix only has 1106 transitions (discarded 300 similar events)
[2024-05-21 03:54:41] [INFO ] Invariant cache hit.
[2024-05-21 03:54:41] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 03:54:42] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-21 03:54:43] [INFO ] Redundant transitions in 823 ms returned []
[2024-05-21 03:54:43] [INFO ] Flow matrix only has 1106 transitions (discarded 300 similar events)
[2024-05-21 03:54:43] [INFO ] Invariant cache hit.
[2024-05-21 03:54:43] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1316 places, 1406/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2091 ms. Remains : 257/1316 places, 1406/2414 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s147 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-04 finished in 2181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 1316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1298 transition count 2396
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1298 transition count 2396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1298 transition count 2395
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 1292 transition count 2389
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 1292 transition count 2389
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 1292 transition count 2384
Applied a total of 54 rules in 115 ms. Remains 1292 /1316 variables (removed 24) and now considering 2384/2414 (removed 30) transitions.
// Phase 1: matrix 2384 rows 1292 cols
[2024-05-21 03:54:43] [INFO ] Computed 7 invariants in 15 ms
[2024-05-21 03:54:43] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-21 03:54:43] [INFO ] Invariant cache hit.
[2024-05-21 03:54:45] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
[2024-05-21 03:54:45] [INFO ] Invariant cache hit.
[2024-05-21 03:54:46] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1316 places, 2384/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2487 ms. Remains : 1292/1316 places, 2384/2414 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s433 0) (EQ s541 1)) (AND (EQ s977 0) (EQ s454 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-09 finished in 2600 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 1316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Graph (trivial) has 1363 edges and 1316 vertex of which 498 / 1316 are part of one of the 56 SCC in 1 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 3788 edges and 874 vertex of which 865 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 864 transition count 1554
Reduce places removed 352 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 353 rules applied. Total rules applied 707 place count 512 transition count 1553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 708 place count 511 transition count 1553
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 708 place count 511 transition count 1488
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 838 place count 446 transition count 1488
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 849 place count 435 transition count 1477
Iterating global reduction 3 with 11 rules applied. Total rules applied 860 place count 435 transition count 1477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 861 place count 435 transition count 1476
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 861 place count 435 transition count 1471
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 871 place count 430 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 872 place count 429 transition count 1470
Iterating global reduction 4 with 1 rules applied. Total rules applied 873 place count 429 transition count 1470
Performed 137 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 4 with 274 rules applied. Total rules applied 1147 place count 292 transition count 1329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1148 place count 292 transition count 1328
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1202 place count 265 transition count 1396
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1208 place count 265 transition count 1390
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1220 place count 259 transition count 1462
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 6 with 53 rules applied. Total rules applied 1273 place count 259 transition count 1409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1274 place count 258 transition count 1408
Applied a total of 1274 rules in 166 ms. Remains 258 /1316 variables (removed 1058) and now considering 1408/2414 (removed 1006) transitions.
[2024-05-21 03:54:46] [INFO ] Flow matrix only has 1108 transitions (discarded 300 similar events)
// Phase 1: matrix 1108 rows 258 cols
[2024-05-21 03:54:46] [INFO ] Computed 7 invariants in 8 ms
[2024-05-21 03:54:46] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 03:54:46] [INFO ] Flow matrix only has 1108 transitions (discarded 300 similar events)
[2024-05-21 03:54:46] [INFO ] Invariant cache hit.
[2024-05-21 03:54:46] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 03:54:47] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2024-05-21 03:54:47] [INFO ] Redundant transitions in 968 ms returned []
[2024-05-21 03:54:47] [INFO ] Flow matrix only has 1108 transitions (discarded 300 similar events)
[2024-05-21 03:54:47] [INFO ] Invariant cache hit.
[2024-05-21 03:54:48] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/1316 places, 1408/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2213 ms. Remains : 258/1316 places, 1408/2414 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s85 0) (EQ s127 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 1675 steps with 30 reset in 17 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-10 finished in 2279 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' '!((p0 U (p1&&G((!p0&&X(!p0))))))'
Support contains 4 out of 1316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Graph (trivial) has 1361 edges and 1316 vertex of which 483 / 1316 are part of one of the 55 SCC in 0 ms
Free SCC test removed 428 places
Ensure Unique test removed 489 transitions
Reduce isomorphic transitions removed 489 transitions.
Graph (complete) has 3806 edges and 888 vertex of which 879 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 358 place count 878 transition count 1566
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 714 place count 522 transition count 1566
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 714 place count 522 transition count 1496
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 854 place count 452 transition count 1496
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 863 place count 443 transition count 1487
Iterating global reduction 2 with 9 rules applied. Total rules applied 872 place count 443 transition count 1487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 873 place count 443 transition count 1486
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 873 place count 443 transition count 1482
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 881 place count 439 transition count 1482
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 882 place count 438 transition count 1481
Iterating global reduction 3 with 1 rules applied. Total rules applied 883 place count 438 transition count 1481
Performed 139 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 1161 place count 299 transition count 1339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1162 place count 299 transition count 1338
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1224 place count 268 transition count 1429
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1231 place count 268 transition count 1422
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1245 place count 261 transition count 1506
Drop transitions removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 5 with 79 rules applied. Total rules applied 1324 place count 261 transition count 1427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1325 place count 260 transition count 1426
Applied a total of 1325 rules in 158 ms. Remains 260 /1316 variables (removed 1056) and now considering 1426/2414 (removed 988) transitions.
[2024-05-21 03:54:48] [INFO ] Flow matrix only has 1127 transitions (discarded 299 similar events)
// Phase 1: matrix 1127 rows 260 cols
[2024-05-21 03:54:48] [INFO ] Computed 7 invariants in 11 ms
[2024-05-21 03:54:48] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 03:54:48] [INFO ] Flow matrix only has 1127 transitions (discarded 299 similar events)
[2024-05-21 03:54:48] [INFO ] Invariant cache hit.
[2024-05-21 03:54:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 03:54:49] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-05-21 03:54:50] [INFO ] Redundant transitions in 825 ms returned []
[2024-05-21 03:54:50] [INFO ] Flow matrix only has 1127 transitions (discarded 299 similar events)
[2024-05-21 03:54:50] [INFO ] Invariant cache hit.
[2024-05-21 03:54:50] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/1316 places, 1426/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1956 ms. Remains : 260/1316 places, 1426/2414 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, true, (OR (NOT p1) p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s66 0) (EQ s200 1)), p1:(OR (EQ s2 0) (EQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-12 finished in 2046 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((G((p1||X(X(F(p1)))))||p0))))'
Support contains 3 out of 1316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Graph (trivial) has 1362 edges and 1316 vertex of which 493 / 1316 are part of one of the 55 SCC in 0 ms
Free SCC test removed 438 places
Ensure Unique test removed 501 transitions
Reduce isomorphic transitions removed 501 transitions.
Graph (complete) has 3792 edges and 878 vertex of which 869 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 353 place count 868 transition count 1559
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 704 place count 517 transition count 1559
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 704 place count 517 transition count 1492
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 838 place count 450 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 848 place count 440 transition count 1482
Iterating global reduction 2 with 10 rules applied. Total rules applied 858 place count 440 transition count 1482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 440 transition count 1481
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 859 place count 440 transition count 1477
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 867 place count 436 transition count 1477
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 868 place count 435 transition count 1476
Iterating global reduction 3 with 1 rules applied. Total rules applied 869 place count 435 transition count 1476
Performed 138 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 1145 place count 297 transition count 1335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1146 place count 297 transition count 1334
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -82
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1204 place count 268 transition count 1416
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1210 place count 268 transition count 1410
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1222 place count 262 transition count 1482
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 5 with 56 rules applied. Total rules applied 1278 place count 262 transition count 1426
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1280 place count 261 transition count 1433
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1281 place count 260 transition count 1432
Applied a total of 1281 rules in 164 ms. Remains 260 /1316 variables (removed 1056) and now considering 1432/2414 (removed 982) transitions.
[2024-05-21 03:54:50] [INFO ] Flow matrix only has 1140 transitions (discarded 292 similar events)
// Phase 1: matrix 1140 rows 260 cols
[2024-05-21 03:54:50] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 03:54:50] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 03:54:50] [INFO ] Flow matrix only has 1140 transitions (discarded 292 similar events)
[2024-05-21 03:54:50] [INFO ] Invariant cache hit.
[2024-05-21 03:54:50] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 03:54:51] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2024-05-21 03:54:52] [INFO ] Redundant transitions in 833 ms returned []
[2024-05-21 03:54:52] [INFO ] Flow matrix only has 1140 transitions (discarded 292 similar events)
[2024-05-21 03:54:52] [INFO ] Invariant cache hit.
[2024-05-21 03:54:52] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/1316 places, 1432/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2112 ms. Remains : 260/1316 places, 1432/2414 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s120 0) (EQ s176 1)), p1:(EQ s58 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]]
Stuttering criterion allowed to conclude after 48985 steps with 947 reset in 257 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-13 finished in 2459 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(p1))))'
Support contains 4 out of 1316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Graph (trivial) has 1363 edges and 1316 vertex of which 498 / 1316 are part of one of the 56 SCC in 0 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 3788 edges and 874 vertex of which 865 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 353 rules applied. Total rules applied 355 place count 864 transition count 1553
Reduce places removed 353 places and 0 transitions.
Iterating post reduction 1 with 353 rules applied. Total rules applied 708 place count 511 transition count 1553
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 708 place count 511 transition count 1487
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 840 place count 445 transition count 1487
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 849 place count 436 transition count 1478
Iterating global reduction 2 with 9 rules applied. Total rules applied 858 place count 436 transition count 1478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 436 transition count 1477
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 859 place count 436 transition count 1472
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 869 place count 431 transition count 1472
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 870 place count 430 transition count 1471
Iterating global reduction 3 with 1 rules applied. Total rules applied 871 place count 430 transition count 1471
Performed 135 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 135 places in 1 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 1141 place count 295 transition count 1332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1142 place count 295 transition count 1331
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1198 place count 267 transition count 1401
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1205 place count 267 transition count 1394
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1219 place count 260 transition count 1478
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 1276 place count 260 transition count 1421
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1278 place count 260 transition count 1421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1279 place count 259 transition count 1420
Applied a total of 1279 rules in 170 ms. Remains 259 /1316 variables (removed 1057) and now considering 1420/2414 (removed 994) transitions.
[2024-05-21 03:54:53] [INFO ] Flow matrix only has 1120 transitions (discarded 300 similar events)
// Phase 1: matrix 1120 rows 259 cols
[2024-05-21 03:54:53] [INFO ] Computed 7 invariants in 12 ms
[2024-05-21 03:54:53] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 03:54:53] [INFO ] Flow matrix only has 1120 transitions (discarded 300 similar events)
[2024-05-21 03:54:53] [INFO ] Invariant cache hit.
[2024-05-21 03:54:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 03:54:53] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-05-21 03:54:54] [INFO ] Redundant transitions in 805 ms returned []
[2024-05-21 03:54:54] [INFO ] Flow matrix only has 1120 transitions (discarded 300 similar events)
[2024-05-21 03:54:54] [INFO ] Invariant cache hit.
[2024-05-21 03:54:54] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/1316 places, 1420/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2059 ms. Remains : 259/1316 places, 1420/2414 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s66 0) (EQ s184 1)), p1:(OR (EQ s169 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1633 steps with 31 reset in 8 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-14 finished in 2189 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 1316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1316/1316 places, 2414/2414 transitions.
Graph (trivial) has 1367 edges and 1316 vertex of which 498 / 1316 are part of one of the 56 SCC in 1 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 3788 edges and 874 vertex of which 865 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 354 transitions
Trivial Post-agglo rules discarded 354 transitions
Performed 354 trivial Post agglomeration. Transition count delta: 354
Iterating post reduction 0 with 354 rules applied. Total rules applied 356 place count 864 transition count 1552
Reduce places removed 354 places and 0 transitions.
Iterating post reduction 1 with 354 rules applied. Total rules applied 710 place count 510 transition count 1552
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 710 place count 510 transition count 1486
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 842 place count 444 transition count 1486
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 852 place count 434 transition count 1476
Iterating global reduction 2 with 10 rules applied. Total rules applied 862 place count 434 transition count 1476
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 862 place count 434 transition count 1471
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 872 place count 429 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 873 place count 428 transition count 1470
Iterating global reduction 2 with 1 rules applied. Total rules applied 874 place count 428 transition count 1470
Performed 137 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 274 rules applied. Total rules applied 1148 place count 291 transition count 1329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1149 place count 291 transition count 1328
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1205 place count 263 transition count 1398
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1212 place count 263 transition count 1391
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1226 place count 256 transition count 1475
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 4 with 56 rules applied. Total rules applied 1282 place count 256 transition count 1419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1283 place count 255 transition count 1418
Applied a total of 1283 rules in 158 ms. Remains 255 /1316 variables (removed 1061) and now considering 1418/2414 (removed 996) transitions.
[2024-05-21 03:54:55] [INFO ] Flow matrix only has 1118 transitions (discarded 300 similar events)
// Phase 1: matrix 1118 rows 255 cols
[2024-05-21 03:54:55] [INFO ] Computed 7 invariants in 9 ms
[2024-05-21 03:54:55] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 03:54:55] [INFO ] Flow matrix only has 1118 transitions (discarded 300 similar events)
[2024-05-21 03:54:55] [INFO ] Invariant cache hit.
[2024-05-21 03:54:55] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 03:54:55] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-21 03:54:56] [INFO ] Redundant transitions in 830 ms returned []
[2024-05-21 03:54:56] [INFO ] Flow matrix only has 1118 transitions (discarded 300 similar events)
[2024-05-21 03:54:56] [INFO ] Invariant cache hit.
[2024-05-21 03:54:57] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/1316 places, 1418/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2046 ms. Remains : 255/1316 places, 1418/2414 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-15 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 s90 0) (EQ s237 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 0 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-15 finished in 2095 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' '!(((p0&&(p1 U G((p2 U X(X(X(p3))))))) U X(G(p4))))'
[2024-05-21 03:54:58] [INFO ] Flatten gal took : 83 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1909429017678020344
[2024-05-21 03:54:58] [INFO ] Too many transitions (2414) to apply POR reductions. Disabling POR matrices.
[2024-05-21 03:54:58] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1909429017678020344
Running compilation step : cd /tmp/ltsmin1909429017678020344;'/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 03:54:58] [INFO ] Applying decomposition
[2024-05-21 03:54:58] [INFO ] Flatten gal took : 92 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/graph8199754422241211387.txt' '-o' '/tmp/graph8199754422241211387.bin' '-w' '/tmp/graph8199754422241211387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8199754422241211387.bin' '-l' '-1' '-v' '-w' '/tmp/graph8199754422241211387.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:54:58] [INFO ] Decomposing Gal with order
[2024-05-21 03:54:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:54:58] [INFO ] Removed a total of 3219 redundant transitions.
[2024-05-21 03:54:58] [INFO ] Flatten gal took : 155 ms
[2024-05-21 03:54:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 173 labels/synchronizations in 47 ms.
[2024-05-21 03:54:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality5826825012024559976.gal : 18 ms
[2024-05-21 03:54:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality15379377048388125269.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/LTLCardinality5826825012024559976.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15379377048388125269.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 : !(((("((i26.u405.p1984==0)||(i5.i1.i4.u95.p496==1))")&&(("((i8.i0.i1.u67.p351==0)||(i29.i0.i0.u394.p1869==1))")U(G(("((i0.u7.p99==0)||...305
Formula 0 simplified : (!"((i26.u405.p1984==0)||(i5.i1.i4.u95.p496==1))" | (!"((i8.i0.i1.u67.p351==0)||(i29.i0.i0.u394.p1869==1))" R F(!"((i0.u7.p99==0)||(...292
Compilation finished in 5054 ms.
Running link step : cd /tmp/ltsmin1909429017678020344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1909429017678020344;'/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' '(((LTLAPp0==true)&&((LTLAPp1==true) U [](((LTLAPp2==true) U X(X(X((LTLAPp3==true)))))))) U X([]((LTLAPp4==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 04:15:57] [INFO ] Applying decomposition
[2024-05-21 04:15:57] [INFO ] Flatten gal took : 216 ms
[2024-05-21 04:15:57] [INFO ] Decomposing Gal with order
[2024-05-21 04:15:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:15:58] [INFO ] Removed a total of 3679 redundant transitions.
[2024-05-21 04:15:58] [INFO ] Flatten gal took : 275 ms
[2024-05-21 04:15:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 772 labels/synchronizations in 121 ms.
[2024-05-21 04:15:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality14861994229643353006.gal : 37 ms
[2024-05-21 04:15:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality17314776149857547179.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/LTLCardinality14861994229643353006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17314776149857547179.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...278
Read 1 LTL properties
Checking formula 0 : !(((("((i0.i0.i1.u42.p1984==0)||(i0.i0.i0.i0.i0.i0.i0.i1.u17.p496==1))")&&(("((i0.i0.i0.i0.i0.i0.i0.i1.i0.u15.p351==0)||(i0.i0.i1.i0.u...406
Formula 0 simplified : (!"((i0.i0.i1.u42.p1984==0)||(i0.i0.i0.i0.i0.i0.i0.i1.u17.p496==1))" | (!"((i0.i0.i0.i0.i0.i0.i0.i1.i0.u15.p351==0)||(i0.i0.i1.i0.u4...393
Reverse transition relation is NOT exact ! Due to transitions t1377, t1548, t1559, t1571, t1587, t1600, t1609, t1622, u56.t3, u56.t4, i0.t2339, i0.t2317, i...4754
Computing Next relation with stutter on 4.87036e+16 deadlock states
Detected timeout of ITS tools.
[2024-05-21 04:36:57] [INFO ] Flatten gal took : 172 ms
[2024-05-21 04:36:58] [INFO ] Input system was already deterministic with 2414 transitions.
[2024-05-21 04:36:58] [INFO ] Transformed 1316 places.
[2024-05-21 04:36:58] [INFO ] Transformed 2414 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 04:36:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality14948238756587796486.gal : 92 ms
[2024-05-21 04:36:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality414337277552409789.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/LTLCardinality14948238756587796486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality414337277552409789.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("((p1984==0)||(p496==1))")&&(("((p351==0)||(p1869==1))")U(G(("((p99==0)||(p2029==1))")U(X(X(X("((p522==0)||(p367==1))"))))))))U(X...189
Formula 0 simplified : (!"((p1984==0)||(p496==1))" | (!"((p351==0)||(p1869==1))" R F(!"((p99==0)||(p2029==1))" R XXX!"((p522==0)||(p367==1))"))) R XF!"((p1...176
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5705392 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16013228 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="CloudDeployment-PT-7b"
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 CloudDeployment-PT-7b, 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 r087-tall-171620522100392"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-7b.tgz
mv CloudDeployment-PT-7b 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;