MCC'2024- Execution of r400-tall-171690531700164

About the Execution of ITS-Tools for StigmergyCommit-PT-06b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	2429855.00	0.00	0.00	T??TF?FFTFFTFF??	normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531700164.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-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531700164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:55 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 3.7M 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-06b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716988715238

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-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 13:18:36] [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 13:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:18:36] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2024-05-29 13:18:36] [INFO ] Transformed 2140 places.
[2024-05-29 13:18:36] [INFO ] Transformed 6760 transitions.
[2024-05-29 13:18:36] [INFO ] Found NUPN structural information;
[2024-05-29 13:18:36] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 542 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyCommit-PT-06b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 2140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Discarding 170 places :
Symmetric choice reduction at 0 with 170 rule applications. Total rules 170 place count 1970 transition count 6590
Iterating global reduction 0 with 170 rules applied. Total rules applied 340 place count 1970 transition count 6590
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 445 place count 1865 transition count 6485
Iterating global reduction 0 with 105 rules applied. Total rules applied 550 place count 1865 transition count 6485
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 612 place count 1803 transition count 6423
Iterating global reduction 0 with 62 rules applied. Total rules applied 674 place count 1803 transition count 6423
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 728 place count 1749 transition count 6369
Iterating global reduction 0 with 54 rules applied. Total rules applied 782 place count 1749 transition count 6369
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 828 place count 1703 transition count 6323
Iterating global reduction 0 with 46 rules applied. Total rules applied 874 place count 1703 transition count 6323
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 918 place count 1659 transition count 6279
Iterating global reduction 0 with 44 rules applied. Total rules applied 962 place count 1659 transition count 6279
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 1006 place count 1615 transition count 6235
Iterating global reduction 0 with 44 rules applied. Total rules applied 1050 place count 1615 transition count 6235
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 1094 place count 1571 transition count 6191
Iterating global reduction 0 with 44 rules applied. Total rules applied 1138 place count 1571 transition count 6191
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1177 place count 1532 transition count 6152
Iterating global reduction 0 with 39 rules applied. Total rules applied 1216 place count 1532 transition count 6152
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 1248 place count 1500 transition count 6120
Iterating global reduction 0 with 32 rules applied. Total rules applied 1280 place count 1500 transition count 6120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1286 place count 1500 transition count 6114
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 1298 place count 1488 transition count 6102
Iterating global reduction 1 with 12 rules applied. Total rules applied 1310 place count 1488 transition count 6102
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 1322 place count 1476 transition count 6090
Iterating global reduction 1 with 12 rules applied. Total rules applied 1334 place count 1476 transition count 6090
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1340 place count 1470 transition count 6084
Iterating global reduction 1 with 6 rules applied. Total rules applied 1346 place count 1470 transition count 6084
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1352 place count 1464 transition count 6078
Iterating global reduction 1 with 6 rules applied. Total rules applied 1358 place count 1464 transition count 6078
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1364 place count 1458 transition count 6072
Iterating global reduction 1 with 6 rules applied. Total rules applied 1370 place count 1458 transition count 6072
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1375 place count 1453 transition count 6067
Iterating global reduction 1 with 5 rules applied. Total rules applied 1380 place count 1453 transition count 6067
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1384 place count 1449 transition count 6063
Iterating global reduction 1 with 4 rules applied. Total rules applied 1388 place count 1449 transition count 6063
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1392 place count 1445 transition count 6059
Iterating global reduction 1 with 4 rules applied. Total rules applied 1396 place count 1445 transition count 6059
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1400 place count 1441 transition count 6055
Iterating global reduction 1 with 4 rules applied. Total rules applied 1404 place count 1441 transition count 6055
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1408 place count 1437 transition count 6051
Iterating global reduction 1 with 4 rules applied. Total rules applied 1412 place count 1437 transition count 6051
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1416 place count 1433 transition count 6047
Iterating global reduction 1 with 4 rules applied. Total rules applied 1420 place count 1433 transition count 6047
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1424 place count 1429 transition count 6043
Iterating global reduction 1 with 4 rules applied. Total rules applied 1428 place count 1429 transition count 6043
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1432 place count 1429 transition count 6039
Applied a total of 1432 rules in 2138 ms. Remains 1429 /2140 variables (removed 711) and now considering 6039/6760 (removed 721) transitions.
// Phase 1: matrix 6039 rows 1429 cols
[2024-05-29 13:18:39] [INFO ] Computed 8 invariants in 139 ms
[2024-05-29 13:18:40] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-29 13:18:40] [INFO ] Invariant cache hit.
[2024-05-29 13:18:42] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2640 ms to find 0 implicit places.
Running 6038 sub problems to find dead transitions.
[2024-05-29 13:18:42] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1428/7468 variables, and 0 constraints, problems are : Problem set: 0 solved, 6038 unsolved in 30156 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1429 constraints, PredecessorRefiner: 6038/1650 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6038 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/7468 variables, and 0 constraints, problems are : Problem set: 0 solved, 6038 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1429 constraints, PredecessorRefiner: 4388/1650 constraints, Known Traps: 0/0 constraints]
After SMT, in 125203ms problems are : Problem set: 0 solved, 6038 unsolved
Search for dead transitions found 0 dead transitions in 125320ms
Starting structural reductions in LTL mode, iteration 1 : 1429/2140 places, 6039/6760 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130150 ms. Remains : 1429/2140 places, 6039/6760 transitions.
Support contains 54 out of 1429 places after structural reductions.
[2024-05-29 13:20:48] [INFO ] Flatten gal took : 602 ms
[2024-05-29 13:20:48] [INFO ] Flatten gal took : 403 ms
[2024-05-29 13:20:49] [INFO ] Input system was already deterministic with 6039 transitions.
Support contains 53 out of 1429 places (down from 54) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (307 resets) in 2016 ms. (19 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
[2024-05-29 13:20:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 1379/1429 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1429 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 6039/7468 variables, 1429/1437 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7468/7468 variables, and 1437 constraints, problems are : Problem set: 1 solved, 26 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1429/1429 constraints, PredecessorRefiner: 27/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 1379/1429 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1429 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 6039/7468 variables, 1429/1437 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7468 variables, 6/1443 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7468/7468 variables, and 1443 constraints, problems are : Problem set: 1 solved, 26 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1429/1429 constraints, PredecessorRefiner: 26/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 10627ms problems are : Problem set: 1 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1369 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 9 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2585 edges and 1331 vertex of which 1324 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.38 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 949 transitions
Trivial Post-agglo rules discarded 949 transitions
Performed 949 trivial Post agglomeration. Transition count delta: 949
Iterating post reduction 0 with 956 rules applied. Total rules applied 958 place count 1324 transition count 4950
Reduce places removed 949 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 971 rules applied. Total rules applied 1929 place count 375 transition count 4928
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 1939 place count 368 transition count 4925
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1942 place count 365 transition count 4925
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 1942 place count 365 transition count 4842
Deduced a syphon composed of 83 places in 3 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 2108 place count 282 transition count 4842
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2109 place count 282 transition count 4841
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 2209 place count 232 transition count 4791
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2222 place count 232 transition count 4778
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 2248 place count 206 transition count 4739
Iterating global reduction 6 with 26 rules applied. Total rules applied 2274 place count 206 transition count 4739
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2279 place count 206 transition count 4734
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2299 place count 186 transition count 4714
Iterating global reduction 7 with 20 rules applied. Total rules applied 2319 place count 186 transition count 4714
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2333 place count 172 transition count 4700
Iterating global reduction 7 with 14 rules applied. Total rules applied 2347 place count 172 transition count 4700
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2354 place count 172 transition count 4693
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 2370 place count 164 transition count 4685
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2376 place count 161 transition count 4693
Free-agglomeration rule applied 55 times.
Iterating global reduction 8 with 55 rules applied. Total rules applied 2431 place count 161 transition count 4638
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 8 with 55 rules applied. Total rules applied 2486 place count 106 transition count 4638
Drop transitions (Redundant composition of simpler transitions.) removed 127 transitions
Redundant transition composition rules discarded 127 transitions
Iterating global reduction 9 with 127 rules applied. Total rules applied 2613 place count 106 transition count 4511
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2615 place count 105 transition count 4510
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2617 place count 104 transition count 4513
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2620 place count 104 transition count 4510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2623 place count 101 transition count 4510
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2630 place count 101 transition count 4510
Applied a total of 2630 rules in 1576 ms. Remains 101 /1429 variables (removed 1328) and now considering 4510/6039 (removed 1529) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1578 ms. Remains : 101/1429 places, 4510/6039 transitions.
RANDOM walk for 40000 steps (2461 resets) in 745 ms. (53 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (19 resets) in 50 ms. (78 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (18 resets) in 14 ms. (266 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (29 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4002 steps (31 resets) in 15 ms. (250 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (29 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (30 resets) in 13 ms. (285 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 12 ms. (307 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4002 steps (33 resets) in 13 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4002 steps (28 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (25 resets) in 15 ms. (250 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 9/10 properties
// Phase 1: matrix 4510 rows 101 cols
[2024-05-29 13:21:03] [INFO ] Computed 8 invariants in 32 ms
[2024-05-29 13:21:03] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 70/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4510/4611 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4611 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4611 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/4611 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4611/4611 variables, and 114 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 70/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 13:21:06] [INFO ] Deduced a trap composed of 19 places in 1312 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4510/4611 variables, 101/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4611 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4611 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 13:21:09] [INFO ] Deduced a trap composed of 27 places in 1298 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/4611 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 13:21:11] [INFO ] Deduced a trap composed of 27 places in 1279 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/4611 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4611 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/4611 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4611/4611 variables, and 122 constraints, problems are : Problem set: 0 solved, 9 unsolved in 8487 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 10482ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 8 properties in 950 ms.
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 4510/4510 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 101 transition count 4504
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 95 transition count 4504
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 26 place count 81 transition count 386
Iterating global reduction 2 with 14 rules applied. Total rules applied 40 place count 81 transition count 386
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 54 place count 81 transition count 372
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 64 place count 76 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 68 place count 76 transition count 363
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 70 place count 74 transition count 361
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 74 transition count 361
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 73 transition count 360
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 73 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 73 transition count 359
Free-agglomeration rule applied 28 times.
Iterating global reduction 5 with 28 rules applied. Total rules applied 103 place count 73 transition count 331
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 5 with 157 rules applied. Total rules applied 260 place count 45 transition count 202
Applied a total of 260 rules in 146 ms. Remains 45 /101 variables (removed 56) and now considering 202/4510 (removed 4308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 45/101 places, 202/4510 transitions.
RANDOM walk for 4052 steps (115 resets) in 26 ms. (150 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA StigmergyCommit-PT-06b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 287 stabilizing places and 301 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((F(G((p1&&(p2||X(X(p1))))))||p0)))'
Support contains 11 out of 1429 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1422 transition count 6032
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1422 transition count 6032
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1415 transition count 6025
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1415 transition count 6025
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1408 transition count 6018
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1408 transition count 6018
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 1401 transition count 6011
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 1401 transition count 6011
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 1395 transition count 6005
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 1395 transition count 6005
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1389 transition count 5999
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1389 transition count 5999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 81 place count 1389 transition count 5998
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 1384 transition count 5993
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 1384 transition count 5993
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 1384 transition count 5991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 1383 transition count 5990
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 1383 transition count 5990
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 1382 transition count 5989
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1374 transition count 5981
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 1374 transition count 5980
Applied a total of 114 rules in 1118 ms. Remains 1374 /1429 variables (removed 55) and now considering 5980/6039 (removed 59) transitions.
// Phase 1: matrix 5980 rows 1374 cols
[2024-05-29 13:21:16] [INFO ] Computed 8 invariants in 81 ms
[2024-05-29 13:21:17] [INFO ] Implicit Places using invariants in 1203 ms returned []
[2024-05-29 13:21:17] [INFO ] Invariant cache hit.
[2024-05-29 13:21:20] [INFO ] Implicit Places using invariants and state equation in 3281 ms returned []
Implicit Place search using SMT with State Equation took 4498 ms to find 0 implicit places.
Running 5979 sub problems to find dead transitions.
[2024-05-29 13:21:20] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1373/7354 variables, and 0 constraints, problems are : Problem set: 0 solved, 5979 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1374 constraints, PredecessorRefiner: 5979/1591 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5979 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 1373/7354 variables, and 0 constraints, problems are : Problem set: 0 solved, 5979 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1374 constraints, PredecessorRefiner: 4388/1591 constraints, Known Traps: 0/0 constraints]
After SMT, in 129109ms problems are : Problem set: 0 solved, 5979 unsolved
Search for dead transitions found 0 dead transitions in 129167ms
Starting structural reductions in LTL mode, iteration 1 : 1374/1429 places, 5980/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134812 ms. Remains : 1374/1429 places, 5980/6039 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 761 ms.
Product exploration explored 100000 steps with 50000 reset in 636 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLFireability-00 finished in 136743 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((!p0 U p1))||F(G(p2))))'
Support contains 15 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1411 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 3 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 976 transitions
Trivial Post-agglo rules discarded 976 transitions
Performed 976 trivial Post agglomeration. Transition count delta: 976
Iterating post reduction 0 with 976 rules applied. Total rules applied 977 place count 1330 transition count 4950
Reduce places removed 976 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 998 rules applied. Total rules applied 1975 place count 354 transition count 4928
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1983 place count 347 transition count 4927
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1984 place count 346 transition count 4927
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 1984 place count 346 transition count 4852
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 2134 place count 271 transition count 4852
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2145 place count 260 transition count 4841
Iterating global reduction 4 with 11 rules applied. Total rules applied 2156 place count 260 transition count 4841
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2157 place count 260 transition count 4840
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2161 place count 256 transition count 4836
Iterating global reduction 5 with 4 rules applied. Total rules applied 2165 place count 256 transition count 4836
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2167 place count 256 transition count 4834
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 2273 place count 203 transition count 4780
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 2301 place count 175 transition count 3289
Iterating global reduction 6 with 28 rules applied. Total rules applied 2329 place count 175 transition count 3289
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2336 place count 175 transition count 3282
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2358 place count 153 transition count 3253
Iterating global reduction 7 with 22 rules applied. Total rules applied 2380 place count 153 transition count 3253
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2402 place count 131 transition count 3224
Iterating global reduction 7 with 22 rules applied. Total rules applied 2424 place count 131 transition count 3224
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 2432 place count 131 transition count 3216
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2454 place count 120 transition count 3223
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2455 place count 119 transition count 3209
Iterating global reduction 8 with 1 rules applied. Total rules applied 2456 place count 119 transition count 3209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2457 place count 119 transition count 3208
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 2464 place count 119 transition count 3201
Applied a total of 2464 rules in 1105 ms. Remains 119 /1429 variables (removed 1310) and now considering 3201/6039 (removed 2838) transitions.
[2024-05-29 13:23:33] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
// Phase 1: matrix 3193 rows 119 cols
[2024-05-29 13:23:33] [INFO ] Computed 2 invariants in 45 ms
[2024-05-29 13:23:33] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-29 13:23:33] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:23:33] [INFO ] Invariant cache hit.
[2024-05-29 13:23:34] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:23:36] [INFO ] Implicit Places using invariants and state equation in 2469 ms returned []
Implicit Place search using SMT with State Equation took 3088 ms to find 0 implicit places.
[2024-05-29 13:23:36] [INFO ] Redundant transitions in 207 ms returned []
Running 3184 sub problems to find dead transitions.
[2024-05-29 13:23:36] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:23:36] [INFO ] Invariant cache hit.
[2024-05-29 13:23:36] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
[2024-05-29 13:24:40] [INFO ] Deduced a trap composed of 19 places in 1125 ms of which 1 ms to minimize.
[2024-05-29 13:24:41] [INFO ] Deduced a trap composed of 27 places in 1064 ms of which 1 ms to minimize.
[2024-05-29 13:24:42] [INFO ] Deduced a trap composed of 28 places in 1031 ms of which 1 ms to minimize.
[2024-05-29 13:24:43] [INFO ] Deduced a trap composed of 36 places in 1072 ms of which 1 ms to minimize.
[2024-05-29 13:24:44] [INFO ] Deduced a trap composed of 19 places in 969 ms of which 1 ms to minimize.
[2024-05-29 13:24:45] [INFO ] Deduced a trap composed of 35 places in 1083 ms of which 1 ms to minimize.
[2024-05-29 13:24:46] [INFO ] Deduced a trap composed of 29 places in 995 ms of which 1 ms to minimize.
[2024-05-29 13:24:47] [INFO ] Deduced a trap composed of 26 places in 999 ms of which 0 ms to minimize.
[2024-05-29 13:24:48] [INFO ] Deduced a trap composed of 31 places in 1000 ms of which 1 ms to minimize.
[2024-05-29 13:24:49] [INFO ] Deduced a trap composed of 24 places in 940 ms of which 1 ms to minimize.
[2024-05-29 13:24:50] [INFO ] Deduced a trap composed of 30 places in 1036 ms of which 1 ms to minimize.
SMT process timed out in 74466ms, After SMT, problems are : Problem set: 0 solved, 3184 unsolved
Search for dead transitions found 0 dead transitions in 74501ms
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1429 places, 3201/6039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78922 ms. Remains : 119/1429 places, 3201/6039 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-01
Product exploration explored 100000 steps with 7322 reset in 724 ms.
Product exploration explored 100000 steps with 7358 reset in 599 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (OR p1 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0) p2)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (OR p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 144 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (2962 resets) in 1060 ms. (37 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (235 resets) in 311 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (242 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (239 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
[2024-05-29 13:24:53] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:24:53] [INFO ] Invariant cache hit.
[2024-05-29 13:24:53] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3191/3308 variables, 117/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3308/3312 variables, and 244 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4520 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 117/119 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3191/3308 variables, 117/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3308/3312 variables, and 244 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 117/119 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9155ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 3201/3201 transitions.
Graph (complete) has 791 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 118 transition count 3183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 116 transition count 3183
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 109 transition count 3176
Free-agglomeration rule applied 48 times.
Iterating global reduction 2 with 48 rules applied. Total rules applied 82 place count 109 transition count 3128
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 89 rules applied. Total rules applied 171 place count 60 transition count 3088
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 178 place count 53 transition count 3088
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 185 place count 46 transition count 3081
Iterating global reduction 4 with 7 rules applied. Total rules applied 192 place count 46 transition count 3081
Performed 14 Post agglomeration using F-continuation condition with reduction of 2069 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 220 place count 32 transition count 998
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 585 transitions
Reduce isomorphic transitions removed 592 transitions.
Iterating post reduction 4 with 592 rules applied. Total rules applied 812 place count 32 transition count 406
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 815 place count 29 transition count 403
Iterating global reduction 5 with 3 rules applied. Total rules applied 818 place count 29 transition count 403
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 832 place count 22 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 839 place count 22 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 840 place count 21 transition count 268
Applied a total of 840 rules in 378 ms. Remains 21 /119 variables (removed 98) and now considering 268/3201 (removed 2933) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 21/119 places, 268/3201 transitions.
RANDOM walk for 14580 steps (1687 resets) in 88 ms. (163 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (OR p1 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0) p2)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (OR p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 369 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 15 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 3201/3201 transitions.
Applied a total of 0 rules in 149 ms. Remains 119 /119 variables (removed 0) and now considering 3201/3201 (removed 0) transitions.
[2024-05-29 13:25:03] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:25:03] [INFO ] Invariant cache hit.
[2024-05-29 13:25:04] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-29 13:25:04] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:25:04] [INFO ] Invariant cache hit.
[2024-05-29 13:25:04] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:25:06] [INFO ] Implicit Places using invariants and state equation in 2353 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
[2024-05-29 13:25:06] [INFO ] Redundant transitions in 188 ms returned []
Running 3184 sub problems to find dead transitions.
[2024-05-29 13:25:06] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:25:06] [INFO ] Invariant cache hit.
[2024-05-29 13:25:06] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
[2024-05-29 13:26:10] [INFO ] Deduced a trap composed of 19 places in 1128 ms of which 3 ms to minimize.
[2024-05-29 13:26:11] [INFO ] Deduced a trap composed of 27 places in 1097 ms of which 1 ms to minimize.
[2024-05-29 13:26:12] [INFO ] Deduced a trap composed of 28 places in 1088 ms of which 2 ms to minimize.
[2024-05-29 13:26:13] [INFO ] Deduced a trap composed of 36 places in 1055 ms of which 1 ms to minimize.
[2024-05-29 13:26:14] [INFO ] Deduced a trap composed of 19 places in 1049 ms of which 1 ms to minimize.
[2024-05-29 13:26:15] [INFO ] Deduced a trap composed of 35 places in 965 ms of which 1 ms to minimize.
[2024-05-29 13:26:16] [INFO ] Deduced a trap composed of 29 places in 949 ms of which 1 ms to minimize.
[2024-05-29 13:26:17] [INFO ] Deduced a trap composed of 26 places in 1012 ms of which 1 ms to minimize.
[2024-05-29 13:26:18] [INFO ] Deduced a trap composed of 31 places in 957 ms of which 0 ms to minimize.
[2024-05-29 13:26:19] [INFO ] Deduced a trap composed of 24 places in 949 ms of which 1 ms to minimize.
[2024-05-29 13:26:20] [INFO ] Deduced a trap composed of 30 places in 1045 ms of which 0 ms to minimize.
SMT process timed out in 74116ms, After SMT, problems are : Problem set: 0 solved, 3184 unsolved
Search for dead transitions found 0 dead transitions in 74146ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 77407 ms. Remains : 119/119 places, 3201/3201 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) p1)), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (OR (NOT p0) p1))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 135 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (2951 resets) in 439 ms. (90 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (242 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (241 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (233 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
[2024-05-29 13:26:21] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:26:21] [INFO ] Invariant cache hit.
[2024-05-29 13:26:21] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3191/3308 variables, 117/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3308/3312 variables, and 244 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4482 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 117/119 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3191/3308 variables, 117/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3308/3312 variables, and 244 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4353 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 117/119 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9046ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 3201/3201 transitions.
Graph (complete) has 791 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 118 transition count 3183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 116 transition count 3183
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 109 transition count 3176
Free-agglomeration rule applied 48 times.
Iterating global reduction 2 with 48 rules applied. Total rules applied 82 place count 109 transition count 3128
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 89 rules applied. Total rules applied 171 place count 60 transition count 3088
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 178 place count 53 transition count 3088
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 185 place count 46 transition count 3081
Iterating global reduction 4 with 7 rules applied. Total rules applied 192 place count 46 transition count 3081
Performed 14 Post agglomeration using F-continuation condition with reduction of 2069 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 220 place count 32 transition count 998
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 585 transitions
Reduce isomorphic transitions removed 592 transitions.
Iterating post reduction 4 with 592 rules applied. Total rules applied 812 place count 32 transition count 406
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 815 place count 29 transition count 403
Iterating global reduction 5 with 3 rules applied. Total rules applied 818 place count 29 transition count 403
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 832 place count 22 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 839 place count 22 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 840 place count 21 transition count 268
Applied a total of 840 rules in 367 ms. Remains 21 /119 variables (removed 98) and now considering 268/3201 (removed 2933) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 21/119 places, 268/3201 transitions.
RANDOM walk for 17322 steps (2005 resets) in 145 ms. (118 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) p1)), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (OR (NOT p0) p1))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 337 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7276 reset in 527 ms.
Product exploration explored 100000 steps with 7335 reset in 479 ms.
Built C files in :
/tmp/ltsmin17845607772303519217
[2024-05-29 13:26:32] [INFO ] Too many transitions (3201) to apply POR reductions. Disabling POR matrices.
[2024-05-29 13:26:32] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17845607772303519217
Running compilation step : cd /tmp/ltsmin17845607772303519217;'/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/ltsmin17845607772303519217;'/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/ltsmin17845607772303519217;'/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 15 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 3201/3201 transitions.
Applied a total of 0 rules in 131 ms. Remains 119 /119 variables (removed 0) and now considering 3201/3201 (removed 0) transitions.
[2024-05-29 13:26:35] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:26:35] [INFO ] Invariant cache hit.
[2024-05-29 13:26:36] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-05-29 13:26:36] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:26:36] [INFO ] Invariant cache hit.
[2024-05-29 13:26:37] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:26:38] [INFO ] Implicit Places using invariants and state equation in 2422 ms returned []
Implicit Place search using SMT with State Equation took 2967 ms to find 0 implicit places.
[2024-05-29 13:26:38] [INFO ] Redundant transitions in 112 ms returned []
Running 3184 sub problems to find dead transitions.
[2024-05-29 13:26:38] [INFO ] Flow matrix only has 3193 transitions (discarded 8 similar events)
[2024-05-29 13:26:38] [INFO ] Invariant cache hit.
[2024-05-29 13:26:39] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3184 unsolved
[2024-05-29 13:27:41] [INFO ] Deduced a trap composed of 19 places in 1022 ms of which 1 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 27 places in 1057 ms of which 1 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 28 places in 1134 ms of which 1 ms to minimize.
[2024-05-29 13:27:45] [INFO ] Deduced a trap composed of 36 places in 1069 ms of which 1 ms to minimize.
[2024-05-29 13:27:46] [INFO ] Deduced a trap composed of 19 places in 1102 ms of which 1 ms to minimize.
[2024-05-29 13:27:47] [INFO ] Deduced a trap composed of 35 places in 1093 ms of which 1 ms to minimize.
[2024-05-29 13:27:48] [INFO ] Deduced a trap composed of 29 places in 1076 ms of which 1 ms to minimize.
[2024-05-29 13:27:49] [INFO ] Deduced a trap composed of 26 places in 1018 ms of which 1 ms to minimize.
[2024-05-29 13:27:50] [INFO ] Deduced a trap composed of 31 places in 890 ms of which 1 ms to minimize.
[2024-05-29 13:27:51] [INFO ] Deduced a trap composed of 24 places in 980 ms of which 1 ms to minimize.
[2024-05-29 13:27:52] [INFO ] Deduced a trap composed of 30 places in 1054 ms of which 1 ms to minimize.
SMT process timed out in 73421ms, After SMT, problems are : Problem set: 0 solved, 3184 unsolved
Search for dead transitions found 0 dead transitions in 73454ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76678 ms. Remains : 119/119 places, 3201/3201 transitions.
Built C files in :
/tmp/ltsmin3381370103257814452
[2024-05-29 13:27:52] [INFO ] Too many transitions (3201) to apply POR reductions. Disabling POR matrices.
[2024-05-29 13:27:52] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3381370103257814452
Running compilation step : cd /tmp/ltsmin3381370103257814452;'/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/ltsmin3381370103257814452;'/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/ltsmin3381370103257814452;'/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 13:27:56] [INFO ] Flatten gal took : 422 ms
[2024-05-29 13:27:56] [INFO ] Flatten gal took : 284 ms
[2024-05-29 13:27:56] [INFO ] Time to serialize gal into /tmp/LTL14326372559120763306.gal : 91 ms
[2024-05-29 13:27:56] [INFO ] Time to serialize properties into /tmp/LTL2548314904213465467.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/LTL14326372559120763306.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4012081530551206790.hoa' '-atoms' '/tmp/LTL2548314904213465467.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/LTL2548314904213465467.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4012081530551206790.hoa
Detected timeout of ITS tools.
[2024-05-29 13:28:12] [INFO ] Flatten gal took : 282 ms
[2024-05-29 13:28:12] [INFO ] Flatten gal took : 284 ms
[2024-05-29 13:28:12] [INFO ] Time to serialize gal into /tmp/LTL13986322344599375841.gal : 41 ms
[2024-05-29 13:28:12] [INFO ] Time to serialize properties into /tmp/LTL4695317768047699495.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13986322344599375841.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4695317768047699495.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 : !(((G((!("((((p75==1)&&(p354==1))&&((p679==1)&&(p958==1)))&&(((p1260==1)&&(p1585==1))&&(p1842==1)))"))U("((((p97==1)&&(p444==1))&&((p7...244
Formula 0 simplified : F("((((p75==1)&&(p354==1))&&((p679==1)&&(p958==1)))&&(((p1260==1)&&(p1585==1))&&(p1842==1)))" R !"((((p97==1)&&(p444==1))&&((p723==1...231
Detected timeout of ITS tools.
[2024-05-29 13:28:27] [INFO ] Flatten gal took : 283 ms
[2024-05-29 13:28:27] [INFO ] Applying decomposition
[2024-05-29 13:28:28] [INFO ] Flatten gal took : 291 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/graph15751814083913230388.txt' '-o' '/tmp/graph15751814083913230388.bin' '-w' '/tmp/graph15751814083913230388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15751814083913230388.bin' '-l' '-1' '-v' '-w' '/tmp/graph15751814083913230388.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:28:29] [INFO ] Decomposing Gal with order
[2024-05-29 13:28:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:28:29] [INFO ] Removed a total of 21344 redundant transitions.
[2024-05-29 13:28:29] [INFO ] Flatten gal took : 762 ms
[2024-05-29 13:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 121 ms.
[2024-05-29 13:28:30] [INFO ] Time to serialize gal into /tmp/LTL14001162713476896436.gal : 8 ms
[2024-05-29 13:28:30] [INFO ] Time to serialize properties into /tmp/LTL6386862453354774657.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/LTL14001162713476896436.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6386862453354774657.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 : !(((G((!("((((i3.u1.p75==1)&&(i0.u4.p354==1))&&((i3.u7.p679==1)&&(i1.u10.p958==1)))&&(((i0.u15.p1260==1)&&(i3.u17.p1585==1))&&(i3.u21....343
Formula 0 simplified : F("((((i3.u1.p75==1)&&(i0.u4.p354==1))&&((i3.u7.p679==1)&&(i1.u10.p958==1)))&&(((i0.u15.p1260==1)&&(i3.u17.p1585==1))&&(i3.u21.p1842...330
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-01 finished in 313300 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)||(X((G(!p0)||(!p0&&F(!p2))))&&p1))))'
Support contains 20 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1421 transition count 6031
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1421 transition count 6031
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1413 transition count 6023
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1413 transition count 6023
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1406 transition count 6016
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1406 transition count 6016
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 1399 transition count 6009
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 1399 transition count 6009
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 1393 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 1393 transition count 6003
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1387 transition count 5997
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1387 transition count 5997
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 1387 transition count 5996
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 1382 transition count 5991
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 1382 transition count 5991
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 1373 transition count 5980
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 1372 transition count 5979
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 1372 transition count 5978
Applied a total of 118 rules in 1035 ms. Remains 1372 /1429 variables (removed 57) and now considering 5978/6039 (removed 61) transitions.
// Phase 1: matrix 5978 rows 1372 cols
[2024-05-29 13:28:46] [INFO ] Computed 8 invariants in 110 ms
[2024-05-29 13:28:47] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2024-05-29 13:28:47] [INFO ] Invariant cache hit.
[2024-05-29 13:28:50] [INFO ] Implicit Places using invariants and state equation in 2859 ms returned []
Implicit Place search using SMT with State Equation took 3887 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 13:28:50] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 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 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 123138ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 123194ms
Starting structural reductions in LTL mode, iteration 1 : 1372/1429 places, 5978/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128135 ms. Remains : 1372/1429 places, 5978/6039 transitions.
Stuttering acceptance computed with spot in 138 ms :[p0, p0, (AND p0 p2)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-02
Product exploration explored 100000 steps with 768 reset in 404 ms.
Product exploration explored 100000 steps with 778 reset in 398 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 123 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[p0, p0, (AND p0 p2)]
RANDOM walk for 40000 steps (307 resets) in 548 ms. (72 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (44 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 526 ms. (75 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 88227 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 9
Probabilistic random walk after 88227 steps, saw 22437 distinct states, run finished after 3021 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-29 13:30:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 1338/1358 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5978/7350 variables, 1372/1380 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5041 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1338/1358 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5978/7350 variables, 1372/1380 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10293ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 1372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Graph (trivial) has 1351 edges and 1372 vertex of which 119 / 1372 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2515 edges and 1274 vertex of which 1267 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 941 transitions
Trivial Post-agglo rules discarded 941 transitions
Performed 941 trivial Post agglomeration. Transition count delta: 941
Iterating post reduction 0 with 948 rules applied. Total rules applied 950 place count 1267 transition count 4897
Reduce places removed 941 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 962 rules applied. Total rules applied 1912 place count 326 transition count 4876
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1919 place count 319 transition count 4876
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1919 place count 319 transition count 4798
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2075 place count 241 transition count 4798
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2076 place count 241 transition count 4797
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2176 place count 191 transition count 4747
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2190 place count 191 transition count 4733
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 2223 place count 158 transition count 2423
Iterating global reduction 5 with 33 rules applied. Total rules applied 2256 place count 158 transition count 2423
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 2268 place count 158 transition count 2411
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2289 place count 137 transition count 2390
Iterating global reduction 6 with 21 rules applied. Total rules applied 2310 place count 137 transition count 2390
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2324 place count 123 transition count 2376
Iterating global reduction 6 with 14 rules applied. Total rules applied 2338 place count 123 transition count 2376
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2345 place count 123 transition count 2369
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2359 place count 116 transition count 2362
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2365 place count 113 transition count 2370
Free-agglomeration rule applied 46 times.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2411 place count 113 transition count 2324
Reduce places removed 46 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 47 rules applied. Total rules applied 2458 place count 67 transition count 2323
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2465 place count 60 transition count 2316
Iterating global reduction 8 with 7 rules applied. Total rules applied 2472 place count 60 transition count 2316
Drop transitions (Redundant composition of simpler transitions.) removed 153 transitions
Redundant transition composition rules discarded 153 transitions
Iterating global reduction 8 with 153 rules applied. Total rules applied 2625 place count 60 transition count 2163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2627 place count 59 transition count 2162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2631 place count 57 transition count 2180
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2634 place count 57 transition count 2177
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2637 place count 54 transition count 2177
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2642 place count 54 transition count 2177
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2646 place count 54 transition count 2173
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2649 place count 51 transition count 2167
Iterating global reduction 9 with 3 rules applied. Total rules applied 2652 place count 51 transition count 2167
Applied a total of 2652 rules in 2549 ms. Remains 51 /1372 variables (removed 1321) and now considering 2167/5978 (removed 3811) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2549 ms. Remains : 51/1372 places, 2167/5978 transitions.
RANDOM walk for 40000 steps (1867 resets) in 1249 ms. (32 steps per ms) remains 2/7 properties
BEST_FIRST walk for 502 steps (0 resets) in 5 ms. (83 steps per ms) remains 0/2 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 20 factoid took 370 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Support contains 14 out of 1372 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Applied a total of 0 rules in 62 ms. Remains 1372 /1372 variables (removed 0) and now considering 5978/5978 (removed 0) transitions.
[2024-05-29 13:31:12] [INFO ] Invariant cache hit.
[2024-05-29 13:31:13] [INFO ] Implicit Places using invariants in 913 ms returned []
[2024-05-29 13:31:13] [INFO ] Invariant cache hit.
[2024-05-29 13:31:16] [INFO ] Implicit Places using invariants and state equation in 2926 ms returned []
Implicit Place search using SMT with State Equation took 3867 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 13:31:16] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)timeout

(s695 1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 timeout
1)
(s909 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 130833ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 130887ms
Finished structural reductions in LTL mode , in 1 iterations and 134833 ms. Remains : 1372/1372 places, 5978/5978 transitions.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[p0, p0]
RANDOM walk for 40000 steps (304 resets) in 946 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (45 resets) in 108 ms. (366 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (45 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 104379 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 104379 steps, saw 25828 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-29 13:33:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1344/1358 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5978/7350 variables, 1372/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4447 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1344/1358 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1358 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/1372 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5978/7350 variables, 1372/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/7350 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7350/7350 variables, and 1380 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3963 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1372/1372 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8519ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1613 ms.
Support contains 14 out of 1372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Graph (trivial) has 1357 edges and 1372 vertex of which 119 / 1372 are part of one of the 21 SCC in 3 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2515 edges and 1274 vertex of which 1267 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 947 transitions
Trivial Post-agglo rules discarded 947 transitions
Performed 947 trivial Post agglomeration. Transition count delta: 947
Iterating post reduction 0 with 954 rules applied. Total rules applied 956 place count 1267 transition count 4891
Reduce places removed 947 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 968 rules applied. Total rules applied 1924 place count 320 transition count 4870
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1931 place count 313 transition count 4870
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1931 place count 313 transition count 4792
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2087 place count 235 transition count 4792
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2088 place count 235 transition count 4791
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2188 place count 185 transition count 4741
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2202 place count 185 transition count 4727
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 2237 place count 150 transition count 1607
Iterating global reduction 5 with 35 rules applied. Total rules applied 2272 place count 150 transition count 1607
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2286 place count 150 transition count 1593
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2307 place count 129 transition count 1572
Iterating global reduction 6 with 21 rules applied. Total rules applied 2328 place count 129 transition count 1572
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2342 place count 115 transition count 1558
Iterating global reduction 6 with 14 rules applied. Total rules applied 2356 place count 115 transition count 1558
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2363 place count 115 transition count 1551
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2377 place count 108 transition count 1544
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2383 place count 105 transition count 1552
Free-agglomeration rule applied 44 times.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2427 place count 105 transition count 1508
Reduce places removed 44 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 53 rules applied. Total rules applied 2480 place count 61 transition count 1499
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2487 place count 54 transition count 1492
Iterating global reduction 8 with 7 rules applied. Total rules applied 2494 place count 54 transition count 1492
Drop transitions (Redundant composition of simpler transitions.) removed 186 transitions
Redundant transition composition rules discarded 186 transitions
Iterating global reduction 8 with 186 rules applied. Total rules applied 2680 place count 54 transition count 1306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2682 place count 53 transition count 1305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2686 place count 51 transition count 1323
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2689 place count 51 transition count 1320
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2692 place count 48 transition count 1320
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2697 place count 48 transition count 1320
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2701 place count 48 transition count 1316
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2704 place count 45 transition count 1310
Iterating global reduction 9 with 3 rules applied. Total rules applied 2707 place count 45 transition count 1310
Applied a total of 2707 rules in 1132 ms. Remains 45 /1372 variables (removed 1327) and now considering 1310/5978 (removed 4668) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1132 ms. Remains : 45/1372 places, 1310/5978 transitions.
RANDOM walk for 30020 steps (1417 resets) in 588 ms. (50 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
Stuttering acceptance computed with spot in 96 ms :[p0, p0]
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Product exploration explored 100000 steps with 766 reset in 350 ms.
Product exploration explored 100000 steps with 770 reset in 407 ms.
Built C files in :
/tmp/ltsmin1916076003921104453
[2024-05-29 13:33:44] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1916076003921104453
Running compilation step : cd /tmp/ltsmin1916076003921104453;'/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/ltsmin1916076003921104453;'/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/ltsmin1916076003921104453;'/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 14 out of 1372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Applied a total of 0 rules in 61 ms. Remains 1372 /1372 variables (removed 0) and now considering 5978/5978 (removed 0) transitions.
[2024-05-29 13:33:47] [INFO ] Invariant cache hit.
[2024-05-29 13:33:48] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2024-05-29 13:33:48] [INFO ] Invariant cache hit.
[2024-05-29 13:33:51] [INFO ] Implicit Places using invariants and state equation in 3101 ms returned []
Implicit Place search using SMT with State Equation took 4149 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 13:33:51] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 131197ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 131262ms
Finished structural reductions in LTL mode , in 1 iterations and 135497 ms. Remains : 1372/1372 places, 5978/5978 transitions.
Built C files in :
/tmp/ltsmin11554492287380656843
[2024-05-29 13:36:02] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11554492287380656843
Running compilation step : cd /tmp/ltsmin11554492287380656843;'/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/ltsmin11554492287380656843;'/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/ltsmin11554492287380656843;'/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 13:36:06] [INFO ] Flatten gal took : 360 ms
[2024-05-29 13:36:06] [INFO ] Flatten gal took : 360 ms
[2024-05-29 13:36:06] [INFO ] Time to serialize gal into /tmp/LTL765580191273294545.gal : 66 ms
[2024-05-29 13:36:06] [INFO ] Time to serialize properties into /tmp/LTL5779700182846271524.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/LTL765580191273294545.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7004458086478563977.hoa' '-atoms' '/tmp/LTL5779700182846271524.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...316
Loading property file /tmp/LTL5779700182846271524.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7004458086478563977.hoa
Detected timeout of ITS tools.
[2024-05-29 13:36:22] [INFO ] Flatten gal took : 359 ms
[2024-05-29 13:36:22] [INFO ] Flatten gal took : 365 ms
[2024-05-29 13:36:22] [INFO ] Time to serialize gal into /tmp/LTL10294566144102914715.gal : 65 ms
[2024-05-29 13:36:22] [INFO ] Time to serialize properties into /tmp/LTL8561780497234066435.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/LTL10294566144102914715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8561780497234066435.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 : !((F((G("((((p75!=1)||(p332!=1))||((p634!=1)||(p958!=1)))||(((p1238!=1)||(p1585!=1))||(p1864!=1)))"))||(("(((p119==1)&&(p399==1))&&((p...530
Formula 0 simplified : G(F!"((((p75!=1)||(p332!=1))||((p634!=1)||(p958!=1)))||(((p1238!=1)||(p1585!=1))||(p1864!=1)))" & (!"(((p119==1)&&(p399==1))&&((p723...514
Detected timeout of ITS tools.
[2024-05-29 13:36:38] [INFO ] Flatten gal took : 345 ms
[2024-05-29 13:36:38] [INFO ] Applying decomposition
[2024-05-29 13:36:38] [INFO ] Flatten gal took : 359 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/graph9304064085503412971.txt' '-o' '/tmp/graph9304064085503412971.bin' '-w' '/tmp/graph9304064085503412971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9304064085503412971.bin' '-l' '-1' '-v' '-w' '/tmp/graph9304064085503412971.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:36:39] [INFO ] Decomposing Gal with order
[2024-05-29 13:36:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:36:40] [INFO ] Removed a total of 31736 redundant transitions.
[2024-05-29 13:36:40] [INFO ] Flatten gal took : 556 ms
[2024-05-29 13:36:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 123 ms.
[2024-05-29 13:36:41] [INFO ] Time to serialize gal into /tmp/LTL14391112149816752850.gal : 35 ms
[2024-05-29 13:36:41] [INFO ] Time to serialize properties into /tmp/LTL3098347342037821249.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/LTL14391112149816752850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3098347342037821249.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 : !((F((G("((((i1.u5.p75!=1)||(i1.u89.p332!=1))||((i1.u169.p634!=1)||(i1.u257.p958!=1)))||(((i1.u327.p1238!=1)||(i1.u402.p1585!=1))||(i1...798
Formula 0 simplified : G(F!"((((i1.u5.p75!=1)||(i1.u89.p332!=1))||((i1.u169.p634!=1)||(i1.u257.p958!=1)))||(((i1.u327.p1238!=1)||(i1.u402.p1585!=1))||(i1.u...782
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-02 finished in 490909 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)||G(p1)))||G(p2)))'
Support contains 10 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1423 transition count 6033
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1423 transition count 6033
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1417 transition count 6027
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1417 transition count 6027
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1412 transition count 6022
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1412 transition count 6022
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1407 transition count 6017
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1407 transition count 6017
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1402 transition count 6012
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1402 transition count 6012
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1397 transition count 6007
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1397 transition count 6007
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 1397 transition count 6006
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 1393 transition count 6002
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 1393 transition count 6002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 1393 transition count 6001
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1392 transition count 6000
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1392 transition count 6000
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1391 transition count 5999
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1391 transition count 5999
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1390 transition count 5998
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1390 transition count 5998
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1389 transition count 5997
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1389 transition count 5997
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 1388 transition count 5996
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 1388 transition count 5996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1387 transition count 5995
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1387 transition count 5995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1386 transition count 5994
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1386 transition count 5994
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1385 transition count 5993
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1385 transition count 5993
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 1384 transition count 5992
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 1384 transition count 5992
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 1383 transition count 5991
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 1383 transition count 5991
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 1383 transition count 5990
Applied a total of 95 rules in 1176 ms. Remains 1383 /1429 variables (removed 46) and now considering 5990/6039 (removed 49) transitions.
// Phase 1: matrix 5990 rows 1383 cols
[2024-05-29 13:36:57] [INFO ] Computed 8 invariants in 80 ms
[2024-05-29 13:36:58] [INFO ] Implicit Places using invariants in 1370 ms returned []
[2024-05-29 13:36:58] [INFO ] Invariant cache hit.
[2024-05-29 13:37:01] [INFO ] Implicit Places using invariants and state equation in 3104 ms returned []
Implicit Place search using SMT with State Equation took 4481 ms to find 0 implicit places.
Running 5989 sub problems to find dead transitions.
[2024-05-29 13:37:01] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1382/7373 variables, and 0 constraints, problems are : Problem set: 0 solved, 5989 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1383 constraints, PredecessorRefiner: 5989/1601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5989 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1382/7373 variables, and 0 constraints, problems are : Problem set: 0 solved, 5989 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1383 constraints, PredecessorRefiner: 4388/1601 constraints, Known Traps: 0/0 constraints]
After SMT, in 129790ms problems are : Problem set: 0 solved, 5989 unsolved
Search for dead transitions found 0 dead transitions in 129846ms
Starting structural reductions in LTL mode, iteration 1 : 1383/1429 places, 5990/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135522 ms. Remains : 1383/1429 places, 5990/6039 transitions.
Stuttering acceptance computed with spot in 327 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 304 steps with 2 reset in 2 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-04 finished in 135899 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 7 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1420 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 986 transitions
Trivial Post-agglo rules discarded 986 transitions
Performed 986 trivial Post agglomeration. Transition count delta: 986
Iterating post reduction 0 with 986 rules applied. Total rules applied 987 place count 1330 transition count 4940
Reduce places removed 986 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 1008 rules applied. Total rules applied 1995 place count 344 transition count 4918
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 2002 place count 337 transition count 4918
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 2002 place count 337 transition count 4843
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 2152 place count 262 transition count 4843
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2163 place count 251 transition count 4832
Iterating global reduction 3 with 11 rules applied. Total rules applied 2174 place count 251 transition count 4832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2175 place count 251 transition count 4831
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2179 place count 247 transition count 4827
Iterating global reduction 4 with 4 rules applied. Total rules applied 2183 place count 247 transition count 4827
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2185 place count 247 transition count 4825
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 2291 place count 194 transition count 4771
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 2325 place count 160 transition count 1950
Iterating global reduction 5 with 34 rules applied. Total rules applied 2359 place count 160 transition count 1950
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2372 place count 160 transition count 1937
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2394 place count 138 transition count 1908
Iterating global reduction 6 with 22 rules applied. Total rules applied 2416 place count 138 transition count 1908
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2438 place count 116 transition count 1879
Iterating global reduction 6 with 22 rules applied. Total rules applied 2460 place count 116 transition count 1879
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2468 place count 116 transition count 1871
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2490 place count 105 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2491 place count 104 transition count 1864
Iterating global reduction 7 with 1 rules applied. Total rules applied 2492 place count 104 transition count 1864
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2493 place count 104 transition count 1863
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 2500 place count 104 transition count 1856
Applied a total of 2500 rules in 531 ms. Remains 104 /1429 variables (removed 1325) and now considering 1856/6039 (removed 4183) transitions.
[2024-05-29 13:39:12] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
// Phase 1: matrix 1848 rows 104 cols
[2024-05-29 13:39:12] [INFO ] Computed 2 invariants in 14 ms
[2024-05-29 13:39:12] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-29 13:39:12] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:39:12] [INFO ] Invariant cache hit.
[2024-05-29 13:39:13] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:39:14] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2024-05-29 13:39:14] [INFO ] Redundant transitions in 40 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 13:39:14] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:39:14] [INFO ] Invariant cache hit.
[2024-05-29 13:39:14] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:39:48] [INFO ] Deduced a trap composed of 24 places in 670 ms of which 2 ms to minimize.
[2024-05-29 13:39:49] [INFO ] Deduced a trap composed of 16 places in 642 ms of which 1 ms to minimize.
[2024-05-29 13:39:49] [INFO ] Deduced a trap composed of 23 places in 621 ms of which 3 ms to minimize.
[2024-05-29 13:39:50] [INFO ] Deduced a trap composed of 16 places in 578 ms of which 6 ms to minimize.
[2024-05-29 13:39:51] [INFO ] Deduced a trap composed of 16 places in 549 ms of which 1 ms to minimize.
[2024-05-29 13:39:51] [INFO ] Deduced a trap composed of 25 places in 572 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 17 places in 583 ms of which 0 ms to minimize.
[2024-05-29 13:39:52] [INFO ] Deduced a trap composed of 16 places in 557 ms of which 1 ms to minimize.
[2024-05-29 13:39:53] [INFO ] Deduced a trap composed of 17 places in 488 ms of which 1 ms to minimize.
[2024-05-29 13:39:55] [INFO ] Deduced a trap composed of 16 places in 497 ms of which 0 ms to minimize.
[2024-05-29 13:40:02] [INFO ] Deduced a trap composed of 27 places in 473 ms of which 1 ms to minimize.
[2024-05-29 13:40:03] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 1 ms to minimize.
[2024-05-29 13:40:07] [INFO ] Deduced a trap composed of 24 places in 450 ms of which 1 ms to minimize.
[2024-05-29 13:40:07] [INFO ] Deduced a trap composed of 24 places in 608 ms of which 1 ms to minimize.
[2024-05-29 13:40:08] [INFO ] Deduced a trap composed of 28 places in 556 ms of which 3 ms to minimize.
[2024-05-29 13:40:08] [INFO ] Deduced a trap composed of 24 places in 517 ms of which 1 ms to minimize.
SMT process timed out in 54553ms, After SMT, problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 54580ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/1429 places, 1856/6039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56774 ms. Remains : 104/1429 places, 1856/6039 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-05
Product exploration explored 100000 steps with 7685 reset in 573 ms.
Product exploration explored 100000 steps with 7669 reset in 392 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3039 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (253 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 757610 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 1
Probabilistic random walk after 757610 steps, saw 133709 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2024-05-29 13:40:13] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:40:13] [INFO ] Invariant cache hit.
[2024-05-29 13:40:13] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2120ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 18 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 7 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 1856/1856 transitions.
Applied a total of 0 rules in 79 ms. Remains 104 /104 variables (removed 0) and now considering 1856/1856 (removed 0) transitions.
[2024-05-29 13:40:15] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:40:15] [INFO ] Invariant cache hit.
[2024-05-29 13:40:15] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-29 13:40:15] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:40:15] [INFO ] Invariant cache hit.
[2024-05-29 13:40:16] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:40:17] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2024-05-29 13:40:17] [INFO ] Redundant transitions in 43 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 13:40:17] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:40:17] [INFO ] Invariant cache hit.
[2024-05-29 13:40:17] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:40:51] [INFO ] Deduced a trap composed of 24 places in 652 ms of which 1 ms to minimize.
[2024-05-29 13:40:51] [INFO ] Deduced a trap composed of 16 places in 630 ms of which 1 ms to minimize.
[2024-05-29 13:40:52] [INFO ] Deduced a trap composed of 23 places in 600 ms of which 1 ms to minimize.
[2024-05-29 13:40:53] [INFO ] Deduced a trap composed of 16 places in 576 ms of which 2 ms to minimize.
[2024-05-29 13:40:53] [INFO ] Deduced a trap composed of 16 places in 556 ms of which 1 ms to minimize.
[2024-05-29 13:40:54] [INFO ] Deduced a trap composed of 25 places in 578 ms of which 1 ms to minimize.
[2024-05-29 13:40:54] [INFO ] Deduced a trap composed of 17 places in 594 ms of which 1 ms to minimize.
[2024-05-29 13:40:55] [INFO ] Deduced a trap composed of 16 places in 548 ms of which 1 ms to minimize.
[2024-05-29 13:40:55] [INFO ] Deduced a trap composed of 17 places in 504 ms of which 1 ms to minimize.
[2024-05-29 13:40:58] [INFO ] Deduced a trap composed of 16 places in 572 ms of which 1 ms to minimize.
[2024-05-29 13:41:05] [INFO ] Deduced a trap composed of 27 places in 467 ms of which 1 ms to minimize.
[2024-05-29 13:41:06] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 0 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 24 places in 414 ms of which 1 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 24 places in 599 ms of which 1 ms to minimize.
[2024-05-29 13:41:10] [INFO ] Deduced a trap composed of 28 places in 549 ms of which 1 ms to minimize.
[2024-05-29 13:41:11] [INFO ] Deduced a trap composed of 24 places in 476 ms of which 1 ms to minimize.
SMT process timed out in 54302ms, After SMT, problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 54322ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56052 ms. Remains : 104/104 places, 1856/1856 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3088 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (260 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 716958 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 1
Probabilistic random walk after 716958 steps, saw 126272 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
[2024-05-29 13:41:14] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:41:14] [INFO ] Invariant cache hit.
[2024-05-29 13:41:14] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2072ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7697 reset in 376 ms.
Product exploration explored 100000 steps with 7659 reset in 387 ms.
Built C files in :
/tmp/ltsmin9151340297808609983
[2024-05-29 13:41:17] [INFO ] Too many transitions (1856) to apply POR reductions. Disabling POR matrices.
[2024-05-29 13:41:17] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9151340297808609983
Running compilation step : cd /tmp/ltsmin9151340297808609983;'/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/ltsmin9151340297808609983;'/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/ltsmin9151340297808609983;'/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 7 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 1856/1856 transitions.
Applied a total of 0 rules in 81 ms. Remains 104 /104 variables (removed 0) and now considering 1856/1856 (removed 0) transitions.
[2024-05-29 13:41:20] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:41:20] [INFO ] Invariant cache hit.
[2024-05-29 13:41:21] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-29 13:41:21] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:41:21] [INFO ] Invariant cache hit.
[2024-05-29 13:41:21] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:41:22] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
[2024-05-29 13:41:22] [INFO ] Redundant transitions in 40 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 13:41:22] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:41:22] [INFO ] Invariant cache hit.
[2024-05-29 13:41:22] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:41:58] [INFO ] Deduced a trap composed of 24 places in 647 ms of which 1 ms to minimize.
[2024-05-29 13:41:59] [INFO ] Deduced a trap composed of 16 places in 597 ms of which 1 ms to minimize.
[2024-05-29 13:41:59] [INFO ] Deduced a trap composed of 23 places in 632 ms of which 1 ms to minimize.
[2024-05-29 13:42:00] [INFO ] Deduced a trap composed of 16 places in 598 ms of which 0 ms to minimize.
[2024-05-29 13:42:00] [INFO ] Deduced a trap composed of 16 places in 507 ms of which 1 ms to minimize.
[2024-05-29 13:42:01] [INFO ] Deduced a trap composed of 25 places in 581 ms of which 0 ms to minimize.
[2024-05-29 13:42:02] [INFO ] Deduced a trap composed of 17 places in 613 ms of which 1 ms to minimize.
[2024-05-29 13:42:02] [INFO ] Deduced a trap composed of 16 places in 529 ms of which 1 ms to minimize.
[2024-05-29 13:42:03] [INFO ] Deduced a trap composed of 17 places in 569 ms of which 1 ms to minimize.
[2024-05-29 13:42:05] [INFO ] Deduced a trap composed of 16 places in 547 ms of which 2 ms to minimize.
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 27 places in 467 ms of which 1 ms to minimize.
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 24 places in 467 ms of which 0 ms to minimize.
[2024-05-29 13:42:17] [INFO ] Deduced a trap composed of 24 places in 469 ms of which 1 ms to minimize.
[2024-05-29 13:42:18] [INFO ] Deduced a trap composed of 24 places in 594 ms of which 1 ms to minimize.
[2024-05-29 13:42:18] [INFO ] Deduced a trap composed of 28 places in 545 ms of which 0 ms to minimize.
[2024-05-29 13:42:19] [INFO ] Deduced a trap composed of 24 places in 510 ms of which 1 ms to minimize.
SMT process timed out in 56672ms, After SMT, problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 56691ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58470 ms. Remains : 104/104 places, 1856/1856 transitions.
Built C files in :
/tmp/ltsmin14467922877566597544
[2024-05-29 13:42:19] [INFO ] Too many transitions (1856) to apply POR reductions. Disabling POR matrices.
[2024-05-29 13:42:19] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14467922877566597544
Running compilation step : cd /tmp/ltsmin14467922877566597544;'/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/ltsmin14467922877566597544;'/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/ltsmin14467922877566597544;'/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 13:42:22] [INFO ] Flatten gal took : 164 ms
[2024-05-29 13:42:23] [INFO ] Flatten gal took : 163 ms
[2024-05-29 13:42:23] [INFO ] Time to serialize gal into /tmp/LTL4282930439873697451.gal : 23 ms
[2024-05-29 13:42:23] [INFO ] Time to serialize properties into /tmp/LTL9071448852485452512.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/LTL4282930439873697451.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13537352511590575553.hoa' '-atoms' '/tmp/LTL9071448852485452512.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/LTL9071448852485452512.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13537352511590575553.hoa
Detected timeout of ITS tools.
[2024-05-29 13:42:38] [INFO ] Flatten gal took : 162 ms
[2024-05-29 13:42:38] [INFO ] Flatten gal took : 168 ms
[2024-05-29 13:42:38] [INFO ] Time to serialize gal into /tmp/LTL11005629675891716239.gal : 34 ms
[2024-05-29 13:42:38] [INFO ] Time to serialize properties into /tmp/LTL12021215513135475714.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/LTL11005629675891716239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12021215513135475714.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p119!=1)||(p421!=1))||((p746!=1)||(p1025!=1)))||(((p1350!=1)||(p1607!=1))||(p1931!=1)))"))))
Formula 0 simplified : GF!"((((p119!=1)||(p421!=1))||((p746!=1)||(p1025!=1)))||(((p1350!=1)||(p1607!=1))||(p1931!=1)))"
Detected timeout of ITS tools.
[2024-05-29 13:42:53] [INFO ] Flatten gal took : 160 ms
[2024-05-29 13:42:53] [INFO ] Applying decomposition
[2024-05-29 13:42:54] [INFO ] Flatten gal took : 160 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/graph2591744655603268727.txt' '-o' '/tmp/graph2591744655603268727.bin' '-w' '/tmp/graph2591744655603268727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2591744655603268727.bin' '-l' '-1' '-v' '-w' '/tmp/graph2591744655603268727.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:42:54] [INFO ] Decomposing Gal with order
[2024-05-29 13:42:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:42:54] [INFO ] Removed a total of 12042 redundant transitions.
[2024-05-29 13:42:54] [INFO ] Flatten gal took : 259 ms
[2024-05-29 13:42:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 34 ms.
[2024-05-29 13:42:54] [INFO ] Time to serialize gal into /tmp/LTL4736403843018323607.gal : 17 ms
[2024-05-29 13:42:54] [INFO ] Time to serialize properties into /tmp/LTL15646092256559754755.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/LTL4736403843018323607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15646092256559754755.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 : !((F(G("((((u2.p119!=1)||(u4.p421!=1))||((u8.p746!=1)||(i0.u10.p1025!=1)))||(((u13.p1350!=1)||(i6.u17.p1607!=1))||(u19.p1931!=1)))")))...156
Formula 0 simplified : GF!"((((u2.p119!=1)||(u4.p421!=1))||((u8.p746!=1)||(i0.u10.p1025!=1)))||(((u13.p1350!=1)||(i6.u17.p1607!=1))||(u19.p1931!=1)))"
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-05 finished in 237863 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 1 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1422 transition count 6032
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1422 transition count 6032
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1415 transition count 6025
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1415 transition count 6025
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 1409 transition count 6019
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 1409 transition count 6019
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1403 transition count 6013
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1403 transition count 6013
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1398 transition count 6008
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1398 transition count 6008
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1393 transition count 6003
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1393 transition count 6003
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 1393 transition count 6002
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 1389 transition count 5998
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 1389 transition count 5998
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 1389 transition count 5996
Applied a total of 83 rules in 598 ms. Remains 1389 /1429 variables (removed 40) and now considering 5996/6039 (removed 43) transitions.
// Phase 1: matrix 5996 rows 1389 cols
[2024-05-29 13:43:10] [INFO ] Computed 8 invariants in 73 ms
[2024-05-29 13:43:12] [INFO ] Implicit Places using invariants in 1527 ms returned []
[2024-05-29 13:43:12] [INFO ] Invariant cache hit.
[2024-05-29 13:43:15] [INFO ] Implicit Places using invariants and state equation in 3674 ms returned []
Implicit Place search using SMT with State Equation took 5205 ms to find 0 implicit places.
Running 5995 sub problems to find dead transitions.
[2024-05-29 13:43:15] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1388/7385 variables, and 0 constraints, problems are : Problem set: 0 solved, 5995 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1389 constraints, PredecessorRefiner: 5995/1607 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5995 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 timeout
1)
(s218 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1388/7385 variables, and 0 constraints, problems are : Problem set: 0 solved, 5995 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1389 constraints, PredecessorRefiner: 4388/1607 constraints, Known Traps: 0/0 constraints]
After SMT, in 125975ms problems are : Problem set: 0 solved, 5995 unsolved
Search for dead transitions found 0 dead transitions in 126035ms
Starting structural reductions in LTL mode, iteration 1 : 1389/1429 places, 5996/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131854 ms. Remains : 1389/1429 places, 5996/6039 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 635 ms.
Product exploration explored 100000 steps with 50000 reset in 585 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLFireability-08 finished in 133262 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((!p0&&X(G(!p1)))) U X(p2)))'
Support contains 21 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1421 transition count 6031
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1421 transition count 6031
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1413 transition count 6023
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1413 transition count 6023
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1406 transition count 6016
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1406 transition count 6016
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 1399 transition count 6009
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 1399 transition count 6009
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 1393 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 1393 transition count 6003
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1387 transition count 5997
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1387 transition count 5997
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 1387 transition count 5996
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 1382 transition count 5991
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 1382 transition count 5991
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 1373 transition count 5980
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 1372 transition count 5979
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 1372 transition count 5978
Applied a total of 118 rules in 990 ms. Remains 1372 /1429 variables (removed 57) and now considering 5978/6039 (removed 61) transitions.
// Phase 1: matrix 5978 rows 1372 cols
[2024-05-29 13:45:24] [INFO ] Computed 8 invariants in 65 ms
[2024-05-29 13:45:25] [INFO ] Implicit Places using invariants in 841 ms returned []
[2024-05-29 13:45:25] [INFO ] Invariant cache hit.
[2024-05-29 13:45:27] [INFO ] Implicit Places using invariants and state equation in 2826 ms returned []
Implicit Place search using SMT with State Equation took 3690 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 13:45:27] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30148 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 123638ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 123697ms
Starting structural reductions in LTL mode, iteration 1 : 1372/1429 places, 5978/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128408 ms. Remains : 1372/1429 places, 5978/6039 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR p1 p0), (OR (NOT p2) p0 p1), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-09
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-09 finished in 128721 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' '!(((p0 U X(p1))||X(G(p2))))'
Support contains 10 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1423 transition count 6033
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1423 transition count 6033
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1417 transition count 6027
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1417 transition count 6027
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1412 transition count 6022
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1412 transition count 6022
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1407 transition count 6017
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1407 transition count 6017
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1403 transition count 6013
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1403 transition count 6013
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1399 transition count 6009
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1399 transition count 6009
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 1399 transition count 6008
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 1396 transition count 6005
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 1396 transition count 6005
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 1396 transition count 6004
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1395 transition count 6003
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1395 transition count 6003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1394 transition count 6002
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1394 transition count 6002
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 1393 transition count 6001
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 1393 transition count 6001
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1392 transition count 6000
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1392 transition count 6000
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1391 transition count 5999
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1391 transition count 5999
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1390 transition count 5998
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1390 transition count 5998
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1389 transition count 5997
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1389 transition count 5997
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 1388 transition count 5996
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 1388 transition count 5996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1387 transition count 5995
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1387 transition count 5995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1386 transition count 5994
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1386 transition count 5994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 1386 transition count 5993
Applied a total of 89 rules in 1111 ms. Remains 1386 /1429 variables (removed 43) and now considering 5993/6039 (removed 46) transitions.
// Phase 1: matrix 5993 rows 1386 cols
[2024-05-29 13:47:33] [INFO ] Computed 8 invariants in 77 ms
[2024-05-29 13:47:34] [INFO ] Implicit Places using invariants in 1311 ms returned []
[2024-05-29 13:47:34] [INFO ] Invariant cache hit.
[2024-05-29 13:47:37] [INFO ] Implicit Places using invariants and state equation in 3435 ms returned []
Implicit Place search using SMT with State Equation took 4751 ms to find 0 implicit places.
Running 5992 sub problems to find dead transitions.
[2024-05-29 13:47:37] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1385/7379 variables, and 0 constraints, problems are : Problem set: 0 solved, 5992 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1386 constraints, PredecessorRefiner: 5992/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5992 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1385/7379 variables, and 0 constraints, problems are : Problem set: 0 solved, 5992 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1386 constraints, PredecessorRefiner: 4388/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 129806ms problems are : Problem set: 0 solved, 5992 unsolved
Search for dead transitions found 0 dead transitions in 129858ms
Starting structural reductions in LTL mode, iteration 1 : 1386/1429 places, 5993/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135734 ms. Remains : 1386/1429 places, 5993/6039 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-10 finished in 136067 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||X(F(p1))))))'
Support contains 11 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1421 transition count 6031
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1421 transition count 6031
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1413 transition count 6023
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1413 transition count 6023
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1406 transition count 6016
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1406 transition count 6016
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 1399 transition count 6009
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 1399 transition count 6009
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 1393 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 1393 transition count 6003
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1387 transition count 5997
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1387 transition count 5997
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 1387 transition count 5996
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 1382 transition count 5991
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 1382 transition count 5991
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 1373 transition count 5980
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 1372 transition count 5979
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 1372 transition count 5978
Applied a total of 118 rules in 1198 ms. Remains 1372 /1429 variables (removed 57) and now considering 5978/6039 (removed 61) transitions.
// Phase 1: matrix 5978 rows 1372 cols
[2024-05-29 13:49:49] [INFO ] Computed 8 invariants in 67 ms
[2024-05-29 13:49:50] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2024-05-29 13:49:50] [INFO ] Invariant cache hit.
[2024-05-29 13:49:53] [INFO ] Implicit Places using invariants and state equation in 3311 ms returned []
Implicit Place search using SMT with State Equation took 4466 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 13:49:53] [INFO ] Invariant cache hit.
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 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 126256ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 126317ms
Starting structural reductions in LTL mode, iteration 1 : 1372/1429 places, 5978/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132003 ms. Remains : 1372/1429 places, 5978/6039 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 474 ms.
Product exploration explored 100000 steps with 33333 reset in 426 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLFireability-11 finished in 133138 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((X(G(p1))&&p0)) U (G(!p2) U p3)))'
Support contains 13 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1422 transition count 6032
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1422 transition count 6032
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1415 transition count 6025
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1415 transition count 6025
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 1409 transition count 6019
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 1409 transition count 6019
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1403 transition count 6013
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1403 transition count 6013
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1398 transition count 6008
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1398 transition count 6008
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1393 transition count 6003
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1393 transition count 6003
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 1393 transition count 6002
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 1389 transition count 5998
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 1389 transition count 5998
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 1389 transition count 5996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1388 transition count 5995
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1388 transition count 5995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1387 transition count 5994
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1387 transition count 5994
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1386 transition count 5993
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1386 transition count 5993
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 1385 transition count 5992
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 1385 transition count 5992
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 1384 transition count 5991
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 1384 transition count 5991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 1383 transition count 5990
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 1383 transition count 5990
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 1382 transition count 5989
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1379 transition count 5986
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 1379 transition count 5985
Applied a total of 104 rules in 1114 ms. Remains 1379 /1429 variables (removed 50) and now considering 5985/6039 (removed 54) transitions.
// Phase 1: matrix 5985 rows 1379 cols
[2024-05-29 13:52:02] [INFO ] Computed 8 invariants in 67 ms
[2024-05-29 13:52:03] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2024-05-29 13:52:03] [INFO ] Invariant cache hit.
[2024-05-29 13:52:06] [INFO ] Implicit Places using invariants and state equation in 3087 ms returned []
Implicit Place search using SMT with State Equation took 4243 ms to find 0 implicit places.
Running 5984 sub problems to find dead transitions.
[2024-05-29 13:52:06] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1378/7364 variables, and 0 constraints, problems are : Problem set: 0 solved, 5984 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 5984/1596 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5984 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1378/7364 variables, and 0 constraints, problems are : Problem set: 0 solved, 5984 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 4388/1596 constraints, Known Traps: 0/0 constraints]
After SMT, in 122536ms problems are : Problem set: 0 solved, 5984 unsolved
Search for dead transitions found 0 dead transitions in 122599ms
Starting structural reductions in LTL mode, iteration 1 : 1379/1429 places, 5985/6039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127973 ms. Remains : 1379/1429 places, 5985/6039 transitions.
Stuttering acceptance computed with spot in 302 ms :[true, (NOT p3), (OR (NOT p3) (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (NOT p3) p2), (OR (NOT p0) (NOT p1) (NOT p3)), p2, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-12
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-12 finished in 128321 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 14 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1413 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 979 transitions
Trivial Post-agglo rules discarded 979 transitions
Performed 979 trivial Post agglomeration. Transition count delta: 979
Iterating post reduction 0 with 979 rules applied. Total rules applied 980 place count 1330 transition count 4947
Reduce places removed 979 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 1001 rules applied. Total rules applied 1981 place count 351 transition count 4925
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1988 place count 344 transition count 4925
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 1988 place count 344 transition count 4850
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 2138 place count 269 transition count 4850
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2149 place count 258 transition count 4839
Iterating global reduction 3 with 11 rules applied. Total rules applied 2160 place count 258 transition count 4839
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2161 place count 258 transition count 4838
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2165 place count 254 transition count 4834
Iterating global reduction 4 with 4 rules applied. Total rules applied 2169 place count 254 transition count 4834
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2171 place count 254 transition count 4832
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 2277 place count 201 transition count 4778
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 2307 place count 171 transition count 2315
Iterating global reduction 5 with 30 rules applied. Total rules applied 2337 place count 171 transition count 2315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 2346 place count 171 transition count 2306
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2368 place count 149 transition count 2277
Iterating global reduction 6 with 22 rules applied. Total rules applied 2390 place count 149 transition count 2277
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2412 place count 127 transition count 2248
Iterating global reduction 6 with 22 rules applied. Total rules applied 2434 place count 127 transition count 2248
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2442 place count 127 transition count 2240
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2464 place count 116 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2465 place count 115 transition count 2233
Iterating global reduction 7 with 1 rules applied. Total rules applied 2466 place count 115 transition count 2233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2467 place count 115 transition count 2232
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 2474 place count 115 transition count 2225
Applied a total of 2474 rules in 528 ms. Remains 115 /1429 variables (removed 1314) and now considering 2225/6039 (removed 3814) transitions.
[2024-05-29 13:54:09] [INFO ] Flow matrix only has 2217 transitions (discarded 8 similar events)
// Phase 1: matrix 2217 rows 115 cols
[2024-05-29 13:54:09] [INFO ] Computed 2 invariants in 27 ms
[2024-05-29 13:54:10] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-29 13:54:10] [INFO ] Flow matrix only has 2217 transitions (discarded 8 similar events)
[2024-05-29 13:54:10] [INFO ] Invariant cache hit.
[2024-05-29 13:54:10] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:54:11] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
[2024-05-29 13:54:11] [INFO ] Redundant transitions in 56 ms returned []
Running 2208 sub problems to find dead transitions.
[2024-05-29 13:54:11] [INFO ] Flow matrix only has 2217 transitions (discarded 8 similar events)
[2024-05-29 13:54:11] [INFO ] Invariant cache hit.
[2024-05-29 13:54:12] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
[2024-05-29 13:55:08] [INFO ] Deduced a trap composed of 16 places in 743 ms of which 1 ms to minimize.
[2024-05-29 13:55:09] [INFO ] Deduced a trap composed of 19 places in 747 ms of which 1 ms to minimize.
[2024-05-29 13:55:10] [INFO ] Deduced a trap composed of 18 places in 686 ms of which 1 ms to minimize.
[2024-05-29 13:55:10] [INFO ] Deduced a trap composed of 18 places in 669 ms of which 1 ms to minimize.
[2024-05-29 13:55:11] [INFO ] Deduced a trap composed of 18 places in 652 ms of which 0 ms to minimize.
[2024-05-29 13:55:12] [INFO ] Deduced a trap composed of 17 places in 733 ms of which 1 ms to minimize.
[2024-05-29 13:55:15] [INFO ] Deduced a trap composed of 26 places in 703 ms of which 1 ms to minimize.
[2024-05-29 13:55:16] [INFO ] Deduced a trap composed of 19 places in 654 ms of which 1 ms to minimize.
[2024-05-29 13:55:18] [INFO ] Deduced a trap composed of 26 places in 700 ms of which 0 ms to minimize.
[2024-05-29 13:55:18] [INFO ] Deduced a trap composed of 29 places in 692 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 115/2332 variables, and 12 constraints, problems are : Problem set: 0 solved, 2208 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/115 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 2208/2041 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
[2024-05-29 13:55:50] [INFO ] Deduced a trap composed of 28 places in 705 ms of which 2 ms to minimize.
[2024-05-29 13:55:51] [INFO ] Deduced a trap composed of 28 places in 683 ms of which 1 ms to minimize.
[2024-05-29 13:55:52] [INFO ] Deduced a trap composed of 29 places in 647 ms of which 3 ms to minimize.
[2024-05-29 13:55:52] [INFO ] Deduced a trap composed of 28 places in 645 ms of which 2 ms to minimize.
[2024-05-29 13:55:53] [INFO ] Deduced a trap composed of 27 places in 606 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2208 unsolved
[2024-05-29 13:55:55] [INFO ] Deduced a trap composed of 28 places in 764 ms of which 1 ms to minimize.
[2024-05-29 13:55:55] [INFO ] Deduced a trap composed of 25 places in 740 ms of which 1 ms to minimize.
SMT process timed out in 103843ms, After SMT, problems are : Problem set: 0 solved, 2208 unsolved
Search for dead transitions found 0 dead transitions in 103862ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1429 places, 2225/6039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106370 ms. Remains : 115/1429 places, 2225/6039 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-13 finished in 106473 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 7 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 6039/6039 transitions.
Graph (trivial) has 1420 edges and 1429 vertex of which 119 / 1429 are part of one of the 21 SCC in 3 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 986 transitions
Trivial Post-agglo rules discarded 986 transitions
Performed 986 trivial Post agglomeration. Transition count delta: 986
Iterating post reduction 0 with 986 rules applied. Total rules applied 987 place count 1330 transition count 4940
Reduce places removed 986 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 1008 rules applied. Total rules applied 1995 place count 344 transition count 4918
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 2002 place count 337 transition count 4918
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 2002 place count 337 transition count 4843
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 2152 place count 262 transition count 4843
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2163 place count 251 transition count 4832
Iterating global reduction 3 with 11 rules applied. Total rules applied 2174 place count 251 transition count 4832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2175 place count 251 transition count 4831
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2179 place count 247 transition count 4827
Iterating global reduction 4 with 4 rules applied. Total rules applied 2183 place count 247 transition count 4827
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2185 place count 247 transition count 4825
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 2291 place count 194 transition count 4771
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 2325 place count 160 transition count 1950
Iterating global reduction 5 with 34 rules applied. Total rules applied 2359 place count 160 transition count 1950
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2372 place count 160 transition count 1937
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2394 place count 138 transition count 1908
Iterating global reduction 6 with 22 rules applied. Total rules applied 2416 place count 138 transition count 1908
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2438 place count 116 transition count 1879
Iterating global reduction 6 with 22 rules applied. Total rules applied 2460 place count 116 transition count 1879
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2468 place count 116 transition count 1871
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2490 place count 105 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2491 place count 104 transition count 1864
Iterating global reduction 7 with 1 rules applied. Total rules applied 2492 place count 104 transition count 1864
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2493 place count 104 transition count 1863
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 2500 place count 104 transition count 1856
Applied a total of 2500 rules in 522 ms. Remains 104 /1429 variables (removed 1325) and now considering 1856/6039 (removed 4183) transitions.
[2024-05-29 13:55:56] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
// Phase 1: matrix 1848 rows 104 cols
[2024-05-29 13:55:56] [INFO ] Computed 2 invariants in 17 ms
[2024-05-29 13:55:56] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-29 13:55:56] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:55:56] [INFO ] Invariant cache hit.
[2024-05-29 13:55:57] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:55:58] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2024-05-29 13:55:58] [INFO ] Redundant transitions in 45 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 13:55:58] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:55:58] [INFO ] Invariant cache hit.
[2024-05-29 13:55:58] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:56:34] [INFO ] Deduced a trap composed of 16 places in 595 ms of which 1 ms to minimize.
[2024-05-29 13:56:35] [INFO ] Deduced a trap composed of 16 places in 588 ms of which 1 ms to minimize.
[2024-05-29 13:56:36] [INFO ] Deduced a trap composed of 23 places in 590 ms of which 1 ms to minimize.
[2024-05-29 13:56:36] [INFO ] Deduced a trap composed of 16 places in 547 ms of which 1 ms to minimize.
[2024-05-29 13:56:37] [INFO ] Deduced a trap composed of 17 places in 544 ms of which 1 ms to minimize.
[2024-05-29 13:56:37] [INFO ] Deduced a trap composed of 32 places in 536 ms of which 1 ms to minimize.
[2024-05-29 13:56:38] [INFO ] Deduced a trap composed of 27 places in 520 ms of which 1 ms to minimize.
[2024-05-29 13:56:38] [INFO ] Deduced a trap composed of 24 places in 572 ms of which 1 ms to minimize.
[2024-05-29 13:56:39] [INFO ] Deduced a trap composed of 24 places in 569 ms of which 1 ms to minimize.
[2024-05-29 13:56:40] [INFO ] Deduced a trap composed of 28 places in 590 ms of which 1 ms to minimize.
[2024-05-29 13:56:40] [INFO ] Deduced a trap composed of 30 places in 551 ms of which 0 ms to minimize.
[2024-05-29 13:56:41] [INFO ] Deduced a trap composed of 24 places in 545 ms of which 0 ms to minimize.
[2024-05-29 13:56:41] [INFO ] Deduced a trap composed of 24 places in 553 ms of which 1 ms to minimize.
[2024-05-29 13:56:42] [INFO ] Deduced a trap composed of 26 places in 550 ms of which 0 ms to minimize.
[2024-05-29 13:56:42] [INFO ] Deduced a trap composed of 26 places in 510 ms of which 0 ms to minimize.
[2024-05-29 13:56:43] [INFO ] Deduced a trap composed of 24 places in 524 ms of which 1 ms to minimize.
[2024-05-29 13:56:43] [INFO ] Deduced a trap composed of 24 places in 553 ms of which 1 ms to minimize.
[2024-05-29 13:56:44] [INFO ] Deduced a trap composed of 16 places in 583 ms of which 1 ms to minimize.
[2024-05-29 13:56:45] [INFO ] Deduced a trap composed of 17 places in 557 ms of which 1 ms to minimize.
[2024-05-29 13:56:45] [INFO ] Deduced a trap composed of 27 places in 595 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:56:51] [INFO ] Deduced a trap composed of 23 places in 548 ms of which 1 ms to minimize.
[2024-05-29 13:56:51] [INFO ] Deduced a trap composed of 16 places in 597 ms of which 1 ms to minimize.
[2024-05-29 13:56:52] [INFO ] Deduced a trap composed of 24 places in 595 ms of which 1 ms to minimize.
[2024-05-29 13:56:53] [INFO ] Deduced a trap composed of 27 places in 584 ms of which 1 ms to minimize.
[2024-05-29 13:56:53] [INFO ] Deduced a trap composed of 27 places in 606 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 104/1952 variables, and 27 constraints, problems are : Problem set: 0 solved, 1839 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1839/219 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1839 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:57:07] [INFO ] Deduced a trap composed of 26 places in 441 ms of which 1 ms to minimize.
[2024-05-29 13:57:08] [INFO ] Deduced a trap composed of 23 places in 418 ms of which 0 ms to minimize.
[2024-05-29 13:57:13] [INFO ] Deduced a trap composed of 24 places in 469 ms of which 1 ms to minimize.
[2024-05-29 13:57:14] [INFO ] Deduced a trap composed of 25 places in 477 ms of which 1 ms to minimize.
[2024-05-29 13:57:14] [INFO ] Deduced a trap composed of 25 places in 504 ms of which 0 ms to minimize.
[2024-05-29 13:57:15] [INFO ] Deduced a trap composed of 24 places in 433 ms of which 1 ms to minimize.
[2024-05-29 13:57:15] [INFO ] Deduced a trap composed of 24 places in 436 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:57:16] [INFO ] Deduced a trap composed of 27 places in 564 ms of which 1 ms to minimize.
[2024-05-29 13:57:17] [INFO ] Deduced a trap composed of 26 places in 575 ms of which 1 ms to minimize.
[2024-05-29 13:57:18] [INFO ] Deduced a trap composed of 28 places in 555 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 Int declared 104/1952 variables, and 37 constraints, problems are : Problem set: 0 solved, 1839 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1620/219 constraints, Known Traps: 35/35 constraints]
After SMT, in 86983ms problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 87003ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/1429 places, 1856/6039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89183 ms. Remains : 104/1429 places, 1856/6039 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-14
Product exploration explored 100000 steps with 7764 reset in 337 ms.
Product exploration explored 100000 steps with 7709 reset in 350 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3084 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (262 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 779451 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 779451 steps, saw 137281 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2024-05-29 13:57:29] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:57:29] [INFO ] Invariant cache hit.
[2024-05-29 13:57:29] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1861ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 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 108 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 1856/1856 transitions.
Applied a total of 0 rules in 70 ms. Remains 104 /104 variables (removed 0) and now considering 1856/1856 (removed 0) transitions.
[2024-05-29 13:57:31] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:57:31] [INFO ] Invariant cache hit.
[2024-05-29 13:57:31] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-29 13:57:31] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:57:31] [INFO ] Invariant cache hit.
[2024-05-29 13:57:31] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:57:32] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
[2024-05-29 13:57:32] [INFO ] Redundant transitions in 40 ms returned []
Running 1839 sub problems to find dead transitions.
[2024-05-29 13:57:32] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:57:32] [INFO ] Invariant cache hit.
[2024-05-29 13:57:32] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:58:05] [INFO ] Deduced a trap composed of 16 places in 603 ms of which 0 ms to minimize.
[2024-05-29 13:58:06] [INFO ] Deduced a trap composed of 16 places in 610 ms of which 0 ms to minimize.
[2024-05-29 13:58:07] [INFO ] Deduced a trap composed of 23 places in 614 ms of which 0 ms to minimize.
[2024-05-29 13:58:07] [INFO ] Deduced a trap composed of 16 places in 542 ms of which 1 ms to minimize.
[2024-05-29 13:58:08] [INFO ] Deduced a trap composed of 17 places in 554 ms of which 1 ms to minimize.
[2024-05-29 13:58:08] [INFO ] Deduced a trap composed of 32 places in 520 ms of which 2 ms to minimize.
[2024-05-29 13:58:09] [INFO ] Deduced a trap composed of 27 places in 537 ms of which 1 ms to minimize.
[2024-05-29 13:58:09] [INFO ] Deduced a trap composed of 24 places in 570 ms of which 0 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 24 places in 574 ms of which 1 ms to minimize.
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 28 places in 575 ms of which 1 ms to minimize.
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 30 places in 560 ms of which 1 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 24 places in 547 ms of which 1 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 24 places in 550 ms of which 1 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 26 places in 552 ms of which 1 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 26 places in 534 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 24 places in 533 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 24 places in 531 ms of which 1 ms to minimize.
[2024-05-29 13:58:15] [INFO ] Deduced a trap composed of 16 places in 578 ms of which 1 ms to minimize.
[2024-05-29 13:58:16] [INFO ] Deduced a trap composed of 17 places in 562 ms of which 1 ms to minimize.
[2024-05-29 13:58:16] [INFO ] Deduced a trap composed of 27 places in 594 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:58:22] [INFO ] Deduced a trap composed of 23 places in 575 ms of which 1 ms to minimize.
[2024-05-29 13:58:23] [INFO ] Deduced a trap composed of 16 places in 604 ms of which 1 ms to minimize.
[2024-05-29 13:58:23] [INFO ] Deduced a trap composed of 24 places in 601 ms of which 0 ms to minimize.
[2024-05-29 13:58:24] [INFO ] Deduced a trap composed of 27 places in 552 ms of which 1 ms to minimize.
[2024-05-29 13:58:24] [INFO ] Deduced a trap composed of 27 places in 560 ms of which 1 ms to minimize.
(s85 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/1952 variables, and 27 constraints, problems are : Problem set: 0 solved, 1839 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1839/219 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1839 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:58:38] [INFO ] Deduced a trap composed of 26 places in 459 ms of which 0 ms to minimize.
[2024-05-29 13:58:39] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 1 ms to minimize.
[2024-05-29 13:58:44] [INFO ] Deduced a trap composed of 24 places in 469 ms of which 1 ms to minimize.
[2024-05-29 13:58:45] [INFO ] Deduced a trap composed of 25 places in 508 ms of which 0 ms to minimize.
[2024-05-29 13:58:46] [INFO ] Deduced a trap composed of 25 places in 484 ms of which 0 ms to minimize.
[2024-05-29 13:58:46] [INFO ] Deduced a trap composed of 24 places in 440 ms of which 1 ms to minimize.
[2024-05-29 13:58:46] [INFO ] Deduced a trap composed of 24 places in 430 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1839 unsolved
[2024-05-29 13:58:48] [INFO ] Deduced a trap composed of 27 places in 606 ms of which 0 ms to minimize.
[2024-05-29 13:58:48] [INFO ] Deduced a trap composed of 26 places in 593 ms of which 1 ms to minimize.
[2024-05-29 13:58:49] [INFO ] Deduced a trap composed of 28 places in 591 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/1952 variables, and 37 constraints, problems are : Problem set: 0 solved, 1839 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/104 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 1620/219 constraints, Known Traps: 35/35 constraints]
After SMT, in 83167ms problems are : Problem set: 0 solved, 1839 unsolved
Search for dead transitions found 0 dead transitions in 83182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 84812 ms. Remains : 104/104 places, 1856/1856 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 118 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3065 resets) in 252 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (259 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 783577 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 1
Probabilistic random walk after 783577 steps, saw 138164 distinct states, run finished after 3002 ms. (steps per millisecond=261 ) properties seen :0
[2024-05-29 13:58:59] [INFO ] Flow matrix only has 1848 transitions (discarded 8 similar events)
[2024-05-29 13:58:59] [INFO ] Invariant cache hit.
[2024-05-29 13:58:59] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1846/1948 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1948 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1948 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1951 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1951 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1952 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1952 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1889ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7710 reset in 342 ms.
Product exploration explored 100000 steps with 7710 reset in 342 ms.
Built C files in :
/tmp/ltsmin167249311157123372
[2024-05-29 13:59:02] [INFO ] Too many transitions (1856) to apply POR reductions. Disabling POR matrices.
[2024-05-29 13:59:02] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin167249311157123372
Running compilation step : cd /tmp/ltsmin167249311157123372;'/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'

BK_STOP 1716991145093

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

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