Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531800204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyCommit-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531800204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 51M May 18 16:43 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 StigmergyCommit-PT-09a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716994952514

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 15:02:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 15:02:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 15:02:35] [INFO ] Load time of PNML (sax parser for PT used): 1891 ms
[2024-05-29 15:02:35] [INFO ] Transformed 364 places.
[2024-05-29 15:02:35] [INFO ] Transformed 50444 transitions.
[2024-05-29 15:02:35] [INFO ] Found NUPN structural information;
[2024-05-29 15:02:35] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 2298 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyCommit-PT-09a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 284 transition count 2430
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 284 transition count 2430
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 170 place count 284 transition count 2420
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 211 place count 243 transition count 2369
Iterating global reduction 1 with 41 rules applied. Total rules applied 252 place count 243 transition count 2369
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 262 place count 243 transition count 2359
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 272 place count 233 transition count 2349
Iterating global reduction 2 with 10 rules applied. Total rules applied 282 place count 233 transition count 2349
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 292 place count 223 transition count 2339
Iterating global reduction 2 with 10 rules applied. Total rules applied 302 place count 223 transition count 2339
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 312 place count 213 transition count 2329
Iterating global reduction 2 with 10 rules applied. Total rules applied 322 place count 213 transition count 2329
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 332 place count 203 transition count 2319
Iterating global reduction 2 with 10 rules applied. Total rules applied 342 place count 203 transition count 2319
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 352 place count 203 transition count 2309
Applied a total of 352 rules in 162 ms. Remains 203 /364 variables (removed 161) and now considering 2309/2520 (removed 211) transitions.
[2024-05-29 15:02:36] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2024-05-29 15:02:36] [INFO ] Computed 2 invariants in 63 ms
[2024-05-29 15:02:36] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-29 15:02:36] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
[2024-05-29 15:02:36] [INFO ] Invariant cache hit.
[2024-05-29 15:02:37] [INFO ] State equation strengthened by 2135 read => feed constraints.
[2024-05-29 15:02:38] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1947 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/364 places, 2309/2520 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 173 transition count 2280
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 173 transition count 2280
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 68 place count 173 transition count 2270
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 163 transition count 2260
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 163 transition count 2260
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 98 place count 153 transition count 2250
Iterating global reduction 1 with 10 rules applied. Total rules applied 108 place count 153 transition count 2250
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 118 place count 143 transition count 2240
Iterating global reduction 1 with 10 rules applied. Total rules applied 128 place count 143 transition count 2240
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 138 place count 133 transition count 2230
Iterating global reduction 1 with 10 rules applied. Total rules applied 148 place count 133 transition count 2230
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 157 place count 124 transition count 2221
Iterating global reduction 1 with 9 rules applied. Total rules applied 166 place count 124 transition count 2221
Applied a total of 166 rules in 72 ms. Remains 124 /202 variables (removed 78) and now considering 2221/2309 (removed 88) transitions.
[2024-05-29 15:02:38] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2024-05-29 15:02:38] [INFO ] Computed 1 invariants in 16 ms
[2024-05-29 15:02:38] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 15:02:38] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:02:38] [INFO ] Invariant cache hit.
[2024-05-29 15:02:39] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:02:39] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/364 places, 2221/2520 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3562 ms. Remains : 124/364 places, 2221/2520 transitions.
Support contains 10 out of 124 places after structural reductions.
[2024-05-29 15:02:40] [INFO ] Flatten gal took : 307 ms
[2024-05-29 15:02:40] [INFO ] Flatten gal took : 201 ms
[2024-05-29 15:02:41] [INFO ] Input system was already deterministic with 2221 transitions.
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 252 steps (0 resets) in 84 ms. (2 steps per ms) remains 0/2 properties
Computed a total of 3 stabilizing places and 3 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||(F(p0)&&F(p1))))))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:02:41] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:02:41] [INFO ] Invariant cache hit.
[2024-05-29 15:02:41] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 15:02:41] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:02:41] [INFO ] Invariant cache hit.
[2024-05-29 15:02:41] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:02:42] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:02:42] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:02:42] [INFO ] Invariant cache hit.
[2024-05-29 15:02:42] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:03:26] [INFO ] Deduced a trap composed of 13 places in 535 ms of which 9 ms to minimize.
[2024-05-29 15:03:26] [INFO ] Deduced a trap composed of 13 places in 540 ms of which 2 ms to minimize.
[2024-05-29 15:03:27] [INFO ] Deduced a trap composed of 13 places in 596 ms of which 1 ms to minimize.
[2024-05-29 15:03:28] [INFO ] Deduced a trap composed of 14 places in 584 ms of which 1 ms to minimize.
[2024-05-29 15:03:28] [INFO ] Deduced a trap composed of 15 places in 578 ms of which 1 ms to minimize.
[2024-05-29 15:03:29] [INFO ] Deduced a trap composed of 13 places in 581 ms of which 1 ms to minimize.
[2024-05-29 15:03:29] [INFO ] Deduced a trap composed of 13 places in 605 ms of which 1 ms to minimize.
[2024-05-29 15:03:30] [INFO ] Deduced a trap composed of 13 places in 592 ms of which 2 ms to minimize.
[2024-05-29 15:03:31] [INFO ] Deduced a trap composed of 13 places in 604 ms of which 1 ms to minimize.
[2024-05-29 15:03:31] [INFO ] Deduced a trap composed of 13 places in 609 ms of which 1 ms to minimize.
[2024-05-29 15:03:32] [INFO ] Deduced a trap composed of 13 places in 594 ms of which 1 ms to minimize.
[2024-05-29 15:03:32] [INFO ] Deduced a trap composed of 13 places in 588 ms of which 1 ms to minimize.
[2024-05-29 15:03:33] [INFO ] Deduced a trap composed of 15 places in 621 ms of which 3 ms to minimize.
[2024-05-29 15:03:34] [INFO ] Deduced a trap composed of 13 places in 616 ms of which 1 ms to minimize.
[2024-05-29 15:03:34] [INFO ] Deduced a trap composed of 13 places in 614 ms of which 5 ms to minimize.
[2024-05-29 15:03:35] [INFO ] Deduced a trap composed of 15 places in 504 ms of which 0 ms to minimize.
[2024-05-29 15:03:35] [INFO ] Deduced a trap composed of 20 places in 512 ms of which 1 ms to minimize.
[2024-05-29 15:03:36] [INFO ] Deduced a trap composed of 17 places in 498 ms of which 1 ms to minimize.
[2024-05-29 15:03:36] [INFO ] Deduced a trap composed of 15 places in 498 ms of which 1 ms to minimize.
[2024-05-29 15:03:37] [INFO ] Deduced a trap composed of 14 places in 431 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:03:38] [INFO ] Deduced a trap composed of 14 places in 416 ms of which 1 ms to minimize.
[2024-05-29 15:03:38] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2024-05-29 15:03:38] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 1 ms to minimize.
[2024-05-29 15:03:39] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 1 ms to minimize.
[2024-05-29 15:03:39] [INFO ] Deduced a trap composed of 13 places in 482 ms of which 1 ms to minimize.
[2024-05-29 15:03:40] [INFO ] Deduced a trap composed of 18 places in 477 ms of which 1 ms to minimize.
[2024-05-29 15:03:40] [INFO ] Deduced a trap composed of 14 places in 478 ms of which 1 ms to minimize.
[2024-05-29 15:03:41] [INFO ] Deduced a trap composed of 13 places in 412 ms of which 0 ms to minimize.
[2024-05-29 15:03:41] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 1 ms to minimize.
[2024-05-29 15:03:42] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 1 ms to minimize.
[2024-05-29 15:03:42] [INFO ] Deduced a trap composed of 13 places in 424 ms of which 1 ms to minimize.
[2024-05-29 15:03:42] [INFO ] Deduced a trap composed of 13 places in 429 ms of which 1 ms to minimize.
[2024-05-29 15:03:43] [INFO ] Deduced a trap composed of 15 places in 359 ms of which 4 ms to minimize.
SMT process timed out in 61172ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 61221ms
Finished structural reductions in LTL mode , in 1 iterations and 61896 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-00
Product exploration explored 100000 steps with 1562 reset in 1090 ms.
Product exploration explored 100000 steps with 1562 reset in 933 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 252 steps (0 resets) in 14 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 15:03:46] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:03:46] [INFO ] Invariant cache hit.
[2024-05-29 15:03:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:03:47] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-05-29 15:03:48] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:03:48] [INFO ] [Real]Added 2055 Read/Feed constraints in 173 ms returned sat
[2024-05-29 15:03:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:03:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 15:03:50] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2024-05-29 15:03:50] [INFO ] [Nat]Added 2055 Read/Feed constraints in 194 ms returned sat
[2024-05-29 15:03:50] [INFO ] Computed and/alt/rep : 132/162/132 causal constraints (skipped 2077 transitions) in 503 ms.
[2024-05-29 15:03:52] [INFO ] Added : 98 causal constraints over 20 iterations in 2343 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 9 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:03:52] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:03:52] [INFO ] Invariant cache hit.
[2024-05-29 15:03:52] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 15:03:52] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:03:52] [INFO ] Invariant cache hit.
[2024-05-29 15:03:53] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:03:53] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:03:53] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:03:53] [INFO ] Invariant cache hit.
[2024-05-29 15:03:53] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:04:37] [INFO ] Deduced a trap composed of 13 places in 503 ms of which 2 ms to minimize.
[2024-05-29 15:04:38] [INFO ] Deduced a trap composed of 13 places in 496 ms of which 1 ms to minimize.
[2024-05-29 15:04:39] [INFO ] Deduced a trap composed of 13 places in 579 ms of which 1 ms to minimize.
[2024-05-29 15:04:39] [INFO ] Deduced a trap composed of 14 places in 596 ms of which 1 ms to minimize.
[2024-05-29 15:04:40] [INFO ] Deduced a trap composed of 15 places in 586 ms of which 1 ms to minimize.
[2024-05-29 15:04:40] [INFO ] Deduced a trap composed of 13 places in 592 ms of which 1 ms to minimize.
[2024-05-29 15:04:41] [INFO ] Deduced a trap composed of 13 places in 599 ms of which 1 ms to minimize.
[2024-05-29 15:04:42] [INFO ] Deduced a trap composed of 13 places in 588 ms of which 0 ms to minimize.
[2024-05-29 15:04:42] [INFO ] Deduced a trap composed of 13 places in 603 ms of which 1 ms to minimize.
[2024-05-29 15:04:43] [INFO ] Deduced a trap composed of 13 places in 600 ms of which 1 ms to minimize.
[2024-05-29 15:04:43] [INFO ] Deduced a trap composed of 13 places in 592 ms of which 1 ms to minimize.
[2024-05-29 15:04:44] [INFO ] Deduced a trap composed of 13 places in 608 ms of which 1 ms to minimize.
[2024-05-29 15:04:45] [INFO ] Deduced a trap composed of 15 places in 614 ms of which 0 ms to minimize.
[2024-05-29 15:04:45] [INFO ] Deduced a trap composed of 13 places in 622 ms of which 1 ms to minimize.
[2024-05-29 15:04:46] [INFO ] Deduced a trap composed of 13 places in 612 ms of which 1 ms to minimize.
[2024-05-29 15:04:46] [INFO ] Deduced a trap composed of 15 places in 515 ms of which 0 ms to minimize.
[2024-05-29 15:04:47] [INFO ] Deduced a trap composed of 20 places in 508 ms of which 0 ms to minimize.
[2024-05-29 15:04:47] [INFO ] Deduced a trap composed of 17 places in 491 ms of which 0 ms to minimize.
[2024-05-29 15:04:48] [INFO ] Deduced a trap composed of 15 places in 492 ms of which 1 ms to minimize.
[2024-05-29 15:04:48] [INFO ] Deduced a trap composed of 14 places in 416 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:04:49] [INFO ] Deduced a trap composed of 14 places in 427 ms of which 0 ms to minimize.
[2024-05-29 15:04:50] [INFO ] Deduced a trap composed of 13 places in 427 ms of which 1 ms to minimize.
[2024-05-29 15:04:50] [INFO ] Deduced a trap composed of 13 places in 374 ms of which 1 ms to minimize.
[2024-05-29 15:04:50] [INFO ] Deduced a trap composed of 13 places in 380 ms of which 4 ms to minimize.
[2024-05-29 15:04:51] [INFO ] Deduced a trap composed of 13 places in 488 ms of which 1 ms to minimize.
[2024-05-29 15:04:51] [INFO ] Deduced a trap composed of 18 places in 495 ms of which 1 ms to minimize.
[2024-05-29 15:04:52] [INFO ] Deduced a trap composed of 14 places in 480 ms of which 0 ms to minimize.
[2024-05-29 15:04:52] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 1 ms to minimize.
[2024-05-29 15:04:53] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 1 ms to minimize.
[2024-05-29 15:04:53] [INFO ] Deduced a trap composed of 13 places in 477 ms of which 1 ms to minimize.
[2024-05-29 15:04:54] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 1 ms to minimize.
[2024-05-29 15:04:54] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 0 ms to minimize.
[2024-05-29 15:04:54] [INFO ] Deduced a trap composed of 15 places in 354 ms of which 0 ms to minimize.
[2024-05-29 15:04:55] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 1 ms to minimize.
[2024-05-29 15:04:55] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 0 ms to minimize.
SMT process timed out in 61697ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 61730ms
Finished structural reductions in LTL mode , in 1 iterations and 62690 ms. Remains : 124/124 places, 2221/2221 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 252 steps (0 resets) in 17 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 15:04:56] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:04:56] [INFO ] Invariant cache hit.
[2024-05-29 15:04:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:04:57] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2024-05-29 15:04:57] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:04:57] [INFO ] [Real]Added 2055 Read/Feed constraints in 174 ms returned sat
[2024-05-29 15:04:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:04:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 15:04:59] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2024-05-29 15:04:59] [INFO ] [Nat]Added 2055 Read/Feed constraints in 196 ms returned sat
[2024-05-29 15:04:59] [INFO ] Computed and/alt/rep : 132/162/132 causal constraints (skipped 2077 transitions) in 506 ms.
[2024-05-29 15:05:01] [INFO ] Added : 98 causal constraints over 20 iterations in 2309 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1562 reset in 904 ms.
Product exploration explored 100000 steps with 1562 reset in 908 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 124 transition count 2221
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 31 place count 124 transition count 2231
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 41 place count 124 transition count 2231
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 61 place count 104 transition count 2211
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 81 place count 104 transition count 2211
Performed 41 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 122 place count 104 transition count 2221
Ensure Unique test removed 1043 transitions
Reduce isomorphic transitions removed 1043 transitions.
Iterating post reduction 1 with 1043 rules applied. Total rules applied 1165 place count 104 transition count 1178
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1187 place count 82 transition count 1156
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 1209 place count 82 transition count 1156
Deduced a syphon composed of 40 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 1229 place count 82 transition count 1136
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1239 place count 82 transition count 1136
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 1259 place count 62 transition count 1116
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 1279 place count 62 transition count 1116
Deduced a syphon composed of 30 places in 1 ms
Applied a total of 1279 rules in 788 ms. Remains 62 /124 variables (removed 62) and now considering 1116/2221 (removed 1105) transitions.
[2024-05-29 15:05:04] [INFO ] Redundant transitions in 107 ms returned []
Running 1115 sub problems to find dead transitions.
[2024-05-29 15:05:04] [INFO ] Flow matrix only has 1105 transitions (discarded 11 similar events)
// Phase 1: matrix 1105 rows 62 cols
[2024-05-29 15:05:04] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 15:05:04] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:05:24] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 0 ms to minimize.
[2024-05-29 15:05:25] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 1 ms to minimize.
[2024-05-29 15:05:25] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2024-05-29 15:05:25] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2024-05-29 15:05:25] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2024-05-29 15:05:26] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:05:26] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2024-05-29 15:05:26] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2024-05-29 15:05:26] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2024-05-29 15:05:26] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 15:05:27] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2024-05-29 15:05:27] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2024-05-29 15:05:27] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2024-05-29 15:05:27] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2024-05-29 15:05:27] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 15:05:28] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 15:05:29] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-29 15:05:29] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-29 15:05:29] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:05:29] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 15:05:31] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2024-05-29 15:05:31] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:05:31] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2024-05-29 15:05:31] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:05:32] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 15:05:32] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 15:05:32] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 15:05:32] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2024-05-29 15:05:32] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:05:32] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 15:05:32] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 15:05:32] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2024-05-29 15:05:33] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2024-05-29 15:05:33] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2024-05-29 15:05:33] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:05:33] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2024-05-29 15:05:33] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
At refinement iteration 6 (OVERLAPS) 1104/1166 variables, 62/120 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1166 variables, 1042/1162 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1166/1167 variables, and 1162 constraints, problems are : Problem set: 40 solved, 1075 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1115/71 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 40 solved, 1075 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 31/62 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 57/58 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:05:52] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:05:52] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 15:05:52] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:05:52] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:05:52] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-29 15:05:52] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-29 15:05:52] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:05:52] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 15:05:53] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:05:53] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:05:53] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:05:53] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 12/70 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:05:56] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:05:57] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 13/83 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:06:00] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2024-05-29 15:06:01] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2024-05-29 15:06:01] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2024-05-29 15:06:01] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2024-05-29 15:06:01] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-29 15:06:01] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 15:06:01] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-29 15:06:01] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:06:02] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:06:02] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 15:06:02] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-29 15:06:02] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:06:02] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2024-05-29 15:06:02] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-29 15:06:02] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:06:02] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:06:02] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 15:06:03] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 15:06:03] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 15:06:03] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 20/103 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:06:04] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 15:06:04] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:06:04] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2024-05-29 15:06:04] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:06:04] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:06:04] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:06:05] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 7/110 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:06:09] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 15:06:10] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 7/117 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:06:15] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 2/119 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 62/1167 variables, and 119 constraints, problems are : Problem set: 40 solved, 1075 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/62 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1044/71 constraints, Known Traps: 118/118 constraints]
After SMT, in 75687ms problems are : Problem set: 40 solved, 1075 unsolved
Search for dead transitions found 40 dead transitions in 75699ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/124 places, 1076/2221 transitions.
Graph (complete) has 351 edges and 62 vertex of which 32 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.4 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 174 ms. Remains 32 /62 variables (removed 30) and now considering 1076/1076 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/124 places, 1076/2221 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76778 ms. Remains : 32/124 places, 1076/2221 transitions.
Built C files in :
/tmp/ltsmin4004003871893985595
[2024-05-29 15:06:20] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4004003871893985595
Running compilation step : cd /tmp/ltsmin4004003871893985595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4004003871893985595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4004003871893985595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:06:23] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2024-05-29 15:06:23] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 15:06:23] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 15:06:23] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:06:23] [INFO ] Invariant cache hit.
[2024-05-29 15:06:24] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:06:24] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:06:24] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:06:24] [INFO ] Invariant cache hit.
[2024-05-29 15:06:24] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:07:08] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:07:08] [INFO ] Deduced a trap composed of 13 places in 503 ms of which 1 ms to minimize.
[2024-05-29 15:07:09] [INFO ] Deduced a trap composed of 13 places in 580 ms of which 1 ms to minimize.
[2024-05-29 15:07:09] [INFO ] Deduced a trap composed of 14 places in 595 ms of which 1 ms to minimize.
[2024-05-29 15:07:10] [INFO ] Deduced a trap composed of 15 places in 566 ms of which 1 ms to minimize.
[2024-05-29 15:07:10] [INFO ] Deduced a trap composed of 13 places in 590 ms of which 1 ms to minimize.
[2024-05-29 15:07:11] [INFO ] Deduced a trap composed of 13 places in 607 ms of which 1 ms to minimize.
[2024-05-29 15:07:12] [INFO ] Deduced a trap composed of 13 places in 587 ms of which 1 ms to minimize.
[2024-05-29 15:07:12] [INFO ] Deduced a trap composed of 13 places in 595 ms of which 1 ms to minimize.
[2024-05-29 15:07:13] [INFO ] Deduced a trap composed of 13 places in 599 ms of which 0 ms to minimize.
[2024-05-29 15:07:13] [INFO ] Deduced a trap composed of 13 places in 589 ms of which 1 ms to minimize.
[2024-05-29 15:07:14] [INFO ] Deduced a trap composed of 13 places in 617 ms of which 1 ms to minimize.
[2024-05-29 15:07:15] [INFO ] Deduced a trap composed of 15 places in 623 ms of which 1 ms to minimize.
[2024-05-29 15:07:15] [INFO ] Deduced a trap composed of 13 places in 624 ms of which 1 ms to minimize.
[2024-05-29 15:07:16] [INFO ] Deduced a trap composed of 13 places in 612 ms of which 1 ms to minimize.
[2024-05-29 15:07:16] [INFO ] Deduced a trap composed of 15 places in 511 ms of which 0 ms to minimize.
[2024-05-29 15:07:17] [INFO ] Deduced a trap composed of 20 places in 516 ms of which 1 ms to minimize.
[2024-05-29 15:07:18] [INFO ] Deduced a trap composed of 17 places in 513 ms of which 1 ms to minimize.
[2024-05-29 15:07:18] [INFO ] Deduced a trap composed of 15 places in 508 ms of which 1 ms to minimize.
[2024-05-29 15:07:18] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:07:19] [INFO ] Deduced a trap composed of 14 places in 431 ms of which 1 ms to minimize.
[2024-05-29 15:07:20] [INFO ] Deduced a trap composed of 13 places in 432 ms of which 0 ms to minimize.
[2024-05-29 15:07:20] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 0 ms to minimize.
[2024-05-29 15:07:21] [INFO ] Deduced a trap composed of 13 places in 368 ms of which 0 ms to minimize.
[2024-05-29 15:07:21] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:07:22] [INFO ] Deduced a trap composed of 18 places in 476 ms of which 0 ms to minimize.
[2024-05-29 15:07:22] [INFO ] Deduced a trap composed of 14 places in 488 ms of which 1 ms to minimize.
[2024-05-29 15:07:23] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 1 ms to minimize.
[2024-05-29 15:07:23] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2024-05-29 15:07:23] [INFO ] Deduced a trap composed of 13 places in 499 ms of which 1 ms to minimize.
[2024-05-29 15:07:24] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 1 ms to minimize.
[2024-05-29 15:07:24] [INFO ] Deduced a trap composed of 13 places in 424 ms of which 0 ms to minimize.
[2024-05-29 15:07:25] [INFO ] Deduced a trap composed of 15 places in 356 ms of which 0 ms to minimize.
[2024-05-29 15:07:25] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 0 ms to minimize.
SMT process timed out in 60884ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 60906ms
Finished structural reductions in LTL mode , in 1 iterations and 61626 ms. Remains : 124/124 places, 2221/2221 transitions.
Built C files in :
/tmp/ltsmin11186738026962829142
[2024-05-29 15:07:25] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11186738026962829142
Running compilation step : cd /tmp/ltsmin11186738026962829142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin11186738026962829142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin11186738026962829142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 15:07:29] [INFO ] Flatten gal took : 136 ms
[2024-05-29 15:07:29] [INFO ] Flatten gal took : 129 ms
[2024-05-29 15:07:29] [INFO ] Time to serialize gal into /tmp/LTL18284949204972212090.gal : 47 ms
[2024-05-29 15:07:29] [INFO ] Time to serialize properties into /tmp/LTL4768964059506186221.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18284949204972212090.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18085714869693893849.hoa' '-atoms' '/tmp/LTL4768964059506186221.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4768964059506186221.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18085714869693893849.hoa
Detected timeout of ITS tools.
[2024-05-29 15:07:44] [INFO ] Flatten gal took : 137 ms
[2024-05-29 15:07:44] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:07:44] [INFO ] Time to serialize gal into /tmp/LTL17472939380055719786.gal : 23 ms
[2024-05-29 15:07:44] [INFO ] Time to serialize properties into /tmp/LTL4093393165838117092.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17472939380055719786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4093393165838117092.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&((p318==1)&&(p354==1...434
Formula 0 simplified : XX(FG!"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&((p318==1)&&(p354==1)))"...420
Detected timeout of ITS tools.
[2024-05-29 15:07:59] [INFO ] Flatten gal took : 124 ms
[2024-05-29 15:07:59] [INFO ] Applying decomposition
[2024-05-29 15:07:59] [INFO ] Flatten gal took : 125 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11127798962885930163.txt' '-o' '/tmp/graph11127798962885930163.bin' '-w' '/tmp/graph11127798962885930163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11127798962885930163.bin' '-l' '-1' '-v' '-w' '/tmp/graph11127798962885930163.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:08:00] [INFO ] Decomposing Gal with order
[2024-05-29 15:08:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:08:01] [INFO ] Removed a total of 20552 redundant transitions.
[2024-05-29 15:08:01] [INFO ] Flatten gal took : 645 ms
[2024-05-29 15:08:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 253 ms.
[2024-05-29 15:08:01] [INFO ] Time to serialize gal into /tmp/LTL4432532933604668993.gal : 23 ms
[2024-05-29 15:08:01] [INFO ] Time to serialize properties into /tmp/LTL3821574429842745031.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4432532933604668993.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3821574429842745031.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(((((i8.u14.p30==1)&&(i8.u9.p66==1))&&((i8.u27.p102==1)&&(i8.u37.p138==1)))&&(((i8.u45.p174==1)&&(i8.u5.p210==1))&&((i8.u...638
Formula 0 simplified : XX(FG!"(((((i8.u14.p30==1)&&(i8.u9.p66==1))&&((i8.u27.p102==1)&&(i8.u37.p138==1)))&&(((i8.u45.p174==1)&&(i8.u5.p210==1))&&((i8.u35.p...624
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-09a-LTLFireability-00 finished in 335283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 11 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:08:16] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:08:16] [INFO ] Invariant cache hit.
[2024-05-29 15:08:16] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 15:08:16] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:08:16] [INFO ] Invariant cache hit.
[2024-05-29 15:08:17] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:08:17] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:08:17] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:08:17] [INFO ] Invariant cache hit.
[2024-05-29 15:08:17] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:09:01] [INFO ] Deduced a trap composed of 13 places in 515 ms of which 5 ms to minimize.
[2024-05-29 15:09:01] [INFO ] Deduced a trap composed of 13 places in 505 ms of which 1 ms to minimize.
[2024-05-29 15:09:02] [INFO ] Deduced a trap composed of 13 places in 584 ms of which 1 ms to minimize.
[2024-05-29 15:09:02] [INFO ] Deduced a trap composed of 14 places in 587 ms of which 1 ms to minimize.
[2024-05-29 15:09:03] [INFO ] Deduced a trap composed of 15 places in 581 ms of which 0 ms to minimize.
[2024-05-29 15:09:04] [INFO ] Deduced a trap composed of 13 places in 585 ms of which 1 ms to minimize.
[2024-05-29 15:09:04] [INFO ] Deduced a trap composed of 13 places in 596 ms of which 1 ms to minimize.
[2024-05-29 15:09:05] [INFO ] Deduced a trap composed of 13 places in 590 ms of which 1 ms to minimize.
[2024-05-29 15:09:05] [INFO ] Deduced a trap composed of 13 places in 599 ms of which 1 ms to minimize.
[2024-05-29 15:09:06] [INFO ] Deduced a trap composed of 13 places in 622 ms of which 0 ms to minimize.
[2024-05-29 15:09:07] [INFO ] Deduced a trap composed of 13 places in 598 ms of which 1 ms to minimize.
[2024-05-29 15:09:07] [INFO ] Deduced a trap composed of 13 places in 621 ms of which 1 ms to minimize.
[2024-05-29 15:09:08] [INFO ] Deduced a trap composed of 15 places in 632 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 13 places in 620 ms of which 1 ms to minimize.
[2024-05-29 15:09:09] [INFO ] Deduced a trap composed of 13 places in 621 ms of which 1 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 15 places in 521 ms of which 1 ms to minimize.
[2024-05-29 15:09:10] [INFO ] Deduced a trap composed of 20 places in 510 ms of which 1 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 17 places in 517 ms of which 0 ms to minimize.
[2024-05-29 15:09:11] [INFO ] Deduced a trap composed of 15 places in 487 ms of which 1 ms to minimize.
[2024-05-29 15:09:12] [INFO ] Deduced a trap composed of 14 places in 412 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:09:13] [INFO ] Deduced a trap composed of 14 places in 417 ms of which 1 ms to minimize.
[2024-05-29 15:09:13] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 1 ms to minimize.
[2024-05-29 15:09:13] [INFO ] Deduced a trap composed of 13 places in 365 ms of which 0 ms to minimize.
[2024-05-29 15:09:14] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 0 ms to minimize.
[2024-05-29 15:09:14] [INFO ] Deduced a trap composed of 13 places in 485 ms of which 1 ms to minimize.
[2024-05-29 15:09:15] [INFO ] Deduced a trap composed of 18 places in 487 ms of which 1 ms to minimize.
[2024-05-29 15:09:15] [INFO ] Deduced a trap composed of 14 places in 481 ms of which 1 ms to minimize.
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 0 ms to minimize.
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 13 places in 360 ms of which 1 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 13 places in 472 ms of which 1 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 0 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 1 ms to minimize.
[2024-05-29 15:09:18] [INFO ] Deduced a trap composed of 15 places in 364 ms of which 0 ms to minimize.
SMT process timed out in 60905ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 60927ms
Finished structural reductions in LTL mode , in 1 iterations and 61618 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-01
Product exploration explored 100000 steps with 1562 reset in 911 ms.
Product exploration explored 100000 steps with 1562 reset in 914 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 252 steps (0 resets) in 12 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-29 15:09:20] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:09:20] [INFO ] Invariant cache hit.
[2024-05-29 15:09:21] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 15:09:21] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2024-05-29 15:09:22] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:09:22] [INFO ] [Real]Added 2055 Read/Feed constraints in 182 ms returned sat
[2024-05-29 15:09:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:09:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 15:09:23] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2024-05-29 15:09:23] [INFO ] [Nat]Added 2055 Read/Feed constraints in 199 ms returned sat
[2024-05-29 15:09:24] [INFO ] Computed and/alt/rep : 132/162/132 causal constraints (skipped 2077 transitions) in 232 ms.
[2024-05-29 15:09:25] [INFO ] Added : 98 causal constraints over 20 iterations in 2023 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 686 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2024-05-29 15:09:26] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2024-05-29 15:09:26] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 15:09:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 15:09:26] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:09:26] [INFO ] Invariant cache hit.
[2024-05-29 15:09:26] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:09:26] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-29 15:09:26] [INFO ] Redundant transitions in 109 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:09:26] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:09:26] [INFO ] Invariant cache hit.
[2024-05-29 15:09:27] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:09:45] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 15:09:45] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 15:09:45] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
[2024-05-29 15:09:45] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:09:45] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:09:45] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:09:45] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:09:45] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:09:45] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-29 15:09:45] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 15:09:46] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-29 15:09:46] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 15:09:46] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2024-05-29 15:09:46] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 15:09:46] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-29 15:09:46] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 15:09:46] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 15:09:46] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 15:09:46] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:09:49] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:09:52] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 0 ms to minimize.
[2024-05-29 15:09:52] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-29 15:09:53] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 0 ms to minimize.
[2024-05-29 15:09:53] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-29 15:09:53] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-29 15:09:53] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-29 15:09:54] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2024-05-29 15:09:54] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-29 15:09:54] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 15:09:54] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-29 15:09:54] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 15:09:54] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:09:55] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:09:55] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:09:55] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:09:55] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:09:55] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:09:55] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2024-05-29 15:09:55] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:09:55] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:10:08] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2024-05-29 15:10:08] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2024-05-29 15:10:08] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-29 15:10:08] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-29 15:10:08] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:10:09] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-29 15:10:09] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:10:14] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2024-05-29 15:10:14] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:10:14] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:10:14] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:10:14] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:10:14] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:10:17] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:10:17] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 15:10:17] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1094 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 75714ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75725ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76863 ms. Remains : 31/124 places, 1075/2221 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 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)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2024-05-29 15:10:43] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:10:43] [INFO ] Invariant cache hit.
[2024-05-29 15:10:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:10:43] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-29 15:10:43] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:10:43] [INFO ] [Real]Added 1043 Read/Feed constraints in 98 ms returned sat
[2024-05-29 15:10:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:10:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 15:10:44] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-29 15:10:44] [INFO ] [Nat]Added 1043 Read/Feed constraints in 119 ms returned sat
[2024-05-29 15:10:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 137 ms.
[2024-05-29 15:10:44] [INFO ] Added : 0 causal constraints over 0 iterations in 210 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 2294 ms.
Product exploration explored 100000 steps with 9090 reset in 2303 ms.
Built C files in :
/tmp/ltsmin7174533941832550792
[2024-05-29 15:10:49] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 15:10:50] [INFO ] Computation of Complete disable matrix. took 375 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:10:50] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 15:10:50] [INFO ] Computation of Complete enable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:10:50] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 15:10:50] [INFO ] Computation of Completed DNA matrix. took 83 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:10:50] [INFO ] Built C files in 995ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7174533941832550792
Running compilation step : cd /tmp/ltsmin7174533941832550792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin7174533941832550792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin7174533941832550792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 185 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-05-29 15:10:53] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:10:53] [INFO ] Invariant cache hit.
[2024-05-29 15:10:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 15:10:53] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:10:53] [INFO ] Invariant cache hit.
[2024-05-29 15:10:54] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:10:54] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-05-29 15:10:54] [INFO ] Redundant transitions in 76 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:10:54] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:10:54] [INFO ] Invariant cache hit.
[2024-05-29 15:10:54] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:11:12] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 15:11:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:11:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:11:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:11:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 15:11:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:11:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:11:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:11:12] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-29 15:11:13] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2024-05-29 15:11:13] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-29 15:11:13] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 15:11:13] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 15:11:13] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 15:11:13] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:11:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 15:11:13] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:11:14] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 15:11:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:11:16] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:11:20] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 1 ms to minimize.
[2024-05-29 15:11:20] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-29 15:11:20] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 0 ms to minimize.
[2024-05-29 15:11:20] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2024-05-29 15:11:21] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2024-05-29 15:11:21] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-29 15:11:21] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 15:11:21] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-29 15:11:21] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:11:22] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-29 15:11:22] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 15:11:22] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 15:11:22] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:11:22] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 15:11:22] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 15:11:22] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:11:22] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:11:23] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 15:11:23] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:11:23] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:11:36] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-29 15:11:36] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-29 15:11:36] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:11:36] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-29 15:11:36] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-29 15:11:37] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-29 15:11:37] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:11:41] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 15:11:41] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:11:41] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:11:42] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:11:42] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 15:11:42] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:11:44] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-29 15:11:44] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 15:11:44] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1151 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 56/56 constraints]
After SMT, in 75725ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75735ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76341 ms. Remains : 31/31 places, 1075/1075 transitions.
Built C files in :
/tmp/ltsmin16830274302081835021
[2024-05-29 15:12:10] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 15:12:10] [INFO ] Computation of Complete disable matrix. took 354 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:12:10] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 15:12:10] [INFO ] Computation of Complete enable matrix. took 63 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:12:10] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 15:12:10] [INFO ] Computation of Completed DNA matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:12:10] [INFO ] Built C files in 950ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16830274302081835021
Running compilation step : cd /tmp/ltsmin16830274302081835021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin16830274302081835021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin16830274302081835021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 15:12:14] [INFO ] Flatten gal took : 79 ms
[2024-05-29 15:12:14] [INFO ] Flatten gal took : 61 ms
[2024-05-29 15:12:14] [INFO ] Time to serialize gal into /tmp/LTL3562906510854169173.gal : 13 ms
[2024-05-29 15:12:14] [INFO ] Time to serialize properties into /tmp/LTL4844920695079837047.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3562906510854169173.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15055523282839386491.hoa' '-atoms' '/tmp/LTL4844920695079837047.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4844920695079837047.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15055523282839386491.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t2201, t2203, t2205, t2207, t2209, t2211, t22...282
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
579 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.19076,139204,1,0,1158,44492,2167,45,44490,28446,2243
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-09a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyCommit-PT-09a-LTLFireability-01 finished in 243899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:12:20] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2024-05-29 15:12:20] [INFO ] Computed 1 invariants in 17 ms
[2024-05-29 15:12:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 15:12:20] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:12:20] [INFO ] Invariant cache hit.
[2024-05-29 15:12:21] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:12:21] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:12:21] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:12:21] [INFO ] Invariant cache hit.
[2024-05-29 15:12:21] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:13:04] [INFO ] Deduced a trap composed of 13 places in 504 ms of which 1 ms to minimize.
[2024-05-29 15:13:05] [INFO ] Deduced a trap composed of 13 places in 493 ms of which 1 ms to minimize.
[2024-05-29 15:13:06] [INFO ] Deduced a trap composed of 13 places in 568 ms of which 1 ms to minimize.
[2024-05-29 15:13:06] [INFO ] Deduced a trap composed of 14 places in 584 ms of which 1 ms to minimize.
[2024-05-29 15:13:07] [INFO ] Deduced a trap composed of 15 places in 583 ms of which 1 ms to minimize.
[2024-05-29 15:13:07] [INFO ] Deduced a trap composed of 13 places in 582 ms of which 0 ms to minimize.
[2024-05-29 15:13:08] [INFO ] Deduced a trap composed of 13 places in 593 ms of which 1 ms to minimize.
[2024-05-29 15:13:09] [INFO ] Deduced a trap composed of 13 places in 594 ms of which 1 ms to minimize.
[2024-05-29 15:13:09] [INFO ] Deduced a trap composed of 13 places in 595 ms of which 1 ms to minimize.
[2024-05-29 15:13:10] [INFO ] Deduced a trap composed of 13 places in 605 ms of which 0 ms to minimize.
[2024-05-29 15:13:10] [INFO ] Deduced a trap composed of 13 places in 605 ms of which 1 ms to minimize.
[2024-05-29 15:13:11] [INFO ] Deduced a trap composed of 13 places in 604 ms of which 1 ms to minimize.
[2024-05-29 15:13:12] [INFO ] Deduced a trap composed of 15 places in 625 ms of which 1 ms to minimize.
[2024-05-29 15:13:12] [INFO ] Deduced a trap composed of 13 places in 617 ms of which 0 ms to minimize.
[2024-05-29 15:13:13] [INFO ] Deduced a trap composed of 13 places in 615 ms of which 1 ms to minimize.
[2024-05-29 15:13:13] [INFO ] Deduced a trap composed of 15 places in 518 ms of which 0 ms to minimize.
[2024-05-29 15:13:14] [INFO ] Deduced a trap composed of 20 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:13:14] [INFO ] Deduced a trap composed of 17 places in 506 ms of which 0 ms to minimize.
[2024-05-29 15:13:15] [INFO ] Deduced a trap composed of 15 places in 498 ms of which 1 ms to minimize.
[2024-05-29 15:13:15] [INFO ] Deduced a trap composed of 14 places in 428 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:13:16] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 1 ms to minimize.
[2024-05-29 15:13:17] [INFO ] Deduced a trap composed of 13 places in 441 ms of which 1 ms to minimize.
[2024-05-29 15:13:17] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2024-05-29 15:13:17] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 0 ms to minimize.
[2024-05-29 15:13:18] [INFO ] Deduced a trap composed of 13 places in 496 ms of which 0 ms to minimize.
[2024-05-29 15:13:18] [INFO ] Deduced a trap composed of 18 places in 501 ms of which 0 ms to minimize.
[2024-05-29 15:13:19] [INFO ] Deduced a trap composed of 14 places in 502 ms of which 0 ms to minimize.
[2024-05-29 15:13:19] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 0 ms to minimize.
[2024-05-29 15:13:20] [INFO ] Deduced a trap composed of 13 places in 354 ms of which 1 ms to minimize.
[2024-05-29 15:13:20] [INFO ] Deduced a trap composed of 13 places in 483 ms of which 0 ms to minimize.
[2024-05-29 15:13:21] [INFO ] Deduced a trap composed of 13 places in 426 ms of which 1 ms to minimize.
[2024-05-29 15:13:21] [INFO ] Deduced a trap composed of 13 places in 424 ms of which 0 ms to minimize.
[2024-05-29 15:13:21] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 1 ms to minimize.
[2024-05-29 15:13:22] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 0 ms to minimize.
[2024-05-29 15:13:22] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
SMT process timed out in 61190ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 61212ms
Finished structural reductions in LTL mode , in 1 iterations and 61936 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-02 finished in 62107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 11 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:13:22] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:13:22] [INFO ] Invariant cache hit.
[2024-05-29 15:13:22] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 15:13:22] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:13:22] [INFO ] Invariant cache hit.
[2024-05-29 15:13:23] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:13:23] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:13:23] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:13:23] [INFO ] Invariant cache hit.
[2024-05-29 15:13:23] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:14:07] [INFO ] Deduced a trap composed of 13 places in 498 ms of which 1 ms to minimize.
[2024-05-29 15:14:07] [INFO ] Deduced a trap composed of 13 places in 499 ms of which 1 ms to minimize.
[2024-05-29 15:14:08] [INFO ] Deduced a trap composed of 13 places in 583 ms of which 1 ms to minimize.
[2024-05-29 15:14:08] [INFO ] Deduced a trap composed of 14 places in 583 ms of which 1 ms to minimize.
[2024-05-29 15:14:09] [INFO ] Deduced a trap composed of 15 places in 565 ms of which 0 ms to minimize.
[2024-05-29 15:14:10] [INFO ] Deduced a trap composed of 13 places in 585 ms of which 0 ms to minimize.
[2024-05-29 15:14:10] [INFO ] Deduced a trap composed of 13 places in 593 ms of which 1 ms to minimize.
[2024-05-29 15:14:11] [INFO ] Deduced a trap composed of 13 places in 592 ms of which 1 ms to minimize.
[2024-05-29 15:14:11] [INFO ] Deduced a trap composed of 13 places in 600 ms of which 0 ms to minimize.
[2024-05-29 15:14:12] [INFO ] Deduced a trap composed of 13 places in 602 ms of which 1 ms to minimize.
[2024-05-29 15:14:13] [INFO ] Deduced a trap composed of 13 places in 594 ms of which 1 ms to minimize.
[2024-05-29 15:14:13] [INFO ] Deduced a trap composed of 13 places in 588 ms of which 1 ms to minimize.
[2024-05-29 15:14:14] [INFO ] Deduced a trap composed of 15 places in 603 ms of which 1 ms to minimize.
[2024-05-29 15:14:14] [INFO ] Deduced a trap composed of 13 places in 603 ms of which 1 ms to minimize.
[2024-05-29 15:14:15] [INFO ] Deduced a trap composed of 13 places in 610 ms of which 1 ms to minimize.
[2024-05-29 15:14:15] [INFO ] Deduced a trap composed of 15 places in 501 ms of which 1 ms to minimize.
[2024-05-29 15:14:16] [INFO ] Deduced a trap composed of 20 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:14:17] [INFO ] Deduced a trap composed of 17 places in 495 ms of which 1 ms to minimize.
[2024-05-29 15:14:17] [INFO ] Deduced a trap composed of 15 places in 499 ms of which 0 ms to minimize.
[2024-05-29 15:14:17] [INFO ] Deduced a trap composed of 14 places in 422 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:14:18] [INFO ] Deduced a trap composed of 14 places in 426 ms of which 1 ms to minimize.
[2024-05-29 15:14:19] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 1 ms to minimize.
[2024-05-29 15:14:19] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 0 ms to minimize.
[2024-05-29 15:14:20] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 1 ms to minimize.
[2024-05-29 15:14:20] [INFO ] Deduced a trap composed of 13 places in 479 ms of which 1 ms to minimize.
[2024-05-29 15:14:21] [INFO ] Deduced a trap composed of 18 places in 480 ms of which 1 ms to minimize.
[2024-05-29 15:14:21] [INFO ] Deduced a trap composed of 14 places in 480 ms of which 1 ms to minimize.
[2024-05-29 15:14:21] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 0 ms to minimize.
[2024-05-29 15:14:22] [INFO ] Deduced a trap composed of 13 places in 360 ms of which 1 ms to minimize.
[2024-05-29 15:14:22] [INFO ] Deduced a trap composed of 13 places in 480 ms of which 1 ms to minimize.
[2024-05-29 15:14:23] [INFO ] Deduced a trap composed of 13 places in 411 ms of which 1 ms to minimize.
[2024-05-29 15:14:23] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 1 ms to minimize.
[2024-05-29 15:14:23] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 1 ms to minimize.
[2024-05-29 15:14:24] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 1 ms to minimize.
SMT process timed out in 60913ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 60934ms
Finished structural reductions in LTL mode , in 1 iterations and 61626 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-03 finished in 61735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:14:24] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:14:24] [INFO ] Invariant cache hit.
[2024-05-29 15:14:24] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 15:14:24] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:14:24] [INFO ] Invariant cache hit.
[2024-05-29 15:14:24] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:14:25] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:14:25] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:14:25] [INFO ] Invariant cache hit.
[2024-05-29 15:14:25] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:15:09] [INFO ] Deduced a trap composed of 13 places in 496 ms of which 1 ms to minimize.
[2024-05-29 15:15:09] [INFO ] Deduced a trap composed of 13 places in 499 ms of which 1 ms to minimize.
[2024-05-29 15:15:10] [INFO ] Deduced a trap composed of 13 places in 586 ms of which 1 ms to minimize.
[2024-05-29 15:15:10] [INFO ] Deduced a trap composed of 14 places in 603 ms of which 1 ms to minimize.
[2024-05-29 15:15:11] [INFO ] Deduced a trap composed of 15 places in 582 ms of which 1 ms to minimize.
[2024-05-29 15:15:12] [INFO ] Deduced a trap composed of 13 places in 600 ms of which 1 ms to minimize.
[2024-05-29 15:15:12] [INFO ] Deduced a trap composed of 13 places in 609 ms of which 1 ms to minimize.
[2024-05-29 15:15:13] [INFO ] Deduced a trap composed of 13 places in 602 ms of which 1 ms to minimize.
[2024-05-29 15:15:13] [INFO ] Deduced a trap composed of 13 places in 603 ms of which 1 ms to minimize.
[2024-05-29 15:15:14] [INFO ] Deduced a trap composed of 13 places in 617 ms of which 1 ms to minimize.
[2024-05-29 15:15:15] [INFO ] Deduced a trap composed of 13 places in 615 ms of which 0 ms to minimize.
[2024-05-29 15:15:15] [INFO ] Deduced a trap composed of 13 places in 617 ms of which 1 ms to minimize.
[2024-05-29 15:15:16] [INFO ] Deduced a trap composed of 15 places in 635 ms of which 1 ms to minimize.
[2024-05-29 15:15:17] [INFO ] Deduced a trap composed of 13 places in 624 ms of which 1 ms to minimize.
[2024-05-29 15:15:17] [INFO ] Deduced a trap composed of 13 places in 612 ms of which 1 ms to minimize.
[2024-05-29 15:15:18] [INFO ] Deduced a trap composed of 15 places in 515 ms of which 1 ms to minimize.
[2024-05-29 15:15:18] [INFO ] Deduced a trap composed of 20 places in 525 ms of which 1 ms to minimize.
[2024-05-29 15:15:19] [INFO ] Deduced a trap composed of 17 places in 514 ms of which 1 ms to minimize.
[2024-05-29 15:15:19] [INFO ] Deduced a trap composed of 15 places in 506 ms of which 1 ms to minimize.
[2024-05-29 15:15:20] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:15:21] [INFO ] Deduced a trap composed of 14 places in 437 ms of which 0 ms to minimize.
[2024-05-29 15:15:21] [INFO ] Deduced a trap composed of 13 places in 433 ms of which 1 ms to minimize.
[2024-05-29 15:15:21] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 0 ms to minimize.
[2024-05-29 15:15:22] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 1 ms to minimize.
[2024-05-29 15:15:22] [INFO ] Deduced a trap composed of 13 places in 507 ms of which 1 ms to minimize.
[2024-05-29 15:15:23] [INFO ] Deduced a trap composed of 18 places in 500 ms of which 0 ms to minimize.
[2024-05-29 15:15:23] [INFO ] Deduced a trap composed of 14 places in 494 ms of which 1 ms to minimize.
[2024-05-29 15:15:24] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 1 ms to minimize.
[2024-05-29 15:15:24] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 1 ms to minimize.
[2024-05-29 15:15:25] [INFO ] Deduced a trap composed of 13 places in 490 ms of which 1 ms to minimize.
[2024-05-29 15:15:25] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 1 ms to minimize.
[2024-05-29 15:15:26] [INFO ] Deduced a trap composed of 13 places in 411 ms of which 1 ms to minimize.
[2024-05-29 15:15:26] [INFO ] Deduced a trap composed of 15 places in 355 ms of which 1 ms to minimize.
SMT process timed out in 61299ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 61322ms
Finished structural reductions in LTL mode , in 1 iterations and 61991 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-04 finished in 62159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 15 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:15:26] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:15:26] [INFO ] Invariant cache hit.
[2024-05-29 15:15:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 15:15:26] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:15:26] [INFO ] Invariant cache hit.
[2024-05-29 15:15:27] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:15:27] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:15:27] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:15:27] [INFO ] Invariant cache hit.
[2024-05-29 15:15:27] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:16:11] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:16:11] [INFO ] Deduced a trap composed of 13 places in 506 ms of which 1 ms to minimize.
[2024-05-29 15:16:12] [INFO ] Deduced a trap composed of 13 places in 595 ms of which 1 ms to minimize.
[2024-05-29 15:16:13] [INFO ] Deduced a trap composed of 14 places in 592 ms of which 1 ms to minimize.
[2024-05-29 15:16:13] [INFO ] Deduced a trap composed of 15 places in 594 ms of which 1 ms to minimize.
[2024-05-29 15:16:14] [INFO ] Deduced a trap composed of 13 places in 585 ms of which 1 ms to minimize.
[2024-05-29 15:16:14] [INFO ] Deduced a trap composed of 13 places in 619 ms of which 1 ms to minimize.
[2024-05-29 15:16:15] [INFO ] Deduced a trap composed of 13 places in 610 ms of which 1 ms to minimize.
[2024-05-29 15:16:16] [INFO ] Deduced a trap composed of 13 places in 622 ms of which 1 ms to minimize.
[2024-05-29 15:16:16] [INFO ] Deduced a trap composed of 13 places in 617 ms of which 1 ms to minimize.
[2024-05-29 15:16:17] [INFO ] Deduced a trap composed of 13 places in 611 ms of which 1 ms to minimize.
[2024-05-29 15:16:17] [INFO ] Deduced a trap composed of 13 places in 601 ms of which 1 ms to minimize.
[2024-05-29 15:16:18] [INFO ] Deduced a trap composed of 15 places in 634 ms of which 1 ms to minimize.
[2024-05-29 15:16:19] [INFO ] Deduced a trap composed of 13 places in 630 ms of which 1 ms to minimize.
[2024-05-29 15:16:19] [INFO ] Deduced a trap composed of 13 places in 630 ms of which 1 ms to minimize.
[2024-05-29 15:16:20] [INFO ] Deduced a trap composed of 15 places in 517 ms of which 1 ms to minimize.
[2024-05-29 15:16:20] [INFO ] Deduced a trap composed of 20 places in 518 ms of which 1 ms to minimize.
[2024-05-29 15:16:21] [INFO ] Deduced a trap composed of 17 places in 508 ms of which 1 ms to minimize.
[2024-05-29 15:16:21] [INFO ] Deduced a trap composed of 15 places in 507 ms of which 0 ms to minimize.
[2024-05-29 15:16:22] [INFO ] Deduced a trap composed of 14 places in 422 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:16:23] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 1 ms to minimize.
[2024-05-29 15:16:23] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 1 ms to minimize.
[2024-05-29 15:16:24] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 1 ms to minimize.
[2024-05-29 15:16:24] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 1 ms to minimize.
[2024-05-29 15:16:24] [INFO ] Deduced a trap composed of 13 places in 489 ms of which 1 ms to minimize.
[2024-05-29 15:16:25] [INFO ] Deduced a trap composed of 18 places in 493 ms of which 1 ms to minimize.
[2024-05-29 15:16:25] [INFO ] Deduced a trap composed of 14 places in 492 ms of which 1 ms to minimize.
[2024-05-29 15:16:26] [INFO ] Deduced a trap composed of 13 places in 412 ms of which 1 ms to minimize.
[2024-05-29 15:16:26] [INFO ] Deduced a trap composed of 13 places in 365 ms of which 1 ms to minimize.
[2024-05-29 15:16:27] [INFO ] Deduced a trap composed of 13 places in 487 ms of which 1 ms to minimize.
[2024-05-29 15:16:27] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 0 ms to minimize.
[2024-05-29 15:16:28] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 1 ms to minimize.
[2024-05-29 15:16:28] [INFO ] Deduced a trap composed of 15 places in 357 ms of which 1 ms to minimize.
SMT process timed out in 61207ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 61228ms
Finished structural reductions in LTL mode , in 1 iterations and 61918 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-05
Product exploration explored 100000 steps with 1562 reset in 904 ms.
Product exploration explored 100000 steps with 1562 reset in 916 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 252 steps (0 resets) in 13 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-29 15:16:30] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:16:30] [INFO ] Invariant cache hit.
[2024-05-29 15:16:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 15:16:32] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2024-05-29 15:16:32] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:16:32] [INFO ] [Real]Added 2055 Read/Feed constraints in 182 ms returned sat
[2024-05-29 15:16:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:16:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 15:16:33] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2024-05-29 15:16:34] [INFO ] [Nat]Added 2055 Read/Feed constraints in 202 ms returned sat
[2024-05-29 15:16:34] [INFO ] Computed and/alt/rep : 132/162/132 causal constraints (skipped 2077 transitions) in 242 ms.
[2024-05-29 15:16:36] [INFO ] Added : 98 causal constraints over 20 iterations in 2003 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 657 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2024-05-29 15:16:36] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2024-05-29 15:16:36] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 15:16:36] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 15:16:36] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:16:36] [INFO ] Invariant cache hit.
[2024-05-29 15:16:36] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:16:37] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-29 15:16:37] [INFO ] Redundant transitions in 77 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:16:37] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:16:37] [INFO ] Invariant cache hit.
[2024-05-29 15:16:37] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:16:59] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 0 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-29 15:17:05] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 15:17:05] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-29 15:17:05] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-29 15:17:05] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:17:05] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-29 15:17:05] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:17:05] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:17:05] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 15:17:06] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-29 15:17:06] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:17:06] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-29 15:17:06] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:17:18] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-29 15:17:19] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 15:17:19] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-29 15:17:19] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-29 15:17:19] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 15:17:20] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:17:20] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:17:24] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-29 15:17:24] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:17:24] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:17:24] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 15:17:25] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 15:17:25] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:17:27] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-29 15:17:27] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:17:27] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 timeout
0)
(s24 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1151 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 56/56 constraints]
After SMT, in 75665ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75676ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76766 ms. Remains : 31/124 places, 1075/2221 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
[2024-05-29 15:17:53] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:17:53] [INFO ] Invariant cache hit.
[2024-05-29 15:17:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:17:53] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-29 15:17:54] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:17:54] [INFO ] [Real]Added 1043 Read/Feed constraints in 97 ms returned sat
[2024-05-29 15:17:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:17:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:17:54] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-29 15:17:54] [INFO ] [Nat]Added 1043 Read/Feed constraints in 120 ms returned sat
[2024-05-29 15:17:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 94 ms.
[2024-05-29 15:17:55] [INFO ] Added : 0 causal constraints over 0 iterations in 168 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 2287 ms.
Product exploration explored 100000 steps with 9090 reset in 2305 ms.
Built C files in :
/tmp/ltsmin10633363349305233457
[2024-05-29 15:17:59] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 15:18:00] [INFO ] Computation of Complete disable matrix. took 350 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:18:00] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 15:18:00] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:18:00] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 15:18:00] [INFO ] Computation of Completed DNA matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:18:00] [INFO ] Built C files in 889ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10633363349305233457
Running compilation step : cd /tmp/ltsmin10633363349305233457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10633363349305233457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10633363349305233457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 171 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-05-29 15:18:03] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:18:03] [INFO ] Invariant cache hit.
[2024-05-29 15:18:03] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 15:18:03] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:18:03] [INFO ] Invariant cache hit.
[2024-05-29 15:18:04] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:18:04] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-29 15:18:04] [INFO ] Redundant transitions in 75 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:18:04] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:18:04] [INFO ] Invariant cache hit.
[2024-05-29 15:18:04] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:18:26] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:18:29] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2024-05-29 15:18:29] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-05-29 15:18:30] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2024-05-29 15:18:30] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-29 15:18:30] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-29 15:18:30] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:18:45] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-29 15:18:45] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-29 15:18:46] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-29 15:18:46] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-29 15:18:46] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 15:18:46] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 15:18:46] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:18:51] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-29 15:18:51] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:18:51] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:18:51] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:18:52] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-29 15:18:52] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:18:54] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:18:54] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 15:18:54] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1094 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 75632ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75643ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76212 ms. Remains : 31/31 places, 1075/1075 transitions.
Built C files in :
/tmp/ltsmin16885181442825274414
[2024-05-29 15:19:19] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 15:19:20] [INFO ] Computation of Complete disable matrix. took 352 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:19:20] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 15:19:20] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:19:20] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 15:19:20] [INFO ] Computation of Completed DNA matrix. took 75 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:19:20] [INFO ] Built C files in 898ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16885181442825274414
Running compilation step : cd /tmp/ltsmin16885181442825274414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin16885181442825274414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin16885181442825274414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 15:19:23] [INFO ] Flatten gal took : 59 ms
[2024-05-29 15:19:23] [INFO ] Flatten gal took : 59 ms
[2024-05-29 15:19:24] [INFO ] Time to serialize gal into /tmp/LTL7544437974592363425.gal : 12 ms
[2024-05-29 15:19:24] [INFO ] Time to serialize properties into /tmp/LTL18018453251184420802.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7544437974592363425.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2540568686482238092.hoa' '-atoms' '/tmp/LTL18018453251184420802.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18018453251184420802.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2540568686482238092.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t2201, t2203, t2205, t2207, t2209, t2211, t22...282
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
530 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,5.67267,136368,1,0,1158,44492,2167,45,43804,28350,2243
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-09a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyCommit-PT-09a-LTLFireability-05 finished in 243212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 646 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2024-05-29 15:19:30] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:19:30] [INFO ] Invariant cache hit.
[2024-05-29 15:19:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 15:19:30] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:19:30] [INFO ] Invariant cache hit.
[2024-05-29 15:19:30] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:19:30] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-29 15:19:30] [INFO ] Redundant transitions in 73 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:19:30] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:19:30] [INFO ] Invariant cache hit.
[2024-05-29 15:19:30] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:19:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:19:53] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:19:56] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2024-05-29 15:19:56] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-29 15:19:57] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 0 ms to minimize.
[2024-05-29 15:19:57] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2024-05-29 15:19:57] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2024-05-29 15:19:57] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-05-29 15:19:58] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 15:19:58] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 15:19:58] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:19:58] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:19:58] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 15:19:58] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:20:12] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2024-05-29 15:20:12] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-05-29 15:20:12] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2024-05-29 15:20:13] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-29 15:20:13] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:20:13] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 15:20:13] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:20:18] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-29 15:20:18] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 15:20:18] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 15:20:18] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:20:18] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:20:18] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:20:21] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:20:21] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:20:21] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1151 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 56/56 constraints]
After SMT, in 75664ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75674ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76728 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-06
Product exploration explored 100000 steps with 9090 reset in 2446 ms.
Product exploration explored 100000 steps with 9090 reset in 2300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-29 15:20:51] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:20:51] [INFO ] Invariant cache hit.
[2024-05-29 15:20:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 15:20:52] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-29 15:20:52] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:20:52] [INFO ] [Real]Added 1043 Read/Feed constraints in 99 ms returned sat
[2024-05-29 15:20:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:20:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:20:53] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-29 15:20:53] [INFO ] [Nat]Added 1043 Read/Feed constraints in 118 ms returned sat
[2024-05-29 15:20:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 93 ms.
[2024-05-29 15:20:53] [INFO ] Added : 0 causal constraints over 0 iterations in 184 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 173 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-05-29 15:20:53] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:20:53] [INFO ] Invariant cache hit.
[2024-05-29 15:20:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 15:20:53] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:20:53] [INFO ] Invariant cache hit.
[2024-05-29 15:20:53] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:20:53] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-29 15:20:53] [INFO ] Redundant transitions in 76 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:20:54] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:20:54] [INFO ] Invariant cache hit.
[2024-05-29 15:20:54] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-29 15:21:12] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:21:16] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:21:19] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-29 15:21:20] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-29 15:21:20] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-29 15:21:20] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2024-05-29 15:21:20] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:21:35] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2024-05-29 15:21:35] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-29 15:21:35] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-29 15:21:36] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-29 15:21:36] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:21:36] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 15:21:36] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:21:41] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-05-29 15:21:41] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:21:41] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 15:21:41] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 15:21:41] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:21:41] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1094 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 75737ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75747ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76343 ms. Remains : 31/31 places, 1075/1075 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-29 15:22:10] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:22:10] [INFO ] Invariant cache hit.
[2024-05-29 15:22:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:22:10] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-29 15:22:10] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:22:10] [INFO ] [Real]Added 1043 Read/Feed constraints in 95 ms returned sat
[2024-05-29 15:22:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:22:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:22:11] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-29 15:22:11] [INFO ] [Nat]Added 1043 Read/Feed constraints in 115 ms returned sat
[2024-05-29 15:22:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 93 ms.
[2024-05-29 15:22:11] [INFO ] Added : 0 causal constraints over 0 iterations in 164 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 2295 ms.
Product exploration explored 100000 steps with 9090 reset in 2295 ms.
Built C files in :
/tmp/ltsmin14027627269568166891
[2024-05-29 15:22:16] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 15:22:16] [INFO ] Computation of Complete disable matrix. took 351 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:22:16] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 15:22:16] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:22:17] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 15:22:17] [INFO ] Computation of Completed DNA matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:22:17] [INFO ] Built C files in 888ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14027627269568166891
Running compilation step : cd /tmp/ltsmin14027627269568166891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14027627269568166891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14027627269568166891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 170 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-05-29 15:22:20] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:22:20] [INFO ] Invariant cache hit.
[2024-05-29 15:22:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 15:22:20] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:22:20] [INFO ] Invariant cache hit.
[2024-05-29 15:22:20] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:22:20] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-29 15:22:20] [INFO ] Redundant transitions in 76 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:22:20] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:22:20] [INFO ] Invariant cache hit.
[2024-05-29 15:22:21] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-29 15:22:39] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-29 15:22:40] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 15:22:40] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:22:40] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 15:22:40] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 15:22:40] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 15:22:40] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:22:40] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 15:22:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:22:43] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:22:46] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-29 15:22:47] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-29 15:22:47] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2024-05-29 15:22:47] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2024-05-29 15:22:47] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2024-05-29 15:22:48] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2024-05-29 15:22:48] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-29 15:22:48] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 15:22:48] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-29 15:22:48] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-29 15:22:48] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-29 15:22:49] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-29 15:22:49] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2024-05-29 15:22:49] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:22:49] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:22:49] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:22:49] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 15:22:49] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 15:22:49] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-29 15:22:50] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:23:02] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2024-05-29 15:23:02] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-29 15:23:02] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 15:23:02] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-29 15:23:02] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-29 15:23:03] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 15:23:03] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:23:08] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2024-05-29 15:23:08] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 15:23:08] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 15:23:08] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 15:23:08] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:23:08] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:23:11] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-29 15:23:11] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 15:23:11] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1094 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 75603ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75613ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76203 ms. Remains : 31/31 places, 1075/1075 transitions.
Built C files in :
/tmp/ltsmin12403515738442171845
[2024-05-29 15:23:36] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 15:23:36] [INFO ] Computation of Complete disable matrix. took 351 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:23:37] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 15:23:37] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:23:37] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 15:23:37] [INFO ] Computation of Completed DNA matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:23:37] [INFO ] Built C files in 890ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12403515738442171845
Running compilation step : cd /tmp/ltsmin12403515738442171845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12403515738442171845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12403515738442171845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 15:23:40] [INFO ] Flatten gal took : 59 ms
[2024-05-29 15:23:40] [INFO ] Flatten gal took : 59 ms
[2024-05-29 15:23:40] [INFO ] Time to serialize gal into /tmp/LTL2531855683661342266.gal : 12 ms
[2024-05-29 15:23:40] [INFO ] Time to serialize properties into /tmp/LTL13438108483289428021.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2531855683661342266.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5047684134475395452.hoa' '-atoms' '/tmp/LTL13438108483289428021.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13438108483289428021.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5047684134475395452.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t2201, t2203, t2205, t2207, t2209, t2211, t22...282
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
584 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.22851,139012,1,0,1161,44534,2161,46,43265,27861,2245
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-09a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyCommit-PT-09a-LTLFireability-06 finished in 257286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:23:47] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2024-05-29 15:23:47] [INFO ] Computed 1 invariants in 17 ms
[2024-05-29 15:23:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 15:23:47] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:23:47] [INFO ] Invariant cache hit.
[2024-05-29 15:23:47] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:23:47] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:23:47] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:23:47] [INFO ] Invariant cache hit.
[2024-05-29 15:23:47] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:24:31] [INFO ] Deduced a trap composed of 13 places in 504 ms of which 1 ms to minimize.
[2024-05-29 15:24:32] [INFO ] Deduced a trap composed of 13 places in 491 ms of which 0 ms to minimize.
[2024-05-29 15:24:32] [INFO ] Deduced a trap composed of 13 places in 603 ms of which 0 ms to minimize.
[2024-05-29 15:24:33] [INFO ] Deduced a trap composed of 14 places in 569 ms of which 1 ms to minimize.
[2024-05-29 15:24:33] [INFO ] Deduced a trap composed of 15 places in 566 ms of which 1 ms to minimize.
[2024-05-29 15:24:34] [INFO ] Deduced a trap composed of 13 places in 590 ms of which 1 ms to minimize.
[2024-05-29 15:24:35] [INFO ] Deduced a trap composed of 13 places in 583 ms of which 1 ms to minimize.
[2024-05-29 15:24:35] [INFO ] Deduced a trap composed of 13 places in 593 ms of which 1 ms to minimize.
[2024-05-29 15:24:36] [INFO ] Deduced a trap composed of 13 places in 609 ms of which 1 ms to minimize.
[2024-05-29 15:24:36] [INFO ] Deduced a trap composed of 13 places in 600 ms of which 1 ms to minimize.
[2024-05-29 15:24:37] [INFO ] Deduced a trap composed of 13 places in 594 ms of which 1 ms to minimize.
[2024-05-29 15:24:38] [INFO ] Deduced a trap composed of 13 places in 598 ms of which 1 ms to minimize.
[2024-05-29 15:24:38] [INFO ] Deduced a trap composed of 15 places in 627 ms of which 1 ms to minimize.
[2024-05-29 15:24:39] [INFO ] Deduced a trap composed of 13 places in 614 ms of which 1 ms to minimize.
[2024-05-29 15:24:39] [INFO ] Deduced a trap composed of 13 places in 619 ms of which 1 ms to minimize.
[2024-05-29 15:24:40] [INFO ] Deduced a trap composed of 15 places in 505 ms of which 1 ms to minimize.
[2024-05-29 15:24:40] [INFO ] Deduced a trap composed of 20 places in 492 ms of which 0 ms to minimize.
[2024-05-29 15:24:41] [INFO ] Deduced a trap composed of 17 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:24:41] [INFO ] Deduced a trap composed of 15 places in 492 ms of which 1 ms to minimize.
[2024-05-29 15:24:42] [INFO ] Deduced a trap composed of 14 places in 419 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:24:43] [INFO ] Deduced a trap composed of 14 places in 427 ms of which 1 ms to minimize.
[2024-05-29 15:24:43] [INFO ] Deduced a trap composed of 13 places in 439 ms of which 1 ms to minimize.
[2024-05-29 15:24:44] [INFO ] Deduced a trap composed of 13 places in 374 ms of which 0 ms to minimize.
[2024-05-29 15:24:44] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 1 ms to minimize.
[2024-05-29 15:24:44] [INFO ] Deduced a trap composed of 13 places in 485 ms of which 1 ms to minimize.
[2024-05-29 15:24:45] [INFO ] Deduced a trap composed of 18 places in 485 ms of which 1 ms to minimize.
[2024-05-29 15:24:45] [INFO ] Deduced a trap composed of 14 places in 480 ms of which 1 ms to minimize.
[2024-05-29 15:24:46] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 0 ms to minimize.
[2024-05-29 15:24:46] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2024-05-29 15:24:47] [INFO ] Deduced a trap composed of 13 places in 483 ms of which 1 ms to minimize.
[2024-05-29 15:24:47] [INFO ] Deduced a trap composed of 13 places in 420 ms of which 0 ms to minimize.
[2024-05-29 15:24:48] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 1 ms to minimize.
[2024-05-29 15:24:48] [INFO ] Deduced a trap composed of 15 places in 368 ms of which 1 ms to minimize.
[2024-05-29 15:24:48] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 0 ms to minimize.
[2024-05-29 15:24:49] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
SMT process timed out in 61228ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 61251ms
Finished structural reductions in LTL mode , in 1 iterations and 61948 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-07
Product exploration explored 100000 steps with 1562 reset in 915 ms.
Product exploration explored 100000 steps with 1562 reset in 913 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 252 steps (0 resets) in 10 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
[2024-05-29 15:24:51] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:24:51] [INFO ] Invariant cache hit.
[2024-05-29 15:24:52] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 15:24:52] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2024-05-29 15:24:52] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:24:53] [INFO ] [Real]Added 2055 Read/Feed constraints in 177 ms returned sat
[2024-05-29 15:24:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:24:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 15:24:54] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2024-05-29 15:24:54] [INFO ] [Nat]Added 2055 Read/Feed constraints in 211 ms returned sat
[2024-05-29 15:24:54] [INFO ] Computed and/alt/rep : 132/162/132 causal constraints (skipped 2077 transitions) in 226 ms.
[2024-05-29 15:24:56] [INFO ] Added : 98 causal constraints over 20 iterations in 2006 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 625 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2024-05-29 15:24:57] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2024-05-29 15:24:57] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 15:24:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 15:24:57] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:24:57] [INFO ] Invariant cache hit.
[2024-05-29 15:24:57] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:24:57] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-29 15:24:57] [INFO ] Redundant transitions in 76 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:24:57] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:24:57] [INFO ] Invariant cache hit.
[2024-05-29 15:24:57] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:25:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 15:25:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:25:15] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:25:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:25:15] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:25:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:25:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:25:16] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:25:16] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-29 15:25:16] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-29 15:25:16] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-29 15:25:16] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 15:25:16] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-29 15:25:17] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 15:25:17] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:25:17] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 15:25:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:25:17] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 15:25:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:25:19] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:25:23] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2024-05-29 15:25:23] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2024-05-29 15:25:23] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-29 15:25:23] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2024-05-29 15:25:24] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-29 15:25:24] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-29 15:25:24] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-29 15:25:24] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-29 15:25:25] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:25:25] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-29 15:25:25] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2024-05-29 15:25:25] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-29 15:25:25] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-29 15:25:25] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:25:25] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:25:25] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 15:25:26] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:25:26] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-29 15:25:26] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:25:26] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:25:38] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2024-05-29 15:25:38] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-29 15:25:38] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-29 15:25:39] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-05-29 15:25:39] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 15:25:39] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 15:25:39] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:25:45] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-29 15:25:45] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 15:25:45] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:25:45] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 15:25:45] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:25:45] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:25:47] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:25:48] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 15:25:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1094 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 75734ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75744ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76790 ms. Remains : 31/124 places, 1075/2221 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-29 15:26:13] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:26:13] [INFO ] Invariant cache hit.
[2024-05-29 15:26:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:26:14] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-29 15:26:14] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:26:14] [INFO ] [Real]Added 1043 Read/Feed constraints in 96 ms returned sat
[2024-05-29 15:26:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:26:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:26:15] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-29 15:26:15] [INFO ] [Nat]Added 1043 Read/Feed constraints in 121 ms returned sat
[2024-05-29 15:26:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 92 ms.
[2024-05-29 15:26:15] [INFO ] Added : 0 causal constraints over 0 iterations in 168 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 2299 ms.
Product exploration explored 100000 steps with 9090 reset in 2313 ms.
Built C files in :
/tmp/ltsmin12418846956999864236
[2024-05-29 15:26:20] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 15:26:20] [INFO ] Computation of Complete disable matrix. took 351 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:26:20] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 15:26:20] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:26:20] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 15:26:20] [INFO ] Computation of Completed DNA matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:26:21] [INFO ] Built C files in 883ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12418846956999864236
Running compilation step : cd /tmp/ltsmin12418846956999864236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12418846956999864236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12418846956999864236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 183 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-05-29 15:26:24] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:26:24] [INFO ] Invariant cache hit.
[2024-05-29 15:26:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 15:26:24] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:26:24] [INFO ] Invariant cache hit.
[2024-05-29 15:26:24] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:26:24] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-05-29 15:26:24] [INFO ] Redundant transitions in 79 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:26:24] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:26:24] [INFO ] Invariant cache hit.
[2024-05-29 15:26:24] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:26:42] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 15:26:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:26:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:26:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:26:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:26:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:26:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:26:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:26:43] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-29 15:26:43] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 15:26:43] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-29 15:26:43] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 15:26:44] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:26:44] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 15:26:44] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 15:26:44] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 15:26:44] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
[2024-05-29 15:26:44] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 15:26:44] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:26:46] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:26:50] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2024-05-29 15:26:50] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-29 15:26:50] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-29 15:26:51] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-29 15:26:51] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2024-05-29 15:26:51] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-29 15:26:51] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-05-29 15:26:52] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:26:52] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 15:26:52] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-29 15:26:52] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 15:26:52] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 15:26:52] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 15:26:52] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:26:52] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:26:53] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 15:26:53] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:26:53] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 15:26:53] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:26:53] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:27:05] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2024-05-29 15:27:06] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-29 15:27:06] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-05-29 15:27:06] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-29 15:27:06] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 15:27:06] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:27:07] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:27:12] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-29 15:27:12] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-29 15:27:12] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 15:27:12] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:27:12] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 15:27:12] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:27:15] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 15:27:15] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:27:15] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1094 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 75831ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75842ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76448 ms. Remains : 31/31 places, 1075/1075 transitions.
Built C files in :
/tmp/ltsmin8831775705251274426
[2024-05-29 15:27:40] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 15:27:40] [INFO ] Computation of Complete disable matrix. took 350 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:27:41] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 15:27:41] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:27:41] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 15:27:41] [INFO ] Computation of Completed DNA matrix. took 75 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 15:27:41] [INFO ] Built C files in 901ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8831775705251274426
Running compilation step : cd /tmp/ltsmin8831775705251274426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8831775705251274426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8831775705251274426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 15:27:44] [INFO ] Flatten gal took : 60 ms
[2024-05-29 15:27:44] [INFO ] Flatten gal took : 71 ms
[2024-05-29 15:27:44] [INFO ] Time to serialize gal into /tmp/LTL11313799621763995567.gal : 12 ms
[2024-05-29 15:27:44] [INFO ] Time to serialize properties into /tmp/LTL4307141781154739492.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11313799621763995567.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7837871608132767345.hoa' '-atoms' '/tmp/LTL4307141781154739492.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4307141781154739492.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7837871608132767345.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t2201, t2203, t2205, t2207, t2209, t2211, t22...282
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
581 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.19854,136900,1,0,1158,44492,2167,45,43492,28335,2243
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-09a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyCommit-PT-09a-LTLFireability-07 finished in 243965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(!(X((G(!p0)||p0)) U !p0)))))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 635 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2024-05-29 15:27:51] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:27:51] [INFO ] Invariant cache hit.
[2024-05-29 15:27:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 15:27:51] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:27:51] [INFO ] Invariant cache hit.
[2024-05-29 15:27:51] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:27:51] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-29 15:27:52] [INFO ] Redundant transitions in 75 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:27:52] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:27:52] [INFO ] Invariant cache hit.
[2024-05-29 15:27:52] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:28:10] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:28:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:28:10] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 15:28:10] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 15:28:10] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:28:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:28:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:28:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:28:10] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-29 15:28:10] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 15:28:11] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-29 15:28:11] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 15:28:11] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:28:11] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 15:28:11] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:28:11] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 15:28:11] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:28:11] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 15:28:11] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:28:14] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:28:17] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2024-05-29 15:28:18] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2024-05-29 15:28:18] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-29 15:28:18] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-29 15:28:18] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2024-05-29 15:28:19] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-29 15:28:19] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-29 15:28:19] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 15:28:19] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:28:19] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:28:19] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 15:28:20] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 15:28:20] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 15:28:20] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 15:28:20] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:28:20] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 15:28:20] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:28:20] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:28:20] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-29 15:28:21] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:28:33] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2024-05-29 15:28:33] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-29 15:28:33] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 15:28:34] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-29 15:28:34] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-29 15:28:34] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:28:34] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:28:39] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2024-05-29 15:28:39] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-29 15:28:39] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:28:39] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 15:28:39] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:28:40] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:28:42] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-29 15:28:42] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:28:42] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1151 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 56/56 constraints]
After SMT, in 75702ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75712ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76758 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-09
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 6 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-09 finished in 76825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:29:07] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2024-05-29 15:29:07] [INFO ] Computed 1 invariants in 17 ms
[2024-05-29 15:29:07] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 15:29:07] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:29:07] [INFO ] Invariant cache hit.
[2024-05-29 15:29:08] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:29:08] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:29:08] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:29:08] [INFO ] Invariant cache hit.
[2024-05-29 15:29:08] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:29:52] [INFO ] Deduced a trap composed of 13 places in 513 ms of which 1 ms to minimize.
[2024-05-29 15:29:53] [INFO ] Deduced a trap composed of 13 places in 501 ms of which 1 ms to minimize.
[2024-05-29 15:29:53] [INFO ] Deduced a trap composed of 13 places in 597 ms of which 1 ms to minimize.
[2024-05-29 15:29:54] [INFO ] Deduced a trap composed of 14 places in 592 ms of which 1 ms to minimize.
[2024-05-29 15:29:55] [INFO ] Deduced a trap composed of 15 places in 579 ms of which 0 ms to minimize.
[2024-05-29 15:29:55] [INFO ] Deduced a trap composed of 13 places in 597 ms of which 1 ms to minimize.
[2024-05-29 15:29:56] [INFO ] Deduced a trap composed of 13 places in 595 ms of which 1 ms to minimize.
[2024-05-29 15:29:56] [INFO ] Deduced a trap composed of 13 places in 596 ms of which 1 ms to minimize.
[2024-05-29 15:29:57] [INFO ] Deduced a trap composed of 13 places in 596 ms of which 1 ms to minimize.
[2024-05-29 15:29:58] [INFO ] Deduced a trap composed of 13 places in 603 ms of which 1 ms to minimize.
[2024-05-29 15:29:58] [INFO ] Deduced a trap composed of 13 places in 605 ms of which 0 ms to minimize.
[2024-05-29 15:29:59] [INFO ] Deduced a trap composed of 13 places in 602 ms of which 0 ms to minimize.
[2024-05-29 15:29:59] [INFO ] Deduced a trap composed of 15 places in 613 ms of which 1 ms to minimize.
[2024-05-29 15:30:00] [INFO ] Deduced a trap composed of 13 places in 613 ms of which 1 ms to minimize.
[2024-05-29 15:30:01] [INFO ] Deduced a trap composed of 13 places in 604 ms of which 1 ms to minimize.
[2024-05-29 15:30:01] [INFO ] Deduced a trap composed of 15 places in 512 ms of which 1 ms to minimize.
[2024-05-29 15:30:02] [INFO ] Deduced a trap composed of 20 places in 508 ms of which 1 ms to minimize.
[2024-05-29 15:30:02] [INFO ] Deduced a trap composed of 17 places in 501 ms of which 1 ms to minimize.
[2024-05-29 15:30:03] [INFO ] Deduced a trap composed of 15 places in 501 ms of which 1 ms to minimize.
[2024-05-29 15:30:03] [INFO ] Deduced a trap composed of 14 places in 429 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:30:04] [INFO ] Deduced a trap composed of 14 places in 419 ms of which 0 ms to minimize.
[2024-05-29 15:30:04] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 0 ms to minimize.
[2024-05-29 15:30:05] [INFO ] Deduced a trap composed of 13 places in 372 ms of which 1 ms to minimize.
[2024-05-29 15:30:05] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 1 ms to minimize.
[2024-05-29 15:30:06] [INFO ] Deduced a trap composed of 13 places in 488 ms of which 1 ms to minimize.
[2024-05-29 15:30:06] [INFO ] Deduced a trap composed of 18 places in 483 ms of which 0 ms to minimize.
[2024-05-29 15:30:07] [INFO ] Deduced a trap composed of 14 places in 474 ms of which 1 ms to minimize.
[2024-05-29 15:30:07] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2024-05-29 15:30:07] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 0 ms to minimize.
[2024-05-29 15:30:08] [INFO ] Deduced a trap composed of 13 places in 477 ms of which 1 ms to minimize.
[2024-05-29 15:30:08] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2024-05-29 15:30:09] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2024-05-29 15:30:09] [INFO ] Deduced a trap composed of 15 places in 377 ms of which 1 ms to minimize.
[2024-05-29 15:30:10] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 0 ms to minimize.
SMT process timed out in 61410ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 61431ms
Finished structural reductions in LTL mode , in 1 iterations and 62154 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-11
Product exploration explored 100000 steps with 1562 reset in 959 ms.
Product exploration explored 100000 steps with 1562 reset in 956 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 252 steps (0 resets) in 11 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 15:30:12] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:30:12] [INFO ] Invariant cache hit.
[2024-05-29 15:30:13] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 15:30:13] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2024-05-29 15:30:14] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:30:14] [INFO ] [Real]Added 2055 Read/Feed constraints in 173 ms returned sat
[2024-05-29 15:30:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:30:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:30:15] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2024-05-29 15:30:15] [INFO ] [Nat]Added 2055 Read/Feed constraints in 204 ms returned sat
[2024-05-29 15:30:15] [INFO ] Computed and/alt/rep : 132/162/132 causal constraints (skipped 2077 transitions) in 225 ms.
[2024-05-29 15:30:17] [INFO ] Added : 98 causal constraints over 20 iterations in 1992 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 9 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:30:17] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:30:17] [INFO ] Invariant cache hit.
[2024-05-29 15:30:17] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 15:30:17] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:30:17] [INFO ] Invariant cache hit.
[2024-05-29 15:30:18] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:30:18] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:30:18] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:30:18] [INFO ] Invariant cache hit.
[2024-05-29 15:30:18] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:31:02] [INFO ] Deduced a trap composed of 13 places in 506 ms of which 0 ms to minimize.
[2024-05-29 15:31:03] [INFO ] Deduced a trap composed of 13 places in 497 ms of which 1 ms to minimize.
[2024-05-29 15:31:03] [INFO ] Deduced a trap composed of 13 places in 589 ms of which 1 ms to minimize.
[2024-05-29 15:31:04] [INFO ] Deduced a trap composed of 14 places in 584 ms of which 1 ms to minimize.
[2024-05-29 15:31:04] [INFO ] Deduced a trap composed of 15 places in 571 ms of which 1 ms to minimize.
[2024-05-29 15:31:05] [INFO ] Deduced a trap composed of 13 places in 600 ms of which 0 ms to minimize.
[2024-05-29 15:31:06] [INFO ] Deduced a trap composed of 13 places in 608 ms of which 1 ms to minimize.
[2024-05-29 15:31:06] [INFO ] Deduced a trap composed of 13 places in 612 ms of which 1 ms to minimize.
[2024-05-29 15:31:07] [INFO ] Deduced a trap composed of 13 places in 607 ms of which 1 ms to minimize.
[2024-05-29 15:31:08] [INFO ] Deduced a trap composed of 13 places in 615 ms of which 1 ms to minimize.
[2024-05-29 15:31:08] [INFO ] Deduced a trap composed of 13 places in 607 ms of which 1 ms to minimize.
[2024-05-29 15:31:09] [INFO ] Deduced a trap composed of 13 places in 615 ms of which 1 ms to minimize.
[2024-05-29 15:31:09] [INFO ] Deduced a trap composed of 15 places in 634 ms of which 1 ms to minimize.
[2024-05-29 15:31:10] [INFO ] Deduced a trap composed of 13 places in 634 ms of which 0 ms to minimize.
[2024-05-29 15:31:11] [INFO ] Deduced a trap composed of 13 places in 627 ms of which 0 ms to minimize.
[2024-05-29 15:31:11] [INFO ] Deduced a trap composed of 15 places in 523 ms of which 1 ms to minimize.
[2024-05-29 15:31:12] [INFO ] Deduced a trap composed of 20 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:31:12] [INFO ] Deduced a trap composed of 17 places in 497 ms of which 1 ms to minimize.
[2024-05-29 15:31:13] [INFO ] Deduced a trap composed of 15 places in 487 ms of which 1 ms to minimize.
[2024-05-29 15:31:13] [INFO ] Deduced a trap composed of 14 places in 420 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:31:14] [INFO ] Deduced a trap composed of 14 places in 421 ms of which 0 ms to minimize.
[2024-05-29 15:31:14] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 0 ms to minimize.
[2024-05-29 15:31:15] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 1 ms to minimize.
[2024-05-29 15:31:15] [INFO ] Deduced a trap composed of 13 places in 380 ms of which 1 ms to minimize.
[2024-05-29 15:31:16] [INFO ] Deduced a trap composed of 13 places in 505 ms of which 1 ms to minimize.
[2024-05-29 15:31:16] [INFO ] Deduced a trap composed of 18 places in 490 ms of which 1 ms to minimize.
[2024-05-29 15:31:17] [INFO ] Deduced a trap composed of 14 places in 490 ms of which 1 ms to minimize.
[2024-05-29 15:31:17] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 0 ms to minimize.
[2024-05-29 15:31:18] [INFO ] Deduced a trap composed of 13 places in 365 ms of which 1 ms to minimize.
[2024-05-29 15:31:18] [INFO ] Deduced a trap composed of 13 places in 480 ms of which 1 ms to minimize.
[2024-05-29 15:31:18] [INFO ] Deduced a trap composed of 13 places in 418 ms of which 1 ms to minimize.
[2024-05-29 15:31:19] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 0 ms to minimize.
[2024-05-29 15:31:19] [INFO ] Deduced a trap composed of 15 places in 364 ms of which 0 ms to minimize.
SMT process timed out in 61371ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 61395ms
Finished structural reductions in LTL mode , in 1 iterations and 62065 ms. Remains : 124/124 places, 2221/2221 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 252 steps (0 resets) in 9 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 15:31:20] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:31:20] [INFO ] Invariant cache hit.
[2024-05-29 15:31:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:31:21] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2024-05-29 15:31:21] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:31:22] [INFO ] [Real]Added 2055 Read/Feed constraints in 178 ms returned sat
[2024-05-29 15:31:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:31:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 15:31:23] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2024-05-29 15:31:23] [INFO ] [Nat]Added 2055 Read/Feed constraints in 203 ms returned sat
[2024-05-29 15:31:23] [INFO ] Computed and/alt/rep : 132/162/132 causal constraints (skipped 2077 transitions) in 227 ms.
[2024-05-29 15:31:25] [INFO ] Added : 98 causal constraints over 20 iterations in 2002 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1562 reset in 910 ms.
Product exploration explored 100000 steps with 1562 reset in 920 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 124 transition count 2221
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 31 place count 124 transition count 2231
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 41 place count 124 transition count 2231
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 61 place count 104 transition count 2211
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 81 place count 104 transition count 2211
Performed 41 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 122 place count 104 transition count 2221
Ensure Unique test removed 1043 transitions
Reduce isomorphic transitions removed 1043 transitions.
Iterating post reduction 1 with 1043 rules applied. Total rules applied 1165 place count 104 transition count 1178
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1187 place count 82 transition count 1156
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 1209 place count 82 transition count 1156
Deduced a syphon composed of 40 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 1229 place count 82 transition count 1136
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1239 place count 82 transition count 1136
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 1259 place count 62 transition count 1116
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 1279 place count 62 transition count 1116
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 1279 rules in 476 ms. Remains 62 /124 variables (removed 62) and now considering 1116/2221 (removed 1105) transitions.
[2024-05-29 15:31:28] [INFO ] Redundant transitions in 73 ms returned []
Running 1115 sub problems to find dead transitions.
[2024-05-29 15:31:28] [INFO ] Flow matrix only has 1105 transitions (discarded 11 similar events)
// Phase 1: matrix 1105 rows 62 cols
[2024-05-29 15:31:28] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 15:31:28] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 15:31:47] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-29 15:31:47] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:31:48] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 15:31:48] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:31:48] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:31:48] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:31:48] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 15:31:48] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:31:48] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 15:31:48] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:31:48] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 0 ms to minimize.
[2024-05-29 15:31:49] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 0 ms to minimize.
[2024-05-29 15:31:49] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
[2024-05-29 15:31:49] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2024-05-29 15:31:49] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2024-05-29 15:31:49] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:31:50] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2024-05-29 15:31:50] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:31:50] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2024-05-29 15:31:50] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 15:31:51] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2024-05-29 15:31:51] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
[2024-05-29 15:31:51] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2024-05-29 15:31:51] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2024-05-29 15:31:51] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2024-05-29 15:31:51] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2024-05-29 15:31:51] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2024-05-29 15:31:52] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 15:31:52] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 15:31:52] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 15:31:52] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-29 15:31:52] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 15:31:52] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-29 15:31:52] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:31:52] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 15:31:52] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 15:31:52] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:31:53] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 15:31:53] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:31:53] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 15:31:55] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2024-05-29 15:31:55] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:31:55] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:31:55] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-29 15:31:55] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:31:56] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-29 15:31:56] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 15:31:56] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2024-05-29 15:31:56] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:31:56] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2024-05-29 15:31:56] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 15:31:56] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:31:56] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2024-05-29 15:31:57] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2024-05-29 15:31:57] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 15:31:57] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2024-05-29 15:31:57] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
At refinement iteration 6 (OVERLAPS) 1104/1166 variables, 62/120 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1166 variables, 1042/1162 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1166/1167 variables, and 1162 constraints, problems are : Problem set: 40 solved, 1075 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1115/71 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 40 solved, 1075 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 31/62 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 57/58 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:32:15] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2024-05-29 15:32:15] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:32:16] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:32:16] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 15:32:16] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 15:32:16] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2024-05-29 15:32:16] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 15:32:16] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:32:16] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:32:16] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 15:32:16] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 15:32:16] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 12/70 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:32:19] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 15:32:19] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:32:20] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2024-05-29 15:32:20] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 15:32:20] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:32:20] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 15:32:20] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 15:32:20] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-05-29 15:32:20] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:32:20] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-29 15:32:20] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:32:21] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:32:21] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 13/83 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:32:24] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2024-05-29 15:32:25] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2024-05-29 15:32:25] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2024-05-29 15:32:25] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2024-05-29 15:32:25] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2024-05-29 15:32:25] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:32:25] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-29 15:32:25] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:32:26] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2024-05-29 15:32:26] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2024-05-29 15:32:26] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:32:26] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2024-05-29 15:32:26] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:32:26] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 15:32:26] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:32:26] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:32:26] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:32:26] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 15:32:27] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-05-29 15:32:27] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 20/103 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:32:28] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2024-05-29 15:32:28] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:32:28] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 15:32:28] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 15:32:28] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:32:28] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:32:28] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 7/110 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:32:33] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2024-05-29 15:32:33] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2024-05-29 15:32:33] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-29 15:32:34] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:32:34] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 15:32:34] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 15:32:34] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 7/117 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 15:32:39] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 15:32:39] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 2/119 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 62/1167 variables, and 119 constraints, problems are : Problem set: 40 solved, 1075 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/62 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1044/71 constraints, Known Traps: 118/118 constraints]
After SMT, in 75775ms problems are : Problem set: 40 solved, 1075 unsolved
Search for dead transitions found 40 dead transitions in 75786ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/124 places, 1076/2221 transitions.
Graph (complete) has 351 edges and 62 vertex of which 32 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 173 ms. Remains 32 /62 variables (removed 30) and now considering 1076/1076 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/124 places, 1076/2221 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76521 ms. Remains : 32/124 places, 1076/2221 transitions.
Built C files in :
/tmp/ltsmin3337307532724751626
[2024-05-29 15:32:44] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3337307532724751626
Running compilation step : cd /tmp/ltsmin3337307532724751626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3337307532724751626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3337307532724751626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2024-05-29 15:32:47] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2024-05-29 15:32:47] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 15:32:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 15:32:47] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:32:47] [INFO ] Invariant cache hit.
[2024-05-29 15:32:47] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:32:47] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:32:48] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:32:48] [INFO ] Invariant cache hit.
[2024-05-29 15:32:48] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:33:32] [INFO ] Deduced a trap composed of 13 places in 501 ms of which 0 ms to minimize.
[2024-05-29 15:33:32] [INFO ] Deduced a trap composed of 13 places in 491 ms of which 0 ms to minimize.
[2024-05-29 15:33:33] [INFO ] Deduced a trap composed of 13 places in 578 ms of which 0 ms to minimize.
[2024-05-29 15:33:33] [INFO ] Deduced a trap composed of 14 places in 595 ms of which 1 ms to minimize.
[2024-05-29 15:33:34] [INFO ] Deduced a trap composed of 15 places in 584 ms of which 1 ms to minimize.
[2024-05-29 15:33:35] [INFO ] Deduced a trap composed of 13 places in 584 ms of which 0 ms to minimize.
[2024-05-29 15:33:35] [INFO ] Deduced a trap composed of 13 places in 593 ms of which 0 ms to minimize.
[2024-05-29 15:33:36] [INFO ] Deduced a trap composed of 13 places in 584 ms of which 1 ms to minimize.
[2024-05-29 15:33:36] [INFO ] Deduced a trap composed of 13 places in 588 ms of which 1 ms to minimize.
[2024-05-29 15:33:37] [INFO ] Deduced a trap composed of 13 places in 597 ms of which 0 ms to minimize.
[2024-05-29 15:33:38] [INFO ] Deduced a trap composed of 13 places in 598 ms of which 0 ms to minimize.
[2024-05-29 15:33:38] [INFO ] Deduced a trap composed of 13 places in 607 ms of which 0 ms to minimize.
[2024-05-29 15:33:39] [INFO ] Deduced a trap composed of 15 places in 617 ms of which 0 ms to minimize.
[2024-05-29 15:33:39] [INFO ] Deduced a trap composed of 13 places in 631 ms of which 1 ms to minimize.
[2024-05-29 15:33:40] [INFO ] Deduced a trap composed of 13 places in 619 ms of which 0 ms to minimize.
[2024-05-29 15:33:41] [INFO ] Deduced a trap composed of 15 places in 514 ms of which 0 ms to minimize.
[2024-05-29 15:33:41] [INFO ] Deduced a trap composed of 20 places in 506 ms of which 0 ms to minimize.
[2024-05-29 15:33:42] [INFO ] Deduced a trap composed of 17 places in 506 ms of which 1 ms to minimize.
[2024-05-29 15:33:42] [INFO ] Deduced a trap composed of 15 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:33:43] [INFO ] Deduced a trap composed of 14 places in 430 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:33:43] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 1 ms to minimize.
[2024-05-29 15:33:44] [INFO ] Deduced a trap composed of 13 places in 431 ms of which 0 ms to minimize.
[2024-05-29 15:33:44] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 1 ms to minimize.
[2024-05-29 15:33:45] [INFO ] Deduced a trap composed of 13 places in 368 ms of which 0 ms to minimize.
[2024-05-29 15:33:45] [INFO ] Deduced a trap composed of 13 places in 487 ms of which 1 ms to minimize.
[2024-05-29 15:33:46] [INFO ] Deduced a trap composed of 18 places in 486 ms of which 0 ms to minimize.
[2024-05-29 15:33:46] [INFO ] Deduced a trap composed of 14 places in 492 ms of which 1 ms to minimize.
[2024-05-29 15:33:47] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 0 ms to minimize.
[2024-05-29 15:33:47] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 1 ms to minimize.
[2024-05-29 15:33:47] [INFO ] Deduced a trap composed of 13 places in 487 ms of which 1 ms to minimize.
[2024-05-29 15:33:48] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 1 ms to minimize.
[2024-05-29 15:33:48] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 1 ms to minimize.
[2024-05-29 15:33:49] [INFO ] Deduced a trap composed of 15 places in 360 ms of which 1 ms to minimize.
SMT process timed out in 61178ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 61202ms
Finished structural reductions in LTL mode , in 1 iterations and 61895 ms. Remains : 124/124 places, 2221/2221 transitions.
Built C files in :
/tmp/ltsmin17163865619311013804
[2024-05-29 15:33:49] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17163865619311013804
Running compilation step : cd /tmp/ltsmin17163865619311013804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin17163865619311013804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin17163865619311013804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 15:33:52] [INFO ] Flatten gal took : 135 ms
[2024-05-29 15:33:52] [INFO ] Flatten gal took : 122 ms
[2024-05-29 15:33:52] [INFO ] Time to serialize gal into /tmp/LTL2902234221892755227.gal : 25 ms
[2024-05-29 15:33:52] [INFO ] Time to serialize properties into /tmp/LTL3263545556748639867.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2902234221892755227.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5528003554017352750.hoa' '-atoms' '/tmp/LTL3263545556748639867.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3263545556748639867.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5528003554017352750.hoa
Detected timeout of ITS tools.
[2024-05-29 15:34:07] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:34:08] [INFO ] Flatten gal took : 121 ms
[2024-05-29 15:34:08] [INFO ] Time to serialize gal into /tmp/LTL15798139298723431900.gal : 23 ms
[2024-05-29 15:34:08] [INFO ] Time to serialize properties into /tmp/LTL8141494831467696627.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15798139298723431900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8141494831467696627.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&((p318==1)&&(p354==1)))...161
Formula 0 simplified : XXG!"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&((p318==1)&&(p354==1)))"
Detected timeout of ITS tools.
[2024-05-29 15:34:23] [INFO ] Flatten gal took : 120 ms
[2024-05-29 15:34:23] [INFO ] Applying decomposition
[2024-05-29 15:34:23] [INFO ] Flatten gal took : 119 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9462847444880144244.txt' '-o' '/tmp/graph9462847444880144244.bin' '-w' '/tmp/graph9462847444880144244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9462847444880144244.bin' '-l' '-1' '-v' '-w' '/tmp/graph9462847444880144244.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:34:23] [INFO ] Decomposing Gal with order
[2024-05-29 15:34:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:34:24] [INFO ] Removed a total of 20551 redundant transitions.
[2024-05-29 15:34:24] [INFO ] Flatten gal took : 292 ms
[2024-05-29 15:34:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 171 ms.
[2024-05-29 15:34:24] [INFO ] Time to serialize gal into /tmp/LTL7868925140889049699.gal : 18 ms
[2024-05-29 15:34:24] [INFO ] Time to serialize properties into /tmp/LTL13289932803539054772.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7868925140889049699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13289932803539054772.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((i3.u5.p30==1)&&(i3.u12.p66==1))&&((i3.u21.p102==1)&&(i3.u7.p138==1)))&&(((i3.u17.p174==1)&&(i3.u42.p210==1))&&((i3.u38....228
Formula 0 simplified : XXG!"(((((i3.u5.p30==1)&&(i3.u12.p66==1))&&((i3.u21.p102==1)&&(i3.u7.p138==1)))&&(((i3.u17.p174==1)&&(i3.u42.p210==1))&&((i3.u38.p24...220
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-09a-LTLFireability-11 finished in 331550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 615 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2024-05-29 15:34:40] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2024-05-29 15:34:40] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 15:34:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 15:34:40] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:34:40] [INFO ] Invariant cache hit.
[2024-05-29 15:34:40] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:34:40] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-29 15:34:40] [INFO ] Redundant transitions in 76 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:34:40] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:34:40] [INFO ] Invariant cache hit.
[2024-05-29 15:34:40] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:34:58] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:34:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:34:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:34:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:34:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:34:58] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:34:58] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:34:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:34:58] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-29 15:34:58] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-29 15:34:59] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-29 15:34:59] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 15:34:59] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-29 15:34:59] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 15:34:59] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:34:59] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:34:59] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 15:34:59] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 15:34:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:35:02] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:35:05] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2024-05-29 15:35:06] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-05-29 15:35:06] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2024-05-29 15:35:06] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2024-05-29 15:35:06] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2024-05-29 15:35:07] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-29 15:35:07] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2024-05-29 15:35:07] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 15:35:07] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:35:07] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-29 15:35:07] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 15:35:08] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-29 15:35:08] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 15:35:08] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:35:08] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-29 15:35:08] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:35:08] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 15:35:08] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2024-05-29 15:35:09] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-29 15:35:09] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:35:21] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2024-05-29 15:35:22] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-29 15:35:22] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-29 15:35:22] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-29 15:35:22] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 15:35:22] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 15:35:23] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:35:27] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:35:27] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:35:27] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:35:27] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 15:35:27] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 15:35:28] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:35:30] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:35:30] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 15:35:30] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1151 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 56/56 constraints]
After SMT, in 75340ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75350ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76389 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-12
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-12 finished in 76455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 613 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2024-05-29 15:35:56] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:35:56] [INFO ] Invariant cache hit.
[2024-05-29 15:35:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 15:35:56] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:35:56] [INFO ] Invariant cache hit.
[2024-05-29 15:35:56] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:35:56] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-29 15:35:56] [INFO ] Redundant transitions in 76 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:35:56] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:35:56] [INFO ] Invariant cache hit.
[2024-05-29 15:35:56] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:36:14] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 15:36:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:36:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:36:14] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:36:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:36:14] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:36:14] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:36:14] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:36:15] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-29 15:36:15] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-29 15:36:15] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-05-29 15:36:15] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 15:36:15] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-29 15:36:15] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 15:36:16] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 15:36:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:36:16] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 15:36:16] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:36:16] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:36:18] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:36:22] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 0 ms to minimize.
[2024-05-29 15:36:22] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-05-29 15:36:22] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2024-05-29 15:36:23] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2024-05-29 15:36:23] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-29 15:36:23] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-29 15:36:23] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-29 15:36:24] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-29 15:36:24] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-05-29 15:36:24] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-29 15:36:24] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-29 15:36:24] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:36:24] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-29 15:36:24] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 15:36:25] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:36:25] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-29 15:36:25] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-29 15:36:25] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2024-05-29 15:36:25] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:36:25] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:36:38] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2024-05-29 15:36:38] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2024-05-29 15:36:38] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-29 15:36:38] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-29 15:36:39] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2024-05-29 15:36:39] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 15:36:39] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:36:43] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-29 15:36:44] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:36:44] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:36:44] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 15:36:44] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-29 15:36:44] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:36:46] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:36:46] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:36:47] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1094 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 75270ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75280ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76309 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-14
Stuttering criterion allowed to conclude after 4301 steps with 390 reset in 105 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-14 finished in 76515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 633 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2024-05-29 15:37:13] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:37:13] [INFO ] Invariant cache hit.
[2024-05-29 15:37:13] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 15:37:13] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:37:13] [INFO ] Invariant cache hit.
[2024-05-29 15:37:13] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:37:13] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-29 15:37:13] [INFO ] Redundant transitions in 76 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 15:37:13] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 15:37:13] [INFO ] Invariant cache hit.
[2024-05-29 15:37:13] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:37:31] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 15:37:31] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:37:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 15:37:31] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:37:31] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:37:31] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 15:37:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:37:31] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:37:31] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-29 15:37:31] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 15:37:32] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-29 15:37:32] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 15:37:32] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:37:32] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 15:37:32] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 15:37:32] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 15:37:32] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 15:37:32] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:37:32] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:37:35] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:37:38] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2024-05-29 15:37:38] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:37:39] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2024-05-29 15:37:39] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2024-05-29 15:37:39] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2024-05-29 15:37:39] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-29 15:37:40] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-05-29 15:37:40] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-29 15:37:40] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-29 15:37:40] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:37:40] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 15:37:40] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 15:37:41] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:37:53] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2024-05-29 15:37:53] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-29 15:37:54] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-29 15:37:54] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-29 15:37:54] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 15:37:54] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 15:37:54] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:38:00] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 15:38:00] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:38:00] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:38:00] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:38:00] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:38:01] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 15:38:03] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-29 15:38:03] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:38:03] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1130 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 21/1151 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1151 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 56/56 constraints]
After SMT, in 75332ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75342ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76392 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-15 finished in 76486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||(F(p0)&&F(p1))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-09a-LTLFireability-00
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1195 place count 41 transition count 1095
Applied a total of 1195 rules in 131 ms. Remains 41 /124 variables (removed 83) and now considering 1095/2221 (removed 1126) transitions.
[2024-05-29 15:38:29] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
// Phase 1: matrix 1084 rows 41 cols
[2024-05-29 15:38:29] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 15:38:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 15:38:29] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:38:29] [INFO ] Invariant cache hit.
[2024-05-29 15:38:29] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:38:29] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2024-05-29 15:38:29] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:38:29] [INFO ] Invariant cache hit.
[2024-05-29 15:38:29] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:38:47] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 15:38:47] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:38:47] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:38:47] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 15:38:47] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:38:48] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:38:48] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:38:48] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-29 15:38:48] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-29 15:38:48] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
[2024-05-29 15:38:48] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2024-05-29 15:38:48] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2024-05-29 15:38:49] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:38:49] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2024-05-29 15:38:49] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2024-05-29 15:38:49] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2024-05-29 15:38:49] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2024-05-29 15:38:50] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2024-05-29 15:38:50] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
[2024-05-29 15:38:50] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:38:50] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:38:50] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:38:50] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:38:50] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:38:50] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 15:38:50] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 15:38:51] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 15:38:51] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2024-05-29 15:38:51] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2024-05-29 15:38:51] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2024-05-29 15:38:51] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2024-05-29 15:38:51] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2024-05-29 15:38:52] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2024-05-29 15:38:52] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-29 15:38:52] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:38:52] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:38:52] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2024-05-29 15:38:52] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 15:38:52] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2024-05-29 15:38:52] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:38:54] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:38:54] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:38:54] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-29 15:38:54] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:38:54] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:38:54] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-29 15:38:55] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:38:55] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:38:57] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2024-05-29 15:38:57] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:38:57] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2024-05-29 15:38:58] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-29 15:38:58] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:38:58] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:38:58] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-29 15:38:58] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:38:58] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:39:01] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-05-29 15:39:01] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2024-05-29 15:39:01] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2024-05-29 15:39:01] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:39:01] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1146 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 1146 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:39:16] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2024-05-29 15:39:17] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:39:17] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:39:19] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2024-05-29 15:39:19] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:39:19] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 15:39:19] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-29 15:39:20] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:39:20] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2024-05-29 15:39:20] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:39:23] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:39:23] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:39:25] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-05-29 15:39:26] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:39:26] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:39:26] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:39:26] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 15:39:26] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:39:26] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 15:39:26] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-29 15:39:26] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:39:26] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:39:26] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:39:27] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:39:27] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:39:27] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1172 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 41/1213 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 88/88 constraints]
After SMT, in 75339ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 75349ms
Starting structural reductions in LI_LTL mode, iteration 1 : 41/124 places, 1095/2221 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 75822 ms. Remains : 41/124 places, 1095/2221 transitions.
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-00
Product exploration explored 100000 steps with 9090 reset in 2306 ms.
Product exploration explored 100000 steps with 9090 reset in 2323 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 15:39:50] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:39:50] [INFO ] Invariant cache hit.
[2024-05-29 15:39:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:39:51] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-29 15:39:51] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:39:51] [INFO ] [Real]Added 1043 Read/Feed constraints in 91 ms returned sat
[2024-05-29 15:39:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:39:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:39:51] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-29 15:39:51] [INFO ] [Nat]Added 1043 Read/Feed constraints in 116 ms returned sat
[2024-05-29 15:39:52] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 1064 transitions) in 96 ms.
[2024-05-29 15:39:52] [INFO ] Added : 0 causal constraints over 0 iterations in 173 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 1095/1095 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
[2024-05-29 15:39:52] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:39:52] [INFO ] Invariant cache hit.
[2024-05-29 15:39:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 15:39:52] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:39:52] [INFO ] Invariant cache hit.
[2024-05-29 15:39:52] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:39:52] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2024-05-29 15:39:52] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:39:52] [INFO ] Invariant cache hit.
[2024-05-29 15:39:52] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:40:10] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 15:40:10] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:40:10] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 15:40:10] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:40:10] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:40:10] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 15:40:10] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:40:11] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 15:40:11] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:40:11] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 0 ms to minimize.
[2024-05-29 15:40:11] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 0 ms to minimize.
[2024-05-29 15:40:11] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:40:11] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2024-05-29 15:40:12] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 0 ms to minimize.
[2024-05-29 15:40:12] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2024-05-29 15:40:12] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2024-05-29 15:40:12] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 0 ms to minimize.
[2024-05-29 15:40:12] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 0 ms to minimize.
[2024-05-29 15:40:13] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2024-05-29 15:40:13] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:40:13] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 15:40:13] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:40:13] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:40:13] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 15:40:13] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 15:40:13] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:40:14] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2024-05-29 15:40:14] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:40:14] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2024-05-29 15:40:14] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2024-05-29 15:40:14] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2024-05-29 15:40:14] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-29 15:40:14] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:40:15] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-29 15:40:15] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:40:15] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2024-05-29 15:40:15] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2024-05-29 15:40:15] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:40:15] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:40:15] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:40:17] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:40:17] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 15:40:17] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:40:17] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-29 15:40:17] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-05-29 15:40:17] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2024-05-29 15:40:17] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:40:17] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:40:20] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:40:20] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-29 15:40:20] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:40:20] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:40:21] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2024-05-29 15:40:21] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 15:40:21] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-29 15:40:21] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 15:40:21] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:40:24] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:40:24] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:40:24] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-29 15:40:24] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2024-05-29 15:40:24] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1146 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 1146 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:40:39] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2024-05-29 15:40:39] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 15:40:39] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:40:42] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2024-05-29 15:40:42] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:40:42] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 15:40:42] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 15:40:42] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:40:42] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2024-05-29 15:40:43] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:40:45] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 15:40:45] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:40:48] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2024-05-29 15:40:48] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:40:48] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:40:49] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:40:49] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:40:49] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:40:49] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-05-29 15:40:49] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:40:49] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 15:40:49] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-29 15:40:49] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2024-05-29 15:40:49] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:40:50] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-05-29 15:40:50] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1172 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 41/1213 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 88/88 constraints]
After SMT, in 75344ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 75354ms
Finished structural reductions in LTL mode , in 1 iterations and 75694 ms. Remains : 41/41 places, 1095/1095 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 15:41:08] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:41:08] [INFO ] Invariant cache hit.
[2024-05-29 15:41:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:41:09] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-29 15:41:09] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:41:09] [INFO ] [Real]Added 1043 Read/Feed constraints in 89 ms returned sat
[2024-05-29 15:41:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:41:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:41:10] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-29 15:41:10] [INFO ] [Nat]Added 1043 Read/Feed constraints in 111 ms returned sat
[2024-05-29 15:41:10] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 1064 transitions) in 96 ms.
[2024-05-29 15:41:10] [INFO ] Added : 0 causal constraints over 0 iterations in 175 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 2299 ms.
Product exploration explored 100000 steps with 9090 reset in 2303 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 1095/1095 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 41 transition count 1085
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 20 rules in 366 ms. Remains 41 /41 variables (removed 0) and now considering 1085/1095 (removed 10) transitions.
[2024-05-29 15:41:15] [INFO ] Redundant transitions in 73 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 15:41:15] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
// Phase 1: matrix 1074 rows 41 cols
[2024-05-29 15:41:15] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 15:41:16] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:41:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:41:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 15:41:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:41:34] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 15:41:34] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:41:34] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:41:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 15:41:34] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 15:41:34] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 15:41:34] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2024-05-29 15:41:35] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-29 15:41:35] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-29 15:41:35] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-29 15:41:35] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-05-29 15:41:35] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-29 15:41:36] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2024-05-29 15:41:36] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 15:41:36] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 15:41:36] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:41:36] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:41:36] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 15:41:36] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:41:36] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:41:36] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:41:37] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2024-05-29 15:41:37] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-05-29 15:41:37] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:41:37] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:41:37] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-29 15:41:38] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 15:41:38] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:41:38] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-29 15:41:38] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:41:38] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:41:38] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:41:38] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:41:38] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:41:38] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:41:39] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-29 15:41:39] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:41:40] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:41:43] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:41:43] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:41:43] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-29 15:41:43] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:41:43] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:41:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 15:41:43] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 7 (OVERLAPS) 1073/1114 variables, 41/90 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1042/1132 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1114/1115 variables, and 1132 constraints, problems are : Problem set: 10 solved, 1065 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1075/31 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 20/41 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 48/49 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 4 (OVERLAPS) 1073/1114 variables, 41/90 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1114 variables, 1042/1132 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1114 variables, 21/1153 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1114 variables, 0/1153 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 8 (OVERLAPS) 1/1115 variables, 1/1154 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1115/1115 variables, and 1154 constraints, problems are : Problem set: 10 solved, 1065 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/31 constraints, Known Traps: 48/48 constraints]
After SMT, in 75388ms problems are : Problem set: 10 solved, 1065 unsolved
Search for dead transitions found 10 dead transitions in 75398ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 41/41 places, 1075/1095 transitions.
Graph (complete) has 341 edges and 41 vertex of which 31 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 168 ms. Remains 31 /41 variables (removed 10) and now considering 1075/1075 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/41 places, 1075/1095 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76018 ms. Remains : 31/41 places, 1075/1095 transitions.
Built C files in :
/tmp/ltsmin17506654263641856739
[2024-05-29 15:42:31] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17506654263641856739
Running compilation step : cd /tmp/ltsmin17506654263641856739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin17506654263641856739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin17506654263641856739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 1095/1095 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
[2024-05-29 15:42:34] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
// Phase 1: matrix 1084 rows 41 cols
[2024-05-29 15:42:34] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 15:42:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 15:42:34] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:42:34] [INFO ] Invariant cache hit.
[2024-05-29 15:42:34] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:42:34] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2024-05-29 15:42:34] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:42:34] [INFO ] Invariant cache hit.
[2024-05-29 15:42:34] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:42:53] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-29 15:42:53] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:42:53] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:42:53] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:42:53] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 15:42:53] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 15:42:53] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:42:53] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-29 15:42:53] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:42:53] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
[2024-05-29 15:42:54] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2024-05-29 15:42:54] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2024-05-29 15:42:54] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
[2024-05-29 15:42:54] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2024-05-29 15:42:54] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 15:42:55] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2024-05-29 15:42:55] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2024-05-29 15:42:55] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2024-05-29 15:42:55] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
[2024-05-29 15:42:55] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:42:56] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:42:56] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 15:42:56] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:42:56] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:42:56] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:42:56] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:42:56] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2024-05-29 15:42:56] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2024-05-29 15:42:56] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 0 ms to minimize.
[2024-05-29 15:42:56] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2024-05-29 15:42:57] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 15:42:57] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 15:42:57] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2024-05-29 15:42:57] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-29 15:42:57] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:42:57] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2024-05-29 15:42:57] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-29 15:42:57] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-29 15:42:58] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-05-29 15:42:58] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:42:59] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:42:59] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:42:59] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:43:00] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:43:00] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:43:00] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2024-05-29 15:43:00] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 15:43:00] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:43:03] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2024-05-29 15:43:03] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 15:43:03] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:43:03] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 15:43:03] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:43:03] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:43:03] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 15:43:03] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-29 15:43:03] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:43:06] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 15:43:06] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:43:06] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:43:06] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:43:07] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1146 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 1146 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:43:22] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:43:24] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:43:25] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:43:28] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-05-29 15:43:28] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2024-05-29 15:43:31] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:43:32] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1172 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 41/1213 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 88/88 constraints]
After SMT, in 75369ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 75382ms
Finished structural reductions in LTL mode , in 1 iterations and 75711 ms. Remains : 41/41 places, 1095/1095 transitions.
Built C files in :
/tmp/ltsmin18391690595316784979
[2024-05-29 15:43:50] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18391690595316784979
Running compilation step : cd /tmp/ltsmin18391690595316784979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin18391690595316784979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin18391690595316784979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 15:43:53] [INFO ] Flatten gal took : 60 ms
[2024-05-29 15:43:53] [INFO ] Flatten gal took : 60 ms
[2024-05-29 15:43:53] [INFO ] Time to serialize gal into /tmp/LTL3556364922823760279.gal : 68 ms
[2024-05-29 15:43:53] [INFO ] Time to serialize properties into /tmp/LTL9176353938937144649.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3556364922823760279.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17514019575883653173.hoa' '-atoms' '/tmp/LTL9176353938937144649.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9176353938937144649.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17514019575883653173.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t2201, t2203, t2205, t2207, t2209, t2211, t22...369
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
707 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,7.45471,166956,1,0,1182,82518,2201,63,46537,53478,2265
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property StigmergyCommit-PT-09a-LTLFireability-00 finished in 332352 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-00 TRUE TECHNIQUES SHORTENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : StigmergyCommit-PT-09a-LTLFireability-11
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
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 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1195 place count 41 transition count 1095
Applied a total of 1195 rules in 133 ms. Remains 41 /124 variables (removed 83) and now considering 1095/2221 (removed 1126) transitions.
[2024-05-29 15:44:01] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:44:01] [INFO ] Invariant cache hit.
[2024-05-29 15:44:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 15:44:01] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:44:01] [INFO ] Invariant cache hit.
[2024-05-29 15:44:01] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:44:01] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2024-05-29 15:44:01] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:44:01] [INFO ] Invariant cache hit.
[2024-05-29 15:44:01] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:44:20] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:44:20] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:44:20] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:44:20] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:44:20] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 15:44:20] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:44:20] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:44:20] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 15:44:20] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-29 15:44:20] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 0 ms to minimize.
[2024-05-29 15:44:21] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 0 ms to minimize.
[2024-05-29 15:44:21] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2024-05-29 15:44:21] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:44:21] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2024-05-29 15:44:21] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2024-05-29 15:44:21] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2024-05-29 15:44:22] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2024-05-29 15:44:22] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2024-05-29 15:44:22] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2024-05-29 15:44:22] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:44:23] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:44:23] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:44:23] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:44:23] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:44:23] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:44:23] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:44:23] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:44:23] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:44:23] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:44:23] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2024-05-29 15:44:24] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2024-05-29 15:44:24] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2024-05-29 15:44:24] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:44:24] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:44:24] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:44:24] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 15:44:24] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 15:44:24] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:44:25] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-29 15:44:25] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:44:26] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:44:26] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:44:26] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:44:27] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:44:27] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-29 15:44:27] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-29 15:44:27] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:44:27] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:44:30] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2024-05-29 15:44:30] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:44:30] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2024-05-29 15:44:30] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:44:30] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:44:30] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:44:30] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:44:30] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:44:30] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:44:33] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 15:44:33] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2024-05-29 15:44:33] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2024-05-29 15:44:33] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:44:33] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1146 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 1146 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:44:49] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-29 15:44:49] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:44:49] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:44:52] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-29 15:44:52] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:44:52] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:44:52] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:44:52] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:44:52] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:44:52] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:44:55] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 15:44:55] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:44:58] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:44:58] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:44:58] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 15:44:58] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:44:58] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:44:58] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:44:58] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 15:44:58] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2024-05-29 15:44:59] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:44:59] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:44:59] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2024-05-29 15:44:59] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2024-05-29 15:44:59] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:44:59] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1172 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 41/1213 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 88/88 constraints]
After SMT, in 75389ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 75401ms
Starting structural reductions in LI_LTL mode, iteration 1 : 41/124 places, 1095/2221 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 75866 ms. Remains : 41/124 places, 1095/2221 transitions.
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-11
Product exploration explored 100000 steps with 9090 reset in 2255 ms.
Product exploration explored 100000 steps with 9090 reset in 2286 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 15:45:22] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:45:22] [INFO ] Invariant cache hit.
[2024-05-29 15:45:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:45:23] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-29 15:45:23] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:45:23] [INFO ] [Real]Added 1043 Read/Feed constraints in 88 ms returned sat
[2024-05-29 15:45:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:45:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:45:23] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-29 15:45:24] [INFO ] [Nat]Added 1043 Read/Feed constraints in 113 ms returned sat
[2024-05-29 15:45:24] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 1064 transitions) in 97 ms.
[2024-05-29 15:45:24] [INFO ] Added : 0 causal constraints over 0 iterations in 170 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 1095/1095 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
[2024-05-29 15:45:24] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:45:24] [INFO ] Invariant cache hit.
[2024-05-29 15:45:24] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 15:45:24] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:45:24] [INFO ] Invariant cache hit.
[2024-05-29 15:45:24] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:45:24] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2024-05-29 15:45:24] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:45:24] [INFO ] Invariant cache hit.
[2024-05-29 15:45:24] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:45:42] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:45:42] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:45:42] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:45:42] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:45:42] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:45:42] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:45:42] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:45:43] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-29 15:45:43] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:45:43] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2024-05-29 15:45:43] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2024-05-29 15:45:43] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2024-05-29 15:45:44] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2024-05-29 15:45:44] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 0 ms to minimize.
[2024-05-29 15:45:44] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 15:45:44] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2024-05-29 15:45:44] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 0 ms to minimize.
[2024-05-29 15:45:44] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 0 ms to minimize.
[2024-05-29 15:45:45] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2024-05-29 15:45:45] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:45:45] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 15:45:45] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:45:45] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:45:45] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 15:45:45] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-05-29 15:45:45] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:45:46] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2024-05-29 15:45:46] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2024-05-29 15:45:46] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2024-05-29 15:45:46] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2024-05-29 15:45:46] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2024-05-29 15:45:46] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:45:47] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:45:47] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 15:45:47] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:45:47] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:45:47] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:45:47] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:45:47] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 15:45:47] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:45:49] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2024-05-29 15:45:49] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:45:49] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:45:49] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-29 15:45:49] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-29 15:45:49] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 15:45:49] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-29 15:45:50] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:45:52] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2024-05-29 15:45:52] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:45:52] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2024-05-29 15:45:53] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 15:45:53] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-29 15:45:53] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:45:53] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:45:53] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:45:53] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:45:56] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-29 15:45:56] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:45:56] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 15:45:56] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2024-05-29 15:45:56] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1146 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 1146 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:46:11] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-29 15:46:11] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2024-05-29 15:46:11] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:46:14] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:46:14] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:46:14] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:46:14] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:46:14] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:46:15] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2024-05-29 15:46:15] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:46:17] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2024-05-29 15:46:18] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:46:20] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:46:20] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:46:20] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:46:21] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:46:21] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:46:21] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:46:21] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-29 15:46:21] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:46:21] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2024-05-29 15:46:21] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:46:21] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2024-05-29 15:46:22] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:46:22] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-29 15:46:22] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1172 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 41/1213 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 88/88 constraints]
After SMT, in 75320ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 75334ms
Finished structural reductions in LTL mode , in 1 iterations and 75679 ms. Remains : 41/41 places, 1095/1095 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 15:46:40] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:46:40] [INFO ] Invariant cache hit.
[2024-05-29 15:46:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:46:41] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-29 15:46:41] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:46:41] [INFO ] [Real]Added 1043 Read/Feed constraints in 89 ms returned sat
[2024-05-29 15:46:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:46:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:46:42] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-29 15:46:42] [INFO ] [Nat]Added 1043 Read/Feed constraints in 115 ms returned sat
[2024-05-29 15:46:42] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 1064 transitions) in 96 ms.
[2024-05-29 15:46:42] [INFO ] Added : 0 causal constraints over 0 iterations in 170 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 2312 ms.
Product exploration explored 100000 steps with 9090 reset in 2311 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 1095/1095 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 41 transition count 1085
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 20 rules in 368 ms. Remains 41 /41 variables (removed 0) and now considering 1085/1095 (removed 10) transitions.
[2024-05-29 15:46:47] [INFO ] Redundant transitions in 73 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 15:46:47] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
// Phase 1: matrix 1074 rows 41 cols
[2024-05-29 15:46:47] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 15:46:47] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:47:05] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 15:47:05] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:47:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:47:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:47:06] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 15:47:06] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:47:06] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:47:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 15:47:06] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 15:47:06] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-29 15:47:06] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 15:47:06] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-29 15:47:07] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-05-29 15:47:07] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-29 15:47:07] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-29 15:47:07] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-29 15:47:08] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-29 15:47:08] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 15:47:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 15:47:08] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:47:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 15:47:08] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:47:08] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:47:08] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:47:08] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2024-05-29 15:47:09] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-29 15:47:09] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-29 15:47:09] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:47:09] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-29 15:47:09] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-29 15:47:09] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:47:09] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-29 15:47:10] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:47:10] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:47:10] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:47:10] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:47:10] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:47:10] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 15:47:10] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:47:10] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:47:12] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:47:15] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:47:15] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 15:47:15] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-29 15:47:15] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:47:15] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 15:47:15] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:47:15] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 7 (OVERLAPS) 1073/1114 variables, 41/90 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1042/1132 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1114/1115 variables, and 1132 constraints, problems are : Problem set: 10 solved, 1065 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1075/31 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 20/41 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 48/49 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 4 (OVERLAPS) 1073/1114 variables, 41/90 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1114 variables, 1042/1132 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1114 variables, 21/1153 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1114 variables, 0/1153 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 8 (OVERLAPS) 1/1115 variables, 1/1154 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1115/1115 variables, and 1154 constraints, problems are : Problem set: 10 solved, 1065 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/31 constraints, Known Traps: 48/48 constraints]
After SMT, in 75314ms problems are : Problem set: 10 solved, 1065 unsolved
Search for dead transitions found 10 dead transitions in 75324ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 41/41 places, 1075/1095 transitions.
Graph (complete) has 341 edges and 41 vertex of which 31 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 167 ms. Remains 31 /41 variables (removed 10) and now considering 1075/1075 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/41 places, 1075/1095 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75944 ms. Remains : 31/41 places, 1075/1095 transitions.
Built C files in :
/tmp/ltsmin15772582129853361696
[2024-05-29 15:48:03] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15772582129853361696
Running compilation step : cd /tmp/ltsmin15772582129853361696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15772582129853361696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15772582129853361696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 1095/1095 transitions.
Applied a total of 0 rules in 8 ms. Remains 41 /41 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
[2024-05-29 15:48:06] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
// Phase 1: matrix 1084 rows 41 cols
[2024-05-29 15:48:06] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 15:48:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 15:48:06] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:48:06] [INFO ] Invariant cache hit.
[2024-05-29 15:48:06] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 15:48:06] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2024-05-29 15:48:06] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 15:48:06] [INFO ] Invariant cache hit.
[2024-05-29 15:48:06] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:48:24] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:48:24] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-29 15:48:24] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:48:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:48:24] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 15:48:24] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-29 15:48:24] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-29 15:48:25] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:48:25] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-05-29 15:48:25] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 0 ms to minimize.
[2024-05-29 15:48:25] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2024-05-29 15:48:25] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2024-05-29 15:48:25] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2024-05-29 15:48:26] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 0 ms to minimize.
[2024-05-29 15:48:26] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:48:26] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2024-05-29 15:48:26] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 0 ms to minimize.
[2024-05-29 15:48:26] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2024-05-29 15:48:27] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2024-05-29 15:48:27] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:48:27] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-29 15:48:27] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:48:27] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:48:27] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 15:48:27] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:48:27] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 15:48:27] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2024-05-29 15:48:28] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2024-05-29 15:48:28] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 0 ms to minimize.
[2024-05-29 15:48:28] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2024-05-29 15:48:28] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2024-05-29 15:48:28] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:48:28] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2024-05-29 15:48:29] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-29 15:48:29] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-29 15:48:29] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2024-05-29 15:48:29] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 15:48:29] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 15:48:29] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:48:29] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:48:31] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:48:31] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:48:31] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:48:31] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:48:31] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:48:31] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 15:48:31] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-29 15:48:31] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:48:34] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2024-05-29 15:48:34] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:48:34] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:48:34] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:48:35] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:48:35] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:48:35] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:48:35] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 15:48:35] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:48:38] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2024-05-29 15:48:38] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:48:38] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:48:38] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:48:38] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1146 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 1146 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:48:53] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-29 15:48:53] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:48:53] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:48:56] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2024-05-29 15:48:56] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:48:56] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 15:48:56] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:48:56] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:48:57] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:48:57] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:48:59] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2024-05-29 15:49:00] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 15:49:02] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:49:02] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-29 15:49:03] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 15:49:03] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:49:03] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:49:03] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:49:03] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 15:49:03] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:49:03] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:49:03] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-29 15:49:03] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2024-05-29 15:49:04] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2024-05-29 15:49:04] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:49:04] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1172 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 41/1213 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 88/88 constraints]
After SMT, in 75274ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 75288ms
Finished structural reductions in LTL mode , in 1 iterations and 75626 ms. Remains : 41/41 places, 1095/1095 transitions.
Built C files in :
/tmp/ltsmin6378618651317069036
[2024-05-29 15:49:21] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6378618651317069036
Running compilation step : cd /tmp/ltsmin6378618651317069036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6378618651317069036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6378618651317069036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 15:49:25] [INFO ] Flatten gal took : 60 ms
[2024-05-29 15:49:25] [INFO ] Flatten gal took : 63 ms
[2024-05-29 15:49:25] [INFO ] Time to serialize gal into /tmp/LTL8605652052124980265.gal : 11 ms
[2024-05-29 15:49:25] [INFO ] Time to serialize properties into /tmp/LTL3262019698503117271.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8605652052124980265.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9198781566351349798.hoa' '-atoms' '/tmp/LTL3262019698503117271.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3262019698503117271.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9198781566351349798.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t2201, t2203, t2205, t2207, t2209, t2211, t22...369
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
692 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,7.28922,167024,1,0,1185,82939,2201,64,43245,53628,2272
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property StigmergyCommit-PT-09a-LTLFireability-11 finished in 331393 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-11 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-29 15:49:32] [INFO ] Flatten gal took : 119 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 2819139 ms.

BK_STOP 1716997772816

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="StigmergyCommit-PT-09a"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-09a, 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 r400-tall-171690531800204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-09a.tgz
mv StigmergyCommit-PT-09a 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 ;