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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 15:44 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 1.5M 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-5b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716262150983

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-5b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 03:29:12] [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:29:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:29:12] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-21 03:29:12] [INFO ] Transformed 1525 places.
[2024-05-21 03:29:12] [INFO ] Transformed 3132 transitions.
[2024-05-21 03:29:12] [INFO ] Found NUPN structural information;
[2024-05-21 03:29:12] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 293 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-5b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1519 transition count 3132
Discarding 405 places :
Symmetric choice reduction at 1 with 405 rule applications. Total rules 411 place count 1114 transition count 1714
Iterating global reduction 1 with 405 rules applied. Total rules applied 816 place count 1114 transition count 1714
Discarding 148 places :
Symmetric choice reduction at 1 with 148 rule applications. Total rules 964 place count 966 transition count 1566
Iterating global reduction 1 with 148 rules applied. Total rules applied 1112 place count 966 transition count 1566
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1129 place count 966 transition count 1549
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1144 place count 951 transition count 1534
Iterating global reduction 2 with 15 rules applied. Total rules applied 1159 place count 951 transition count 1534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1160 place count 950 transition count 1533
Iterating global reduction 2 with 1 rules applied. Total rules applied 1161 place count 950 transition count 1533
Applied a total of 1161 rules in 790 ms. Remains 950 /1525 variables (removed 575) and now considering 1533/3132 (removed 1599) transitions.
// Phase 1: matrix 1533 rows 950 cols
[2024-05-21 03:29:13] [INFO ] Computed 15 invariants in 32 ms
[2024-05-21 03:29:14] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-21 03:29:14] [INFO ] Invariant cache hit.
[2024-05-21 03:29:15] [INFO ] Implicit Places using invariants and state equation in 902 ms returned [11, 20, 189, 199, 367, 375, 542, 551, 718, 728]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1327 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 940/1525 places, 1533/3132 transitions.
Applied a total of 0 rules in 20 ms. Remains 940 /940 variables (removed 0) and now considering 1533/1533 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2137 ms. Remains : 940/1525 places, 1533/3132 transitions.
Support contains 26 out of 940 places after structural reductions.
[2024-05-21 03:29:15] [INFO ] Flatten gal took : 166 ms
[2024-05-21 03:29:15] [INFO ] Flatten gal took : 106 ms
[2024-05-21 03:29:15] [INFO ] Input system was already deterministic with 1533 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1533 rows 940 cols
[2024-05-21 03:29:16] [INFO ] Computed 5 invariants in 10 ms
[2024-05-21 03:29:16] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 03:29:16] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-21 03:29:17] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 03:29:18] [INFO ] After 1215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 283 ms.
[2024-05-21 03:29:18] [INFO ] After 1786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 44 ms.
Support contains 8 out of 940 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 940/940 places, 1533/1533 transitions.
Graph (trivial) has 967 edges and 940 vertex of which 344 / 940 are part of one of the 40 SCC in 4 ms
Free SCC test removed 304 places
Drop transitions removed 396 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 398 transitions.
Graph (complete) has 2209 edges and 636 vertex of which 629 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 270 rules applied. Total rules applied 272 place count 629 transition count 865
Reduce places removed 260 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 261 rules applied. Total rules applied 533 place count 369 transition count 864
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 534 place count 368 transition count 864
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 534 place count 368 transition count 810
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 642 place count 314 transition count 810
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 652 place count 304 transition count 800
Iterating global reduction 3 with 10 rules applied. Total rules applied 662 place count 304 transition count 800
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 664 place count 304 transition count 798
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 664 place count 304 transition count 793
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 674 place count 299 transition count 793
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 844 place count 214 transition count 708
Performed 38 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 920 place count 176 transition count 928
Drop transitions removed 17 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 958 place count 176 transition count 890
Drop transitions removed 163 transitions
Redundant transition composition rules discarded 163 transitions
Iterating global reduction 5 with 163 rules applied. Total rules applied 1121 place count 176 transition count 727
Free-agglomeration rule applied 50 times with reduction of 19 identical transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1171 place count 176 transition count 658
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 91 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 121 transitions.
Graph (complete) has 947 edges and 126 vertex of which 125 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 5 with 172 rules applied. Total rules applied 1343 place count 125 transition count 537
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1344 place count 125 transition count 536
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 7 with 75 rules applied. Total rules applied 1419 place count 125 transition count 461
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1420 place count 124 transition count 460
Applied a total of 1420 rules in 213 ms. Remains 124 /940 variables (removed 816) and now considering 460/1533 (removed 1073) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 124/940 places, 460/1533 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-21 03:29:18] [INFO ] Flow matrix only has 229 transitions (discarded 231 similar events)
// Phase 1: matrix 229 rows 124 cols
[2024-05-21 03:29:18] [INFO ] Computed 19 invariants in 1 ms
[2024-05-21 03:29:18] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:29:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 03:29:19] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-21 03:29:19] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:29:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:29:19] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:29:19] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 03:29:19] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 460/460 transitions.
Graph (trivial) has 53 edges and 124 vertex of which 2 / 124 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 123 transition count 454
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 119 transition count 454
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 118 transition count 448
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 118 transition count 448
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 115 transition count 445
Drop transitions removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 24 place count 115 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 114 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 114 transition count 432
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 29 place count 114 transition count 429
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 114 transition count 428
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 37 place count 113 transition count 422
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 112 transition count 416
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 112 transition count 416
Applied a total of 39 rules in 40 ms. Remains 112 /124 variables (removed 12) and now considering 416/460 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 112/124 places, 416/460 transitions.
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 141 stabilizing places and 481 stable transitions
Graph (complete) has 2739 edges and 940 vertex of which 933 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.21 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(((p1 U G(!p1))||p0)))'
Support contains 2 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1533/1533 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 926 transition count 1519
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 926 transition count 1519
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 926 transition count 1516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 923 transition count 1513
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 923 transition count 1513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 922 transition count 1512
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 922 transition count 1512
Applied a total of 39 rules in 92 ms. Remains 922 /940 variables (removed 18) and now considering 1512/1533 (removed 21) transitions.
// Phase 1: matrix 1512 rows 922 cols
[2024-05-21 03:29:19] [INFO ] Computed 5 invariants in 16 ms
[2024-05-21 03:29:19] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 03:29:19] [INFO ] Invariant cache hit.
[2024-05-21 03:29:20] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2024-05-21 03:29:20] [INFO ] Invariant cache hit.
[2024-05-21 03:29:21] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 922/940 places, 1512/1533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1627 ms. Remains : 922/940 places, 1512/1533 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 297 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s248 0) (EQ s186 1)), p0:(OR (EQ s248 0) (EQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 864 ms.
Product exploration explored 100000 steps with 50000 reset in 792 ms.
Computed a total of 136 stabilizing places and 476 stable transitions
Graph (complete) has 2711 edges and 922 vertex of which 915 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 ms
Computed a total of 136 stabilizing places and 476 stable transitions
Detected a total of 136/922 stabilizing places and 476/1512 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLCardinality-03 finished in 3673 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 940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 940/940 places, 1533/1533 transitions.
Graph (trivial) has 974 edges and 940 vertex of which 347 / 940 are part of one of the 39 SCC in 3 ms
Free SCC test removed 308 places
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Graph (complete) has 2335 edges and 632 vertex of which 625 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 624 transition count 924
Reduce places removed 254 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 258 rules applied. Total rules applied 514 place count 370 transition count 920
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 519 place count 366 transition count 919
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 519 place count 366 transition count 867
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 623 place count 314 transition count 867
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 631 place count 306 transition count 859
Iterating global reduction 3 with 8 rules applied. Total rules applied 639 place count 306 transition count 859
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 642 place count 306 transition count 856
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 642 place count 306 transition count 855
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 644 place count 305 transition count 855
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 838 place count 208 transition count 758
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 888 place count 183 transition count 833
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 930 place count 183 transition count 791
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 940 place count 178 transition count 876
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 1004 place count 178 transition count 812
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1005 place count 177 transition count 811
Applied a total of 1005 rules in 160 ms. Remains 177 /940 variables (removed 763) and now considering 811/1533 (removed 722) transitions.
[2024-05-21 03:29:23] [INFO ] Flow matrix only has 623 transitions (discarded 188 similar events)
// Phase 1: matrix 623 rows 177 cols
[2024-05-21 03:29:23] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 03:29:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 03:29:23] [INFO ] Flow matrix only has 623 transitions (discarded 188 similar events)
[2024-05-21 03:29:23] [INFO ] Invariant cache hit.
[2024-05-21 03:29:23] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 03:29:23] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-21 03:29:24] [INFO ] Redundant transitions in 545 ms returned []
[2024-05-21 03:29:24] [INFO ] Flow matrix only has 623 transitions (discarded 188 similar events)
[2024-05-21 03:29:24] [INFO ] Invariant cache hit.
[2024-05-21 03:29:24] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/940 places, 811/1533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1341 ms. Remains : 177/940 places, 811/1533 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-08 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 s137 0) (EQ s65 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-5b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLCardinality-08 finished in 1401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((X(F(!p1)) U (p2&&G(!p0)))))))'
Support contains 5 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1533/1533 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 928 transition count 1521
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 928 transition count 1521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 928 transition count 1518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 926 transition count 1516
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 926 transition count 1516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 925 transition count 1515
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 925 transition count 1515
Applied a total of 33 rules in 87 ms. Remains 925 /940 variables (removed 15) and now considering 1515/1533 (removed 18) transitions.
// Phase 1: matrix 1515 rows 925 cols
[2024-05-21 03:29:24] [INFO ] Computed 5 invariants in 14 ms
[2024-05-21 03:29:24] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 03:29:24] [INFO ] Invariant cache hit.
[2024-05-21 03:29:25] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2024-05-21 03:29:25] [INFO ] Invariant cache hit.
[2024-05-21 03:29:26] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 925/940 places, 1515/1533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1587 ms. Remains : 925/940 places, 1515/1533 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), p1, (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(OR p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=p0, acceptance={0} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s417 1), p2:(OR (EQ s606 0) (EQ s89 1)), p1:(OR (EQ s384 0) (EQ s433 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 631 reset in 318 ms.
Product exploration explored 100000 steps with 625 reset in 393 ms.
Computed a total of 136 stabilizing places and 476 stable transitions
Graph (complete) has 2713 edges and 925 vertex of which 918 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Computed a total of 136 stabilizing places and 476 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (OR p0 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Incomplete random walk after 10000 steps, including 60 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 03:29:27] [INFO ] Invariant cache hit.
[2024-05-21 03:29:27] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 03:29:28] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-21 03:29:28] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 03:29:28] [INFO ] After 897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-21 03:29:29] [INFO ] After 1251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 925 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 925/925 places, 1515/1515 transitions.
Graph (trivial) has 956 edges and 925 vertex of which 336 / 925 are part of one of the 40 SCC in 1 ms
Free SCC test removed 296 places
Drop transitions removed 386 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 388 transitions.
Graph (complete) has 2193 edges and 629 vertex of which 622 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 268 rules applied. Total rules applied 270 place count 622 transition count 859
Reduce places removed 259 places and 0 transitions.
Iterating post reduction 1 with 259 rules applied. Total rules applied 529 place count 363 transition count 859
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 529 place count 363 transition count 802
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 643 place count 306 transition count 802
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 648 place count 301 transition count 797
Iterating global reduction 2 with 5 rules applied. Total rules applied 653 place count 301 transition count 797
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 653 place count 301 transition count 793
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 661 place count 297 transition count 793
Performed 87 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 835 place count 210 transition count 705
Performed 39 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 913 place count 171 transition count 930
Drop transitions removed 18 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 952 place count 171 transition count 891
Drop transitions removed 170 transitions
Redundant transition composition rules discarded 170 transitions
Iterating global reduction 3 with 170 rules applied. Total rules applied 1122 place count 171 transition count 721
Free-agglomeration rule applied 49 times with reduction of 20 identical transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 1171 place count 171 transition count 652
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 92 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 127 transitions.
Graph (complete) has 928 edges and 122 vertex of which 121 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 3 with 177 rules applied. Total rules applied 1348 place count 121 transition count 525
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1349 place count 121 transition count 524
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1351 place count 119 transition count 512
Iterating global reduction 5 with 2 rules applied. Total rules applied 1353 place count 119 transition count 512
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 1428 place count 119 transition count 437
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1430 place count 119 transition count 437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1431 place count 118 transition count 436
Applied a total of 1431 rules in 127 ms. Remains 118 /925 variables (removed 807) and now considering 436/1515 (removed 1079) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 118/925 places, 436/1515 transitions.
Finished random walk after 1411 steps, including 21 resets, run visited all 4 properties in 6 ms. (steps per millisecond=235 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (OR p0 (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0)))), (F (OR (NOT p2) p0)), (F (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 289 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Support contains 5 out of 925 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 925/925 places, 1515/1515 transitions.
Graph (trivial) has 956 edges and 925 vertex of which 336 / 925 are part of one of the 40 SCC in 4 ms
Free SCC test removed 296 places
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Graph (complete) has 2318 edges and 629 vertex of which 622 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 621 transition count 921
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 1 with 255 rules applied. Total rules applied 512 place count 366 transition count 921
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 512 place count 366 transition count 870
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 614 place count 315 transition count 870
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 615 place count 314 transition count 869
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 314 transition count 869
Performed 100 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 816 place count 214 transition count 768
Performed 29 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 874 place count 185 transition count 869
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 879 place count 185 transition count 864
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 3 with 66 rules applied. Total rules applied 945 place count 185 transition count 798
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 953 place count 181 transition count 866
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 3 with 64 rules applied. Total rules applied 1017 place count 181 transition count 802
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1018 place count 180 transition count 801
Applied a total of 1018 rules in 150 ms. Remains 180 /925 variables (removed 745) and now considering 801/1515 (removed 714) transitions.
[2024-05-21 03:29:30] [INFO ] Flow matrix only has 597 transitions (discarded 204 similar events)
// Phase 1: matrix 597 rows 180 cols
[2024-05-21 03:29:30] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 03:29:30] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 03:29:30] [INFO ] Flow matrix only has 597 transitions (discarded 204 similar events)
[2024-05-21 03:29:30] [INFO ] Invariant cache hit.
[2024-05-21 03:29:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:29:30] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-21 03:29:31] [INFO ] Redundant transitions in 535 ms returned []
[2024-05-21 03:29:31] [INFO ] Flow matrix only has 597 transitions (discarded 204 similar events)
[2024-05-21 03:29:31] [INFO ] Invariant cache hit.
[2024-05-21 03:29:31] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/925 places, 801/1515 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1501 ms. Remains : 180/925 places, 801/1515 transitions.
Computed a total of 52 stabilizing places and 504 stable transitions
Computed a total of 52 stabilizing places and 504 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1))))), (X p1), (X (X (NOT (OR (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 115 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Incomplete random walk after 10000 steps, including 325 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2024-05-21 03:29:31] [INFO ] Flow matrix only has 597 transitions (discarded 204 similar events)
[2024-05-21 03:29:31] [INFO ] Invariant cache hit.
[2024-05-21 03:29:32] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:29:32] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-21 03:29:32] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:29:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:29:32] [INFO ] After 19ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:29:32] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-21 03:29:32] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 801/801 transitions.
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 180 transition count 743
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 78 place count 170 transition count 823
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 88 place count 170 transition count 813
Drop transitions removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 173 place count 170 transition count 728
Free-agglomeration rule applied 49 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 222 place count 170 transition count 659
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 92 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 127 transitions.
Graph (complete) has 907 edges and 121 vertex of which 120 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 2 with 177 rules applied. Total rules applied 399 place count 120 transition count 532
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 400 place count 120 transition count 531
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 402 place count 118 transition count 519
Iterating global reduction 4 with 2 rules applied. Total rules applied 404 place count 118 transition count 519
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 479 place count 118 transition count 444
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 481 place count 118 transition count 444
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 482 place count 118 transition count 443
Applied a total of 482 rules in 79 ms. Remains 118 /180 variables (removed 62) and now considering 443/801 (removed 358) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 118/180 places, 443/801 transitions.
Finished random walk after 1310 steps, including 21 resets, run visited all 1 properties in 4 ms. (steps per millisecond=327 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1))))), (X p1), (X (X (NOT (OR (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p2))), (F (OR p0 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 300 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Product exploration explored 100000 steps with 3067 reset in 407 ms.
Product exploration explored 100000 steps with 3049 reset in 379 ms.
Built C files in :
/tmp/ltsmin15519238471182033729
[2024-05-21 03:29:34] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2024-05-21 03:29:34] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:29:34] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2024-05-21 03:29:34] [INFO ] Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:29:34] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2024-05-21 03:29:34] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:29:34] [INFO ] Built C files in 224ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15519238471182033729
Running compilation step : cd /tmp/ltsmin15519238471182033729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2610 ms.
Running link step : cd /tmp/ltsmin15519238471182033729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin15519238471182033729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13350293982489458516.hoa' '--buchi-type=spotba'
LTSmin run took 8814 ms.
FORMULA CloudDeployment-PT-5b-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-5b-LTLCardinality-09 finished in 21339 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) U X((!p1&&F(G(p1))))))'
Support contains 4 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1533/1533 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 925 transition count 1518
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 925 transition count 1518
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 925 transition count 1515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 921 transition count 1511
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 921 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 920 transition count 1510
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 920 transition count 1510
Applied a total of 43 rules in 89 ms. Remains 920 /940 variables (removed 20) and now considering 1510/1533 (removed 23) transitions.
// Phase 1: matrix 1510 rows 920 cols
[2024-05-21 03:29:45] [INFO ] Computed 5 invariants in 15 ms
[2024-05-21 03:29:46] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-21 03:29:46] [INFO ] Invariant cache hit.
[2024-05-21 03:29:46] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2024-05-21 03:29:46] [INFO ] Invariant cache hit.
[2024-05-21 03:29:47] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 920/940 places, 1510/1533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1645 ms. Remains : 920/940 places, 1510/1533 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s512 1)), p1:(OR (EQ s301 0) (EQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLCardinality-11 finished in 1911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(X((F((X(!p1) U p2))||G(p2))))))'
Support contains 4 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1533/1533 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 927 transition count 1520
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 927 transition count 1520
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 927 transition count 1517
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 923 transition count 1513
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 923 transition count 1513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 922 transition count 1512
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 922 transition count 1512
Applied a total of 39 rules in 107 ms. Remains 922 /940 variables (removed 18) and now considering 1512/1533 (removed 21) transitions.
// Phase 1: matrix 1512 rows 922 cols
[2024-05-21 03:29:47] [INFO ] Computed 5 invariants in 12 ms
[2024-05-21 03:29:47] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 03:29:47] [INFO ] Invariant cache hit.
[2024-05-21 03:29:48] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
[2024-05-21 03:29:48] [INFO ] Invariant cache hit.
[2024-05-21 03:29:49] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 922/940 places, 1512/1533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1593 ms. Remains : 922/940 places, 1512/1533 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(OR (EQ s191 0) (EQ s819 1)), p0:(AND (EQ s274 0) (EQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 839 ms.
Product exploration explored 100000 steps with 50000 reset in 845 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2712 edges and 922 vertex of which 915 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.16 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLCardinality-12 finished in 3476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(p1&&G(p2)))))'
Support contains 6 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1533/1533 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 927 transition count 1520
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 927 transition count 1520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 927 transition count 1519
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 923 transition count 1515
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 923 transition count 1515
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 922 transition count 1514
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 922 transition count 1514
Applied a total of 37 rules in 84 ms. Remains 922 /940 variables (removed 18) and now considering 1514/1533 (removed 19) transitions.
// Phase 1: matrix 1514 rows 922 cols
[2024-05-21 03:29:51] [INFO ] Computed 5 invariants in 13 ms
[2024-05-21 03:29:51] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 03:29:51] [INFO ] Invariant cache hit.
[2024-05-21 03:29:52] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2024-05-21 03:29:52] [INFO ] Invariant cache hit.
[2024-05-21 03:29:52] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 922/940 places, 1514/1533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1571 ms. Remains : 922/940 places, 1514/1533 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s175 0) (EQ s701 1)), p1:(OR (EQ s838 0) (EQ s323 1)), p2:(OR (EQ s700 0) (EQ s717 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 586 ms.
Product exploration explored 100000 steps with 33333 reset in 582 ms.
Computed a total of 134 stabilizing places and 474 stable transitions
Graph (complete) has 2714 edges and 922 vertex of which 915 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Computed a total of 134 stabilizing places and 474 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLCardinality-13 finished in 2970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 940/940 places, 1533/1533 transitions.
Graph (trivial) has 977 edges and 940 vertex of which 356 / 940 are part of one of the 40 SCC in 3 ms
Free SCC test removed 316 places
Ensure Unique test removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 2319 edges and 624 vertex of which 617 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 616 transition count 916
Reduce places removed 253 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 254 rules applied. Total rules applied 509 place count 363 transition count 915
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 510 place count 362 transition count 915
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 510 place count 362 transition count 865
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 610 place count 312 transition count 865
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 618 place count 304 transition count 857
Iterating global reduction 3 with 8 rules applied. Total rules applied 626 place count 304 transition count 857
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 628 place count 304 transition count 855
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 628 place count 304 transition count 854
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 630 place count 303 transition count 854
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 822 place count 207 transition count 758
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 872 place count 182 transition count 833
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 912 place count 182 transition count 793
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 920 place count 178 transition count 861
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 984 place count 178 transition count 797
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 985 place count 177 transition count 796
Applied a total of 985 rules in 116 ms. Remains 177 /940 variables (removed 763) and now considering 796/1533 (removed 737) transitions.
[2024-05-21 03:29:54] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
// Phase 1: matrix 612 rows 177 cols
[2024-05-21 03:29:54] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 03:29:54] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 03:29:54] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 03:29:54] [INFO ] Invariant cache hit.
[2024-05-21 03:29:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:29:54] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-21 03:29:55] [INFO ] Redundant transitions in 451 ms returned []
[2024-05-21 03:29:55] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 03:29:55] [INFO ] Invariant cache hit.
[2024-05-21 03:29:55] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/940 places, 796/1533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1212 ms. Remains : 177/940 places, 796/1533 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s134 0) (AND (EQ s87 0) (EQ s141 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3022 reset in 326 ms.
Product exploration explored 100000 steps with 3073 reset in 336 ms.
Computed a total of 53 stabilizing places and 504 stable transitions
Computed a total of 53 stabilizing places and 504 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1033272 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{}
Probabilistic random walk after 1033272 steps, saw 142551 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:29:59] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 03:29:59] [INFO ] Invariant cache hit.
[2024-05-21 03:29:59] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:29:59] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:29:59] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:29:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:29:59] [INFO ] After 19ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:29:59] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-21 03:29:59] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 796/796 transitions.
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 177 transition count 736
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 82 place count 166 transition count 829
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 93 place count 166 transition count 818
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 2 with 96 rules applied. Total rules applied 189 place count 166 transition count 722
Free-agglomeration rule applied 50 times with reduction of 19 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 239 place count 166 transition count 653
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 93 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 890 edges and 116 vertex of which 115 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 2 with 189 rules applied. Total rules applied 428 place count 115 transition count 515
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 429 place count 115 transition count 514
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 433 place count 111 transition count 490
Iterating global reduction 4 with 4 rules applied. Total rules applied 437 place count 111 transition count 490
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 512 place count 111 transition count 415
Applied a total of 512 rules in 51 ms. Remains 111 /177 variables (removed 66) and now considering 415/796 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 111/177 places, 415/796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 398 steps, run visited all 1 properties in 6 ms. (steps per millisecond=66 )
Probabilistic random walk after 398 steps, saw 307 distinct states, run finished after 6 ms. (steps per millisecond=66 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 796/796 transitions.
Applied a total of 0 rules in 19 ms. Remains 177 /177 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2024-05-21 03:29:59] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 03:29:59] [INFO ] Invariant cache hit.
[2024-05-21 03:30:00] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 03:30:00] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 03:30:00] [INFO ] Invariant cache hit.
[2024-05-21 03:30:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:30:00] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-21 03:30:00] [INFO ] Redundant transitions in 521 ms returned []
[2024-05-21 03:30:00] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 03:30:00] [INFO ] Invariant cache hit.
[2024-05-21 03:30:01] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1167 ms. Remains : 177/177 places, 796/796 transitions.
Computed a total of 53 stabilizing places and 504 stable transitions
Computed a total of 53 stabilizing places and 504 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 330 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1050447 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 1050447 steps, saw 144864 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:30:04] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 03:30:04] [INFO ] Invariant cache hit.
[2024-05-21 03:30:04] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:30:04] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-21 03:30:04] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:30:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:30:04] [INFO ] After 21ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:30:04] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 03:30:04] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 796/796 transitions.
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 177 transition count 736
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 82 place count 166 transition count 829
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 93 place count 166 transition count 818
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 2 with 96 rules applied. Total rules applied 189 place count 166 transition count 722
Free-agglomeration rule applied 50 times with reduction of 19 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 239 place count 166 transition count 653
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 93 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 890 edges and 116 vertex of which 115 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 2 with 189 rules applied. Total rules applied 428 place count 115 transition count 515
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 429 place count 115 transition count 514
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 433 place count 111 transition count 490
Iterating global reduction 4 with 4 rules applied. Total rules applied 437 place count 111 transition count 490
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 512 place count 111 transition count 415
Applied a total of 512 rules in 54 ms. Remains 111 /177 variables (removed 66) and now considering 415/796 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 111/177 places, 415/796 transitions.
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3072 reset in 333 ms.
Product exploration explored 100000 steps with 3071 reset in 335 ms.
Built C files in :
/tmp/ltsmin14297614026311267461
[2024-05-21 03:30:05] [INFO ] Computing symmetric may disable matrix : 796 transitions.
[2024-05-21 03:30:05] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:30:05] [INFO ] Computing symmetric may enable matrix : 796 transitions.
[2024-05-21 03:30:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:30:05] [INFO ] Computing Do-Not-Accords matrix : 796 transitions.
[2024-05-21 03:30:05] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:30:05] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14297614026311267461
Running compilation step : cd /tmp/ltsmin14297614026311267461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2530 ms.
Running link step : cd /tmp/ltsmin14297614026311267461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14297614026311267461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18066166847064171245.hoa' '--buchi-type=spotba'
LTSmin run took 4514 ms.
FORMULA CloudDeployment-PT-5b-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-5b-LTLCardinality-15 finished in 18865 ms.
All properties solved by simple procedures.
Total runtime 60574 ms.

BK_STOP 1716262213964

--------------------
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-5b"
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-5b, 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-171620522100372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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