Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r069-smll-167814396400420.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r069-smll-167814396400420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 14:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 14:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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 1678451855858

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=itstools
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 202303021504
[2023-03-10 12:37:38] [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]
[2023-03-10 12:37:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 12:37:38] [INFO ] Load time of PNML (sax parser for PT used): 419 ms
[2023-03-10 12:37:38] [INFO ] Transformed 1525 places.
[2023-03-10 12:37:38] [INFO ] Transformed 3132 transitions.
[2023-03-10 12:37:38] [INFO ] Found NUPN structural information;
[2023-03-10 12:37:38] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 570 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-5b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 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 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 948 place count 973 transition count 2585
Iterating global reduction 1 with 151 rules applied. Total rules applied 1099 place count 973 transition count 2585
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 1118 place count 973 transition count 2566
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1134 place count 957 transition count 2550
Iterating global reduction 2 with 16 rules applied. Total rules applied 1150 place count 957 transition count 2550
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1151 place count 956 transition count 2549
Iterating global reduction 2 with 1 rules applied. Total rules applied 1152 place count 956 transition count 2549
Applied a total of 1152 rules in 690 ms. Remains 956 /1525 variables (removed 569) and now considering 2549/3132 (removed 583) transitions.
// Phase 1: matrix 2549 rows 956 cols
[2023-03-10 12:37:40] [INFO ] Computed 16 place invariants in 75 ms
[2023-03-10 12:37:41] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2023-03-10 12:37:41] [INFO ] Invariant cache hit.
[2023-03-10 12:37:42] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 2231 ms to find 0 implicit places.
[2023-03-10 12:37:42] [INFO ] Invariant cache hit.
[2023-03-10 12:37:44] [INFO ] Dead Transitions using invariants and state equation in 2082 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 956/1525 places, 2549/3132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5025 ms. Remains : 956/1525 places, 2549/3132 transitions.
Support contains 61 out of 956 places after structural reductions.
[2023-03-10 12:37:45] [INFO ] Flatten gal took : 563 ms
[2023-03-10 12:37:45] [INFO ] Flatten gal took : 369 ms
[2023-03-10 12:37:46] [INFO ] Input system was already deterministic with 2549 transitions.
Support contains 60 out of 956 places (down from 61) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 743 ms. (steps per millisecond=13 ) properties (out of 35) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-10 12:37:47] [INFO ] Invariant cache hit.
[2023-03-10 12:37:49] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 12 ms returned sat
[2023-03-10 12:37:49] [INFO ] After 1052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-10 12:37:50] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 15 ms returned sat
[2023-03-10 12:37:54] [INFO ] After 3160ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :14
[2023-03-10 12:37:56] [INFO ] After 5667ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :14
Attempting to minimize the solution found.
Minimization took 1876 ms.
[2023-03-10 12:37:58] [INFO ] After 9049ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :14
Fused 26 Parikh solutions to 14 different solutions.
Parikh walk visited 9 properties in 412 ms.
Support contains 12 out of 956 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Graph (trivial) has 969 edges and 956 vertex of which 346 / 956 are part of one of the 39 SCC in 7 ms
Free SCC test removed 307 places
Drop transitions removed 1415 transitions
Reduce isomorphic transitions removed 1415 transitions.
Graph (complete) has 2411 edges and 649 vertex of which 621 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.7 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 281 rules applied. Total rules applied 283 place count 621 transition count 853
Reduce places removed 263 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 266 rules applied. Total rules applied 549 place count 358 transition count 850
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 551 place count 356 transition count 850
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 551 place count 356 transition count 796
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 659 place count 302 transition count 796
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 667 place count 294 transition count 788
Iterating global reduction 3 with 8 rules applied. Total rules applied 675 place count 294 transition count 788
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 676 place count 294 transition count 787
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 676 place count 294 transition count 782
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 686 place count 289 transition count 782
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 848 place count 208 transition count 701
Performed 35 Post agglomeration using F-continuation condition with reduction of 54 identical transitions.
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 918 place count 173 transition count 907
Drop transitions removed 12 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 946 place count 173 transition count 879
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 5 with 130 rules applied. Total rules applied 1076 place count 173 transition count 749
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 5 with 43 rules applied. Total rules applied 1119 place count 173 transition count 694
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 5 with 156 rules applied. Total rules applied 1275 place count 130 transition count 581
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1281 place count 124 transition count 541
Iterating global reduction 6 with 6 rules applied. Total rules applied 1287 place count 124 transition count 541
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1289 place count 124 transition count 539
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 7 with 62 rules applied. Total rules applied 1351 place count 124 transition count 477
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1355 place count 124 transition count 477
Applied a total of 1355 rules in 350 ms. Remains 124 /956 variables (removed 832) and now considering 477/2549 (removed 2072) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 124/956 places, 477/2549 transitions.
Incomplete random walk after 10000 steps, including 165 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-10 12:37:59] [INFO ] Flow matrix only has 277 transitions (discarded 200 similar events)
// Phase 1: matrix 277 rows 124 cols
[2023-03-10 12:37:59] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-10 12:37:59] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 12:37:59] [INFO ] [Real]Absence check using 5 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 12:37:59] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 12:37:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 12:37:59] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 12:38:00] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 12:38:00] [INFO ] State equation strengthened by 149 read => feed constraints.
[2023-03-10 12:38:00] [INFO ] After 115ms SMT Verify possible using 149 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 12:38:00] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-10 12:38:00] [INFO ] After 541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 8 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 477/477 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 124 transition count 476
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 476
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 475
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 122 transition count 473
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 120 transition count 473
Applied a total of 8 rules in 43 ms. Remains 120 /124 variables (removed 4) and now considering 473/477 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 120/124 places, 473/477 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-10 12:38:00] [INFO ] Flow matrix only has 273 transitions (discarded 200 similar events)
// Phase 1: matrix 273 rows 120 cols
[2023-03-10 12:38:00] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-10 12:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 12:38:00] [INFO ] [Real]Absence check using 5 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-10 12:38:00] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 12:38:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 12:38:00] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-10 12:38:01] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 12:38:01] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-10 12:38:01] [INFO ] After 123ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 12:38:01] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-10 12:38:01] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 473/473 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 120 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 119 transition count 472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 118 transition count 471
Applied a total of 4 rules in 26 ms. Remains 118 /120 variables (removed 2) and now considering 471/473 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 118/120 places, 471/473 transitions.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 581626 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 581626 steps, saw 79011 distinct states, run finished after 3003 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 12:38:04] [INFO ] Flow matrix only has 266 transitions (discarded 205 similar events)
// Phase 1: matrix 266 rows 118 cols
[2023-03-10 12:38:04] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-10 12:38:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 12:38:04] [INFO ] [Real]Absence check using 5 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 12:38:04] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 12:38:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 12:38:04] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-10 12:38:04] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 12:38:05] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-10 12:38:05] [INFO ] After 82ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 12:38:05] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-10 12:38:05] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 471/471 transitions.
Applied a total of 0 rules in 14 ms. Remains 118 /118 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 118/118 places, 471/471 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 471/471 transitions.
Applied a total of 0 rules in 14 ms. Remains 118 /118 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2023-03-10 12:38:05] [INFO ] Flow matrix only has 266 transitions (discarded 205 similar events)
[2023-03-10 12:38:05] [INFO ] Invariant cache hit.
[2023-03-10 12:38:05] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-10 12:38:05] [INFO ] Flow matrix only has 266 transitions (discarded 205 similar events)
[2023-03-10 12:38:05] [INFO ] Invariant cache hit.
[2023-03-10 12:38:05] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-10 12:38:05] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-10 12:38:06] [INFO ] Redundant transitions in 287 ms returned []
[2023-03-10 12:38:06] [INFO ] Flow matrix only has 266 transitions (discarded 205 similar events)
[2023-03-10 12:38:06] [INFO ] Invariant cache hit.
[2023-03-10 12:38:06] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1031 ms. Remains : 118/118 places, 471/471 transitions.
Graph (trivial) has 104 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 205 transitions
Reduce isomorphic transitions removed 249 transitions.
Ensure Unique test removed 7 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 83 transition count 212
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 29 place count 73 transition count 211
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 31 place count 72 transition count 210
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 31 place count 72 transition count 202
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 47 place count 64 transition count 202
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 61 transition count 199
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 61 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 56 place count 58 transition count 181
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 58 transition count 181
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 104 place count 58 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 116 place count 52 transition count 130
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 124 place count 52 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 132 place count 48 transition count 142
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 169 place count 48 transition count 105
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 175 place count 45 transition count 102
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 177 place count 43 transition count 88
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 43 transition count 88
Applied a total of 179 rules in 30 ms. Remains 43 /118 variables (removed 75) and now considering 88/471 (removed 383) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 88 rows 43 cols
[2023-03-10 12:38:06] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-10 12:38:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 12:38:06] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 12:38:06] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 12:38:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 12:38:06] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 12:38:06] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 12:38:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-10 12:38:06] [INFO ] After 19ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 12:38:06] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-10 12:38:06] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 12 atomic propositions for a total of 15 simplifications.
FORMULA CloudDeployment-PT-5b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 152 stabilizing places and 1504 stable transitions
Graph (complete) has 2925 edges and 956 vertex of which 928 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.30 ms
FORMULA CloudDeployment-PT-5b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(!p0)))'
Support contains 1 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 934 transition count 1515
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 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 44 place count 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 929 transition count 1509
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 929 transition count 1509
Applied a total of 54 rules in 151 ms. Remains 929 /956 variables (removed 27) and now considering 1509/2549 (removed 1040) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2023-03-10 12:38:07] [INFO ] Computed 15 place invariants in 8 ms
[2023-03-10 12:38:07] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-10 12:38:07] [INFO ] Invariant cache hit.
[2023-03-10 12:38:08] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1646 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 919/956 places, 1509/2549 transitions.
Applied a total of 0 rules in 26 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 1825 ms. Remains : 919/956 places, 1509/2549 transitions.
Stuttering acceptance computed with spot in 340 ms :[p0, true, p0, p0]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(NEQ s617 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 13 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-01 finished in 2263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 935 transition count 1516
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 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 42 place count 935 transition count 1515
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 932 transition count 1512
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 932 transition count 1512
Applied a total of 48 rules in 208 ms. Remains 932 /956 variables (removed 24) and now considering 1512/2549 (removed 1037) transitions.
// Phase 1: matrix 1512 rows 932 cols
[2023-03-10 12:38:09] [INFO ] Computed 15 place invariants in 9 ms
[2023-03-10 12:38:09] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-10 12:38:09] [INFO ] Invariant cache hit.
[2023-03-10 12:38:10] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1647 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 922/956 places, 1512/2549 transitions.
Applied a total of 0 rules in 28 ms. Remains 922 /922 variables (removed 0) and now considering 1512/1512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1886 ms. Remains : 922/956 places, 1512/2549 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s786 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]]
Stuttering criterion allowed to conclude after 228 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 2020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U X(G(!p2)))&&p0)))'
Support contains 24 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 946 transition count 2539
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 946 transition count 2539
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 946 transition count 2538
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 942 transition count 2534
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 942 transition count 2534
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 941 transition count 2533
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 941 transition count 2533
Applied a total of 31 rules in 138 ms. Remains 941 /956 variables (removed 15) and now considering 2533/2549 (removed 16) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2023-03-10 12:38:11] [INFO ] Computed 16 place invariants in 24 ms
[2023-03-10 12:38:11] [INFO ] Implicit Places using invariants in 672 ms returned []
[2023-03-10 12:38:11] [INFO ] Invariant cache hit.
[2023-03-10 12:38:14] [INFO ] Implicit Places using invariants and state equation in 2507 ms returned []
Implicit Place search using SMT with State Equation took 3186 ms to find 0 implicit places.
[2023-03-10 12:38:14] [INFO ] Invariant cache hit.
[2023-03-10 12:38:16] [INFO ] Dead Transitions using invariants and state equation in 2381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 941/956 places, 2533/2549 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5710 ms. Remains : 941/956 places, 2533/2549 transitions.
Stuttering acceptance computed with spot in 165 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 622 reset in 567 ms.
Product exploration explored 100000 steps with 620 reset in 528 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.12 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 p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1511 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 152 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 52 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-10 12:38:21] [INFO ] Invariant cache hit.
[2023-03-10 12:38:21] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2023-03-10 12:38:21] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 9 ms returned sat
[2023-03-10 12:38:23] [INFO ] After 1945ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-10 12:38:25] [INFO ] After 3254ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 762 ms.
[2023-03-10 12:38:26] [INFO ] After 4434ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 86 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 3 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.3 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 307 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 309 ms. Remains : 146/941 places, 1499/2533 transitions.
Incomplete random walk after 10000 steps, including 262 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 296564 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296564 steps, saw 44640 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 12:38:30] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
// Phase 1: matrix 1299 rows 146 cols
[2023-03-10 12:38:30] [INFO ] Computed 21 place invariants in 18 ms
[2023-03-10 12:38:30] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 12:38:30] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 12:38:30] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 12:38:30] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-10 12:38:31] [INFO ] After 215ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 12:38:31] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-10 12:38:31] [INFO ] After 1301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 23 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 32 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 33 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 31 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
[2023-03-10 12:38:31] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 12:38:31] [INFO ] Invariant cache hit.
[2023-03-10 12:38:32] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-10 12:38:32] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 12:38:32] [INFO ] Invariant cache hit.
[2023-03-10 12:38:32] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-10 12:38:34] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2418 ms to find 0 implicit places.
[2023-03-10 12:38:34] [INFO ] Redundant transitions in 239 ms returned []
[2023-03-10 12:38:34] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 12:38:34] [INFO ] Invariant cache hit.
[2023-03-10 12:38:35] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3572 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 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 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 1 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 122 ms. Remains 78 /146 variables (removed 68) and now considering 1132/1499 (removed 367) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1132 rows 78 cols
[2023-03-10 12:38:35] [INFO ] Computed 21 place invariants in 15 ms
[2023-03-10 12:38:35] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 12:38:35] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2023-03-10 12:38:35] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 12:38:36] [INFO ] After 603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-10 12:38:36] [INFO ] After 771ms 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 (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 28 factoid took 1436 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 136 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 127 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 26 ms. Remains 941 /941 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2023-03-10 12:38:37] [INFO ] Computed 16 place invariants in 18 ms
[2023-03-10 12:38:38] [INFO ] Implicit Places using invariants in 715 ms returned []
[2023-03-10 12:38:38] [INFO ] Invariant cache hit.
[2023-03-10 12:38:41] [INFO ] Implicit Places using invariants and state equation in 2611 ms returned []
Implicit Place search using SMT with State Equation took 3330 ms to find 0 implicit places.
[2023-03-10 12:38:41] [INFO ] Invariant cache hit.
[2023-03-10 12:38:43] [INFO ] Dead Transitions using invariants and state equation in 1765 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5134 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.10 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 p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1095 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 130 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Incomplete random walk after 10000 steps, including 60 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-10 12:38:44] [INFO ] Invariant cache hit.
[2023-03-10 12:38:45] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 12:38:45] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 9 ms returned sat
[2023-03-10 12:38:47] [INFO ] After 2001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 12:38:48] [INFO ] After 3013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 677 ms.
[2023-03-10 12:38:49] [INFO ] After 4027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 3 properties in 135 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 7 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.2 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 1 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 242 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 242 ms. Remains : 146/941 places, 1499/2533 transitions.
Incomplete random walk after 10000 steps, including 257 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 352283 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 352283 steps, saw 52477 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 12:38:52] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
// Phase 1: matrix 1299 rows 146 cols
[2023-03-10 12:38:52] [INFO ] Computed 21 place invariants in 16 ms
[2023-03-10 12:38:53] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 12:38:53] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 12:38:53] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 12:38:53] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-10 12:38:53] [INFO ] After 190ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 12:38:54] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-10 12:38:54] [INFO ] After 1069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 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 26 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 26 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 26 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
[2023-03-10 12:38:54] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 12:38:54] [INFO ] Invariant cache hit.
[2023-03-10 12:38:54] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-10 12:38:54] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 12:38:54] [INFO ] Invariant cache hit.
[2023-03-10 12:38:55] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-10 12:38:56] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2164 ms to find 0 implicit places.
[2023-03-10 12:38:56] [INFO ] Redundant transitions in 353 ms returned []
[2023-03-10 12:38:56] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 12:38:56] [INFO ] Invariant cache hit.
[2023-03-10 12:38:57] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3518 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 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 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 1 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 105 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
[2023-03-10 12:38:57] [INFO ] Computed 21 place invariants in 9 ms
[2023-03-10 12:38:57] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 12:38:57] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-10 12:38:58] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 12:38:58] [INFO ] After 746ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-10 12:38:58] [INFO ] After 930ms 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 p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 18 factoid took 1105 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 172 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
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 136 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Product exploration explored 100000 steps with 614 reset in 538 ms.
Product exploration explored 100000 steps with 615 reset in 413 ms.
Built C files in :
/tmp/ltsmin5394189458379867612
[2023-03-10 12:39:01] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5394189458379867612
Running compilation step : cd /tmp/ltsmin5394189458379867612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5394189458379867612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5394189458379867612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 30 ms. Remains 941 /941 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2023-03-10 12:39:04] [INFO ] Computed 16 place invariants in 15 ms
[2023-03-10 12:39:05] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-10 12:39:05] [INFO ] Invariant cache hit.
[2023-03-10 12:39:08] [INFO ] Implicit Places using invariants and state equation in 2675 ms returned []
Implicit Place search using SMT with State Equation took 3421 ms to find 0 implicit places.
[2023-03-10 12:39:08] [INFO ] Invariant cache hit.
[2023-03-10 12:39:10] [INFO ] Dead Transitions using invariants and state equation in 2385 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5837 ms. Remains : 941/941 places, 2533/2533 transitions.
Built C files in :
/tmp/ltsmin13224802006688969853
[2023-03-10 12:39:10] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13224802006688969853
Running compilation step : cd /tmp/ltsmin13224802006688969853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13224802006688969853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13224802006688969853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-10 12:39:14] [INFO ] Flatten gal took : 305 ms
[2023-03-10 12:39:14] [INFO ] Flatten gal took : 268 ms
[2023-03-10 12:39:14] [INFO ] Time to serialize gal into /tmp/LTL465772245117987732.gal : 55 ms
[2023-03-10 12:39:14] [INFO ] Time to serialize properties into /tmp/LTL9944128200742762996.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL465772245117987732.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6146414912064144525.hoa' '-atoms' '/tmp/LTL9944128200742762996.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL9944128200742762996.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6146414912064144525.hoa
Detected timeout of ITS tools.
[2023-03-10 12:39:30] [INFO ] Flatten gal took : 261 ms
[2023-03-10 12:39:30] [INFO ] Flatten gal took : 245 ms
[2023-03-10 12:39:30] [INFO ] Time to serialize gal into /tmp/LTL10196346133867182500.gal : 46 ms
[2023-03-10 12:39:30] [INFO ] Time to serialize properties into /tmp/LTL10982291579213998811.ltl : 6 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10196346133867182500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10982291579213998811.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
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.
[2023-03-10 12:39:45] [INFO ] Flatten gal took : 249 ms
[2023-03-10 12:39:45] [INFO ] Applying decomposition
[2023-03-10 12:39:46] [INFO ] Flatten gal took : 219 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph754921210542843608.txt' '-o' '/tmp/graph754921210542843608.bin' '-w' '/tmp/graph754921210542843608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph754921210542843608.bin' '-l' '-1' '-v' '-w' '/tmp/graph754921210542843608.weights' '-q' '0' '-e' '0.001'
[2023-03-10 12:39:46] [INFO ] Decomposing Gal with order
[2023-03-10 12:39:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 12:39:48] [INFO ] Removed a total of 10958 redundant transitions.
[2023-03-10 12:39:48] [INFO ] Flatten gal took : 1190 ms
[2023-03-10 12:39:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2143 labels/synchronizations in 341 ms.
[2023-03-10 12:39:49] [INFO ] Time to serialize gal into /tmp/LTL2009717374810632968.gal : 48 ms
[2023-03-10 12:39:49] [INFO ] Time to serialize properties into /tmp/LTL1995774547545795858.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2009717374810632968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1995774547545795858.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((("(i21.i1.i2.u318.p1437==0)")&&(("(i22.i0.i1.u269.p1260==1)")U(X(G(!("(((((i23.u5.p49==1)&&(i23.u10.p87==1))&&((i3.i0.i1.u52.p24...630
Formula 0 simplified : G(!"((((((i23.u5.p27==0)||(i23.u10.p58==0))||((i4.i0.i0.u11.p95==0)||(i23.u334.p302==0)))||(((i5.u75.p348==0)||(i9.u78.p385==0))||((...617
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10956477696618092916
[2023-03-10 12:40:04] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10956477696618092916
Running compilation step : cd /tmp/ltsmin10956477696618092916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10956477696618092916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10956477696618092916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 116402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G((X(p2)||p1))))))))'
Support contains 9 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 934 transition count 1515
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 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 44 place count 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 929 transition count 1509
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 929 transition count 1509
Applied a total of 54 rules in 123 ms. Remains 929 /956 variables (removed 27) and now considering 1509/2549 (removed 1040) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2023-03-10 12:40:07] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-10 12:40:07] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-10 12:40:07] [INFO ] Invariant cache hit.
[2023-03-10 12:40:09] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1682 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 919/956 places, 1509/2549 transitions.
Applied a total of 0 rules in 27 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 1832 ms. Remains : 919/956 places, 1509/2549 transitions.
Stuttering acceptance computed with spot in 193 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 610 reset in 269 ms.
Product exploration explored 100000 steps with 626 reset in 352 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.6 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 186 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 201 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 61 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 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 176805 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176805 steps, saw 41907 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1509 rows 919 cols
[2023-03-10 12:40:13] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-10 12:40:14] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 12:40:14] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 12:40:15] [INFO ] After 1160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 12:40:16] [INFO ] After 1774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 463 ms.
[2023-03-10 12:40:16] [INFO ] After 2544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 105 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 124 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 124 ms. Remains : 118/919 places, 476/1509 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 420341 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 420341 steps, saw 55877 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 12:40:20] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
// Phase 1: matrix 276 rows 118 cols
[2023-03-10 12:40:20] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-10 12:40:20] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 12:40:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 12:40:20] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 12:40:20] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 12:40:20] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 12:40:21] [INFO ] After 191ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 12:40:21] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-10 12:40:21] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 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 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 7 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
[2023-03-10 12:40:21] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 12:40:21] [INFO ] Invariant cache hit.
[2023-03-10 12:40:21] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 12:40:21] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 12:40:21] [INFO ] Invariant cache hit.
[2023-03-10 12:40:21] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 12:40:21] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-10 12:40:22] [INFO ] Redundant transitions in 254 ms returned []
[2023-03-10 12:40:22] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 12:40:22] [INFO ] Invariant cache hit.
[2023-03-10 12:40:22] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1170 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 1 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 24 ms. Remains 44 /118 variables (removed 74) and now considering 96/476 (removed 380) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 96 rows 44 cols
[2023-03-10 12:40:22] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 12:40:22] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 12:40:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 12:40:22] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 12:40:22] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 12:40:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 12:40:22] [INFO ] After 48ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 12:40:22] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-10 12:40:22] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 174 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 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))]
Stuttering acceptance computed with spot in 209 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
[2023-03-10 12:40:23] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-10 12:40:23] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-10 12:40:23] [INFO ] Invariant cache hit.
[2023-03-10 12:40:25] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
[2023-03-10 12:40:25] [INFO ] Invariant cache hit.
[2023-03-10 12:40:26] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2510 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.4 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 160 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 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))]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 166202 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166202 steps, saw 39805 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 12:40:30] [INFO ] Invariant cache hit.
[2023-03-10 12:40:30] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 12:40:30] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 12:40:31] [INFO ] After 1136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 12:40:32] [INFO ] After 2017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 504 ms.
[2023-03-10 12:40:33] [INFO ] After 2811ms 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 52 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 0 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 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 117 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 117 ms. Remains : 118/919 places, 476/1509 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 12:40:33] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
// Phase 1: matrix 276 rows 118 cols
[2023-03-10 12:40:33] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-10 12:40:33] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 12:40:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 12:40:33] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-10 12:40:33] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 12:40:33] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 12:40:33] [INFO ] After 79ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 12:40:33] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-10 12:40:34] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 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 8 ms. Remains : 118/118 places, 476/476 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 666746 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 666746 steps, saw 84593 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 12:40:37] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 12:40:37] [INFO ] Invariant cache hit.
[2023-03-10 12:40:37] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 12:40:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 12:40:37] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 12:40:37] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 12:40:37] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 12:40:37] [INFO ] After 77ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 12:40:37] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-10 12:40:37] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 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 9 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 8 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
[2023-03-10 12:40:37] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 12:40:37] [INFO ] Invariant cache hit.
[2023-03-10 12:40:37] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 12:40:37] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 12:40:37] [INFO ] Invariant cache hit.
[2023-03-10 12:40:37] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 12:40:38] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2023-03-10 12:40:38] [INFO ] Redundant transitions in 367 ms returned []
[2023-03-10 12:40:38] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 12:40:38] [INFO ] Invariant cache hit.
[2023-03-10 12:40:38] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1274 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 34 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
[2023-03-10 12:40:39] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 12:40:39] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 12:40:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 12:40:39] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 12:40:39] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 12:40:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 12:40:39] [INFO ] After 24ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 12:40:39] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-10 12:40:39] [INFO ] After 169ms 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 p2 p1)))]
Knowledge based reduction with 4 factoid took 229 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 200 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 288 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 194 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 631 reset in 255 ms.
Product exploration explored 100000 steps with 622 reset in 272 ms.
Built C files in :
/tmp/ltsmin18012537669916445540
[2023-03-10 12:40:40] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18012537669916445540
Running compilation step : cd /tmp/ltsmin18012537669916445540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18012537669916445540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18012537669916445540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 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 26 ms. Remains 919 /919 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
// Phase 1: matrix 1509 rows 919 cols
[2023-03-10 12:40:43] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-10 12:40:44] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-10 12:40:44] [INFO ] Invariant cache hit.
[2023-03-10 12:40:45] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
[2023-03-10 12:40:45] [INFO ] Invariant cache hit.
[2023-03-10 12:40:46] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2443 ms. Remains : 919/919 places, 1509/1509 transitions.
Built C files in :
/tmp/ltsmin5817648212626071015
[2023-03-10 12:40:46] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5817648212626071015
Running compilation step : cd /tmp/ltsmin5817648212626071015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5817648212626071015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5817648212626071015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-10 12:40:49] [INFO ] Flatten gal took : 51 ms
[2023-03-10 12:40:49] [INFO ] Flatten gal took : 51 ms
[2023-03-10 12:40:49] [INFO ] Time to serialize gal into /tmp/LTL2367520974179970123.gal : 8 ms
[2023-03-10 12:40:49] [INFO ] Time to serialize properties into /tmp/LTL5700313706131351957.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2367520974179970123.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10447846997614058893.hoa' '-atoms' '/tmp/LTL5700313706131351957.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5700313706131351957.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10447846997614058893.hoa
Detected timeout of ITS tools.
[2023-03-10 12:41:04] [INFO ] Flatten gal took : 55 ms
[2023-03-10 12:41:04] [INFO ] Flatten gal took : 62 ms
[2023-03-10 12:41:04] [INFO ] Time to serialize gal into /tmp/LTL9301223530860803450.gal : 14 ms
[2023-03-10 12:41:04] [INFO ] Time to serialize properties into /tmp/LTL7583722954246372397.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9301223530860803450.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7583722954246372397.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
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.
[2023-03-10 12:41:19] [INFO ] Flatten gal took : 52 ms
[2023-03-10 12:41:19] [INFO ] Applying decomposition
[2023-03-10 12:41:20] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6649717214926757953.txt' '-o' '/tmp/graph6649717214926757953.bin' '-w' '/tmp/graph6649717214926757953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6649717214926757953.bin' '-l' '-1' '-v' '-w' '/tmp/graph6649717214926757953.weights' '-q' '0' '-e' '0.001'
[2023-03-10 12:41:20] [INFO ] Decomposing Gal with order
[2023-03-10 12:41:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 12:41:20] [INFO ] Removed a total of 2175 redundant transitions.
[2023-03-10 12:41:20] [INFO ] Flatten gal took : 90 ms
[2023-03-10 12:41:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 25 ms.
[2023-03-10 12:41:20] [INFO ] Time to serialize gal into /tmp/LTL10824696519237962600.gal : 12 ms
[2023-03-10 12:41:20] [INFO ] Time to serialize properties into /tmp/LTL4950381799276899000.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10824696519237962600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4950381799276899000.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(G(("(((i24.u197.p919==0)||(i24.u202.p957==0))||((i17.i1.i4.u245.p1129==0)||(i24.u330.p1503==0)))")||(("(i24.u334.p1521==0)...458
Formula 0 simplified : XF(!"((((i4.u69.p301==0)||(i4.u75.p343==0))||((i4.u77.p580==0)||(i24.u325.p1472==0)))&&((((i24.u197.p919==0)||(i24.u202.p957==0))||(...442
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17118527634841936434
[2023-03-10 12:41:35] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17118527634841936434
Running compilation step : cd /tmp/ltsmin17118527634841936434;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17118527634841936434;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17118527634841936434;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-05 finished in 91060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 934 transition count 1515
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 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 44 place count 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 929 transition count 1509
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 929 transition count 1509
Applied a total of 54 rules in 111 ms. Remains 929 /956 variables (removed 27) and now considering 1509/2549 (removed 1040) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2023-03-10 12:41:38] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-10 12:41:38] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-10 12:41:38] [INFO ] Invariant cache hit.
[2023-03-10 12:41:40] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1616 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 919/956 places, 1509/2549 transitions.
Applied a total of 0 rules in 27 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 1754 ms. Remains : 919/956 places, 1509/2549 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, p0, p0]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s697 1) (EQ s792 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 31341 steps with 193 reset in 78 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-06 finished in 1933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (G(p0)||(p0&&G(!p1)))) U X(!p0))))'
Support contains 6 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 935 transition count 1516
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 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 42 place count 935 transition count 1515
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 931 transition count 1511
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 931 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 930 transition count 1510
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 930 transition count 1510
Applied a total of 52 rules in 108 ms. Remains 930 /956 variables (removed 26) and now considering 1510/2549 (removed 1039) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2023-03-10 12:41:40] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-10 12:41:40] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-10 12:41:40] [INFO ] Invariant cache hit.
[2023-03-10 12:41:42] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned [11, 19, 185, 193, 359, 367, 532, 540, 705, 713]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1572 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 920/956 places, 1510/2549 transitions.
Applied a total of 0 rules in 23 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 1703 ms. Remains : 920/956 places, 1510/2549 transitions.
Stuttering acceptance computed with spot in 279 ms :[p1, (OR p1 p0), p0, true, p0, p0, true, p0]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0), acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 2}]], initial=7, aps=[p1:(AND (EQ s529 1) (EQ s545 1) (EQ s561 1) (EQ s899 1) (EQ s916 1)), p0:(NEQ s206 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 92 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 2010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 956 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Graph (trivial) has 985 edges and 956 vertex of which 355 / 956 are part of one of the 40 SCC in 0 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2502 edges and 641 vertex of which 613 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 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 263 place count 612 transition count 902
Reduce places removed 261 places and 0 transitions.
Iterating post reduction 1 with 261 rules applied. Total rules applied 524 place count 351 transition count 902
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 524 place count 351 transition count 854
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 620 place count 303 transition count 854
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 624 place count 299 transition count 850
Iterating global reduction 2 with 4 rules applied. Total rules applied 628 place count 299 transition count 850
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 629 place count 299 transition count 849
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 817 place count 205 transition count 755
Performed 26 Post agglomeration using F-continuation condition with reduction of 56 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 869 place count 179 transition count 840
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 3 with 53 rules applied. Total rules applied 922 place count 179 transition count 787
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 930 place count 175 transition count 855
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 3 with 64 rules applied. Total rules applied 994 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 995 place count 174 transition count 790
Applied a total of 995 rules in 199 ms. Remains 174 /956 variables (removed 782) and now considering 790/2549 (removed 1759) transitions.
[2023-03-10 12:41:42] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
// Phase 1: matrix 606 rows 174 cols
[2023-03-10 12:41:42] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 12:41:42] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-10 12:41:42] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 12:41:42] [INFO ] Invariant cache hit.
[2023-03-10 12:41:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-10 12:41:43] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2023-03-10 12:41:44] [INFO ] Redundant transitions in 729 ms returned []
[2023-03-10 12:41:44] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 12:41:44] [INFO ] Invariant cache hit.
[2023-03-10 12:41:44] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/956 places, 790/2549 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1993 ms. Remains : 174/956 places, 790/2549 transitions.
Stuttering acceptance computed with spot in 74 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 3085 reset in 506 ms.
Product exploration explored 100000 steps with 3085 reset in 447 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 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 335 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 810158 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 810158 steps, saw 105465 distinct states, run finished after 3005 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 12:41:48] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 12:41:48] [INFO ] Invariant cache hit.
[2023-03-10 12:41:48] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 12:41:49] [INFO ] After 186ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 12:41:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-10 12:41:49] [INFO ] After 25ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-10 12:41:49] [INFO ] After 61ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-10 12:41:49] [INFO ] After 322ms 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.1 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 81 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 81 ms. Remains : 108/174 places, 399/790 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
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 187 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 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 16 ms. Remains 174 /174 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2023-03-10 12:41:49] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 12:41:49] [INFO ] Invariant cache hit.
[2023-03-10 12:41:49] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-10 12:41:49] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 12:41:49] [INFO ] Invariant cache hit.
[2023-03-10 12:41:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-10 12:41:50] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2023-03-10 12:41:50] [INFO ] Redundant transitions in 710 ms returned []
[2023-03-10 12:41:50] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 12:41:50] [INFO ] Invariant cache hit.
[2023-03-10 12:41:51] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2102 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 169 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 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 329 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 812122 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :{}
Probabilistic random walk after 812122 steps, saw 105841 distinct states, run finished after 3002 ms. (steps per millisecond=270 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 12:41:55] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 12:41:55] [INFO ] Invariant cache hit.
[2023-03-10 12:41:55] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 12:41:55] [INFO ] After 218ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 12:41:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-10 12:41:55] [INFO ] After 30ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-10 12:41:55] [INFO ] After 69ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-10 12:41:55] [INFO ] After 376ms 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.1 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 80 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 81 ms. Remains : 108/174 places, 399/790 transitions.
Finished random walk after 1179 steps, including 24 resets, run visited all 1 properties in 5 ms. (steps per millisecond=235 )
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 178 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3077 reset in 383 ms.
Product exploration explored 100000 steps with 3050 reset in 405 ms.
Built C files in :
/tmp/ltsmin18268128224250095472
[2023-03-10 12:41:56] [INFO ] Computing symmetric may disable matrix : 790 transitions.
[2023-03-10 12:41:56] [INFO ] Computation of Complete disable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 12:41:56] [INFO ] Computing symmetric may enable matrix : 790 transitions.
[2023-03-10 12:41:56] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 12:41:56] [INFO ] Computing Do-Not-Accords matrix : 790 transitions.
[2023-03-10 12:41:57] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 12:41:57] [INFO ] Built C files in 257ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18268128224250095472
Running compilation step : cd /tmp/ltsmin18268128224250095472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18268128224250095472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18268128224250095472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 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 16 ms. Remains 174 /174 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2023-03-10 12:42:00] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 12:42:00] [INFO ] Invariant cache hit.
[2023-03-10 12:42:00] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-10 12:42:00] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 12:42:00] [INFO ] Invariant cache hit.
[2023-03-10 12:42:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-10 12:42:00] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
[2023-03-10 12:42:01] [INFO ] Redundant transitions in 964 ms returned []
[2023-03-10 12:42:01] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 12:42:01] [INFO ] Invariant cache hit.
[2023-03-10 12:42:02] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2296 ms. Remains : 174/174 places, 790/790 transitions.
Built C files in :
/tmp/ltsmin3030855247706013104
[2023-03-10 12:42:02] [INFO ] Computing symmetric may disable matrix : 790 transitions.
[2023-03-10 12:42:02] [INFO ] Computation of Complete disable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 12:42:02] [INFO ] Computing symmetric may enable matrix : 790 transitions.
[2023-03-10 12:42:02] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 12:42:02] [INFO ] Computing Do-Not-Accords matrix : 790 transitions.
[2023-03-10 12:42:02] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 12:42:02] [INFO ] Built C files in 308ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3030855247706013104
Running compilation step : cd /tmp/ltsmin3030855247706013104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3030855247706013104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3030855247706013104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-10 12:42:05] [INFO ] Flatten gal took : 65 ms
[2023-03-10 12:42:05] [INFO ] Flatten gal took : 71 ms
[2023-03-10 12:42:06] [INFO ] Time to serialize gal into /tmp/LTL6062056751851500828.gal : 9 ms
[2023-03-10 12:42:06] [INFO ] Time to serialize properties into /tmp/LTL412326847362219802.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6062056751851500828.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17826487527402869528.hoa' '-atoms' '/tmp/LTL412326847362219802.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL412326847362219802.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17826487527402869528.hoa
Detected timeout of ITS tools.
[2023-03-10 12:42:21] [INFO ] Flatten gal took : 33 ms
[2023-03-10 12:42:21] [INFO ] Flatten gal took : 34 ms
[2023-03-10 12:42:21] [INFO ] Time to serialize gal into /tmp/LTL16137566080131528163.gal : 5 ms
[2023-03-10 12:42:21] [INFO ] Time to serialize properties into /tmp/LTL6693409060674184811.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16137566080131528163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6693409060674184811.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.202303021504/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.
[2023-03-10 12:42:36] [INFO ] Flatten gal took : 35 ms
[2023-03-10 12:42:36] [INFO ] Applying decomposition
[2023-03-10 12:42:36] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4564554942996809891.txt' '-o' '/tmp/graph4564554942996809891.bin' '-w' '/tmp/graph4564554942996809891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4564554942996809891.bin' '-l' '-1' '-v' '-w' '/tmp/graph4564554942996809891.weights' '-q' '0' '-e' '0.001'
[2023-03-10 12:42:36] [INFO ] Decomposing Gal with order
[2023-03-10 12:42:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 12:42:36] [INFO ] Removed a total of 1740 redundant transitions.
[2023-03-10 12:42:36] [INFO ] Flatten gal took : 58 ms
[2023-03-10 12:42:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 7 ms.
[2023-03-10 12:42:36] [INFO ] Time to serialize gal into /tmp/LTL16927101425005009000.gal : 4 ms
[2023-03-10 12:42:36] [INFO ] Time to serialize properties into /tmp/LTL12723764245557630431.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16927101425005009000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12723764245557630431.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
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 t1, t2494_t982, t2485_t790, t28_t2008_t942_t750_t561_t373_t180, t28_t2279_t982_t3, t28_t2273_...2435
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
112 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.17867,56276,1,0,71118,8522,4724,248280,926,63501,48646
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 55433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 2 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 935 transition count 1516
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 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 42 place count 935 transition count 1515
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 932 transition count 1512
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 932 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 931 transition count 1511
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 931 transition count 1511
Applied a total of 50 rules in 115 ms. Remains 931 /956 variables (removed 25) and now considering 1511/2549 (removed 1038) transitions.
// Phase 1: matrix 1511 rows 931 cols
[2023-03-10 12:42:38] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-10 12:42:38] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-10 12:42:38] [INFO ] Invariant cache hit.
[2023-03-10 12:42:39] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned [11, 19, 187, 195, 360, 368, 533, 541, 706, 714]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1666 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 921/956 places, 1511/2549 transitions.
Applied a total of 0 rules in 22 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 1803 ms. Remains : 921/956 places, 1511/2549 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s119 0), p0:(EQ s461 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1247 ms.
Product exploration explored 100000 steps with 50000 reset in 1177 ms.
Computed a total of 135 stabilizing places and 475 stable transitions
Graph (complete) has 2709 edges and 921 vertex of which 914 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Computed a total of 135 stabilizing places and 475 stable transitions
Detected a total of 135/921 stabilizing places and 475/1511 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLFireability-10 finished in 4534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 935 transition count 1516
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 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 42 place count 935 transition count 1515
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 932 transition count 1512
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 932 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 931 transition count 1511
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 931 transition count 1511
Applied a total of 50 rules in 112 ms. Remains 931 /956 variables (removed 25) and now considering 1511/2549 (removed 1038) transitions.
// Phase 1: matrix 1511 rows 931 cols
[2023-03-10 12:42:42] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-10 12:42:42] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-10 12:42:42] [INFO ] Invariant cache hit.
[2023-03-10 12:42:44] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 706, 714]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1662 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 921/956 places, 1511/2549 transitions.
Applied a total of 0 rules in 22 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 1797 ms. Remains : 921/956 places, 1511/2549 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-13 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 s662 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-13 finished in 1894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p0 U (X(p1)||G(p0))))))))'
Support contains 2 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 935 transition count 1516
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 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 42 place count 935 transition count 1515
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 931 transition count 1511
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 931 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 930 transition count 1510
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 930 transition count 1510
Applied a total of 52 rules in 108 ms. Remains 930 /956 variables (removed 26) and now considering 1510/2549 (removed 1039) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2023-03-10 12:42:44] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-10 12:42:44] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-10 12:42:44] [INFO ] Invariant cache hit.
[2023-03-10 12:42:46] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 705, 713]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1627 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 920/956 places, 1510/2549 transitions.
Applied a total of 0 rules in 21 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 1756 ms. Remains : 920/956 places, 1510/2549 transitions.
Stuttering acceptance computed with spot in 178 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 627 reset in 232 ms.
Product exploration explored 100000 steps with 624 reset in 245 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.6 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 210 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 179 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 64 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1510 rows 920 cols
[2023-03-10 12:42:47] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-10 12:42:47] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 12:42:48] [INFO ] After 644ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-10 12:42:48] [INFO ] After 734ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 12:42:48] [INFO ] After 933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 12:42:48] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 12:42:49] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 12:42:49] [INFO ] After 824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-10 12:42:49] [INFO ] After 1119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 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 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 1 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 204 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 204 ms. Remains : 110/920 places, 398/1510 transitions.
Finished random walk after 170 steps, including 2 resets, run visited all 2 properties in 4 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X 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 284 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 191 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 185 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 22 ms. Remains 920 /920 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2023-03-10 12:42:50] [INFO ] Invariant cache hit.
[2023-03-10 12:42:50] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-10 12:42:50] [INFO ] Invariant cache hit.
[2023-03-10 12:42:51] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
[2023-03-10 12:42:51] [INFO ] Invariant cache hit.
[2023-03-10 12:42:53] [INFO ] Dead Transitions using invariants and state equation in 1153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2653 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.4 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 217 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 186 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 59 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 12:42:53] [INFO ] Invariant cache hit.
[2023-03-10 12:42:53] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 6 ms returned sat
[2023-03-10 12:42:54] [INFO ] After 929ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-10 12:42:54] [INFO ] After 1023ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 12:42:54] [INFO ] After 1291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 12:42:55] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 12:42:55] [INFO ] After 770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 12:42:56] [INFO ] After 947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-10 12:42:56] [INFO ] After 1249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 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 2 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 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 1 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 133 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 134 ms. Remains : 110/920 places, 398/1510 transitions.
Finished random walk after 53 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X 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 400 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 305 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 311 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 256 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 637 reset in 445 ms.
Product exploration explored 100000 steps with 617 reset in 355 ms.
Built C files in :
/tmp/ltsmin16225122245767237220
[2023-03-10 12:42:58] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16225122245767237220
Running compilation step : cd /tmp/ltsmin16225122245767237220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16225122245767237220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16225122245767237220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 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 39 ms. Remains 920 /920 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2023-03-10 12:43:01] [INFO ] Invariant cache hit.
[2023-03-10 12:43:02] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-10 12:43:02] [INFO ] Invariant cache hit.
[2023-03-10 12:43:03] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2023-03-10 12:43:03] [INFO ] Invariant cache hit.
[2023-03-10 12:43:04] [INFO ] Dead Transitions using invariants and state equation in 1508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3303 ms. Remains : 920/920 places, 1510/1510 transitions.
Built C files in :
/tmp/ltsmin7840499881611575213
[2023-03-10 12:43:04] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7840499881611575213
Running compilation step : cd /tmp/ltsmin7840499881611575213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7840499881611575213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7840499881611575213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-10 12:43:08] [INFO ] Flatten gal took : 48 ms
[2023-03-10 12:43:08] [INFO ] Flatten gal took : 50 ms
[2023-03-10 12:43:08] [INFO ] Time to serialize gal into /tmp/LTL3502132349699664215.gal : 7 ms
[2023-03-10 12:43:08] [INFO ] Time to serialize properties into /tmp/LTL12077887071965848026.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3502132349699664215.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3178072036118725938.hoa' '-atoms' '/tmp/LTL12077887071965848026.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12077887071965848026.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3178072036118725938.hoa
Detected timeout of ITS tools.
[2023-03-10 12:43:23] [INFO ] Flatten gal took : 47 ms
[2023-03-10 12:43:23] [INFO ] Flatten gal took : 48 ms
[2023-03-10 12:43:23] [INFO ] Time to serialize gal into /tmp/LTL15218483461186169008.gal : 8 ms
[2023-03-10 12:43:23] [INFO ] Time to serialize properties into /tmp/LTL8710318243682746535.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15218483461186169008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8710318243682746535.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p996!=1)")&&(X(("(p996!=1)")U((X("(p514==1)"))||(G("(p996!=1)")))))))))
Formula 0 simplified : FG(!"(p996!=1)" | X(!"(p996!=1)" M X!"(p514==1)"))
Detected timeout of ITS tools.
[2023-03-10 12:43:38] [INFO ] Flatten gal took : 47 ms
[2023-03-10 12:43:38] [INFO ] Applying decomposition
[2023-03-10 12:43:38] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2941935685043361376.txt' '-o' '/tmp/graph2941935685043361376.bin' '-w' '/tmp/graph2941935685043361376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2941935685043361376.bin' '-l' '-1' '-v' '-w' '/tmp/graph2941935685043361376.weights' '-q' '0' '-e' '0.001'
[2023-03-10 12:43:38] [INFO ] Decomposing Gal with order
[2023-03-10 12:43:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 12:43:38] [INFO ] Removed a total of 1836 redundant transitions.
[2023-03-10 12:43:38] [INFO ] Flatten gal took : 88 ms
[2023-03-10 12:43:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 13 ms.
[2023-03-10 12:43:38] [INFO ] Time to serialize gal into /tmp/LTL176158164403315942.gal : 11 ms
[2023-03-10 12:43:38] [INFO ] Time to serialize properties into /tmp/LTL12562042155530191480.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL176158164403315942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12562042155530191480.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i14.u210.p996!=1)")&&(X(("(i14.u210.p996!=1)")U((X("(i8.u104.p514==1)"))||(G("(i14.u210.p996!=1)")))))))))
Formula 0 simplified : FG(!"(i14.u210.p996!=1)" | X(!"(i14.u210.p996!=1)" M X!"(i8.u104.p514==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15701122433287545965
[2023-03-10 12:43:53] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15701122433287545965
Running compilation step : cd /tmp/ltsmin15701122433287545965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15701122433287545965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15701122433287545965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-14 finished in 72619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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 137 ms :[(OR (NOT p0) p2), p2, p2]
Support contains 24 out of 956 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Graph (trivial) has 965 edges and 956 vertex of which 346 / 956 are part of one of the 39 SCC in 1 ms
Free SCC test removed 307 places
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Graph (complete) has 2518 edges and 649 vertex of which 648 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 263 place count 648 transition count 1936
Reduce places removed 261 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 264 rules applied. Total rules applied 527 place count 387 transition count 1933
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 529 place count 385 transition count 1933
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 529 place count 385 transition count 1884
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 627 place count 336 transition count 1884
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 631 place count 332 transition count 1880
Iterating global reduction 3 with 4 rules applied. Total rules applied 635 place count 332 transition count 1880
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 636 place count 332 transition count 1879
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 636 place count 332 transition count 1878
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 638 place count 331 transition count 1878
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 828 place count 236 transition count 1783
Performed 25 Post agglomeration using F-continuation condition with reduction of 54 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 878 place count 211 transition count 1909
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 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 167 ms. Remains 211 /956 variables (removed 745) and now considering 1889/2549 (removed 660) transitions.
[2023-03-10 12:43:57] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2023-03-10 12:43:57] [INFO ] Computed 16 place invariants in 11 ms
[2023-03-10 12:43:58] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-10 12:43:58] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 12:43:58] [INFO ] Invariant cache hit.
[2023-03-10 12:43:58] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-10 12:44:00] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2990 ms to find 0 implicit places.
[2023-03-10 12:44:00] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 12:44:00] [INFO ] Invariant cache hit.
[2023-03-10 12:44:01] [INFO ] Dead Transitions using invariants and state equation in 1180 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 211/956 places, 1889/2549 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4338 ms. Remains : 211/956 places, 1889/2549 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 s51 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 2894 reset in 1152 ms.
Product exploration explored 100000 steps with 2942 reset in 892 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.5 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 p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1098 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 128 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 293 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 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 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-10 12:44:05] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 12:44:05] [INFO ] Invariant cache hit.
[2023-03-10 12:44:06] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2023-03-10 12:44:06] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 7 ms returned sat
[2023-03-10 12:44:07] [INFO ] After 1091ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-10 12:44:07] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-10 12:44:08] [INFO ] After 651ms SMT Verify possible using 228 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-10 12:44:08] [INFO ] After 1543ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 685 ms.
[2023-03-10 12:44:09] [INFO ] After 3467ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 5 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 271 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 272 ms. Remains : 146/211 places, 1504/1889 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 279151 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279151 steps, saw 39323 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-10 12:44:13] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
// Phase 1: matrix 1304 rows 146 cols
[2023-03-10 12:44:13] [INFO ] Computed 16 place invariants in 7 ms
[2023-03-10 12:44:14] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-10 12:44:14] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-10 12:44:15] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-10 12:44:15] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-03-10 12:44:15] [INFO ] After 435ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-10 12:44:16] [INFO ] After 1006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 423 ms.
[2023-03-10 12:44:16] [INFO ] After 2249ms 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 63 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 42 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 42 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 40 ms. Remains 146 /146 variables (removed 0) and now considering 1504/1504 (removed 0) transitions.
[2023-03-10 12:44:16] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2023-03-10 12:44:16] [INFO ] Invariant cache hit.
[2023-03-10 12:44:17] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-10 12:44:17] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2023-03-10 12:44:17] [INFO ] Invariant cache hit.
[2023-03-10 12:44:17] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-03-10 12:44:18] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 2208 ms to find 0 implicit places.
[2023-03-10 12:44:19] [INFO ] Redundant transitions in 333 ms returned []
[2023-03-10 12:44:19] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2023-03-10 12:44:19] [INFO ] Invariant cache hit.
[2023-03-10 12:44:20] [INFO ] Dead Transitions using invariants and state equation in 1353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3947 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 1 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 97 ms. Remains 78 /146 variables (removed 68) and now considering 1133/1504 (removed 371) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1133 rows 78 cols
[2023-03-10 12:44:20] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-10 12:44:20] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-10 12:44:20] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-10 12:44:21] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-10 12:44:21] [INFO ] After 911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 246 ms.
[2023-03-10 12:44:22] [INFO ] After 1234ms 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 (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 28 factoid took 1432 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 121 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 119 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 6 ms. Remains 211 /211 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2023-03-10 12:44:23] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2023-03-10 12:44:23] [INFO ] Computed 16 place invariants in 10 ms
[2023-03-10 12:44:24] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-10 12:44:24] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 12:44:24] [INFO ] Invariant cache hit.
[2023-03-10 12:44:24] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-10 12:44:26] [INFO ] Implicit Places using invariants and state equation in 2148 ms returned []
Implicit Place search using SMT with State Equation took 2724 ms to find 0 implicit places.
[2023-03-10 12:44:26] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 12:44:26] [INFO ] Invariant cache hit.
[2023-03-10 12:44:28] [INFO ] Dead Transitions using invariants and state equation in 1729 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4460 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.8 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 p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 799 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 159 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Incomplete random walk after 10000 steps, including 311 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 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 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 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 20 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 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-10 12:44:29] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 12:44:29] [INFO ] Invariant cache hit.
[2023-03-10 12:44:29] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 12:44:29] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 7 ms returned sat
[2023-03-10 12:44:30] [INFO ] After 854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 12:44:30] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-10 12:44:31] [INFO ] After 511ms SMT Verify possible using 228 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-10 12:44:31] [INFO ] After 1135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 499 ms.
[2023-03-10 12:44:32] [INFO ] After 2603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
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 0 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 169 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 169 ms. Remains : 146/211 places, 1504/1889 transitions.
Incomplete random walk after 10000 steps, including 265 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 290034 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290034 steps, saw 41230 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-10 12:44:36] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
// Phase 1: matrix 1304 rows 146 cols
[2023-03-10 12:44:36] [INFO ] Computed 16 place invariants in 8 ms
[2023-03-10 12:44:36] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 12:44:36] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-10 12:44:37] [INFO ] After 627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 12:44:37] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-03-10 12:44:37] [INFO ] After 329ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-10 12:44:37] [INFO ] After 756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 289 ms.
[2023-03-10 12:44:38] [INFO ] After 1765ms 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 23 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 24 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 25 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 24 ms. Remains 146 /146 variables (removed 0) and now considering 1504/1504 (removed 0) transitions.
[2023-03-10 12:44:38] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2023-03-10 12:44:38] [INFO ] Invariant cache hit.
[2023-03-10 12:44:38] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-10 12:44:38] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2023-03-10 12:44:38] [INFO ] Invariant cache hit.
[2023-03-10 12:44:39] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-03-10 12:44:40] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
[2023-03-10 12:44:40] [INFO ] Redundant transitions in 286 ms returned []
[2023-03-10 12:44:40] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2023-03-10 12:44:40] [INFO ] Invariant cache hit.
[2023-03-10 12:44:41] [INFO ] Dead Transitions using invariants and state equation in 1209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3565 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 1 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 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 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 112 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
[2023-03-10 12:44:41] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-10 12:44:42] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 12:44:42] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-10 12:44:42] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 12:44:42] [INFO ] After 818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-10 12:44:43] [INFO ] After 1111ms 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 p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 18 factoid took 848 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 122 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Product exploration explored 100000 steps with 2902 reset in 793 ms.
Product exploration explored 100000 steps with 2871 reset in 809 ms.
Built C files in :
/tmp/ltsmin3680553511662644917
[2023-03-10 12:44:46] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3680553511662644917
Running compilation step : cd /tmp/ltsmin3680553511662644917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3680553511662644917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3680553511662644917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 6 ms. Remains 211 /211 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2023-03-10 12:44:49] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2023-03-10 12:44:49] [INFO ] Computed 16 place invariants in 10 ms
[2023-03-10 12:44:49] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-10 12:44:49] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 12:44:49] [INFO ] Invariant cache hit.
[2023-03-10 12:44:50] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-10 12:44:52] [INFO ] Implicit Places using invariants and state equation in 2693 ms returned []
Implicit Place search using SMT with State Equation took 3280 ms to find 0 implicit places.
[2023-03-10 12:44:52] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 12:44:52] [INFO ] Invariant cache hit.
[2023-03-10 12:44:54] [INFO ] Dead Transitions using invariants and state equation in 1440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4728 ms. Remains : 211/211 places, 1889/1889 transitions.
Built C files in :
/tmp/ltsmin5627628276148470076
[2023-03-10 12:44:54] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5627628276148470076
Running compilation step : cd /tmp/ltsmin5627628276148470076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5627628276148470076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5627628276148470076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-10 12:44:57] [INFO ] Flatten gal took : 252 ms
[2023-03-10 12:44:57] [INFO ] Flatten gal took : 219 ms
[2023-03-10 12:44:57] [INFO ] Time to serialize gal into /tmp/LTL8757167684761862863.gal : 25 ms
[2023-03-10 12:44:57] [INFO ] Time to serialize properties into /tmp/LTL13428802599029268672.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8757167684761862863.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4360034899919310939.hoa' '-atoms' '/tmp/LTL13428802599029268672.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13428802599029268672.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4360034899919310939.hoa
Detected timeout of ITS tools.
[2023-03-10 12:45:13] [INFO ] Flatten gal took : 219 ms
[2023-03-10 12:45:13] [INFO ] Flatten gal took : 259 ms
[2023-03-10 12:45:13] [INFO ] Time to serialize gal into /tmp/LTL17843399438411450901.gal : 40 ms
[2023-03-10 12:45:13] [INFO ] Time to serialize properties into /tmp/LTL3266517409982857247.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17843399438411450901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3266517409982857247.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.202303021504/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.
[2023-03-10 12:45:28] [INFO ] Flatten gal took : 211 ms
[2023-03-10 12:45:28] [INFO ] Applying decomposition
[2023-03-10 12:45:28] [INFO ] Flatten gal took : 213 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14628581958252453858.txt' '-o' '/tmp/graph14628581958252453858.bin' '-w' '/tmp/graph14628581958252453858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14628581958252453858.bin' '-l' '-1' '-v' '-w' '/tmp/graph14628581958252453858.weights' '-q' '0' '-e' '0.001'
[2023-03-10 12:45:29] [INFO ] Decomposing Gal with order
[2023-03-10 12:45:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 12:45:29] [INFO ] Removed a total of 10523 redundant transitions.
[2023-03-10 12:45:30] [INFO ] Flatten gal took : 696 ms
[2023-03-10 12:45:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2211 labels/synchronizations in 266 ms.
[2023-03-10 12:45:30] [INFO ] Time to serialize gal into /tmp/LTL3366169731563449361.gal : 27 ms
[2023-03-10 12:45:30] [INFO ] Time to serialize properties into /tmp/LTL4699288014712535181.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3366169731563449361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4699288014712535181.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((("(i4.u30.p1437==0)")&&(("(i4.u25.p1260==1)")U(X(G(!("(((((i0.u0.p49==1)&&(i0.u1.p87==1))&&((i0.u6.p245==1)&&(i5.u39.p1503==1)))...540
Formula 0 simplified : G(!"((((((i0.u0.p27==0)||(i0.u1.p58==0))||((i0.u6.p95==0)||(i1.u7.p302==0)))||(((i1.u7.p348==0)||(i1.u12.p385==0))||((i1.u7.p592==0)...527
Reverse transition relation is NOT exact ! Due to transitions t1191, t2494_t982, t2485_t790, i0.t2400_t870_t871_t872_t938, i0.t867_t876_t942, i0.t908_t942,...1352
Computing Next relation with stutter on 1.94178e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17687223589379575131
[2023-03-10 12:45:45] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17687223589379575131
Running compilation step : cd /tmp/ltsmin17687223589379575131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17687223589379575131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17687223589379575131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 111618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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 200 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 956 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Graph (trivial) has 973 edges and 956 vertex of which 341 / 956 are part of one of the 38 SCC in 1 ms
Free SCC test removed 303 places
Ensure Unique test removed 347 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 2522 edges and 653 vertex of which 625 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions removed 1025 transitions
Drop transitions removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 265 place count 625 transition count 914
Reduce places removed 263 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 266 rules applied. Total rules applied 531 place count 362 transition count 911
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 533 place count 360 transition count 911
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 533 place count 360 transition count 863
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 629 place count 312 transition count 863
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 635 place count 306 transition count 857
Iterating global reduction 3 with 6 rules applied. Total rules applied 641 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 642 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 642 place count 306 transition count 854
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 646 place count 304 transition count 854
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 836 place count 209 transition count 759
Performed 26 Post agglomeration using F-continuation condition with reduction of 56 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 888 place count 183 transition count 848
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 889 place count 183 transition count 847
Applied a total of 889 rules in 74 ms. Remains 183 /956 variables (removed 773) and now considering 847/2549 (removed 1702) transitions.
[2023-03-10 12:45:48] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
// Phase 1: matrix 685 rows 183 cols
[2023-03-10 12:45:48] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 12:45:49] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-10 12:45:49] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 12:45:49] [INFO ] Invariant cache hit.
[2023-03-10 12:45:49] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-10 12:45:49] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2023-03-10 12:45:49] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 12:45:49] [INFO ] Invariant cache hit.
[2023-03-10 12:45:50] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 183/956 places, 847/2549 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1278 ms. Remains : 183/956 places, 847/2549 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 s58 0) (EQ s159 0)) (OR (EQ s91 0) (EQ s97 0) (EQ s116 0) (EQ s170 0) (EQ s181 0))), p1:(OR (EQ s91 0) (EQ s97 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 2863 reset in 509 ms.
Product exploration explored 100000 steps with 2852 reset in 515 ms.
Computed a total of 50 stabilizing places and 509 stable transitions
Computed a total of 50 stabilizing places and 509 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 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 194 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 309 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 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 15 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 16 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 423628 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423628 steps, saw 61587 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 12:45:54] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 12:45:54] [INFO ] Invariant cache hit.
[2023-03-10 12:45:55] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 12:45:55] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 12:45:55] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 12:45:55] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-10 12:45:55] [INFO ] After 271ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 12:45:56] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 235 ms.
[2023-03-10 12:45:56] [INFO ] After 1333ms 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 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 847/847 transitions.
Drop transitions removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 183 transition count 782
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -132
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 93 place count 169 transition count 914
Drop transitions removed 11 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 120 place count 169 transition count 887
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 2 with 2 rules applied. Total rules applied 122 place count 168 transition count 904
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 168 transition count 901
Drop transitions removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 3 with 133 rules applied. Total rules applied 258 place count 168 transition count 768
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 301 place count 168 transition count 713
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 462 place count 125 transition count 595
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 469 place count 118 transition count 548
Iterating global reduction 4 with 7 rules applied. Total rules applied 476 place count 118 transition count 548
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 478 place count 118 transition count 546
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 539 place count 118 transition count 485
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 543 place count 118 transition count 485
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 546 place count 118 transition count 482
Applied a total of 546 rules in 97 ms. Remains 118 /183 variables (removed 65) and now considering 482/847 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 118/183 places, 482/847 transitions.
Incomplete random walk after 10000 steps, including 196 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 12:45:56] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
// Phase 1: matrix 282 rows 118 cols
[2023-03-10 12:45:56] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 12:45:56] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 12:45:56] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-10 12:45:57] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 12:45:57] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 12:45:57] [INFO ] After 116ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 12:45:57] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-10 12:45:57] [INFO ] After 561ms 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, 482/482 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 118/118 places, 482/482 transitions.
Incomplete random walk after 10000 steps, including 195 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 685721 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 685721 steps, saw 89474 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 12:46:00] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 12:46:00] [INFO ] Invariant cache hit.
[2023-03-10 12:46:00] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 12:46:00] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 12:46:00] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 12:46:00] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 12:46:00] [INFO ] After 77ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 12:46:01] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-10 12:46:01] [INFO ] After 389ms 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, 482/482 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 118/118 places, 482/482 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 482/482 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2023-03-10 12:46:01] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 12:46:01] [INFO ] Invariant cache hit.
[2023-03-10 12:46:01] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-10 12:46:01] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 12:46:01] [INFO ] Invariant cache hit.
[2023-03-10 12:46:01] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 12:46:01] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-10 12:46:01] [INFO ] Redundant transitions in 287 ms returned []
[2023-03-10 12:46:01] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 12:46:01] [INFO ] Invariant cache hit.
[2023-03-10 12:46:02] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1230 ms. Remains : 118/118 places, 482/482 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 49 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 249 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 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 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 27 ms. Remains 44 /118 variables (removed 74) and now considering 97/482 (removed 385) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 97 rows 44 cols
[2023-03-10 12:46:02] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 12:46:02] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 12:46:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 12:46:02] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-10 12:46:02] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 12:46:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 12:46:02] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 12:46:02] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-10 12:46:02] [INFO ] After 166ms 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 p2 p1)))]
Knowledge based reduction with 4 factoid took 277 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 222 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 194 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 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 847/847 transitions.
Applied a total of 0 rules in 3 ms. Remains 183 /183 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2023-03-10 12:46:03] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
// Phase 1: matrix 685 rows 183 cols
[2023-03-10 12:46:03] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 12:46:03] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-10 12:46:03] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 12:46:03] [INFO ] Invariant cache hit.
[2023-03-10 12:46:03] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-10 12:46:04] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2023-03-10 12:46:04] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 12:46:04] [INFO ] Invariant cache hit.
[2023-03-10 12:46:04] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1353 ms. Remains : 183/183 places, 847/847 transitions.
Computed a total of 50 stabilizing places and 509 stable transitions
Computed a total of 50 stabilizing places and 509 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 229 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 309 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 299 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 399565 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 399565 steps, saw 57378 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 12:46:08] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 12:46:08] [INFO ] Invariant cache hit.
[2023-03-10 12:46:08] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 12:46:08] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 12:46:09] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 12:46:09] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-10 12:46:09] [INFO ] After 306ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 12:46:10] [INFO ] After 662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 267 ms.
[2023-03-10 12:46:10] [INFO ] After 1465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 2 ms.
Support contains 9 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 847/847 transitions.
Drop transitions removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 183 transition count 782
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -132
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 93 place count 169 transition count 914
Drop transitions removed 11 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 120 place count 169 transition count 887
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 122 place count 168 transition count 904
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 168 transition count 901
Drop transitions removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 3 with 133 rules applied. Total rules applied 258 place count 168 transition count 768
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 301 place count 168 transition count 713
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 462 place count 125 transition count 595
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 469 place count 118 transition count 548
Iterating global reduction 4 with 7 rules applied. Total rules applied 476 place count 118 transition count 548
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 478 place count 118 transition count 546
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 539 place count 118 transition count 485
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 543 place count 118 transition count 485
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 546 place count 118 transition count 482
Applied a total of 546 rules in 131 ms. Remains 118 /183 variables (removed 65) and now considering 482/847 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 118/183 places, 482/847 transitions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 401912 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401912 steps, saw 55570 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 12:46:13] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
// Phase 1: matrix 282 rows 118 cols
[2023-03-10 12:46:13] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 12:46:14] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 12:46:14] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-10 12:46:14] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 12:46:14] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 12:46:14] [INFO ] After 216ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 12:46:14] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-10 12:46:14] [INFO ] After 914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 18 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 482/482 transitions.
Applied a total of 0 rules in 13 ms. Remains 118 /118 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 118/118 places, 482/482 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 482/482 transitions.
Applied a total of 0 rules in 12 ms. Remains 118 /118 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2023-03-10 12:46:14] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 12:46:14] [INFO ] Invariant cache hit.
[2023-03-10 12:46:15] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-10 12:46:15] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 12:46:15] [INFO ] Invariant cache hit.
[2023-03-10 12:46:15] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 12:46:15] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-10 12:46:15] [INFO ] Redundant transitions in 400 ms returned []
[2023-03-10 12:46:15] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 12:46:15] [INFO ] Invariant cache hit.
[2023-03-10 12:46:16] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1287 ms. Remains : 118/118 places, 482/482 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 49 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 249 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 37 ms. Remains 44 /118 variables (removed 74) and now considering 97/482 (removed 385) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 97 rows 44 cols
[2023-03-10 12:46:16] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 12:46:16] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 12:46:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 12:46:16] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 12:46:16] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 12:46:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 12:46:16] [INFO ] After 56ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 12:46:16] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-10 12:46:16] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p2 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 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 326 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 369 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 227 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 2884 reset in 498 ms.
Product exploration explored 100000 steps with 2822 reset in 525 ms.
Built C files in :
/tmp/ltsmin16943958691437783306
[2023-03-10 12:46:19] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16943958691437783306
Running compilation step : cd /tmp/ltsmin16943958691437783306;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2614 ms.
Running link step : cd /tmp/ltsmin16943958691437783306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16943958691437783306;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3780658302017095148.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 847/847 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2023-03-10 12:46:34] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
// Phase 1: matrix 685 rows 183 cols
[2023-03-10 12:46:34] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 12:46:34] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-10 12:46:34] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 12:46:34] [INFO ] Invariant cache hit.
[2023-03-10 12:46:34] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-10 12:46:34] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2023-03-10 12:46:34] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 12:46:34] [INFO ] Invariant cache hit.
[2023-03-10 12:46:35] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1432 ms. Remains : 183/183 places, 847/847 transitions.
Built C files in :
/tmp/ltsmin12399033017219859657
[2023-03-10 12:46:35] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12399033017219859657
Running compilation step : cd /tmp/ltsmin12399033017219859657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2790 ms.
Running link step : cd /tmp/ltsmin12399033017219859657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12399033017219859657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8440738075336576798.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 12:46:50] [INFO ] Flatten gal took : 46 ms
[2023-03-10 12:46:50] [INFO ] Flatten gal took : 47 ms
[2023-03-10 12:46:50] [INFO ] Time to serialize gal into /tmp/LTL4448185847788657944.gal : 8 ms
[2023-03-10 12:46:50] [INFO ] Time to serialize properties into /tmp/LTL3083720416397425792.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4448185847788657944.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14568935640287324976.hoa' '-atoms' '/tmp/LTL3083720416397425792.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3083720416397425792.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14568935640287324976.hoa
Detected timeout of ITS tools.
[2023-03-10 12:47:06] [INFO ] Flatten gal took : 39 ms
[2023-03-10 12:47:06] [INFO ] Flatten gal took : 38 ms
[2023-03-10 12:47:06] [INFO ] Time to serialize gal into /tmp/LTL11398017706783102125.gal : 7 ms
[2023-03-10 12:47:06] [INFO ] Time to serialize properties into /tmp/LTL4007118466288326736.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11398017706783102125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4007118466288326736.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.202303021504/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.
[2023-03-10 12:47:21] [INFO ] Flatten gal took : 34 ms
[2023-03-10 12:47:21] [INFO ] Applying decomposition
[2023-03-10 12:47:21] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3865704591830499950.txt' '-o' '/tmp/graph3865704591830499950.bin' '-w' '/tmp/graph3865704591830499950.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3865704591830499950.bin' '-l' '-1' '-v' '-w' '/tmp/graph3865704591830499950.weights' '-q' '0' '-e' '0.001'
[2023-03-10 12:47:21] [INFO ] Decomposing Gal with order
[2023-03-10 12:47:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 12:47:21] [INFO ] Removed a total of 1882 redundant transitions.
[2023-03-10 12:47:21] [INFO ] Flatten gal took : 56 ms
[2023-03-10 12:47:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 8 ms.
[2023-03-10 12:47:21] [INFO ] Time to serialize gal into /tmp/LTL9831560232766345009.gal : 4 ms
[2023-03-10 12:47:21] [INFO ] Time to serialize properties into /tmp/LTL4071865029281266231.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9831560232766345009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4071865029281266231.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(G(("(((i3.u23.p919==0)||(i3.u24.p957==0))||((i3.u22.p1129==0)||(u45.p1503==0)))")||(("(u45.p1521==0)")||(X("(((i1.u8.p301=...404
Formula 0 simplified : XF(!"((((i1.u8.p301==0)||(i1.u9.p343==0))||((i1.u8.p580==0)||(i5.u38.p1472==0)))&&((((i3.u23.p919==0)||(i3.u24.p957==0))||((i3.u22.p...388
Reverse transition relation is NOT exact ! Due to transitions t2494_t982, t2485_t790, t2008_t942_t750_t561_t373_t180, t2208_t790_t750_t3, u45.t4, i0.t945_t...2463
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
451 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,4.56745,155584,1,0,282138,9920,5642,784673,1334,64786,236535
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property CloudDeployment-PT-5b-LTLFireability-05 finished in 98298 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p0 U (X(p1)||G(p0))))))))'
[2023-03-10 12:47:27] [INFO ] Flatten gal took : 222 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8319584552339342100
[2023-03-10 12:47:27] [INFO ] Too many transitions (2549) to apply POR reductions. Disabling POR matrices.
[2023-03-10 12:47:27] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8319584552339342100
Running compilation step : cd /tmp/ltsmin8319584552339342100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-10 12:47:27] [INFO ] Applying decomposition
[2023-03-10 12:47:27] [INFO ] Flatten gal took : 255 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17209873185390113839.txt' '-o' '/tmp/graph17209873185390113839.bin' '-w' '/tmp/graph17209873185390113839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17209873185390113839.bin' '-l' '-1' '-v' '-w' '/tmp/graph17209873185390113839.weights' '-q' '0' '-e' '0.001'
[2023-03-10 12:47:28] [INFO ] Decomposing Gal with order
[2023-03-10 12:47:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 12:47:29] [INFO ] Removed a total of 10973 redundant transitions.
[2023-03-10 12:47:29] [INFO ] Flatten gal took : 787 ms
[2023-03-10 12:47:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2104 labels/synchronizations in 134 ms.
[2023-03-10 12:47:29] [INFO ] Time to serialize gal into /tmp/LTLFireability4012341315004972328.gal : 25 ms
[2023-03-10 12:47:29] [INFO ] Time to serialize properties into /tmp/LTLFireability2028797906203580180.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4012341315004972328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2028797906203580180.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F(("((i25.u329.p1437==0)&&((((((i0.u5.p27==0)||(i0.u6.p58==0))||((i4.i0.i1.u12.p95==0)||(i26.u344.p302==0)))||(((i5.u76.p348==0)||(...614
Formula 0 simplified : G(!"((i25.u329.p1437==0)&&((((((i0.u5.p27==0)||(i0.u6.p58==0))||((i4.i0.i1.u12.p95==0)||(i26.u344.p302==0)))||(((i5.u76.p348==0)||(i...603
Compilation finished in 15342 ms.
Running link step : cd /tmp/ltsmin8319584552339342100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin8319584552339342100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp1==true) U X([](!(LTLAPp2==true))))&&(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t175, t176, t187, t369, t370, t388, t557, t558, t576, t717, t746, t747, t756, t876, t937,...1853
Computing Next relation with stutter on 1.94178e+12 deadlock states
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8319584552339342100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp1==true) U X([](!(LTLAPp2==true))))&&(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8319584552339342100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp3==true)||X(X([]((X((LTLAPp5==true))||(LTLAPp4==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-10 13:10:46] [INFO ] Applying decomposition
[2023-03-10 13:10:47] [INFO ] Flatten gal took : 851 ms
[2023-03-10 13:10:47] [INFO ] Decomposing Gal with order
[2023-03-10 13:10:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 13:10:49] [INFO ] Removed a total of 19223 redundant transitions.
[2023-03-10 13:10:49] [INFO ] Flatten gal took : 1390 ms
[2023-03-10 13:10:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 589 labels/synchronizations in 282 ms.
[2023-03-10 13:10:50] [INFO ] Time to serialize gal into /tmp/LTLFireability10400793241969673703.gal : 6 ms
[2023-03-10 13:10:50] [INFO ] Time to serialize properties into /tmp/LTLFireability15856833705858617569.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10400793241969673703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15856833705858617569.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 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 t1824, t2011, t2031, t2037, t2048, t2059, u40.t3, u40.t4, i0.t2494, i0.t2487, i0.t2486, i0.t2...2625
Computing Next relation with stutter on 1.94178e+12 deadlock states
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8319584552339342100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp3==true)||X(X([]((X((LTLAPp5==true))||(LTLAPp4==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8319584552339342100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp6==true)&&X(((LTLAPp6==true) U (X((LTLAPp7==true))||[]((LTLAPp6==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-10 13:34:07] [INFO ] Flatten gal took : 547 ms
[2023-03-10 13:34:07] [INFO ] Input system was already deterministic with 2549 transitions.
[2023-03-10 13:34:07] [INFO ] Transformed 956 places.
[2023-03-10 13:34:08] [INFO ] Transformed 2549 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
[2023-03-10 13:34:08] [INFO ] Time to serialize gal into /tmp/LTLFireability13620271880939192743.gal : 82 ms
[2023-03-10 13:34:08] [INFO ] Time to serialize properties into /tmp/LTLFireability2549594705972473219.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13620271880939192743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2549594705972473219.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 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: 11207340 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14707288 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="itstools"
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-5348"
echo " Executing tool itstools"
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 r069-smll-167814396400420"
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 ;