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-171620522100373.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620522100373
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716262205978

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 03:30:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:30:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:30:07] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-21 03:30:07] [INFO ] Transformed 1525 places.
[2024-05-21 03:30:07] [INFO ] Transformed 3132 transitions.
[2024-05-21 03:30:07] [INFO ] Found NUPN structural information;
[2024-05-21 03:30:07] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudDeployment-PT-5b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1520 transition count 3132
Discarding 396 places :
Symmetric choice reduction at 1 with 396 rule applications. Total rules 401 place count 1124 transition count 2736
Iterating global reduction 1 with 396 rules applied. Total rules applied 797 place count 1124 transition count 2736
Discarding 152 places :
Symmetric choice reduction at 1 with 152 rule applications. Total rules 949 place count 972 transition count 2584
Iterating global reduction 1 with 152 rules applied. Total rules applied 1101 place count 972 transition count 2584
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 1120 place count 972 transition count 2565
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1137 place count 955 transition count 2548
Iterating global reduction 2 with 17 rules applied. Total rules applied 1154 place count 955 transition count 2548
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1155 place count 954 transition count 2547
Iterating global reduction 2 with 1 rules applied. Total rules applied 1156 place count 954 transition count 2547
Applied a total of 1156 rules in 379 ms. Remains 954 /1525 variables (removed 571) and now considering 2547/3132 (removed 585) transitions.
// Phase 1: matrix 2547 rows 954 cols
[2024-05-21 03:30:08] [INFO ] Computed 16 invariants in 54 ms
[2024-05-21 03:30:08] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-21 03:30:08] [INFO ] Invariant cache hit.
[2024-05-21 03:30:09] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
[2024-05-21 03:30:09] [INFO ] Invariant cache hit.
[2024-05-21 03:30:10] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 954/1525 places, 2547/3132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2602 ms. Remains : 954/1525 places, 2547/3132 transitions.
Support contains 56 out of 954 places after structural reductions.
[2024-05-21 03:30:11] [INFO ] Flatten gal took : 430 ms
[2024-05-21 03:30:11] [INFO ] Flatten gal took : 281 ms
[2024-05-21 03:30:12] [INFO ] Input system was already deterministic with 2547 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 28) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2024-05-21 03:30:12] [INFO ] Invariant cache hit.
[2024-05-21 03:30:13] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 8 ms returned sat
[2024-05-21 03:30:13] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-21 03:30:14] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 6 ms returned sat
[2024-05-21 03:30:16] [INFO ] After 1701ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :14
[2024-05-21 03:30:17] [INFO ] After 3333ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :14
Attempting to minimize the solution found.
Minimization took 916 ms.
[2024-05-21 03:30:18] [INFO ] After 4997ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :14
Fused 22 Parikh solutions to 13 different solutions.
Parikh walk visited 9 properties in 189 ms.
Support contains 5 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 974 edges and 954 vertex of which 333 / 954 are part of one of the 38 SCC in 5 ms
Free SCC test removed 295 places
Drop transitions removed 1400 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1401 transitions.
Graph (complete) has 2406 edges and 659 vertex of which 631 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 287 rules applied. Total rules applied 289 place count 631 transition count 859
Reduce places removed 267 places and 0 transitions.
Iterating post reduction 1 with 267 rules applied. Total rules applied 556 place count 364 transition count 859
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 556 place count 364 transition count 805
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 664 place count 310 transition count 805
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 672 place count 302 transition count 797
Iterating global reduction 2 with 8 rules applied. Total rules applied 680 place count 302 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 681 place count 302 transition count 796
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 681 place count 302 transition count 790
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 693 place count 296 transition count 790
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 865 place count 210 transition count 704
Performed 36 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 937 place count 174 transition count 915
Drop transitions removed 13 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 968 place count 174 transition count 884
Drop transitions removed 150 transitions
Redundant transition composition rules discarded 150 transitions
Iterating global reduction 4 with 150 rules applied. Total rules applied 1118 place count 174 transition count 734
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 1120 place count 173 transition count 745
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1121 place count 173 transition count 744
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1131 place count 173 transition count 734
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1132 place count 172 transition count 727
Iterating global reduction 5 with 1 rules applied. Total rules applied 1133 place count 172 transition count 727
Free-agglomeration rule applied 51 times with reduction of 20 identical transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1184 place count 172 transition count 656
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 96 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 141 transitions.
Graph (complete) has 925 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 5 with 193 rules applied. Total rules applied 1377 place count 120 transition count 515
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1378 place count 120 transition count 514
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1382 place count 116 transition count 490
Iterating global reduction 7 with 4 rules applied. Total rules applied 1386 place count 116 transition count 490
Drop transitions removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 7 with 84 rules applied. Total rules applied 1470 place count 116 transition count 406
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1471 place count 116 transition count 406
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1472 place count 115 transition count 405
Applied a total of 1472 rules in 247 ms. Remains 115 /954 variables (removed 839) and now considering 405/2547 (removed 2142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 115/954 places, 405/2547 transitions.
Finished random walk after 1045 steps, including 12 resets, run visited all 5 properties in 13 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-5b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 153 stabilizing places and 1505 stable transitions
Graph (complete) has 2930 edges and 954 vertex of which 926 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.30 ms
FORMULA CloudDeployment-PT-5b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F(p0)))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 933 transition count 1514
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 933 transition count 1514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 933 transition count 1513
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 929 transition count 1509
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 929 transition count 1509
Applied a total of 50 rules in 64 ms. Remains 929 /954 variables (removed 25) and now considering 1509/2547 (removed 1038) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2024-05-21 03:30:19] [INFO ] Computed 15 invariants in 15 ms
[2024-05-21 03:30:19] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-21 03:30:19] [INFO ] Invariant cache hit.
[2024-05-21 03:30:20] [INFO ] Implicit Places using invariants and state equation in 801 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 999 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 919/954 places, 1509/2547 transitions.
Applied a total of 0 rules in 19 ms. Remains 919 /919 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1082 ms. Remains : 919/954 places, 1509/2547 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 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s186 1) (NEQ s365 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 962 ms.
Product exploration explored 100000 steps with 50000 reset in 851 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2707 edges and 919 vertex of which 912 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.15 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLFireability-00 finished in 3198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F((p0||G(p1)))||(p2&&X((p2 U (!p0||G(p2))))))))))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 935 transition count 1516
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 935 transition count 1516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 935 transition count 1515
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 933 transition count 1513
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 933 transition count 1513
Applied a total of 42 rules in 78 ms. Remains 933 /954 variables (removed 21) and now considering 1513/2547 (removed 1034) transitions.
// Phase 1: matrix 1513 rows 933 cols
[2024-05-21 03:30:22] [INFO ] Computed 15 invariants in 15 ms
[2024-05-21 03:30:22] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 03:30:22] [INFO ] Invariant cache hit.
[2024-05-21 03:30:23] [INFO ] Implicit Places using invariants and state equation in 790 ms returned [11, 19, 185, 193, 358, 366, 533, 541, 706, 716]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 980 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 923/954 places, 1513/2547 transitions.
Applied a total of 0 rules in 18 ms. Remains 923 /923 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1078 ms. Remains : 923/954 places, 1513/2547 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s386 1), p2:(NEQ s699 1), p1:(EQ s699 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 624 reset in 220 ms.
Product exploration explored 100000 steps with 621 reset in 295 ms.
Computed a total of 137 stabilizing places and 477 stable transitions
Graph (complete) has 2716 edges and 923 vertex of which 916 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.17 ms
Computed a total of 137 stabilizing places and 477 stable transitions
Detected a total of 137/923 stabilizing places and 477/1513 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 63 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Finished probabilistic random walk after 208253 steps, run visited all 3 properties in 1679 ms. (steps per millisecond=124 )
Probabilistic random walk after 208253 steps, saw 48287 distinct states, run finished after 1679 ms. (steps per millisecond=124 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 423 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 1513/1513 transitions.
Applied a total of 0 rules in 23 ms. Remains 923 /923 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
// Phase 1: matrix 1513 rows 923 cols
[2024-05-21 03:30:27] [INFO ] Computed 5 invariants in 14 ms
[2024-05-21 03:30:27] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 03:30:27] [INFO ] Invariant cache hit.
[2024-05-21 03:30:28] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2024-05-21 03:30:28] [INFO ] Invariant cache hit.
[2024-05-21 03:30:28] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1376 ms. Remains : 923/923 places, 1513/1513 transitions.
Computed a total of 137 stabilizing places and 477 stable transitions
Graph (complete) has 2716 edges and 923 vertex of which 916 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Computed a total of 137 stabilizing places and 477 stable transitions
Detected a total of 137/923 stabilizing places and 477/1513 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 63 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Finished probabilistic random walk after 208253 steps, run visited all 3 properties in 1656 ms. (steps per millisecond=125 )
Probabilistic random walk after 208253 steps, saw 48287 distinct states, run finished after 1657 ms. (steps per millisecond=125 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 418 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 612 reset in 189 ms.
Product exploration explored 100000 steps with 627 reset in 193 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 923/923 places, 1513/1513 transitions.
Graph (trivial) has 961 edges and 923 vertex of which 355 / 923 are part of one of the 40 SCC in 3 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2291 edges and 608 vertex of which 601 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 248 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 248 rules applied. Total rules applied 250 place count 601 transition count 1151
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 250 place count 601 transition count 1180
Deduced a syphon composed of 282 places in 1 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 284 place count 601 transition count 1180
Discarding 132 places :
Symmetric choice reduction at 1 with 132 rule applications. Total rules 416 place count 469 transition count 1048
Deduced a syphon composed of 150 places in 3 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 548 place count 469 transition count 1048
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 252 places in 1 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 650 place count 469 transition count 1048
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 727 place count 392 transition count 971
Deduced a syphon composed of 175 places in 1 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 804 place count 392 transition count 971
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 839 place count 392 transition count 1226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 844 place count 392 transition count 1221
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 884 place count 352 transition count 1096
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 924 place count 352 transition count 1096
Deduced a syphon composed of 170 places in 0 ms
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 2 with 75 rules applied. Total rules applied 999 place count 352 transition count 1021
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1009 place count 342 transition count 1011
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1019 place count 342 transition count 1011
Deduced a syphon composed of 160 places in 1 ms
Applied a total of 1019 rules in 171 ms. Remains 342 /923 variables (removed 581) and now considering 1011/1513 (removed 502) transitions.
[2024-05-21 03:30:33] [INFO ] Redundant transitions in 485 ms returned []
[2024-05-21 03:30:33] [INFO ] Flow matrix only has 852 transitions (discarded 159 similar events)
// Phase 1: matrix 852 rows 342 cols
[2024-05-21 03:30:33] [INFO ] Computed 5 invariants in 8 ms
[2024-05-21 03:30:33] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 342/923 places, 1011/1513 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 966 ms. Remains : 342/923 places, 1011/1513 transitions.
Built C files in :
/tmp/ltsmin15547712343993161837
[2024-05-21 03:30:33] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15547712343993161837
Running compilation step : cd /tmp/ltsmin15547712343993161837;'/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 2877 ms.
Running link step : cd /tmp/ltsmin15547712343993161837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15547712343993161837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13312050798647353211.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 1513/1513 transitions.
Applied a total of 0 rules in 32 ms. Remains 923 /923 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
// Phase 1: matrix 1513 rows 923 cols
[2024-05-21 03:30:48] [INFO ] Computed 5 invariants in 13 ms
[2024-05-21 03:30:48] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 03:30:48] [INFO ] Invariant cache hit.
[2024-05-21 03:30:49] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2024-05-21 03:30:49] [INFO ] Invariant cache hit.
[2024-05-21 03:30:50] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1388 ms. Remains : 923/923 places, 1513/1513 transitions.
Built C files in :
/tmp/ltsmin897552514273509231
[2024-05-21 03:30:50] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin897552514273509231
Running compilation step : cd /tmp/ltsmin897552514273509231;'/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 2599 ms.
Running link step : cd /tmp/ltsmin897552514273509231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin897552514273509231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10951364406160853368.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:31:05] [INFO ] Flatten gal took : 53 ms
[2024-05-21 03:31:05] [INFO ] Flatten gal took : 52 ms
[2024-05-21 03:31:05] [INFO ] Time to serialize gal into /tmp/LTL15047073571259443022.gal : 13 ms
[2024-05-21 03:31:05] [INFO ] Time to serialize properties into /tmp/LTL3267816982274754180.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15047073571259443022.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11227316565709311380.hoa' '-atoms' '/tmp/LTL3267816982274754180.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3267816982274754180.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11227316565709311380.hoa
Detected timeout of ITS tools.
[2024-05-21 03:31:20] [INFO ] Flatten gal took : 49 ms
[2024-05-21 03:31:20] [INFO ] Flatten gal took : 51 ms
[2024-05-21 03:31:20] [INFO ] Time to serialize gal into /tmp/LTL4208278023971664469.gal : 9 ms
[2024-05-21 03:31:20] [INFO ] Time to serialize properties into /tmp/LTL11917947621282268742.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4208278023971664469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11917947621282268742.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F(("(p682==1)")||(G("(p1183==0)"))))||(("(p1183!=1)")&&(X(("(p1183!=1)")U(("(p682!=1)")||(G("(p1183!=1)")))))))))))
Formula 0 simplified : XXF(G(!"(p682==1)" & F!"(p1183==0)") & (!"(p1183!=1)" | X(!"(p1183!=1)" M !"(p682!=1)")))
Detected timeout of ITS tools.
[2024-05-21 03:31:35] [INFO ] Flatten gal took : 46 ms
[2024-05-21 03:31:35] [INFO ] Applying decomposition
[2024-05-21 03:31:35] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1739218116395067699.txt' '-o' '/tmp/graph1739218116395067699.bin' '-w' '/tmp/graph1739218116395067699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1739218116395067699.bin' '-l' '-1' '-v' '-w' '/tmp/graph1739218116395067699.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:31:36] [INFO ] Decomposing Gal with order
[2024-05-21 03:31:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:31:36] [INFO ] Removed a total of 1698 redundant transitions.
[2024-05-21 03:31:36] [INFO ] Flatten gal took : 134 ms
[2024-05-21 03:31:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 30 ms.
[2024-05-21 03:31:36] [INFO ] Time to serialize gal into /tmp/LTL703112644148027306.gal : 13 ms
[2024-05-21 03:31:36] [INFO ] Time to serialize properties into /tmp/LTL16056177539132687383.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL703112644148027306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16056177539132687383.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F(("(i11.i0.i0.u141.p682==1)")||(G("(i23.u262.p1183==0)"))))||(("(i23.u262.p1183!=1)")&&(X(("(i23.u262.p1183!=1)")U(("(i11.i...212
Formula 0 simplified : XXF(G(!"(i11.i0.i0.u141.p682==1)" & F!"(i23.u262.p1183==0)") & (!"(i23.u262.p1183!=1)" | X(!"(i23.u262.p1183!=1)" M !"(i11.i0.i0.u14...169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10201892454119273614
[2024-05-21 03:31:51] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10201892454119273614
Running compilation step : cd /tmp/ltsmin10201892454119273614;'/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 2641 ms.
Running link step : cd /tmp/ltsmin10201892454119273614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10201892454119273614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((<>(((LTLAPp0==true)||[]((LTLAPp1==true))))||((LTLAPp2==true)&&X(((LTLAPp2==true) U (!(LTLAPp0==true)||[]((LTLAPp2==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CloudDeployment-PT-5b-LTLFireability-01 finished in 104069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1) U X(p2))))'
Support contains 3 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 934 transition count 1515
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 934 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 930 transition count 1510
Applied a total of 48 rules in 78 ms. Remains 930 /954 variables (removed 24) and now considering 1510/2547 (removed 1037) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2024-05-21 03:32:06] [INFO ] Computed 15 invariants in 10 ms
[2024-05-21 03:32:06] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-21 03:32:06] [INFO ] Invariant cache hit.
[2024-05-21 03:32:07] [INFO ] Implicit Places using invariants and state equation in 780 ms returned [11, 19, 185, 193, 359, 367, 532, 540, 705, 713]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 975 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 920/954 places, 1510/2547 transitions.
Applied a total of 0 rules in 18 ms. Remains 920 /920 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1071 ms. Remains : 920/954 places, 1510/2547 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s191 1), p0:(AND (EQ s200 1) (EQ s191 1)), p2:(EQ s152 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 246 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-03 finished in 1330 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(((p1 U X(G(!p2)))&&p0)))'
Support contains 24 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 945 transition count 2538
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 945 transition count 2538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 945 transition count 2537
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 941 transition count 2533
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 941 transition count 2533
Applied a total of 27 rules in 69 ms. Remains 941 /954 variables (removed 13) and now considering 2533/2547 (removed 14) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2024-05-21 03:32:08] [INFO ] Computed 16 invariants in 21 ms
[2024-05-21 03:32:08] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-21 03:32:08] [INFO ] Invariant cache hit.
[2024-05-21 03:32:10] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
[2024-05-21 03:32:10] [INFO ] Invariant cache hit.
[2024-05-21 03:32:11] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 941/954 places, 2533/2547 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3443 ms. Remains : 941/954 places, 2533/2547 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s869 0) (OR (EQ s13 0) (EQ s22 0) (EQ s42 0) (EQ s187 0) (EQ s198 0) (EQ s218 0) (EQ s362 0) (EQ s373 0) (EQ s393 0) (EQ s537 0) (EQ s548 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 613 reset in 374 ms.
Product exploration explored 100000 steps with 624 reset in 396 ms.
Computed a total of 145 stabilizing places and 1497 stable transitions
Graph (complete) has 2908 edges and 941 vertex of which 913 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Computed a total of 145 stabilizing places and 1497 stable transitions
Detected a total of 145/941 stabilizing places and 1497/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 454 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-21 03:32:13] [INFO ] Invariant cache hit.
[2024-05-21 03:32:13] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2024-05-21 03:32:14] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-21 03:32:15] [INFO ] After 1256ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-05-21 03:32:16] [INFO ] After 2247ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 655 ms.
[2024-05-21 03:32:17] [INFO ] After 3210ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Graph (trivial) has 950 edges and 941 vertex of which 346 / 941 are part of one of the 39 SCC in 1 ms
Free SCC test removed 307 places
Drop transitions removed 391 transitions
Reduce isomorphic transitions removed 391 transitions.
Graph (complete) has 2392 edges and 634 vertex of which 633 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 633 transition count 1890
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 250 rules applied. Total rules applied 504 place count 386 transition count 1887
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 506 place count 384 transition count 1887
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 506 place count 384 transition count 1825
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 630 place count 322 transition count 1825
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 802 place count 236 transition count 1739
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 872 place count 201 transition count 1949
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 904 place count 201 transition count 1917
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 4 with 130 rules applied. Total rules applied 1034 place count 201 transition count 1787
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1082 place count 201 transition count 1727
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 4 with 166 rules applied. Total rules applied 1248 place count 153 transition count 1609
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1255 place count 146 transition count 1562
Iterating global reduction 5 with 7 rules applied. Total rules applied 1262 place count 146 transition count 1562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1264 place count 146 transition count 1560
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 6 with 61 rules applied. Total rules applied 1325 place count 146 transition count 1499
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1327 place count 146 transition count 1499
Applied a total of 1327 rules in 223 ms. Remains 146 /941 variables (removed 795) and now considering 1499/2533 (removed 1034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 146/941 places, 1499/2533 transitions.
Incomplete random walk after 10000 steps, including 251 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 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 24 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 441025 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 441025 steps, saw 65615 distinct states, run finished after 3002 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-21 03:32:21] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
// Phase 1: matrix 1299 rows 146 cols
[2024-05-21 03:32:21] [INFO ] Computed 21 invariants in 9 ms
[2024-05-21 03:32:21] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 03:32:21] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 3 ms returned sat
[2024-05-21 03:32:21] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-21 03:32:21] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-05-21 03:32:22] [INFO ] After 347ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-21 03:32:22] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 310 ms.
[2024-05-21 03:32:22] [INFO ] After 1716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 22 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 146/146 places, 1499/1499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 22 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
[2024-05-21 03:32:23] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-21 03:32:23] [INFO ] Invariant cache hit.
[2024-05-21 03:32:23] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-21 03:32:23] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-21 03:32:23] [INFO ] Invariant cache hit.
[2024-05-21 03:32:23] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-05-21 03:32:24] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2024-05-21 03:32:24] [INFO ] Redundant transitions in 155 ms returned []
[2024-05-21 03:32:24] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-21 03:32:24] [INFO ] Invariant cache hit.
[2024-05-21 03:32:25] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2284 ms. Remains : 146/146 places, 1499/1499 transitions.
Graph (trivial) has 108 edges and 146 vertex of which 32 / 146 are part of one of the 4 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions removed 44 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 244 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 118 transition count 1246
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 109 transition count 1244
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 107 transition count 1243
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 107 transition count 1235
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 99 transition count 1235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 96 transition count 1232
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 96 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 93 transition count 1214
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 93 transition count 1214
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 94 place count 93 transition count 1172
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 108 place count 86 transition count 1163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 114 place count 86 transition count 1157
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 83 transition count 1172
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 155 place count 83 transition count 1137
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 155 place count 83 transition count 1134
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 161 place count 80 transition count 1134
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 80 transition count 1132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 78 transition count 1132
Applied a total of 165 rules in 80 ms. Remains 78 /146 variables (removed 68) and now considering 1132/1499 (removed 367) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1132 rows 78 cols
[2024-05-21 03:32:25] [INFO ] Computed 21 invariants in 17 ms
[2024-05-21 03:32:25] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 03:32:25] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 2 ms returned sat
[2024-05-21 03:32:26] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-21 03:32:26] [INFO ] After 730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 207 ms.
[2024-05-21 03:32:26] [INFO ] After 987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 28 factoid took 1015 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Applied a total of 0 rules in 23 ms. Remains 941 /941 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2024-05-21 03:32:27] [INFO ] Computed 16 invariants in 11 ms
[2024-05-21 03:32:28] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-21 03:32:28] [INFO ] Invariant cache hit.
[2024-05-21 03:32:30] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2458 ms to find 0 implicit places.
[2024-05-21 03:32:30] [INFO ] Invariant cache hit.
[2024-05-21 03:32:31] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3357 ms. Remains : 941/941 places, 2533/2533 transitions.
Computed a total of 145 stabilizing places and 1497 stable transitions
Graph (complete) has 2908 edges and 941 vertex of which 913 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Computed a total of 145 stabilizing places and 1497 stable transitions
Detected a total of 145/941 stabilizing places and 1497/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p2)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 304 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 03:32:32] [INFO ] Invariant cache hit.
[2024-05-21 03:32:32] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 03:32:32] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 6 ms returned sat
[2024-05-21 03:32:33] [INFO ] After 1299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 03:32:34] [INFO ] After 2187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 548 ms.
[2024-05-21 03:32:35] [INFO ] After 2984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 3 properties in 50 ms.
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Graph (trivial) has 950 edges and 941 vertex of which 346 / 941 are part of one of the 39 SCC in 1 ms
Free SCC test removed 307 places
Drop transitions removed 391 transitions
Reduce isomorphic transitions removed 391 transitions.
Graph (complete) has 2392 edges and 634 vertex of which 633 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 633 transition count 1890
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 250 rules applied. Total rules applied 504 place count 386 transition count 1887
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 506 place count 384 transition count 1887
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 506 place count 384 transition count 1825
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 630 place count 322 transition count 1825
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 802 place count 236 transition count 1739
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 872 place count 201 transition count 1949
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 904 place count 201 transition count 1917
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 4 with 130 rules applied. Total rules applied 1034 place count 201 transition count 1787
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1082 place count 201 transition count 1727
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 4 with 166 rules applied. Total rules applied 1248 place count 153 transition count 1609
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1255 place count 146 transition count 1562
Iterating global reduction 5 with 7 rules applied. Total rules applied 1262 place count 146 transition count 1562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1264 place count 146 transition count 1560
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 6 with 61 rules applied. Total rules applied 1325 place count 146 transition count 1499
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1327 place count 146 transition count 1499
Applied a total of 1327 rules in 188 ms. Remains 146 /941 variables (removed 795) and now considering 1499/2533 (removed 1034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 146/941 places, 1499/2533 transitions.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 597043 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 597043 steps, saw 84726 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 03:32:38] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
// Phase 1: matrix 1299 rows 146 cols
[2024-05-21 03:32:38] [INFO ] Computed 21 invariants in 8 ms
[2024-05-21 03:32:38] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:32:38] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 3 ms returned sat
[2024-05-21 03:32:39] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 03:32:39] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-05-21 03:32:39] [INFO ] After 163ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 03:32:39] [INFO ] After 365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 125 ms.
[2024-05-21 03:32:39] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 146/146 places, 1499/1499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
[2024-05-21 03:32:39] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-21 03:32:39] [INFO ] Invariant cache hit.
[2024-05-21 03:32:40] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-21 03:32:40] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-21 03:32:40] [INFO ] Invariant cache hit.
[2024-05-21 03:32:40] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-05-21 03:32:41] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2024-05-21 03:32:41] [INFO ] Redundant transitions in 157 ms returned []
[2024-05-21 03:32:41] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-21 03:32:41] [INFO ] Invariant cache hit.
[2024-05-21 03:32:41] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2338 ms. Remains : 146/146 places, 1499/1499 transitions.
Graph (trivial) has 108 edges and 146 vertex of which 32 / 146 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 44 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 244 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 118 transition count 1246
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 109 transition count 1244
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 107 transition count 1243
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 107 transition count 1235
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 99 transition count 1235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 96 transition count 1232
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 96 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 93 transition count 1214
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 93 transition count 1214
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 94 place count 93 transition count 1172
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 108 place count 86 transition count 1163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 114 place count 86 transition count 1157
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 83 transition count 1172
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 155 place count 83 transition count 1137
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 155 place count 83 transition count 1134
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 161 place count 80 transition count 1134
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 80 transition count 1132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 78 transition count 1132
Applied a total of 165 rules in 74 ms. Remains 78 /146 variables (removed 68) and now considering 1132/1499 (removed 367) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1132 rows 78 cols
[2024-05-21 03:32:42] [INFO ] Computed 21 invariants in 12 ms
[2024-05-21 03:32:42] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:32:42] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 3 ms returned sat
[2024-05-21 03:32:42] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 03:32:42] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-21 03:32:42] [INFO ] After 486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p2)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) p2)), (F (AND (NOT p1) p0 p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 18 factoid took 651 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Product exploration explored 100000 steps with 643 reset in 307 ms.
Product exploration explored 100000 steps with 628 reset in 299 ms.
Built C files in :
/tmp/ltsmin6192859113460985904
[2024-05-21 03:32:44] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6192859113460985904
Running compilation step : cd /tmp/ltsmin6192859113460985904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6192859113460985904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6192859113460985904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Applied a total of 0 rules in 23 ms. Remains 941 /941 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2024-05-21 03:32:47] [INFO ] Computed 16 invariants in 17 ms
[2024-05-21 03:32:48] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-21 03:32:48] [INFO ] Invariant cache hit.
[2024-05-21 03:32:49] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 2413 ms to find 0 implicit places.
[2024-05-21 03:32:49] [INFO ] Invariant cache hit.
[2024-05-21 03:32:50] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3296 ms. Remains : 941/941 places, 2533/2533 transitions.
Built C files in :
/tmp/ltsmin13343810127468799996
[2024-05-21 03:32:50] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13343810127468799996
Running compilation step : cd /tmp/ltsmin13343810127468799996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13343810127468799996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13343810127468799996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 03:32:54] [INFO ] Flatten gal took : 200 ms
[2024-05-21 03:32:54] [INFO ] Flatten gal took : 193 ms
[2024-05-21 03:32:54] [INFO ] Time to serialize gal into /tmp/LTL12569951604078835227.gal : 123 ms
[2024-05-21 03:32:54] [INFO ] Time to serialize properties into /tmp/LTL9609361866407630078.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12569951604078835227.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4725973300889105813.hoa' '-atoms' '/tmp/LTL9609361866407630078.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9609361866407630078.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4725973300889105813.hoa
Detected timeout of ITS tools.
[2024-05-21 03:33:09] [INFO ] Flatten gal took : 211 ms
[2024-05-21 03:33:10] [INFO ] Flatten gal took : 195 ms
[2024-05-21 03:33:10] [INFO ] Time to serialize gal into /tmp/LTL12908786263580396004.gal : 36 ms
[2024-05-21 03:33:10] [INFO ] Time to serialize properties into /tmp/LTL487592468937578015.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12908786263580396004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL487592468937578015.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((("(p1437==0)")&&(("(p1260==1)")U(X(G(!("(((((p49==1)&&(p87==1))&&((p245==1)&&(p1503==1)))&&(p1521==1))||(p1260==1))"))))))&&("((...377
Formula 0 simplified : G(!"((((((p27==0)||(p58==0))||((p95==0)||(p302==0)))||(((p348==0)||(p385==0))||((p592==0)||(p638==0))))||((((p675==0)||(p882==0))||(...364
Detected timeout of ITS tools.
[2024-05-21 03:33:25] [INFO ] Flatten gal took : 203 ms
[2024-05-21 03:33:25] [INFO ] Applying decomposition
[2024-05-21 03:33:25] [INFO ] Flatten gal took : 187 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16648319772665667370.txt' '-o' '/tmp/graph16648319772665667370.bin' '-w' '/tmp/graph16648319772665667370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16648319772665667370.bin' '-l' '-1' '-v' '-w' '/tmp/graph16648319772665667370.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:33:25] [INFO ] Decomposing Gal with order
[2024-05-21 03:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:33:26] [INFO ] Removed a total of 14367 redundant transitions.
[2024-05-21 03:33:26] [INFO ] Flatten gal took : 361 ms
[2024-05-21 03:33:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 183 ms.
[2024-05-21 03:33:26] [INFO ] Time to serialize gal into /tmp/LTL5251279276235022101.gal : 19 ms
[2024-05-21 03:33:26] [INFO ] Time to serialize properties into /tmp/LTL4000870707878367596.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5251279276235022101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4000870707878367596.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((("(i24.i1.i1.u322.p1437==0)")&&(("(i22.i0.i0.u269.p1260==1)")U(X(G(!("(((((i0.u5.p49==1)&&(i0.u7.p87==1))&&((i4.u54.p245==1)&&(i...642
Formula 0 simplified : G(!"((((((i0.u5.p27==0)||(i0.u7.p58==0))||((i4.u13.p95==0)||(i16.i1.i3.u204.p302==0)))||(((i6.u74.p348==0)||(i7.i1.i0.u77.p385==0))|...629
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5969039056799024236
[2024-05-21 03:33:41] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5969039056799024236
Running compilation step : cd /tmp/ltsmin5969039056799024236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5969039056799024236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5969039056799024236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CloudDeployment-PT-5b-LTLFireability-04 finished in 96757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G((X(p2)||p1))))))))'
Support contains 9 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 933 transition count 1514
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 933 transition count 1514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 933 transition count 1513
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 929 transition count 1509
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 929 transition count 1509
Applied a total of 50 rules in 73 ms. Remains 929 /954 variables (removed 25) and now considering 1509/2547 (removed 1038) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2024-05-21 03:33:44] [INFO ] Computed 15 invariants in 12 ms
[2024-05-21 03:33:45] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 03:33:45] [INFO ] Invariant cache hit.
[2024-05-21 03:33:45] [INFO ] Implicit Places using invariants and state equation in 742 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 915 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 919/954 places, 1509/2547 transitions.
Applied a total of 0 rules in 22 ms. Remains 919 /919 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1011 ms. Remains : 919/954 places, 1509/2547 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (OR (EQ s182 0) (EQ s189 0) (EQ s344 0) (EQ s876 0)) (OR (EQ s528 0) (EQ s544 0) (EQ s664 0) (EQ s898 0) (EQ s915 0))), p1:(OR (EQ s528 0) (EQ s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 613 reset in 246 ms.
Product exploration explored 100000 steps with 615 reset in 231 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2707 edges and 919 vertex of which 912 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 324929 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324929 steps, saw 75650 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1509 rows 919 cols
[2024-05-21 03:33:50] [INFO ] Computed 5 invariants in 11 ms
[2024-05-21 03:33:50] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 03:33:50] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-21 03:33:51] [INFO ] After 758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 03:33:51] [INFO ] After 1251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 360 ms.
[2024-05-21 03:33:52] [INFO ] After 1820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 9 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 1509/1509 transitions.
Graph (trivial) has 949 edges and 919 vertex of which 341 / 919 are part of one of the 38 SCC in 1 ms
Free SCC test removed 303 places
Drop transitions removed 395 transitions
Reduce isomorphic transitions removed 395 transitions.
Graph (complete) has 2196 edges and 616 vertex of which 609 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 10 transitions
Reduce isomorphic transitions removed 10 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 264 rules applied. Total rules applied 266 place count 609 transition count 850
Reduce places removed 254 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 257 rules applied. Total rules applied 523 place count 355 transition count 847
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 525 place count 353 transition count 847
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 525 place count 353 transition count 790
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 639 place count 296 transition count 790
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 644 place count 291 transition count 785
Iterating global reduction 3 with 5 rules applied. Total rules applied 649 place count 291 transition count 785
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 649 place count 291 transition count 781
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 657 place count 287 transition count 781
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 823 place count 204 transition count 698
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 893 place count 169 transition count 908
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 925 place count 169 transition count 876
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 927 place count 168 transition count 893
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 930 place count 168 transition count 890
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 1058 place count 168 transition count 762
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 5 with 43 rules applied. Total rules applied 1101 place count 168 transition count 707
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 5 with 161 rules applied. Total rules applied 1262 place count 125 transition count 589
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1269 place count 118 transition count 542
Iterating global reduction 6 with 7 rules applied. Total rules applied 1276 place count 118 transition count 542
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1278 place count 118 transition count 540
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 7 with 61 rules applied. Total rules applied 1339 place count 118 transition count 479
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1343 place count 118 transition count 479
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1346 place count 118 transition count 476
Applied a total of 1346 rules in 99 ms. Remains 118 /919 variables (removed 801) and now considering 476/1509 (removed 1033) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 118/919 places, 476/1509 transitions.
Incomplete random walk after 10000 steps, including 172 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:33:52] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
// Phase 1: matrix 276 rows 118 cols
[2024-05-21 03:33:52] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 03:33:52] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:33:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 03:33:52] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-21 03:33:52] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:33:52] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-21 03:33:52] [INFO ] After 66ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:33:52] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-21 03:33:52] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 118/118 places, 476/476 transitions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1043825 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1043825 steps, saw 130145 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:33:55] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2024-05-21 03:33:55] [INFO ] Invariant cache hit.
[2024-05-21 03:33:55] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:33:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 03:33:55] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-21 03:33:55] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:33:55] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-21 03:33:55] [INFO ] After 59ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:33:56] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-21 03:33:56] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/118 places, 476/476 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
[2024-05-21 03:33:56] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2024-05-21 03:33:56] [INFO ] Invariant cache hit.
[2024-05-21 03:33:56] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 03:33:56] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2024-05-21 03:33:56] [INFO ] Invariant cache hit.
[2024-05-21 03:33:56] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-21 03:33:56] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-21 03:33:56] [INFO ] Redundant transitions in 151 ms returned []
[2024-05-21 03:33:56] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2024-05-21 03:33:56] [INFO ] Invariant cache hit.
[2024-05-21 03:33:56] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 118/118 places, 476/476 transitions.
Graph (trivial) has 95 edges and 118 vertex of which 32 / 118 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 44 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 244 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 227
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 80 transition count 226
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 79 transition count 225
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 19 place count 79 transition count 216
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 37 place count 70 transition count 216
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 40 place count 67 transition count 213
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 67 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 65 transition count 211
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 65 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 64 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 64 transition count 205
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 66 place count 64 transition count 188
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 80 place count 57 transition count 181
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 87 place count 57 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 56 transition count 173
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 56 transition count 173
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 55 transition count 167
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 55 transition count 167
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 108 place count 55 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 52 transition count 168
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 50 transition count 117
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 50 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 50 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 173 place count 46 transition count 112
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 175 place count 44 transition count 96
Iterating global reduction 7 with 2 rules applied. Total rules applied 177 place count 44 transition count 96
Applied a total of 177 rules in 15 ms. Remains 44 /118 variables (removed 74) and now considering 96/476 (removed 380) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 96 rows 44 cols
[2024-05-21 03:33:56] [INFO ] Computed 11 invariants in 1 ms
[2024-05-21 03:33:56] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:33:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 03:33:56] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-21 03:33:56] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:33:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:33:56] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:33:56] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-21 03:33:56] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 9 out of 919 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 919/919 places, 1509/1509 transitions.
Applied a total of 0 rules in 22 ms. Remains 919 /919 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
// Phase 1: matrix 1509 rows 919 cols
[2024-05-21 03:33:57] [INFO ] Computed 5 invariants in 12 ms
[2024-05-21 03:33:57] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 03:33:57] [INFO ] Invariant cache hit.
[2024-05-21 03:33:58] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2024-05-21 03:33:58] [INFO ] Invariant cache hit.
[2024-05-21 03:33:58] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1341 ms. Remains : 919/919 places, 1509/1509 transitions.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2707 edges and 919 vertex of which 912 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 60 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 316287 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316287 steps, saw 73589 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 03:34:02] [INFO ] Invariant cache hit.
[2024-05-21 03:34:02] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 03:34:02] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-21 03:34:03] [INFO ] After 743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 03:34:03] [INFO ] After 1253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 354 ms.
[2024-05-21 03:34:04] [INFO ] After 1817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 25 ms.
Support contains 9 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 1509/1509 transitions.
Graph (trivial) has 949 edges and 919 vertex of which 341 / 919 are part of one of the 38 SCC in 1 ms
Free SCC test removed 303 places
Drop transitions removed 395 transitions
Reduce isomorphic transitions removed 395 transitions.
Graph (complete) has 2196 edges and 616 vertex of which 609 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 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 264 rules applied. Total rules applied 266 place count 609 transition count 850
Reduce places removed 254 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 257 rules applied. Total rules applied 523 place count 355 transition count 847
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 525 place count 353 transition count 847
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 525 place count 353 transition count 790
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 639 place count 296 transition count 790
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 644 place count 291 transition count 785
Iterating global reduction 3 with 5 rules applied. Total rules applied 649 place count 291 transition count 785
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 649 place count 291 transition count 781
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 657 place count 287 transition count 781
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 823 place count 204 transition count 698
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 893 place count 169 transition count 908
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 925 place count 169 transition count 876
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 927 place count 168 transition count 893
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 930 place count 168 transition count 890
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 1058 place count 168 transition count 762
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 5 with 43 rules applied. Total rules applied 1101 place count 168 transition count 707
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 5 with 161 rules applied. Total rules applied 1262 place count 125 transition count 589
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1269 place count 118 transition count 542
Iterating global reduction 6 with 7 rules applied. Total rules applied 1276 place count 118 transition count 542
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1278 place count 118 transition count 540
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 7 with 61 rules applied. Total rules applied 1339 place count 118 transition count 479
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1343 place count 118 transition count 479
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1346 place count 118 transition count 476
Applied a total of 1346 rules in 97 ms. Remains 118 /919 variables (removed 801) and now considering 476/1509 (removed 1033) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 118/919 places, 476/1509 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:34:04] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
// Phase 1: matrix 276 rows 118 cols
[2024-05-21 03:34:04] [INFO ] Computed 18 invariants in 3 ms
[2024-05-21 03:34:04] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:34:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 03:34:04] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-21 03:34:04] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:34:04] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-21 03:34:04] [INFO ] After 60ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:34:04] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-21 03:34:04] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 118/118 places, 476/476 transitions.
Incomplete random walk after 10000 steps, including 168 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 936368 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 936368 steps, saw 117546 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:34:08] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2024-05-21 03:34:08] [INFO ] Invariant cache hit.
[2024-05-21 03:34:08] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:34:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 03:34:08] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 6 ms returned sat
[2024-05-21 03:34:08] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:34:08] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-21 03:34:08] [INFO ] After 59ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:34:08] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-21 03:34:08] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 118/118 places, 476/476 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
[2024-05-21 03:34:08] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2024-05-21 03:34:08] [INFO ] Invariant cache hit.
[2024-05-21 03:34:08] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 03:34:08] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2024-05-21 03:34:08] [INFO ] Invariant cache hit.
[2024-05-21 03:34:08] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-21 03:34:08] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-21 03:34:08] [INFO ] Redundant transitions in 154 ms returned []
[2024-05-21 03:34:08] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2024-05-21 03:34:08] [INFO ] Invariant cache hit.
[2024-05-21 03:34:09] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 595 ms. Remains : 118/118 places, 476/476 transitions.
Graph (trivial) has 95 edges and 118 vertex of which 32 / 118 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 44 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 244 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 227
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 80 transition count 226
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 79 transition count 225
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 19 place count 79 transition count 216
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 37 place count 70 transition count 216
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 40 place count 67 transition count 213
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 67 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 65 transition count 211
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 65 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 64 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 64 transition count 205
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 66 place count 64 transition count 188
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 80 place count 57 transition count 181
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 87 place count 57 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 56 transition count 173
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 56 transition count 173
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 55 transition count 167
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 55 transition count 167
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 108 place count 55 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 52 transition count 168
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 50 transition count 117
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 50 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 50 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 173 place count 46 transition count 112
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 175 place count 44 transition count 96
Iterating global reduction 7 with 2 rules applied. Total rules applied 177 place count 44 transition count 96
Applied a total of 177 rules in 15 ms. Remains 44 /118 variables (removed 74) and now considering 96/476 (removed 380) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 96 rows 44 cols
[2024-05-21 03:34:09] [INFO ] Computed 11 invariants in 1 ms
[2024-05-21 03:34:09] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:34:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 03:34:09] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-21 03:34:09] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:34:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:34:09] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:34:09] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-21 03:34:09] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 612 reset in 213 ms.
Product exploration explored 100000 steps with 627 reset in 216 ms.
Built C files in :
/tmp/ltsmin14042211474141744541
[2024-05-21 03:34:10] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14042211474141744541
Running compilation step : cd /tmp/ltsmin14042211474141744541;'/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 2611 ms.
Running link step : cd /tmp/ltsmin14042211474141744541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14042211474141744541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11298767183870694756.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 919 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 919/919 places, 1509/1509 transitions.
Applied a total of 0 rules in 16 ms. Remains 919 /919 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
// Phase 1: matrix 1509 rows 919 cols
[2024-05-21 03:34:25] [INFO ] Computed 5 invariants in 11 ms
[2024-05-21 03:34:25] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 03:34:25] [INFO ] Invariant cache hit.
[2024-05-21 03:34:26] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2024-05-21 03:34:26] [INFO ] Invariant cache hit.
[2024-05-21 03:34:26] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1335 ms. Remains : 919/919 places, 1509/1509 transitions.
Built C files in :
/tmp/ltsmin11546295100730624069
[2024-05-21 03:34:26] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11546295100730624069
Running compilation step : cd /tmp/ltsmin11546295100730624069;'/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 2608 ms.
Running link step : cd /tmp/ltsmin11546295100730624069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11546295100730624069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11272210505818849999.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:34:42] [INFO ] Flatten gal took : 43 ms
[2024-05-21 03:34:42] [INFO ] Flatten gal took : 54 ms
[2024-05-21 03:34:42] [INFO ] Time to serialize gal into /tmp/LTL6617955469813285707.gal : 7 ms
[2024-05-21 03:34:42] [INFO ] Time to serialize properties into /tmp/LTL11481653727688190417.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6617955469813285707.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4145683159901116231.hoa' '-atoms' '/tmp/LTL11481653727688190417.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11481653727688190417.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4145683159901116231.hoa
Detected timeout of ITS tools.
[2024-05-21 03:34:57] [INFO ] Flatten gal took : 39 ms
[2024-05-21 03:34:57] [INFO ] Flatten gal took : 39 ms
[2024-05-21 03:34:57] [INFO ] Time to serialize gal into /tmp/LTL6657287527664737754.gal : 6 ms
[2024-05-21 03:34:57] [INFO ] Time to serialize properties into /tmp/LTL17601946165174082637.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6657287527664737754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17601946165174082637.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(G(("(((p919==0)||(p957==0))||((p1129==0)||(p1503==0)))")||(("(p1521==0)")||(X("(((p301==0)||(p343==0))||((p580==0)||(p1472...296
Formula 0 simplified : XF(!"((((p301==0)||(p343==0))||((p580==0)||(p1472==0)))&&((((p919==0)||(p957==0))||((p1129==0)||(p1503==0)))||(p1521==0)))" & XXF(!"...280
Detected timeout of ITS tools.
[2024-05-21 03:35:12] [INFO ] Flatten gal took : 51 ms
[2024-05-21 03:35:12] [INFO ] Applying decomposition
[2024-05-21 03:35:12] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12984117685003430227.txt' '-o' '/tmp/graph12984117685003430227.bin' '-w' '/tmp/graph12984117685003430227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12984117685003430227.bin' '-l' '-1' '-v' '-w' '/tmp/graph12984117685003430227.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:35:12] [INFO ] Decomposing Gal with order
[2024-05-21 03:35:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:35:12] [INFO ] Removed a total of 1830 redundant transitions.
[2024-05-21 03:35:12] [INFO ] Flatten gal took : 76 ms
[2024-05-21 03:35:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 10 ms.
[2024-05-21 03:35:12] [INFO ] Time to serialize gal into /tmp/LTL2636552731310951342.gal : 7 ms
[2024-05-21 03:35:12] [INFO ] Time to serialize properties into /tmp/LTL9285930619070635682.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2636552731310951342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9285930619070635682.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(G(("(((i23.u201.p919==0)||(i23.u337.p957==0))||((i17.i0.i3.u249.p1129==0)||(i23.u337.p1503==0)))")||(("(i23.u337.p1521==0)...474
Formula 0 simplified : XF(!"((((i23.u71.p301==0)||(i23.u76.p343==0))||((i7.i0.i0.u78.p580==0)||(i23.u329.p1472==0)))&&((((i23.u201.p919==0)||(i23.u337.p957...458
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1741871822220535417
[2024-05-21 03:35:27] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1741871822220535417
Running compilation step : cd /tmp/ltsmin1741871822220535417;'/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 2568 ms.
Running link step : cd /tmp/ltsmin1741871822220535417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1741871822220535417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CloudDeployment-PT-5b-LTLFireability-05 finished in 118175 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)||X(X(p1)))))'
Support contains 23 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 944 transition count 2537
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 944 transition count 2537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 944 transition count 2536
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 940 transition count 2532
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 940 transition count 2532
Applied a total of 29 rules in 64 ms. Remains 940 /954 variables (removed 14) and now considering 2532/2547 (removed 15) transitions.
// Phase 1: matrix 2532 rows 940 cols
[2024-05-21 03:35:43] [INFO ] Computed 16 invariants in 12 ms
[2024-05-21 03:35:43] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-21 03:35:43] [INFO ] Invariant cache hit.
[2024-05-21 03:35:44] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
[2024-05-21 03:35:44] [INFO ] Invariant cache hit.
[2024-05-21 03:35:45] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 940/954 places, 2532/2547 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2654 ms. Remains : 940/954 places, 2532/2547 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s20 0) (EQ s42 0) (EQ s189 0) (EQ s196 0) (EQ s218 0) (EQ s364 0) (EQ s373 0) (EQ s393 0) (EQ s537 0) (EQ s546 0) (EQ s568 0) (EQ s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 611 reset in 243 ms.
Product exploration explored 100000 steps with 613 reset in 264 ms.
Computed a total of 144 stabilizing places and 1496 stable transitions
Graph (complete) has 2904 edges and 940 vertex of which 912 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Computed a total of 144 stabilizing places and 1496 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 236255 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236255 steps, saw 56162 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:35:49] [INFO ] Invariant cache hit.
[2024-05-21 03:35:49] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:35:49] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 6 ms returned sat
[2024-05-21 03:35:50] [INFO ] After 727ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G p0), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLFireability-06 finished in 7627 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 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 983 edges and 954 vertex of which 348 / 954 are part of one of the 39 SCC in 1 ms
Free SCC test removed 309 places
Ensure Unique test removed 354 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 2513 edges and 645 vertex of which 617 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions removed 1025 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 616 transition count 913
Reduce places removed 254 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 255 rules applied. Total rules applied 511 place count 362 transition count 912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 512 place count 361 transition count 912
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 512 place count 361 transition count 862
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 612 place count 311 transition count 862
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 617 place count 306 transition count 857
Iterating global reduction 3 with 5 rules applied. Total rules applied 622 place count 306 transition count 857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 306 transition count 856
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 623 place count 306 transition count 854
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 627 place count 304 transition count 854
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 825 place count 205 transition count 755
Performed 26 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 877 place count 179 transition count 835
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 4 with 46 rules applied. Total rules applied 923 place count 179 transition count 789
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
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 933 place count 174 transition count 874
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1013 place count 174 transition count 794
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1014 place count 173 transition count 793
Applied a total of 1014 rules in 104 ms. Remains 173 /954 variables (removed 781) and now considering 793/2547 (removed 1754) transitions.
[2024-05-21 03:35:50] [INFO ] Flow matrix only has 600 transitions (discarded 193 similar events)
// Phase 1: matrix 600 rows 173 cols
[2024-05-21 03:35:50] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 03:35:50] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 03:35:50] [INFO ] Flow matrix only has 600 transitions (discarded 193 similar events)
[2024-05-21 03:35:50] [INFO ] Invariant cache hit.
[2024-05-21 03:35:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:35:51] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-21 03:35:51] [INFO ] Redundant transitions in 426 ms returned []
[2024-05-21 03:35:51] [INFO ] Flow matrix only has 600 transitions (discarded 193 similar events)
[2024-05-21 03:35:51] [INFO ] Invariant cache hit.
[2024-05-21 03:35:51] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 173/954 places, 793/2547 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1086 ms. Remains : 173/954 places, 793/2547 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-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:(EQ s14 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-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-08 finished in 1135 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 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 983 edges and 954 vertex of which 355 / 954 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2505 edges and 639 vertex of which 611 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions removed 1025 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 610 transition count 908
Reduce places removed 253 places and 0 transitions.
Iterating post reduction 1 with 253 rules applied. Total rules applied 508 place count 357 transition count 908
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 508 place count 357 transition count 860
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 604 place count 309 transition count 860
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 608 place count 305 transition count 856
Iterating global reduction 2 with 4 rules applied. Total rules applied 612 place count 305 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 613 place count 305 transition count 855
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 613 place count 305 transition count 854
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 615 place count 304 transition count 854
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 813 place count 205 transition count 755
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 3 with 50 rules applied. Total rules applied 863 place count 180 transition count 826
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 903 place count 180 transition count 786
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 913 place count 175 transition count 871
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 993 place count 175 transition count 791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 994 place count 174 transition count 790
Applied a total of 994 rules in 101 ms. Remains 174 /954 variables (removed 780) and now considering 790/2547 (removed 1757) transitions.
[2024-05-21 03:35:51] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
// Phase 1: matrix 606 rows 174 cols
[2024-05-21 03:35:51] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 03:35:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 03:35:51] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 03:35:51] [INFO ] Invariant cache hit.
[2024-05-21 03:35:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:35:52] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-21 03:35:52] [INFO ] Redundant transitions in 427 ms returned []
[2024-05-21 03:35:52] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 03:35:52] [INFO ] Invariant cache hit.
[2024-05-21 03:35:52] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/954 places, 790/2547 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1116 ms. Remains : 174/954 places, 790/2547 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-09 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:(NEQ s111 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 3054 reset in 387 ms.
Product exploration explored 100000 steps with 3033 reset in 351 ms.
Computed a total of 54 stabilizing places and 505 stable transitions
Computed a total of 54 stabilizing places and 505 stable transitions
Detected a total of 54/174 stabilizing places and 505/790 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 329 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1192823 steps, run timeout after 3001 ms. (steps per millisecond=397 ) properties seen :{}
Probabilistic random walk after 1192823 steps, saw 150457 distinct states, run finished after 3003 ms. (steps per millisecond=397 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:35:56] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 03:35:56] [INFO ] Invariant cache hit.
[2024-05-21 03:35:56] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:35:57] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 03:35:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:35:57] [INFO ] After 20ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 03:35:57] [INFO ] After 44ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-21 03:35:57] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 790/790 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 174 transition count 730
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 80 place count 164 transition count 810
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 164 transition count 800
Drop transitions removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 175 place count 164 transition count 715
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 225 place count 164 transition count 645
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 876 edges and 114 vertex of which 113 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 196 rules applied. Total rules applied 421 place count 113 transition count 500
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 113 transition count 499
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 427 place count 108 transition count 469
Iterating global reduction 4 with 5 rules applied. Total rules applied 432 place count 108 transition count 469
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 502 place count 108 transition count 399
Applied a total of 502 rules in 47 ms. Remains 108 /174 variables (removed 66) and now considering 399/790 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 108/174 places, 399/790 transitions.
Finished random walk after 63 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 105 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 790/790 transitions.
Applied a total of 0 rules in 19 ms. Remains 174 /174 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2024-05-21 03:35:57] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 03:35:57] [INFO ] Invariant cache hit.
[2024-05-21 03:35:57] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 03:35:57] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 03:35:57] [INFO ] Invariant cache hit.
[2024-05-21 03:35:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:35:57] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-21 03:35:58] [INFO ] Redundant transitions in 417 ms returned []
[2024-05-21 03:35:58] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 03:35:58] [INFO ] Invariant cache hit.
[2024-05-21 03:35:58] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1020 ms. Remains : 174/174 places, 790/790 transitions.
Computed a total of 54 stabilizing places and 505 stable transitions
Computed a total of 54 stabilizing places and 505 stable transitions
Detected a total of 54/174 stabilizing places and 505/790 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 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 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1193478 steps, run timeout after 3001 ms. (steps per millisecond=397 ) properties seen :{}
Probabilistic random walk after 1193478 steps, saw 150549 distinct states, run finished after 3001 ms. (steps per millisecond=397 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:36:01] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 03:36:01] [INFO ] Invariant cache hit.
[2024-05-21 03:36:01] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:36:01] [INFO ] After 104ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 03:36:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:36:01] [INFO ] After 20ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 03:36:01] [INFO ] After 43ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-21 03:36:01] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 790/790 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 174 transition count 730
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 164 transition count 810
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 164 transition count 800
Drop transitions removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 175 place count 164 transition count 715
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 225 place count 164 transition count 645
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 876 edges and 114 vertex of which 113 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 196 rules applied. Total rules applied 421 place count 113 transition count 500
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 113 transition count 499
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 427 place count 108 transition count 469
Iterating global reduction 4 with 5 rules applied. Total rules applied 432 place count 108 transition count 469
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 502 place count 108 transition count 399
Applied a total of 502 rules in 47 ms. Remains 108 /174 variables (removed 66) and now considering 399/790 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 108/174 places, 399/790 transitions.
Finished random walk after 180 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=180 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 186 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3077 reset in 326 ms.
Product exploration explored 100000 steps with 3109 reset in 331 ms.
Built C files in :
/tmp/ltsmin17506935230800529952
[2024-05-21 03:36:03] [INFO ] Computing symmetric may disable matrix : 790 transitions.
[2024-05-21 03:36:03] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:36:03] [INFO ] Computing symmetric may enable matrix : 790 transitions.
[2024-05-21 03:36:03] [INFO ] Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:36:03] [INFO ] Computing Do-Not-Accords matrix : 790 transitions.
[2024-05-21 03:36:03] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:36:03] [INFO ] Built C files in 257ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17506935230800529952
Running compilation step : cd /tmp/ltsmin17506935230800529952;'/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 2312 ms.
Running link step : cd /tmp/ltsmin17506935230800529952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin17506935230800529952;'/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/stateBased17729077043573475924.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 790/790 transitions.
Applied a total of 0 rules in 12 ms. Remains 174 /174 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2024-05-21 03:36:18] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 03:36:18] [INFO ] Invariant cache hit.
[2024-05-21 03:36:18] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 03:36:18] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 03:36:18] [INFO ] Invariant cache hit.
[2024-05-21 03:36:18] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:36:18] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-05-21 03:36:18] [INFO ] Redundant transitions in 434 ms returned []
[2024-05-21 03:36:18] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 03:36:18] [INFO ] Invariant cache hit.
[2024-05-21 03:36:19] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1025 ms. Remains : 174/174 places, 790/790 transitions.
Built C files in :
/tmp/ltsmin7457388357155608257
[2024-05-21 03:36:19] [INFO ] Computing symmetric may disable matrix : 790 transitions.
[2024-05-21 03:36:19] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:36:19] [INFO ] Computing symmetric may enable matrix : 790 transitions.
[2024-05-21 03:36:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:36:19] [INFO ] Computing Do-Not-Accords matrix : 790 transitions.
[2024-05-21 03:36:19] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:36:19] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7457388357155608257
Running compilation step : cd /tmp/ltsmin7457388357155608257;'/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 2327 ms.
Running link step : cd /tmp/ltsmin7457388357155608257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin7457388357155608257;'/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/stateBased16936780201329699965.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:36:34] [INFO ] Flatten gal took : 35 ms
[2024-05-21 03:36:34] [INFO ] Flatten gal took : 35 ms
[2024-05-21 03:36:34] [INFO ] Time to serialize gal into /tmp/LTL9047024649572045023.gal : 4 ms
[2024-05-21 03:36:34] [INFO ] Time to serialize properties into /tmp/LTL6682875615720280021.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9047024649572045023.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5974251310706631292.hoa' '-atoms' '/tmp/LTL6682875615720280021.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6682875615720280021.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5974251310706631292.hoa
Detected timeout of ITS tools.
[2024-05-21 03:36:49] [INFO ] Flatten gal took : 27 ms
[2024-05-21 03:36:49] [INFO ] Flatten gal took : 27 ms
[2024-05-21 03:36:49] [INFO ] Time to serialize gal into /tmp/LTL15453122194557981397.gal : 4 ms
[2024-05-21 03:36:49] [INFO ] Time to serialize properties into /tmp/LTL1317583727840624800.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15453122194557981397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1317583727840624800.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1150!=1)"))))
Formula 0 simplified : FG!"(p1150!=1)"
Detected timeout of ITS tools.
[2024-05-21 03:37:04] [INFO ] Flatten gal took : 31 ms
[2024-05-21 03:37:04] [INFO ] Applying decomposition
[2024-05-21 03:37:04] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph815888143794402419.txt' '-o' '/tmp/graph815888143794402419.bin' '-w' '/tmp/graph815888143794402419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph815888143794402419.bin' '-l' '-1' '-v' '-w' '/tmp/graph815888143794402419.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:37:04] [INFO ] Decomposing Gal with order
[2024-05-21 03:37:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:37:04] [INFO ] Removed a total of 1732 redundant transitions.
[2024-05-21 03:37:04] [INFO ] Flatten gal took : 41 ms
[2024-05-21 03:37:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 6 ms.
[2024-05-21 03:37:04] [INFO ] Time to serialize gal into /tmp/LTL9522837969774607989.gal : 3 ms
[2024-05-21 03:37:04] [INFO ] Time to serialize properties into /tmp/LTL15173748356515137841.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9522837969774607989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15173748356515137841.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(i3.u33.p1150!=1)"))))
Formula 0 simplified : FG!"(i3.u33.p1150!=1)"
Reverse transition relation is NOT exact ! Due to transitions t0, t2492_t980, t2483_t792, t27_t2006_t941_t752_t563_t370_t176, t27_t2186_t2, t27_t2152_t980_...2364
Computing Next relation with stutter on 1.31058e+12 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
79 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.844845,54564,1,0,64869,18728,4624,218459,1132,75998,50826
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-5b-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-5b-LTLFireability-09 finished in 73987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 934 transition count 1515
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 934 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 934 transition count 1514
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 931 transition count 1511
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 931 transition count 1511
Applied a total of 46 rules in 82 ms. Remains 931 /954 variables (removed 23) and now considering 1511/2547 (removed 1036) transitions.
// Phase 1: matrix 1511 rows 931 cols
[2024-05-21 03:37:05] [INFO ] Computed 15 invariants in 10 ms
[2024-05-21 03:37:05] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 03:37:05] [INFO ] Invariant cache hit.
[2024-05-21 03:37:06] [INFO ] Implicit Places using invariants and state equation in 773 ms returned [11, 19, 185, 193, 358, 366, 533, 541, 706, 714]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 948 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 921/954 places, 1511/2547 transitions.
Applied a total of 0 rules in 21 ms. Remains 921 /921 variables (removed 0) and now considering 1511/1511 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1051 ms. Remains : 921/954 places, 1511/2547 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s489 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 934 steps with 4 reset in 4 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-12 finished in 1156 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&&X((p0 U (X(p1)||G(p0))))))))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 934 transition count 1515
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 934 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 930 transition count 1510
Applied a total of 48 rules in 72 ms. Remains 930 /954 variables (removed 24) and now considering 1510/2547 (removed 1037) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2024-05-21 03:37:06] [INFO ] Computed 15 invariants in 11 ms
[2024-05-21 03:37:07] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 03:37:07] [INFO ] Invariant cache hit.
[2024-05-21 03:37:07] [INFO ] Implicit Places using invariants and state equation in 805 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 705, 713]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 978 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 920/954 places, 1510/2547 transitions.
Applied a total of 0 rules in 22 ms. Remains 920 /920 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1075 ms. Remains : 920/954 places, 1510/2547 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s571 1), p1:(EQ s298 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 621 reset in 190 ms.
Product exploration explored 100000 steps with 620 reset in 195 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2708 edges and 920 vertex of which 913 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1510 rows 920 cols
[2024-05-21 03:37:08] [INFO ] Computed 5 invariants in 9 ms
[2024-05-21 03:37:09] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-21 03:37:09] [INFO ] After 447ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-21 03:37:09] [INFO ] After 527ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:37:09] [INFO ] After 675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:37:09] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-21 03:37:10] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:37:10] [INFO ] After 586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-21 03:37:10] [INFO ] After 821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1510/1510 transitions.
Graph (trivial) has 957 edges and 920 vertex of which 340 / 920 are part of one of the 39 SCC in 1 ms
Free SCC test removed 301 places
Drop transitions removed 394 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 395 transitions.
Graph (complete) has 2177 edges and 619 vertex of which 612 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 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 269 rules applied. Total rules applied 271 place count 612 transition count 846
Reduce places removed 259 places and 0 transitions.
Iterating post reduction 1 with 259 rules applied. Total rules applied 530 place count 353 transition count 846
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 530 place count 353 transition count 789
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 644 place count 296 transition count 789
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 649 place count 291 transition count 784
Iterating global reduction 2 with 5 rules applied. Total rules applied 654 place count 291 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 654 place count 291 transition count 779
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 664 place count 286 transition count 779
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 828 place count 204 transition count 697
Performed 36 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 900 place count 168 transition count 910
Drop transitions removed 14 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 932 place count 168 transition count 878
Drop transitions removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1087 place count 168 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1089 place count 167 transition count 734
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1090 place count 167 transition count 733
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1100 place count 167 transition count 723
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1101 place count 166 transition count 716
Iterating global reduction 4 with 1 rules applied. Total rules applied 1102 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1152 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 140 transitions.
Graph (complete) has 905 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 4 with 191 rules applied. Total rules applied 1343 place count 115 transition count 506
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1344 place count 115 transition count 505
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1348 place count 111 transition count 481
Iterating global reduction 6 with 4 rules applied. Total rules applied 1352 place count 111 transition count 481
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 6 with 82 rules applied. Total rules applied 1434 place count 111 transition count 399
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1435 place count 111 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1436 place count 110 transition count 398
Applied a total of 1436 rules in 102 ms. Remains 110 /920 variables (removed 810) and now considering 398/1510 (removed 1112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 110/920 places, 398/1510 transitions.
Finished random walk after 155 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1510/1510 transitions.
Applied a total of 0 rules in 23 ms. Remains 920 /920 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2024-05-21 03:37:11] [INFO ] Invariant cache hit.
[2024-05-21 03:37:11] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 03:37:11] [INFO ] Invariant cache hit.
[2024-05-21 03:37:11] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2024-05-21 03:37:11] [INFO ] Invariant cache hit.
[2024-05-21 03:37:12] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1400 ms. Remains : 920/920 places, 1510/1510 transitions.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2708 edges and 920 vertex of which 913 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 63 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:37:12] [INFO ] Invariant cache hit.
[2024-05-21 03:37:12] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-21 03:37:13] [INFO ] After 436ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-21 03:37:13] [INFO ] After 516ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:37:13] [INFO ] After 659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:37:13] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-21 03:37:14] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:37:14] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-21 03:37:14] [INFO ] After 799ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1510/1510 transitions.
Graph (trivial) has 957 edges and 920 vertex of which 340 / 920 are part of one of the 39 SCC in 1 ms
Free SCC test removed 301 places
Drop transitions removed 394 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 395 transitions.
Graph (complete) has 2177 edges and 619 vertex of which 612 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 10 transitions
Reduce isomorphic transitions removed 10 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 269 rules applied. Total rules applied 271 place count 612 transition count 846
Reduce places removed 259 places and 0 transitions.
Iterating post reduction 1 with 259 rules applied. Total rules applied 530 place count 353 transition count 846
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 530 place count 353 transition count 789
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 644 place count 296 transition count 789
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 649 place count 291 transition count 784
Iterating global reduction 2 with 5 rules applied. Total rules applied 654 place count 291 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 654 place count 291 transition count 779
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 664 place count 286 transition count 779
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 828 place count 204 transition count 697
Performed 36 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 900 place count 168 transition count 910
Drop transitions removed 14 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 932 place count 168 transition count 878
Drop transitions removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1087 place count 168 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1089 place count 167 transition count 734
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1090 place count 167 transition count 733
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1100 place count 167 transition count 723
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1101 place count 166 transition count 716
Iterating global reduction 4 with 1 rules applied. Total rules applied 1102 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1152 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 140 transitions.
Graph (complete) has 905 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 4 with 191 rules applied. Total rules applied 1343 place count 115 transition count 506
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1344 place count 115 transition count 505
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1348 place count 111 transition count 481
Iterating global reduction 6 with 4 rules applied. Total rules applied 1352 place count 111 transition count 481
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 6 with 82 rules applied. Total rules applied 1434 place count 111 transition count 399
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1435 place count 111 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1436 place count 110 transition count 398
Applied a total of 1436 rules in 98 ms. Remains 110 /920 variables (removed 810) and now considering 398/1510 (removed 1112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 110/920 places, 398/1510 transitions.
Finished random walk after 94 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 632 reset in 195 ms.
Product exploration explored 100000 steps with 636 reset in 212 ms.
Built C files in :
/tmp/ltsmin18387791173709925813
[2024-05-21 03:37:15] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18387791173709925813
Running compilation step : cd /tmp/ltsmin18387791173709925813;'/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 2599 ms.
Running link step : cd /tmp/ltsmin18387791173709925813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18387791173709925813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7144237295478589562.hoa' '--buchi-type=spotba'
LTSmin run took 4081 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-5b-LTLFireability-14 finished in 15686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F((p0||G(p1)))||(p2&&X((p2 U (!p0||G(p2))))))))))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-01
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 981 edges and 954 vertex of which 355 / 954 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2505 edges and 639 vertex of which 611 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 610 transition count 909
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 506 place count 358 transition count 909
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 506 place count 358 transition count 861
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 602 place count 310 transition count 861
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 605 place count 307 transition count 858
Iterating global reduction 2 with 3 rules applied. Total rules applied 608 place count 307 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 609 place count 307 transition count 857
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 609 place count 307 transition count 856
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 611 place count 306 transition count 856
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 809 place count 207 transition count 757
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 3 with 50 rules applied. Total rules applied 859 place count 182 transition count 832
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 860 place count 181 transition count 831
Applied a total of 860 rules in 64 ms. Remains 181 /954 variables (removed 773) and now considering 831/2547 (removed 1716) transitions.
[2024-05-21 03:37:22] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
// Phase 1: matrix 672 rows 181 cols
[2024-05-21 03:37:22] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 03:37:22] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 03:37:22] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 03:37:22] [INFO ] Invariant cache hit.
[2024-05-21 03:37:23] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 03:37:23] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-05-21 03:37:23] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 03:37:23] [INFO ] Invariant cache hit.
[2024-05-21 03:37:23] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 181/954 places, 831/2547 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 665 ms. Remains : 181/954 places, 831/2547 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s70 1), p2:(NEQ s119 1), p1:(EQ s119 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3134 reset in 348 ms.
Product exploration explored 100000 steps with 3142 reset in 359 ms.
Computed a total of 51 stabilizing places and 521 stable transitions
Computed a total of 51 stabilizing places and 521 stable transitions
Detected a total of 51/181 stabilizing places and 521/831 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 315 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 826888 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :{}
Probabilistic random walk after 826888 steps, saw 110493 distinct states, run finished after 3001 ms. (steps per millisecond=275 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 03:37:27] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 03:37:27] [INFO ] Invariant cache hit.
[2024-05-21 03:37:27] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:37:27] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-21 03:37:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 03:37:27] [INFO ] After 37ms SMT Verify possible using 35 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:37:27] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:37:27] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:37:28] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 03:37:28] [INFO ] After 55ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 03:37:28] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-21 03:37:28] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 831/831 transitions.
Drop transitions removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 181 transition count 761
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 100 place count 166 transition count 906
Drop transitions removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 135 place count 166 transition count 871
Drop transitions removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 2 with 155 rules applied. Total rules applied 290 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 340 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 893 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 196 rules applied. Total rules applied 536 place count 115 transition count 501
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 115 transition count 500
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 542 place count 110 transition count 470
Iterating global reduction 4 with 5 rules applied. Total rules applied 547 place count 110 transition count 470
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 617 place count 110 transition count 400
Applied a total of 617 rules in 49 ms. Remains 110 /181 variables (removed 71) and now considering 400/831 (removed 431) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 110/181 places, 400/831 transitions.
Finished random walk after 122 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 406 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 831/831 transitions.
Applied a total of 0 rules in 1 ms. Remains 181 /181 variables (removed 0) and now considering 831/831 (removed 0) transitions.
[2024-05-21 03:37:29] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 03:37:29] [INFO ] Invariant cache hit.
[2024-05-21 03:37:29] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 03:37:29] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 03:37:29] [INFO ] Invariant cache hit.
[2024-05-21 03:37:29] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 03:37:29] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-21 03:37:29] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 03:37:29] [INFO ] Invariant cache hit.
[2024-05-21 03:37:29] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 181/181 places, 831/831 transitions.
Computed a total of 51 stabilizing places and 521 stable transitions
Computed a total of 51 stabilizing places and 521 stable transitions
Detected a total of 51/181 stabilizing places and 521/831 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 337 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 824565 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :{}
Probabilistic random walk after 824565 steps, saw 110405 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 03:37:33] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 03:37:33] [INFO ] Invariant cache hit.
[2024-05-21 03:37:33] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:37:33] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-21 03:37:33] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 03:37:33] [INFO ] After 36ms SMT Verify possible using 35 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:37:33] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:37:33] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:37:33] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 03:37:33] [INFO ] After 52ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 03:37:33] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-21 03:37:33] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 831/831 transitions.
Drop transitions removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 181 transition count 761
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 100 place count 166 transition count 906
Drop transitions removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 135 place count 166 transition count 871
Drop transitions removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 2 with 155 rules applied. Total rules applied 290 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 340 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 893 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 196 rules applied. Total rules applied 536 place count 115 transition count 501
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 115 transition count 500
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 542 place count 110 transition count 470
Iterating global reduction 4 with 5 rules applied. Total rules applied 547 place count 110 transition count 470
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 617 place count 110 transition count 400
Applied a total of 617 rules in 50 ms. Remains 110 /181 variables (removed 71) and now considering 400/831 (removed 431) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 110/181 places, 400/831 transitions.
Finished random walk after 127 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 416 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3117 reset in 335 ms.
Product exploration explored 100000 steps with 3126 reset in 347 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 831/831 transitions.
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 181 transition count 791
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -105
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 45 place count 181 transition count 896
Deduced a syphon composed of 5 places in 1 ms
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 125 place count 181 transition count 816
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 125 rules in 43 ms. Remains 181 /181 variables (removed 0) and now considering 816/831 (removed 15) transitions.
[2024-05-21 03:37:36] [INFO ] Redundant transitions in 419 ms returned []
[2024-05-21 03:37:36] [INFO ] Flow matrix only has 632 transitions (discarded 184 similar events)
// Phase 1: matrix 632 rows 181 cols
[2024-05-21 03:37:36] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 03:37:36] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/181 places, 816/831 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 705 ms. Remains : 181/181 places, 816/831 transitions.
Built C files in :
/tmp/ltsmin3213303183105193350
[2024-05-21 03:37:36] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3213303183105193350
Running compilation step : cd /tmp/ltsmin3213303183105193350;'/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 1377 ms.
Running link step : cd /tmp/ltsmin3213303183105193350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3213303183105193350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2749195476253758040.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 831/831 transitions.
Applied a total of 0 rules in 1 ms. Remains 181 /181 variables (removed 0) and now considering 831/831 (removed 0) transitions.
[2024-05-21 03:37:51] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
// Phase 1: matrix 672 rows 181 cols
[2024-05-21 03:37:51] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 03:37:51] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 03:37:51] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 03:37:51] [INFO ] Invariant cache hit.
[2024-05-21 03:37:51] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 03:37:51] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-21 03:37:51] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 03:37:51] [INFO ] Invariant cache hit.
[2024-05-21 03:37:52] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 596 ms. Remains : 181/181 places, 831/831 transitions.
Built C files in :
/tmp/ltsmin13422998450412667948
[2024-05-21 03:37:52] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13422998450412667948
Running compilation step : cd /tmp/ltsmin13422998450412667948;'/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 1370 ms.
Running link step : cd /tmp/ltsmin13422998450412667948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13422998450412667948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12708896226090526035.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:38:07] [INFO ] Flatten gal took : 27 ms
[2024-05-21 03:38:07] [INFO ] Flatten gal took : 27 ms
[2024-05-21 03:38:07] [INFO ] Time to serialize gal into /tmp/LTL4315972537380397437.gal : 4 ms
[2024-05-21 03:38:07] [INFO ] Time to serialize properties into /tmp/LTL12283487531283147312.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4315972537380397437.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11480757599112205866.hoa' '-atoms' '/tmp/LTL12283487531283147312.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12283487531283147312.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11480757599112205866.hoa
Detected timeout of ITS tools.
[2024-05-21 03:38:22] [INFO ] Flatten gal took : 27 ms
[2024-05-21 03:38:22] [INFO ] Flatten gal took : 27 ms
[2024-05-21 03:38:22] [INFO ] Time to serialize gal into /tmp/LTL12761568165844352469.gal : 4 ms
[2024-05-21 03:38:22] [INFO ] Time to serialize properties into /tmp/LTL2312837526612028831.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12761568165844352469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2312837526612028831.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F(("(p682==1)")||(G("(p1183==0)"))))||(("(p1183!=1)")&&(X(("(p1183!=1)")U(("(p682!=1)")||(G("(p1183!=1)")))))))))))
Formula 0 simplified : XXF(G(!"(p682==1)" & F!"(p1183==0)") & (!"(p1183!=1)" | X(!"(p1183!=1)" M !"(p682!=1)")))
Detected timeout of ITS tools.
[2024-05-21 03:38:37] [INFO ] Flatten gal took : 30 ms
[2024-05-21 03:38:37] [INFO ] Applying decomposition
[2024-05-21 03:38:37] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4074696201468971384.txt' '-o' '/tmp/graph4074696201468971384.bin' '-w' '/tmp/graph4074696201468971384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4074696201468971384.bin' '-l' '-1' '-v' '-w' '/tmp/graph4074696201468971384.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:38:37] [INFO ] Decomposing Gal with order
[2024-05-21 03:38:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:38:37] [INFO ] Removed a total of 1782 redundant transitions.
[2024-05-21 03:38:37] [INFO ] Flatten gal took : 43 ms
[2024-05-21 03:38:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 8 ms.
[2024-05-21 03:38:37] [INFO ] Time to serialize gal into /tmp/LTL16805577449034294029.gal : 3 ms
[2024-05-21 03:38:37] [INFO ] Time to serialize properties into /tmp/LTL17872081348646040064.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16805577449034294029.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17872081348646040064.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F(("(i2.u17.p682==1)")||(G("(i4.u31.p1183==0)"))))||(("(i4.u31.p1183!=1)")&&(X(("(i4.u31.p1183!=1)")U(("(i2.u17.p682!=1)")||...188
Formula 0 simplified : XXF(G(!"(i2.u17.p682==1)" & F!"(i4.u31.p1183==0)") & (!"(i4.u31.p1183!=1)" | X(!"(i4.u31.p1183!=1)" M !"(i2.u17.p682!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t0, t2492_t980, t2483_t792, t2502_t410, t27_t2006_t941_t752_t563_t370_t176, t27_t2279_t980_t8...2932
Computing Next relation with stutter on 1.31058e+12 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
110 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.15274,69688,1,0,79301,49803,5343,227851,1887,209800,78433
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property CloudDeployment-PT-5b-LTLFireability-01 finished in 76579 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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(((p1 U X(G(!p2)))&&p0)))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-04
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) p2), p2, p2]
Support contains 24 out of 954 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 963 edges and 954 vertex of which 346 / 954 are part of one of the 39 SCC in 0 ms
Free SCC test removed 307 places
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Graph (complete) has 2521 edges and 647 vertex of which 646 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 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 646 transition count 1942
Reduce places removed 253 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 256 rules applied. Total rules applied 511 place count 393 transition count 1939
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 513 place count 391 transition count 1939
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 513 place count 391 transition count 1890
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 611 place count 342 transition count 1890
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 615 place count 338 transition count 1886
Iterating global reduction 3 with 4 rules applied. Total rules applied 619 place count 338 transition count 1886
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 620 place count 338 transition count 1885
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 620 place count 338 transition count 1883
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 624 place count 336 transition count 1883
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 824 place count 236 transition count 1783
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 874 place count 211 transition count 1913
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 894 place count 211 transition count 1893
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 898 place count 211 transition count 1889
Applied a total of 898 rules in 97 ms. Remains 211 /954 variables (removed 743) and now considering 1889/2547 (removed 658) transitions.
[2024-05-21 03:38:39] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2024-05-21 03:38:39] [INFO ] Computed 16 invariants in 17 ms
[2024-05-21 03:38:39] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-21 03:38:39] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 03:38:39] [INFO ] Invariant cache hit.
[2024-05-21 03:38:40] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-21 03:38:41] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
[2024-05-21 03:38:41] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 03:38:41] [INFO ] Invariant cache hit.
[2024-05-21 03:38:41] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 211/954 places, 1889/2547 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2611 ms. Remains : 211/954 places, 1889/2547 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s174 0) (OR (EQ s4 0) (EQ s10 0) (EQ s17 0) (EQ s39 0) (EQ s45 0) (EQ s52 0) (EQ s73 0) (EQ s79 0) (EQ s86 0) (EQ s107 0) (EQ s113 0) (EQ s120...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2905 reset in 577 ms.
Product exploration explored 100000 steps with 2902 reset in 591 ms.
Computed a total of 68 stabilizing places and 1569 stable transitions
Graph (complete) has 2047 edges and 211 vertex of which 184 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Computed a total of 68 stabilizing places and 1569 stable transitions
Detected a total of 68/211 stabilizing places and 1569/1889 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 462 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 298 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-21 03:38:44] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 03:38:44] [INFO ] Invariant cache hit.
[2024-05-21 03:38:44] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2024-05-21 03:38:44] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 03:38:45] [INFO ] After 701ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-05-21 03:38:45] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-21 03:38:45] [INFO ] After 510ms SMT Verify possible using 228 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2024-05-21 03:38:46] [INFO ] After 1159ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 559 ms.
[2024-05-21 03:38:46] [INFO ] After 2519ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 211 transition count 1850
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 59 place count 201 transition count 1930
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 201 transition count 1922
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 2 with 130 rules applied. Total rules applied 197 place count 201 transition count 1792
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 245 place count 201 transition count 1732
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 2 with 166 rules applied. Total rules applied 411 place count 153 transition count 1614
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 418 place count 146 transition count 1567
Iterating global reduction 3 with 7 rules applied. Total rules applied 425 place count 146 transition count 1567
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 427 place count 146 transition count 1565
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 488 place count 146 transition count 1504
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 146 transition count 1504
Applied a total of 490 rules in 129 ms. Remains 146 /211 variables (removed 65) and now considering 1504/1889 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 146/211 places, 1504/1889 transitions.
Incomplete random walk after 10000 steps, including 260 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 03:38:47] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
// Phase 1: matrix 1304 rows 146 cols
[2024-05-21 03:38:47] [INFO ] Computed 16 invariants in 5 ms
[2024-05-21 03:38:47] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 03:38:47] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 03:38:47] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 03:38:47] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-21 03:38:48] [INFO ] After 164ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 03:38:48] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-21 03:38:48] [INFO ] After 917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 10 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1504/1504 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1504/1504 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 146/146 places, 1504/1504 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 591649 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 591649 steps, saw 83110 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-21 03:38:51] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2024-05-21 03:38:51] [INFO ] Invariant cache hit.
[2024-05-21 03:38:51] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 03:38:51] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 03:38:52] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 03:38:52] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-21 03:38:52] [INFO ] After 191ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 03:38:52] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 149 ms.
[2024-05-21 03:38:52] [INFO ] After 967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 17 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1504/1504 transitions.
Applied a total of 0 rules in 21 ms. Remains 146 /146 variables (removed 0) and now considering 1504/1504 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 146/146 places, 1504/1504 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1504/1504 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1504/1504 (removed 0) transitions.
[2024-05-21 03:38:52] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2024-05-21 03:38:52] [INFO ] Invariant cache hit.
[2024-05-21 03:38:53] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-21 03:38:53] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2024-05-21 03:38:53] [INFO ] Invariant cache hit.
[2024-05-21 03:38:53] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-21 03:38:54] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
[2024-05-21 03:38:54] [INFO ] Redundant transitions in 171 ms returned []
[2024-05-21 03:38:54] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2024-05-21 03:38:54] [INFO ] Invariant cache hit.
[2024-05-21 03:38:55] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2333 ms. Remains : 146/146 places, 1504/1504 transitions.
Graph (trivial) has 108 edges and 146 vertex of which 32 / 146 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 48 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 248 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 118 transition count 1247
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 109 transition count 1245
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 107 transition count 1244
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 107 transition count 1236
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 99 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 96 transition count 1233
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 96 transition count 1233
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 93 transition count 1215
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 93 transition count 1215
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 94 place count 93 transition count 1173
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 108 place count 86 transition count 1164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 114 place count 86 transition count 1158
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 83 transition count 1173
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 155 place count 83 transition count 1138
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 155 place count 83 transition count 1135
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 161 place count 80 transition count 1135
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 80 transition count 1133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 78 transition count 1133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 78 transition count 1133
Applied a total of 166 rules in 84 ms. Remains 78 /146 variables (removed 68) and now considering 1133/1504 (removed 371) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1133 rows 78 cols
[2024-05-21 03:38:55] [INFO ] Computed 20 invariants in 7 ms
[2024-05-21 03:38:55] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 03:38:55] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-21 03:38:55] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 03:38:55] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-05-21 03:38:55] [INFO ] After 589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (F (AND (NOT p1) p0 p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 28 factoid took 1718 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Applied a total of 0 rules in 11 ms. Remains 211 /211 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2024-05-21 03:38:57] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2024-05-21 03:38:57] [INFO ] Computed 16 invariants in 15 ms
[2024-05-21 03:38:58] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-21 03:38:58] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 03:38:58] [INFO ] Invariant cache hit.
[2024-05-21 03:38:58] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-21 03:38:59] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
[2024-05-21 03:38:59] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 03:38:59] [INFO ] Invariant cache hit.
[2024-05-21 03:39:00] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2535 ms. Remains : 211/211 places, 1889/1889 transitions.
Computed a total of 68 stabilizing places and 1569 stable transitions
Graph (complete) has 2047 edges and 211 vertex of which 184 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Computed a total of 68 stabilizing places and 1569 stable transitions
Detected a total of 68/211 stabilizing places and 1569/1889 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p2)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 242 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Incomplete random walk after 10000 steps, including 300 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 03:39:01] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 03:39:01] [INFO ] Invariant cache hit.
[2024-05-21 03:39:01] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 03:39:01] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 03:39:02] [INFO ] After 600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 03:39:02] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-21 03:39:02] [INFO ] After 512ms SMT Verify possible using 228 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-21 03:39:03] [INFO ] After 1094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 378 ms.
[2024-05-21 03:39:03] [INFO ] After 2147ms 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 0 properties in 1 ms.
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 211 transition count 1850
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 59 place count 201 transition count 1930
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 201 transition count 1922
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 2 with 130 rules applied. Total rules applied 197 place count 201 transition count 1792
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 245 place count 201 transition count 1732
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 2 with 166 rules applied. Total rules applied 411 place count 153 transition count 1614
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 418 place count 146 transition count 1567
Iterating global reduction 3 with 7 rules applied. Total rules applied 425 place count 146 transition count 1567
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 427 place count 146 transition count 1565
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 488 place count 146 transition count 1504
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 146 transition count 1504
Applied a total of 490 rules in 142 ms. Remains 146 /211 variables (removed 65) and now considering 1504/1889 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 146/211 places, 1504/1889 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 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 25 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 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 27 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 517817 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 517817 steps, saw 72419 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-21 03:39:07] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
// Phase 1: matrix 1304 rows 146 cols
[2024-05-21 03:39:07] [INFO ] Computed 16 invariants in 5 ms
[2024-05-21 03:39:07] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 03:39:07] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 03:39:07] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 03:39:07] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-21 03:39:07] [INFO ] After 281ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-21 03:39:08] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 259 ms.
[2024-05-21 03:39:08] [INFO ] After 1417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1504/1504 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1504/1504 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 146/146 places, 1504/1504 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1504/1504 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1504/1504 (removed 0) transitions.
[2024-05-21 03:39:08] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2024-05-21 03:39:08] [INFO ] Invariant cache hit.
[2024-05-21 03:39:09] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-21 03:39:09] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2024-05-21 03:39:09] [INFO ] Invariant cache hit.
[2024-05-21 03:39:09] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-21 03:39:10] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned []
Implicit Place search using SMT with State Equation took 1574 ms to find 0 implicit places.
[2024-05-21 03:39:10] [INFO ] Redundant transitions in 180 ms returned []
[2024-05-21 03:39:10] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2024-05-21 03:39:10] [INFO ] Invariant cache hit.
[2024-05-21 03:39:10] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2250 ms. Remains : 146/146 places, 1504/1504 transitions.
Graph (trivial) has 108 edges and 146 vertex of which 32 / 146 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 48 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 248 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 118 transition count 1247
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 109 transition count 1245
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 107 transition count 1244
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 107 transition count 1236
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 99 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 96 transition count 1233
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 96 transition count 1233
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 93 transition count 1215
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 93 transition count 1215
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 94 place count 93 transition count 1173
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 108 place count 86 transition count 1164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 114 place count 86 transition count 1158
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 83 transition count 1173
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 155 place count 83 transition count 1138
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 155 place count 83 transition count 1135
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 161 place count 80 transition count 1135
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 80 transition count 1133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 78 transition count 1133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 78 transition count 1133
Applied a total of 166 rules in 76 ms. Remains 78 /146 variables (removed 68) and now considering 1133/1504 (removed 371) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1133 rows 78 cols
[2024-05-21 03:39:10] [INFO ] Computed 20 invariants in 14 ms
[2024-05-21 03:39:11] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 03:39:11] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 2 ms returned sat
[2024-05-21 03:39:11] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 03:39:11] [INFO ] After 577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-21 03:39:11] [INFO ] After 793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p2)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 18 factoid took 466 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Product exploration explored 100000 steps with 2866 reset in 559 ms.
Product exploration explored 100000 steps with 2886 reset in 566 ms.
Built C files in :
/tmp/ltsmin10989228008063831543
[2024-05-21 03:39:13] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10989228008063831543
Running compilation step : cd /tmp/ltsmin10989228008063831543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10989228008063831543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10989228008063831543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2024-05-21 03:39:16] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2024-05-21 03:39:16] [INFO ] Computed 16 invariants in 10 ms
[2024-05-21 03:39:17] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-21 03:39:17] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 03:39:17] [INFO ] Invariant cache hit.
[2024-05-21 03:39:17] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-21 03:39:18] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
[2024-05-21 03:39:18] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 03:39:18] [INFO ] Invariant cache hit.
[2024-05-21 03:39:19] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2485 ms. Remains : 211/211 places, 1889/1889 transitions.
Built C files in :
/tmp/ltsmin16674941773448478469
[2024-05-21 03:39:19] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16674941773448478469
Running compilation step : cd /tmp/ltsmin16674941773448478469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16674941773448478469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16674941773448478469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 03:39:22] [INFO ] Flatten gal took : 179 ms
[2024-05-21 03:39:22] [INFO ] Flatten gal took : 188 ms
[2024-05-21 03:39:22] [INFO ] Time to serialize gal into /tmp/LTL2088031186350854753.gal : 23 ms
[2024-05-21 03:39:22] [INFO ] Time to serialize properties into /tmp/LTL16191343260469199080.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2088031186350854753.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9481945836932626688.hoa' '-atoms' '/tmp/LTL16191343260469199080.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16191343260469199080.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9481945836932626688.hoa
Detected timeout of ITS tools.
[2024-05-21 03:39:38] [INFO ] Flatten gal took : 182 ms
[2024-05-21 03:39:38] [INFO ] Flatten gal took : 182 ms
[2024-05-21 03:39:38] [INFO ] Time to serialize gal into /tmp/LTL2470629206127222241.gal : 25 ms
[2024-05-21 03:39:38] [INFO ] Time to serialize properties into /tmp/LTL12305912993832760857.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2470629206127222241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12305912993832760857.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("(p1437==0)")&&(("(p1260==1)")U(X(G(!("(((((p49==1)&&(p87==1))&&((p245==1)&&(p1503==1)))&&(p1521==1))||(p1260==1))"))))))&&("((...377
Formula 0 simplified : G(!"((((((p27==0)||(p58==0))||((p95==0)||(p302==0)))||(((p348==0)||(p385==0))||((p592==0)||(p638==0))))||((((p675==0)||(p882==0))||(...364
Detected timeout of ITS tools.
[2024-05-21 03:39:53] [INFO ] Flatten gal took : 182 ms
[2024-05-21 03:39:53] [INFO ] Applying decomposition
[2024-05-21 03:39:53] [INFO ] Flatten gal took : 184 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10451729538895520986.txt' '-o' '/tmp/graph10451729538895520986.bin' '-w' '/tmp/graph10451729538895520986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10451729538895520986.bin' '-l' '-1' '-v' '-w' '/tmp/graph10451729538895520986.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:39:54] [INFO ] Decomposing Gal with order
[2024-05-21 03:39:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:39:54] [INFO ] Removed a total of 9288 redundant transitions.
[2024-05-21 03:39:54] [INFO ] Flatten gal took : 438 ms
[2024-05-21 03:39:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2212 labels/synchronizations in 95 ms.
[2024-05-21 03:39:54] [INFO ] Time to serialize gal into /tmp/LTL13077571222786579411.gal : 15 ms
[2024-05-21 03:39:54] [INFO ] Time to serialize properties into /tmp/LTL12528451658527183200.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13077571222786579411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12528451658527183200.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((("(i6.u27.p1437==0)")&&(("(i6.u20.p1260==1)")U(X(G(!("(((((i0.u0.p49==1)&&(i0.u1.p87==1))&&((i0.u2.p245==1)&&(u35.p1503==1)))&&(...531
Formula 0 simplified : G(!"((((((i0.u0.p27==0)||(i0.u1.p58==0))||((i0.u2.p95==0)||(i0.u0.p302==0)))||(((i1.u5.p348==0)||(i1.u5.p385==0))||((i0.u0.p592==0)|...518
Reverse transition relation is NOT exact ! Due to transitions t1189, t2492_t980, t2483_t792, u35.t3, i0.t866_t875_t941, i0.t949_t946, i0.t936, i0.u0.t907.t...1358
Computing Next relation with stutter on 1.94178e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7422825040473812101
[2024-05-21 03:40:09] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7422825040473812101
Running compilation step : cd /tmp/ltsmin7422825040473812101;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7422825040473812101;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7422825040473812101;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CloudDeployment-PT-5b-LTLFireability-04 finished in 93860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G((X(p2)||p1))))))))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-05
Stuttering acceptance computed with spot in 203 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 9 out of 954 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 971 edges and 954 vertex of which 341 / 954 are part of one of the 38 SCC in 0 ms
Free SCC test removed 303 places
Ensure Unique test removed 347 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 2525 edges and 651 vertex of which 623 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions removed 1025 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 623 transition count 920
Reduce places removed 255 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 258 rules applied. Total rules applied 515 place count 368 transition count 917
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 517 place count 366 transition count 917
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 517 place count 366 transition count 868
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 615 place count 317 transition count 868
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 620 place count 312 transition count 863
Iterating global reduction 3 with 5 rules applied. Total rules applied 625 place count 312 transition count 863
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 626 place count 312 transition count 862
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 626 place count 312 transition count 860
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 630 place count 310 transition count 860
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 832 place count 209 transition count 759
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 882 place count 184 transition count 834
Applied a total of 882 rules in 55 ms. Remains 184 /954 variables (removed 770) and now considering 834/2547 (removed 1713) transitions.
[2024-05-21 03:40:13] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
// Phase 1: matrix 677 rows 184 cols
[2024-05-21 03:40:13] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 03:40:13] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 03:40:13] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 03:40:13] [INFO ] Invariant cache hit.
[2024-05-21 03:40:13] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-21 03:40:13] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-21 03:40:13] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 03:40:13] [INFO ] Invariant cache hit.
[2024-05-21 03:40:14] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 184/954 places, 834/2547 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 759 ms. Remains : 184/954 places, 834/2547 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (OR (EQ s31 0) (EQ s34 0) (EQ s59 0) (EQ s160 0)) (OR (EQ s92 0) (EQ s98 0) (EQ s117 0) (EQ s171 0) (EQ s182 0))), p1:(OR (EQ s92 0) (EQ s98 0) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2845 reset in 397 ms.
Product exploration explored 100000 steps with 2832 reset in 398 ms.
Computed a total of 49 stabilizing places and 491 stable transitions
Computed a total of 49 stabilizing places and 491 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 295 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 707971 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 707971 steps, saw 96636 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 03:40:18] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 03:40:18] [INFO ] Invariant cache hit.
[2024-05-21 03:40:18] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 03:40:18] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:40:18] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 03:40:18] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-21 03:40:19] [INFO ] After 212ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-21 03:40:19] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 209 ms.
[2024-05-21 03:40:19] [INFO ] After 1039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1 ms.
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 834/834 transitions.
Drop transitions removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 184 transition count 768
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 96 place count 169 transition count 913
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 128 place count 169 transition count 881
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 168 transition count 898
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 168 transition count 895
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 3 with 128 rules applied. Total rules applied 261 place count 168 transition count 767
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 304 place count 168 transition count 712
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 465 place count 125 transition count 594
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 472 place count 118 transition count 547
Iterating global reduction 4 with 7 rules applied. Total rules applied 479 place count 118 transition count 547
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 481 place count 118 transition count 545
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 542 place count 118 transition count 484
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 546 place count 118 transition count 484
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 549 place count 118 transition count 481
Applied a total of 549 rules in 63 ms. Remains 118 /184 variables (removed 66) and now considering 481/834 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 118/184 places, 481/834 transitions.
Incomplete random walk after 10000 steps, including 196 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:40:19] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
// Phase 1: matrix 281 rows 118 cols
[2024-05-21 03:40:19] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 03:40:19] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:40:19] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-21 03:40:19] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:19] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 03:40:19] [INFO ] After 68ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:20] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-21 03:40:20] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 481/481 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 118/118 places, 481/481 transitions.
Incomplete random walk after 10000 steps, including 199 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 959099 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 959099 steps, saw 120650 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:40:23] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
[2024-05-21 03:40:23] [INFO ] Invariant cache hit.
[2024-05-21 03:40:23] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:40:23] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-21 03:40:23] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:23] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 03:40:23] [INFO ] After 68ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:23] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-21 03:40:23] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 481/481 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 118/118 places, 481/481 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 481/481 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-21 03:40:23] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
[2024-05-21 03:40:23] [INFO ] Invariant cache hit.
[2024-05-21 03:40:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 03:40:23] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
[2024-05-21 03:40:23] [INFO ] Invariant cache hit.
[2024-05-21 03:40:23] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 03:40:23] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-21 03:40:24] [INFO ] Redundant transitions in 180 ms returned []
[2024-05-21 03:40:24] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
[2024-05-21 03:40:24] [INFO ] Invariant cache hit.
[2024-05-21 03:40:24] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 118/118 places, 481/481 transitions.
Graph (trivial) has 95 edges and 118 vertex of which 32 / 118 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 48 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 248 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 228
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 80 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 79 transition count 226
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 19 place count 79 transition count 217
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 37 place count 70 transition count 217
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 40 place count 67 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 67 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 65 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 65 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 64 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 64 transition count 206
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 66 place count 64 transition count 189
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 80 place count 57 transition count 182
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 87 place count 57 transition count 175
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 56 transition count 174
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 56 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 55 transition count 168
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 55 transition count 168
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 108 place count 55 transition count 151
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 52 transition count 169
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 160 place count 52 transition count 123
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 50 transition count 118
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 50 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 50 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 173 place count 46 transition count 113
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 175 place count 44 transition count 97
Iterating global reduction 7 with 2 rules applied. Total rules applied 177 place count 44 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 178 place count 44 transition count 97
Applied a total of 178 rules in 17 ms. Remains 44 /118 variables (removed 74) and now considering 97/481 (removed 384) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 97 rows 44 cols
[2024-05-21 03:40:24] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 03:40:24] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:40:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 03:40:24] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-21 03:40:24] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:40:24] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:24] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-21 03:40:24] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 834/834 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 834/834 (removed 0) transitions.
[2024-05-21 03:40:24] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
// Phase 1: matrix 677 rows 184 cols
[2024-05-21 03:40:24] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 03:40:24] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 03:40:24] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 03:40:24] [INFO ] Invariant cache hit.
[2024-05-21 03:40:25] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-21 03:40:25] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-05-21 03:40:25] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 03:40:25] [INFO ] Invariant cache hit.
[2024-05-21 03:40:25] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 702 ms. Remains : 184/184 places, 834/834 transitions.
Computed a total of 49 stabilizing places and 491 stable transitions
Computed a total of 49 stabilizing places and 491 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 298 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 688813 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 688813 steps, saw 93632 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 03:40:29] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 03:40:29] [INFO ] Invariant cache hit.
[2024-05-21 03:40:29] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 03:40:29] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:40:29] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 03:40:29] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-21 03:40:29] [INFO ] After 222ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-21 03:40:30] [INFO ] After 481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 206 ms.
[2024-05-21 03:40:30] [INFO ] After 1059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1 ms.
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 834/834 transitions.
Drop transitions removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 184 transition count 768
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 96 place count 169 transition count 913
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 128 place count 169 transition count 881
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 168 transition count 898
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 168 transition count 895
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 3 with 128 rules applied. Total rules applied 261 place count 168 transition count 767
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 304 place count 168 transition count 712
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 465 place count 125 transition count 594
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 472 place count 118 transition count 547
Iterating global reduction 4 with 7 rules applied. Total rules applied 479 place count 118 transition count 547
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 481 place count 118 transition count 545
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 542 place count 118 transition count 484
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 546 place count 118 transition count 484
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 549 place count 118 transition count 481
Applied a total of 549 rules in 65 ms. Remains 118 /184 variables (removed 66) and now considering 481/834 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 118/184 places, 481/834 transitions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:40:30] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
// Phase 1: matrix 281 rows 118 cols
[2024-05-21 03:40:30] [INFO ] Computed 13 invariants in 2 ms
[2024-05-21 03:40:30] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:40:30] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-21 03:40:30] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:30] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 03:40:30] [INFO ] After 68ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:30] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-21 03:40:30] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 481/481 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 118/118 places, 481/481 transitions.
Incomplete random walk after 10000 steps, including 198 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1100763 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :{}
Probabilistic random walk after 1100763 steps, saw 135764 distinct states, run finished after 3001 ms. (steps per millisecond=366 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:40:33] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
[2024-05-21 03:40:33] [INFO ] Invariant cache hit.
[2024-05-21 03:40:33] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:40:33] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-21 03:40:34] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:34] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 03:40:34] [INFO ] After 64ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:34] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-21 03:40:34] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 481/481 transitions.
Applied a total of 0 rules in 10 ms. Remains 118 /118 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 118/118 places, 481/481 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 481/481 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-21 03:40:34] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
[2024-05-21 03:40:34] [INFO ] Invariant cache hit.
[2024-05-21 03:40:34] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 03:40:34] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
[2024-05-21 03:40:34] [INFO ] Invariant cache hit.
[2024-05-21 03:40:34] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 03:40:34] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-05-21 03:40:34] [INFO ] Redundant transitions in 165 ms returned []
[2024-05-21 03:40:34] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
[2024-05-21 03:40:34] [INFO ] Invariant cache hit.
[2024-05-21 03:40:34] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 118/118 places, 481/481 transitions.
Graph (trivial) has 95 edges and 118 vertex of which 32 / 118 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 48 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 248 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 228
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 80 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 79 transition count 226
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 19 place count 79 transition count 217
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 37 place count 70 transition count 217
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 40 place count 67 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 67 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 65 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 65 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 64 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 64 transition count 206
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 66 place count 64 transition count 189
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 80 place count 57 transition count 182
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 87 place count 57 transition count 175
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 56 transition count 174
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 56 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 55 transition count 168
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 55 transition count 168
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 108 place count 55 transition count 151
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 52 transition count 169
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 160 place count 52 transition count 123
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 50 transition count 118
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 50 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 50 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 173 place count 46 transition count 113
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 175 place count 44 transition count 97
Iterating global reduction 7 with 2 rules applied. Total rules applied 177 place count 44 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 178 place count 44 transition count 97
Applied a total of 178 rules in 11 ms. Remains 44 /118 variables (removed 74) and now considering 97/481 (removed 384) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 97 rows 44 cols
[2024-05-21 03:40:34] [INFO ] Computed 10 invariants in 0 ms
[2024-05-21 03:40:34] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:40:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 03:40:34] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-21 03:40:34] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:40:34] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:40:34] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-21 03:40:35] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2840 reset in 400 ms.
Product exploration explored 100000 steps with 2849 reset in 393 ms.
Built C files in :
/tmp/ltsmin9875882415335465890
[2024-05-21 03:40:36] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9875882415335465890
Running compilation step : cd /tmp/ltsmin9875882415335465890;'/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 1404 ms.
Running link step : cd /tmp/ltsmin9875882415335465890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9875882415335465890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16882488311372236923.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 834/834 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 834/834 (removed 0) transitions.
[2024-05-21 03:40:51] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
// Phase 1: matrix 677 rows 184 cols
[2024-05-21 03:40:51] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 03:40:51] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 03:40:51] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 03:40:51] [INFO ] Invariant cache hit.
[2024-05-21 03:40:51] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-21 03:40:52] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-05-21 03:40:52] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 03:40:52] [INFO ] Invariant cache hit.
[2024-05-21 03:40:52] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 697 ms. Remains : 184/184 places, 834/834 transitions.
Built C files in :
/tmp/ltsmin8142238940451346967
[2024-05-21 03:40:52] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8142238940451346967
Running compilation step : cd /tmp/ltsmin8142238940451346967;'/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 1400 ms.
Running link step : cd /tmp/ltsmin8142238940451346967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8142238940451346967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased598042298444481785.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:41:07] [INFO ] Flatten gal took : 28 ms
[2024-05-21 03:41:07] [INFO ] Flatten gal took : 28 ms
[2024-05-21 03:41:07] [INFO ] Time to serialize gal into /tmp/LTL13056284981834495051.gal : 4 ms
[2024-05-21 03:41:07] [INFO ] Time to serialize properties into /tmp/LTL6587765388018210051.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13056284981834495051.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8564781322088378764.hoa' '-atoms' '/tmp/LTL6587765388018210051.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6587765388018210051.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8564781322088378764.hoa
Detected timeout of ITS tools.
[2024-05-21 03:41:22] [INFO ] Flatten gal took : 28 ms
[2024-05-21 03:41:22] [INFO ] Flatten gal took : 29 ms
[2024-05-21 03:41:22] [INFO ] Time to serialize gal into /tmp/LTL18214150856915041913.gal : 4 ms
[2024-05-21 03:41:22] [INFO ] Time to serialize properties into /tmp/LTL9608808866716649657.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18214150856915041913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9608808866716649657.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(G(("(((p919==0)||(p957==0))||((p1129==0)||(p1503==0)))")||(("(p1521==0)")||(X("(((p301==0)||(p343==0))||((p580==0)||(p1472...296
Formula 0 simplified : XF(!"((((p301==0)||(p343==0))||((p580==0)||(p1472==0)))&&((((p919==0)||(p957==0))||((p1129==0)||(p1503==0)))||(p1521==0)))" & XXF(!"...280
Detected timeout of ITS tools.
[2024-05-21 03:41:37] [INFO ] Flatten gal took : 39 ms
[2024-05-21 03:41:37] [INFO ] Applying decomposition
[2024-05-21 03:41:37] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14777694920928940674.txt' '-o' '/tmp/graph14777694920928940674.bin' '-w' '/tmp/graph14777694920928940674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14777694920928940674.bin' '-l' '-1' '-v' '-w' '/tmp/graph14777694920928940674.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:41:38] [INFO ] Decomposing Gal with order
[2024-05-21 03:41:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:41:38] [INFO ] Removed a total of 1798 redundant transitions.
[2024-05-21 03:41:38] [INFO ] Flatten gal took : 41 ms
[2024-05-21 03:41:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 6 ms.
[2024-05-21 03:41:38] [INFO ] Time to serialize gal into /tmp/LTL7800983406724081189.gal : 2 ms
[2024-05-21 03:41:38] [INFO ] Time to serialize properties into /tmp/LTL14094089447209405570.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7800983406724081189.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14094089447209405570.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(G(("(((i3.u22.p919==0)||(i3.u23.p957==0))||((i3.u28.p1129==0)||(u44.p1503==0)))")||(("(u44.p1521==0)")||(X("(((i1.u8.p301=...404
Formula 0 simplified : XF(!"((((i1.u8.p301==0)||(i1.u9.p343==0))||((i1.u8.p580==0)||(i4.u43.p1472==0)))&&((((i3.u22.p919==0)||(i3.u23.p957==0))||((i3.u28.p...388
Reverse transition relation is NOT exact ! Due to transitions t2492_t980, t2483_t792, t2006_t941_t752_t563_t370_t176, u44.t3, i0.t944_t949_t946, i0.t2399_t...2381
Computing Next relation with stutter on 1.31058e+12 deadlock states
6 unique states visited
0 strongly connected components in search stack
10 transitions explored
6 items max in DFS search stack
872 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.77518,346496,1,0,526317,23929,5648,2.4711e+06,1494,163046,223833
no accepting run found
Formula 0 is TRUE no accepting run found.
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudDeployment-PT-5b-LTLFireability-05 finished in 96112 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2024-05-21 03:41:49] [INFO ] Flatten gal took : 186 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10079398398642953015
[2024-05-21 03:41:49] [INFO ] Too many transitions (2547) to apply POR reductions. Disabling POR matrices.
[2024-05-21 03:41:49] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10079398398642953015
Running compilation step : cd /tmp/ltsmin10079398398642953015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 03:41:49] [INFO ] Applying decomposition
[2024-05-21 03:41:49] [INFO ] Flatten gal took : 190 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17043414891614139043.txt' '-o' '/tmp/graph17043414891614139043.bin' '-w' '/tmp/graph17043414891614139043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17043414891614139043.bin' '-l' '-1' '-v' '-w' '/tmp/graph17043414891614139043.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:41:49] [INFO ] Decomposing Gal with order
[2024-05-21 03:41:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:41:50] [INFO ] Removed a total of 10408 redundant transitions.
[2024-05-21 03:41:50] [INFO ] Flatten gal took : 610 ms
[2024-05-21 03:41:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2137 labels/synchronizations in 87 ms.
[2024-05-21 03:41:50] [INFO ] Time to serialize gal into /tmp/LTLFireability10492440395490875491.gal : 20 ms
[2024-05-21 03:41:50] [INFO ] Time to serialize properties into /tmp/LTLFireability6401027742232317530.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10492440395490875491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6401027742232317530.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(("((i19.u328.p1437==0)&&((((((i24.u4.p27==0)||(i24.u343.p58==0))||((i5.u10.p95==0)||(i24.u343.p302==0)))||(((i6.u73.p348==0)||(i1...605
Formula 0 simplified : G(!"((i19.u328.p1437==0)&&((((((i24.u4.p27==0)||(i24.u343.p58==0))||((i5.u10.p95==0)||(i24.u343.p302==0)))||(((i6.u73.p348==0)||(i10...594
Compilation finished in 8774 ms.
Running link step : cd /tmp/ltsmin10079398398642953015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10079398398642953015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp4==true) U X([](!(LTLAPp5==true))))&&(LTLAPp3==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t171, t172, t183, t218, t336, t366, t367, t385, t557, t558, t578, t686, t748, t749, t757,...1749
Computing Next relation with stutter on 1.94178e+12 deadlock states
Detected timeout of ITS tools.
[2024-05-21 04:05:45] [INFO ] Applying decomposition
[2024-05-21 04:05:45] [INFO ] Flatten gal took : 390 ms
[2024-05-21 04:05:45] [INFO ] Decomposing Gal with order
[2024-05-21 04:05:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:05:46] [INFO ] Removed a total of 19221 redundant transitions.
[2024-05-21 04:05:46] [INFO ] Flatten gal took : 715 ms
[2024-05-21 04:05:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 590 labels/synchronizations in 152 ms.
[2024-05-21 04:05:47] [INFO ] Time to serialize gal into /tmp/LTLFireability15401142954810146904.gal : 5 ms
[2024-05-21 04:05:47] [INFO ] Time to serialize properties into /tmp/LTLFireability15911611325752352596.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15401142954810146904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15911611325752352596.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((F(("((i0.i0.i1.u30.p1437==0)&&((((((i0.i0.i0.i0.i0.i0.i0.u8.p27==0)||(i0.i0.i0.i0.i0.i0.i0.u9.p58==0))||((i0.i0.i0.i0.i0.i0.u10.p95...814
Formula 0 simplified : G(!"((i0.i0.i1.u30.p1437==0)&&((((((i0.i0.i0.i0.i0.i0.i0.u8.p27==0)||(i0.i0.i0.i0.i0.i0.i0.u9.p58==0))||((i0.i0.i0.i0.i0.i0.u10.p95=...803
Reverse transition relation is NOT exact ! Due to transitions t1552, t2191, t2200, t2217, t2228, u40.t2, u40.t3, i0.t2501, i0.t2492, i0.t2485, i0.t2484, i0...2679
Computing Next relation with stutter on 1.94178e+12 deadlock states
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin10079398398642953015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp4==true) U X([](!(LTLAPp5==true))))&&(LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10079398398642953015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp6==true)||X(X([]((X((LTLAPp8==true))||(LTLAPp7==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 04:29:40] [INFO ] Flatten gal took : 445 ms
[2024-05-21 04:29:41] [INFO ] Input system was already deterministic with 2547 transitions.
[2024-05-21 04:29:41] [INFO ] Transformed 954 places.
[2024-05-21 04:29:41] [INFO ] Transformed 2547 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 04:29:41] [INFO ] Time to serialize gal into /tmp/LTLFireability10011173712027010920.gal : 40 ms
[2024-05-21 04:29:41] [INFO ] Time to serialize properties into /tmp/LTLFireability6334818422599629437.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10011173712027010920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6334818422599629437.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("((p1437==0)&&((((((p27==0)||(p58==0))||((p95==0)||(p302==0)))||(((p348==0)||(p385==0))||((p592==0)||(p638==0))))||((((p675==0)|...373
Formula 0 simplified : G(!"((p1437==0)&&((((((p27==0)||(p58==0))||((p95==0)||(p302==0)))||(((p348==0)||(p385==0))||((p592==0)||(p638==0))))||((((p675==0)||...362
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12831184 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16033256 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-5b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CloudDeployment-PT-5b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620522100373"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;