fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654447200468
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBNT-PT-S05J60

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14724.279 3600000.00 8205293.00 414.60 ?FFFFF?FFFFFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447200468.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-PT-S05J60, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBNT-PT-S05J60-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716931061707

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 21:17:43] [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-28 21:17:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:17:43] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-05-28 21:17:43] [INFO ] Transformed 909 places.
[2024-05-28 21:17:43] [INFO ] Transformed 1970 transitions.
[2024-05-28 21:17:43] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 522 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 906 transition count 1315
Applied a total of 3 rules in 63 ms. Remains 906 /909 variables (removed 3) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-05-28 21:17:44] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 906 cols
[2024-05-28 21:17:44] [INFO ] Computed 139 invariants in 81 ms
[2024-05-28 21:17:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2217 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20124 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/906 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 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 898/2217 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/906 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 43512ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 43561ms
[2024-05-28 21:18:27] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 21:18:27] [INFO ] Invariant cache hit.
[2024-05-28 21:18:28] [INFO ] Implicit Places using invariants in 931 ms returned []
[2024-05-28 21:18:28] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 21:18:28] [INFO ] Invariant cache hit.
[2024-05-28 21:18:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:18:35] [INFO ] Implicit Places using invariants and state equation in 6725 ms returned []
Implicit Place search using SMT with State Equation took 7682 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-05-28 21:18:35] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 21:18:35] [INFO ] Invariant cache hit.
[2024-05-28 21:18:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2217 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/906 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD267 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1314 is UNSAT
At refinement iteration 3 (OVERLAPS) 8/906 variables, 8/139 constraints. Problems are: Problem set: 95 solved, 1214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 906/2217 variables, and 139 constraints, problems are : Problem set: 95 solved, 1214 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/906 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 64012ms problems are : Problem set: 95 solved, 1214 unsolved
Search for dead transitions found 95 dead transitions in 64030ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in LTL mode, iteration 1 : 906/909 places, 1220/1315 transitions.
Applied a total of 0 rules in 19 ms. Remains 906 /906 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115426 ms. Remains : 906/909 places, 1220/1315 transitions.
Support contains 522 out of 906 places after structural reductions.
[2024-05-28 21:19:39] [INFO ] Flatten gal took : 170 ms
[2024-05-28 21:19:39] [INFO ] Flatten gal took : 116 ms
[2024-05-28 21:19:40] [INFO ] Input system was already deterministic with 1220 transitions.
Reduction of identical properties reduced properties to check from 24 to 22
RANDOM walk for 40000 steps (2729 resets) in 1355 ms. (29 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40002 steps (507 resets) in 280 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (491 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (192 resets) in 325 ms. (122 steps per ms) remains 1/5 properties
[2024-05-28 21:19:41] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 906 cols
[2024-05-28 21:19:41] [INFO ] Computed 139 invariants in 40 ms
[2024-05-28 21:19:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 529/544 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 318/862 variables, 111/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:19:41] [INFO ] Deduced a trap composed of 74 places in 375 ms of which 52 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/862 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/862 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 43/905 variables, 22/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/906 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/906 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1216/2122 variables, 906/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2122 variables, 1/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2122 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2122 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2122/2122 variables, and 1047 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 906/906 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 529/544 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 318/862 variables, 111/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/862 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/862 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 43/905 variables, 22/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/906 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/906 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1216/2122 variables, 906/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2122 variables, 1/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2122 variables, 1/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2122 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2122 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2122/2122 variables, and 1048 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1355 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 906/906 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2802ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 9 ms.
Computed a total of 0 stabilizing places and 0 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' '!(G(F(p0)))'
Support contains 63 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1154
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1154
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1089
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1088
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1088
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1086
Applied a total of 268 rules in 285 ms. Remains 770 /906 variables (removed 136) and now considering 1086/1220 (removed 134) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:19:44] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-28 21:19:44] [INFO ] Computed 137 invariants in 37 ms
[2024-05-28 21:19:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:19:58] [INFO ] Deduced a trap composed of 247 places in 278 ms of which 6 ms to minimize.
[2024-05-28 21:19:58] [INFO ] Deduced a trap composed of 248 places in 296 ms of which 6 ms to minimize.
[2024-05-28 21:19:59] [INFO ] Deduced a trap composed of 260 places in 332 ms of which 5 ms to minimize.
[2024-05-28 21:19:59] [INFO ] Deduced a trap composed of 197 places in 332 ms of which 6 ms to minimize.
[2024-05-28 21:19:59] [INFO ] Deduced a trap composed of 239 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:20:00] [INFO ] Deduced a trap composed of 208 places in 308 ms of which 4 ms to minimize.
[2024-05-28 21:20:00] [INFO ] Deduced a trap composed of 207 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:20:00] [INFO ] Deduced a trap composed of 213 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:20:00] [INFO ] Deduced a trap composed of 197 places in 217 ms of which 4 ms to minimize.
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 207 places in 309 ms of which 5 ms to minimize.
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 203 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 206 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 208 places in 283 ms of which 4 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 201 places in 272 ms of which 4 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 205 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 197 places in 318 ms of which 5 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 206 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 225 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:20:04] [INFO ] Deduced a trap composed of 242 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:20:05] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:20:06] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 21:20:07] [INFO ] Deduced a trap composed of 197 places in 228 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 155 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 23/155 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:20:28] [INFO ] Deduced a trap composed of 352 places in 379 ms of which 5 ms to minimize.
SMT process timed out in 43123ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 43136ms
[2024-05-28 21:20:28] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:20:28] [INFO ] Invariant cache hit.
[2024-05-28 21:20:29] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2024-05-28 21:20:29] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:20:29] [INFO ] Invariant cache hit.
[2024-05-28 21:20:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:20:44] [INFO ] Implicit Places using invariants and state equation in 15220 ms returned []
Implicit Place search using SMT with State Equation took 16437 ms to find 0 implicit places.
[2024-05-28 21:20:44] [INFO ] Redundant transitions in 65 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:20:44] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:20:44] [INFO ] Invariant cache hit.
[2024-05-28 21:20:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:20:57] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:20:57] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 21:20:57] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:20:58] [INFO ] Deduced a trap composed of 206 places in 248 ms of which 3 ms to minimize.
[2024-05-28 21:20:58] [INFO ] Deduced a trap composed of 207 places in 322 ms of which 5 ms to minimize.
[2024-05-28 21:20:58] [INFO ] Deduced a trap composed of 208 places in 297 ms of which 5 ms to minimize.
[2024-05-28 21:20:59] [INFO ] Deduced a trap composed of 209 places in 268 ms of which 4 ms to minimize.
[2024-05-28 21:20:59] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 3 ms to minimize.
[2024-05-28 21:20:59] [INFO ] Deduced a trap composed of 206 places in 222 ms of which 4 ms to minimize.
[2024-05-28 21:20:59] [INFO ] Deduced a trap composed of 208 places in 274 ms of which 8 ms to minimize.
[2024-05-28 21:21:00] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 3 ms to minimize.
[2024-05-28 21:21:00] [INFO ] Deduced a trap composed of 202 places in 228 ms of which 4 ms to minimize.
[2024-05-28 21:21:00] [INFO ] Deduced a trap composed of 209 places in 222 ms of which 4 ms to minimize.
[2024-05-28 21:21:00] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:21:01] [INFO ] Deduced a trap composed of 206 places in 319 ms of which 5 ms to minimize.
[2024-05-28 21:21:01] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-28 21:21:01] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-05-28 21:21:02] [INFO ] Deduced a trap composed of 239 places in 334 ms of which 4 ms to minimize.
[2024-05-28 21:21:02] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 6 ms to minimize.
[2024-05-28 21:21:02] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:21:04] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-05-28 21:21:05] [INFO ] Deduced a trap composed of 136 places in 359 ms of which 6 ms to minimize.
[2024-05-28 21:21:05] [INFO ] Deduced a trap composed of 136 places in 262 ms of which 4 ms to minimize.
[2024-05-28 21:21:05] [INFO ] Deduced a trap composed of 136 places in 326 ms of which 5 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 136 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 136 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 239 places in 301 ms of which 4 ms to minimize.
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 266 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:21:08] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 15 ms to minimize.
[2024-05-28 21:21:08] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-05-28 21:21:08] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 3 ms to minimize.
[2024-05-28 21:21:08] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:21:09] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:21:10] [INFO ] Deduced a trap composed of 245 places in 369 ms of which 5 ms to minimize.
[2024-05-28 21:21:10] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 21:21:11] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:21:11] [INFO ] Deduced a trap composed of 197 places in 328 ms of which 4 ms to minimize.
[2024-05-28 21:21:11] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 8.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:21:31] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 3 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 267 places in 332 ms of which 5 ms to minimize.
[2024-05-28 21:21:36] [INFO ] Deduced a trap composed of 248 places in 414 ms of which 5 ms to minimize.
[2024-05-28 21:21:37] [INFO ] Deduced a trap composed of 236 places in 410 ms of which 5 ms to minimize.
[2024-05-28 21:21:37] [INFO ] Deduced a trap composed of 240 places in 320 ms of which 4 ms to minimize.
[2024-05-28 21:21:39] [INFO ] Deduced a trap composed of 349 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:21:40] [INFO ] Deduced a trap composed of 337 places in 348 ms of which 5 ms to minimize.
[2024-05-28 21:21:40] [INFO ] Deduced a trap composed of 265 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:21:40] [INFO ] Deduced a trap composed of 246 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:21:46] [INFO ] Deduced a trap composed of 243 places in 305 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 182 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 50/50 constraints]
After SMT, in 63311ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 63334ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/906 places, 1086/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123279 ms. Remains : 770/906 places, 1086/1220 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-00
Product exploration explored 100000 steps with 5649 reset in 1528 ms.
Product exploration explored 100000 steps with 5631 reset in 1073 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 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 132 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 404 steps (17 resets) in 24 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 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 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 63 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 61 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:21:51] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:21:51] [INFO ] Invariant cache hit.
[2024-05-28 21:21:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:22:05] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 5 ms to minimize.
[2024-05-28 21:22:05] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 5 ms to minimize.
[2024-05-28 21:22:05] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 5 ms to minimize.
[2024-05-28 21:22:05] [INFO ] Deduced a trap composed of 206 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:22:06] [INFO ] Deduced a trap composed of 207 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:22:06] [INFO ] Deduced a trap composed of 208 places in 449 ms of which 19 ms to minimize.
[2024-05-28 21:22:07] [INFO ] Deduced a trap composed of 209 places in 426 ms of which 19 ms to minimize.
[2024-05-28 21:22:07] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 5 ms to minimize.
[2024-05-28 21:22:07] [INFO ] Deduced a trap composed of 206 places in 331 ms of which 4 ms to minimize.
[2024-05-28 21:22:08] [INFO ] Deduced a trap composed of 208 places in 268 ms of which 3 ms to minimize.
[2024-05-28 21:22:08] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 5 ms to minimize.
[2024-05-28 21:22:08] [INFO ] Deduced a trap composed of 202 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:22:08] [INFO ] Deduced a trap composed of 209 places in 224 ms of which 4 ms to minimize.
[2024-05-28 21:22:09] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 4 ms to minimize.
[2024-05-28 21:22:09] [INFO ] Deduced a trap composed of 206 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:22:09] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:22:09] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:22:10] [INFO ] Deduced a trap composed of 239 places in 307 ms of which 3 ms to minimize.
[2024-05-28 21:22:10] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 5 ms to minimize.
[2024-05-28 21:22:10] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:22:12] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2024-05-28 21:22:12] [INFO ] Deduced a trap composed of 136 places in 291 ms of which 4 ms to minimize.
[2024-05-28 21:22:13] [INFO ] Deduced a trap composed of 136 places in 345 ms of which 5 ms to minimize.
[2024-05-28 21:22:13] [INFO ] Deduced a trap composed of 136 places in 284 ms of which 3 ms to minimize.
[2024-05-28 21:22:13] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 3 ms to minimize.
[2024-05-28 21:22:14] [INFO ] Deduced a trap composed of 136 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:22:14] [INFO ] Deduced a trap composed of 136 places in 246 ms of which 3 ms to minimize.
SMT process timed out in 23091ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 23106ms
[2024-05-28 21:22:14] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:22:14] [INFO ] Invariant cache hit.
[2024-05-28 21:22:15] [INFO ] Implicit Places using invariants in 1286 ms returned []
[2024-05-28 21:22:15] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:22:15] [INFO ] Invariant cache hit.
[2024-05-28 21:22:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:22:30] [INFO ] Implicit Places using invariants and state equation in 14822 ms returned []
Implicit Place search using SMT with State Equation took 16124 ms to find 0 implicit places.
[2024-05-28 21:22:30] [INFO ] Redundant transitions in 18 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:22:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:22:30] [INFO ] Invariant cache hit.
[2024-05-28 21:22:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:22:43] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 5 ms to minimize.
[2024-05-28 21:22:44] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 6 ms to minimize.
[2024-05-28 21:22:44] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-05-28 21:22:44] [INFO ] Deduced a trap composed of 206 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:22:45] [INFO ] Deduced a trap composed of 207 places in 238 ms of which 3 ms to minimize.
[2024-05-28 21:22:45] [INFO ] Deduced a trap composed of 208 places in 344 ms of which 6 ms to minimize.
[2024-05-28 21:22:45] [INFO ] Deduced a trap composed of 209 places in 335 ms of which 5 ms to minimize.
[2024-05-28 21:22:46] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 5 ms to minimize.
[2024-05-28 21:22:46] [INFO ] Deduced a trap composed of 206 places in 272 ms of which 4 ms to minimize.
[2024-05-28 21:22:46] [INFO ] Deduced a trap composed of 208 places in 316 ms of which 6 ms to minimize.
[2024-05-28 21:22:46] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-28 21:22:47] [INFO ] Deduced a trap composed of 202 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:22:47] [INFO ] Deduced a trap composed of 209 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:22:47] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 3 ms to minimize.
[2024-05-28 21:22:48] [INFO ] Deduced a trap composed of 206 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:22:48] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-05-28 21:22:48] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 4 ms to minimize.
[2024-05-28 21:22:49] [INFO ] Deduced a trap composed of 239 places in 320 ms of which 4 ms to minimize.
[2024-05-28 21:22:49] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:22:49] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:22:51] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 6 ms to minimize.
[2024-05-28 21:22:51] [INFO ] Deduced a trap composed of 136 places in 323 ms of which 6 ms to minimize.
[2024-05-28 21:22:52] [INFO ] Deduced a trap composed of 136 places in 231 ms of which 4 ms to minimize.
[2024-05-28 21:22:52] [INFO ] Deduced a trap composed of 136 places in 244 ms of which 3 ms to minimize.
[2024-05-28 21:22:52] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:22:52] [INFO ] Deduced a trap composed of 136 places in 333 ms of which 6 ms to minimize.
[2024-05-28 21:22:53] [INFO ] Deduced a trap composed of 136 places in 245 ms of which 3 ms to minimize.
[2024-05-28 21:22:53] [INFO ] Deduced a trap composed of 239 places in 216 ms of which 4 ms to minimize.
[2024-05-28 21:22:53] [INFO ] Deduced a trap composed of 266 places in 234 ms of which 4 ms to minimize.
[2024-05-28 21:22:54] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:22:54] [INFO ] Deduced a trap composed of 197 places in 273 ms of which 5 ms to minimize.
[2024-05-28 21:22:54] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 21:22:55] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 5 ms to minimize.
[2024-05-28 21:22:55] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:22:55] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:22:56] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 4 ms to minimize.
[2024-05-28 21:22:56] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 5 ms to minimize.
[2024-05-28 21:22:57] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:22:57] [INFO ] Deduced a trap composed of 197 places in 335 ms of which 5 ms to minimize.
[2024-05-28 21:22:57] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:23:18] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 3 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 267 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 248 places in 275 ms of which 4 ms to minimize.
[2024-05-28 21:23:22] [INFO ] Deduced a trap composed of 236 places in 390 ms of which 6 ms to minimize.
[2024-05-28 21:23:22] [INFO ] Deduced a trap composed of 240 places in 333 ms of which 4 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 349 places in 275 ms of which 4 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 337 places in 284 ms of which 4 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 265 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 246 places in 277 ms of which 4 ms to minimize.
[2024-05-28 21:23:32] [INFO ] Deduced a trap composed of 243 places in 367 ms of which 4 ms to minimize.
[2024-05-28 21:23:33] [INFO ] Deduced a trap composed of 259 places in 314 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 183 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 51/51 constraints]
After SMT, in 63234ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 63258ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102612 ms. Remains : 770/770 places, 1086/1086 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 229 steps (11 resets) in 6 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 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 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5614 reset in 966 ms.
Product exploration explored 100000 steps with 5618 reset in 1000 ms.
Built C files in :
/tmp/ltsmin16427380487677815285
[2024-05-28 21:23:36] [INFO ] Computing symmetric may disable matrix : 1086 transitions.
[2024-05-28 21:23:36] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:23:36] [INFO ] Computing symmetric may enable matrix : 1086 transitions.
[2024-05-28 21:23:36] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:23:36] [INFO ] Computing Do-Not-Accords matrix : 1086 transitions.
[2024-05-28 21:23:36] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:23:36] [INFO ] Built C files in 338ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16427380487677815285
Running compilation step : cd /tmp/ltsmin16427380487677815285;'/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/ltsmin16427380487677815285;'/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/ltsmin16427380487677815285;'/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 63 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 67 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:23:39] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:23:39] [INFO ] Invariant cache hit.
[2024-05-28 21:23:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:23:52] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:23:52] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 3 ms to minimize.
[2024-05-28 21:23:52] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:23:53] [INFO ] Deduced a trap composed of 206 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:23:53] [INFO ] Deduced a trap composed of 207 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:23:53] [INFO ] Deduced a trap composed of 208 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:23:53] [INFO ] Deduced a trap composed of 209 places in 212 ms of which 3 ms to minimize.
[2024-05-28 21:23:54] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 3 ms to minimize.
[2024-05-28 21:23:54] [INFO ] Deduced a trap composed of 206 places in 216 ms of which 4 ms to minimize.
[2024-05-28 21:23:54] [INFO ] Deduced a trap composed of 208 places in 269 ms of which 4 ms to minimize.
[2024-05-28 21:23:54] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 4 ms to minimize.
[2024-05-28 21:23:55] [INFO ] Deduced a trap composed of 202 places in 212 ms of which 3 ms to minimize.
[2024-05-28 21:23:55] [INFO ] Deduced a trap composed of 209 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:23:55] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 5 ms to minimize.
[2024-05-28 21:23:56] [INFO ] Deduced a trap composed of 206 places in 292 ms of which 4 ms to minimize.
[2024-05-28 21:23:56] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 5 ms to minimize.
[2024-05-28 21:23:56] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 5 ms to minimize.
[2024-05-28 21:23:57] [INFO ] Deduced a trap composed of 239 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:23:57] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 21:23:57] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:23:59] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
[2024-05-28 21:23:59] [INFO ] Deduced a trap composed of 136 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:24:00] [INFO ] Deduced a trap composed of 136 places in 246 ms of which 3 ms to minimize.
[2024-05-28 21:24:00] [INFO ] Deduced a trap composed of 136 places in 241 ms of which 3 ms to minimize.
[2024-05-28 21:24:00] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:24:00] [INFO ] Deduced a trap composed of 136 places in 283 ms of which 3 ms to minimize.
[2024-05-28 21:24:01] [INFO ] Deduced a trap composed of 136 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:24:01] [INFO ] Deduced a trap composed of 239 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:24:01] [INFO ] Deduced a trap composed of 266 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:24:02] [INFO ] Deduced a trap composed of 197 places in 282 ms of which 4 ms to minimize.
[2024-05-28 21:24:02] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:24:02] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:24:02] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 4 ms to minimize.
SMT process timed out in 23099ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 23114ms
[2024-05-28 21:24:02] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:24:02] [INFO ] Invariant cache hit.
[2024-05-28 21:24:04] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2024-05-28 21:24:04] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:24:04] [INFO ] Invariant cache hit.
[2024-05-28 21:24:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:24:18] [INFO ] Implicit Places using invariants and state equation in 14597 ms returned []
Implicit Place search using SMT with State Equation took 15759 ms to find 0 implicit places.
[2024-05-28 21:24:18] [INFO ] Redundant transitions in 31 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:24:18] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:24:18] [INFO ] Invariant cache hit.
[2024-05-28 21:24:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:24:30] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 21:24:31] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
[2024-05-28 21:24:31] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 4 ms to minimize.
[2024-05-28 21:24:31] [INFO ] Deduced a trap composed of 206 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:24:31] [INFO ] Deduced a trap composed of 207 places in 234 ms of which 3 ms to minimize.
[2024-05-28 21:24:32] [INFO ] Deduced a trap composed of 208 places in 239 ms of which 3 ms to minimize.
[2024-05-28 21:24:32] [INFO ] Deduced a trap composed of 209 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:24:32] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:24:32] [INFO ] Deduced a trap composed of 206 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:24:33] [INFO ] Deduced a trap composed of 208 places in 259 ms of which 3 ms to minimize.
[2024-05-28 21:24:33] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 3 ms to minimize.
[2024-05-28 21:24:33] [INFO ] Deduced a trap composed of 202 places in 295 ms of which 6 ms to minimize.
[2024-05-28 21:24:33] [INFO ] Deduced a trap composed of 209 places in 234 ms of which 3 ms to minimize.
[2024-05-28 21:24:34] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
[2024-05-28 21:24:34] [INFO ] Deduced a trap composed of 206 places in 211 ms of which 4 ms to minimize.
[2024-05-28 21:24:34] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
[2024-05-28 21:24:34] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 3 ms to minimize.
[2024-05-28 21:24:35] [INFO ] Deduced a trap composed of 239 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:24:35] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 6 ms to minimize.
[2024-05-28 21:24:35] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:24:37] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
[2024-05-28 21:24:37] [INFO ] Deduced a trap composed of 136 places in 328 ms of which 6 ms to minimize.
[2024-05-28 21:24:38] [INFO ] Deduced a trap composed of 136 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:24:38] [INFO ] Deduced a trap composed of 136 places in 363 ms of which 5 ms to minimize.
[2024-05-28 21:24:38] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:24:39] [INFO ] Deduced a trap composed of 136 places in 305 ms of which 4 ms to minimize.
[2024-05-28 21:24:39] [INFO ] Deduced a trap composed of 136 places in 374 ms of which 5 ms to minimize.
[2024-05-28 21:24:40] [INFO ] Deduced a trap composed of 239 places in 358 ms of which 5 ms to minimize.
[2024-05-28 21:24:40] [INFO ] Deduced a trap composed of 266 places in 359 ms of which 6 ms to minimize.
[2024-05-28 21:24:41] [INFO ] Deduced a trap composed of 197 places in 306 ms of which 5 ms to minimize.
[2024-05-28 21:24:41] [INFO ] Deduced a trap composed of 197 places in 309 ms of which 5 ms to minimize.
[2024-05-28 21:24:41] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:24:41] [INFO ] Deduced a trap composed of 197 places in 291 ms of which 4 ms to minimize.
[2024-05-28 21:24:42] [INFO ] Deduced a trap composed of 197 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:24:42] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 3 ms to minimize.
[2024-05-28 21:24:43] [INFO ] Deduced a trap composed of 245 places in 350 ms of which 5 ms to minimize.
[2024-05-28 21:24:44] [INFO ] Deduced a trap composed of 196 places in 345 ms of which 5 ms to minimize.
[2024-05-28 21:24:44] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 3 ms to minimize.
[2024-05-28 21:24:44] [INFO ] Deduced a trap composed of 197 places in 315 ms of which 5 ms to minimize.
[2024-05-28 21:24:45] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:25:05] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 267 places in 315 ms of which 5 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 248 places in 418 ms of which 5 ms to minimize.
[2024-05-28 21:25:11] [INFO ] Deduced a trap composed of 236 places in 443 ms of which 6 ms to minimize.
[2024-05-28 21:25:11] [INFO ] Deduced a trap composed of 240 places in 380 ms of which 5 ms to minimize.
[2024-05-28 21:25:14] [INFO ] Deduced a trap composed of 349 places in 355 ms of which 6 ms to minimize.
[2024-05-28 21:25:14] [INFO ] Deduced a trap composed of 337 places in 318 ms of which 4 ms to minimize.
[2024-05-28 21:25:15] [INFO ] Deduced a trap composed of 265 places in 327 ms of which 5 ms to minimize.
[2024-05-28 21:25:15] [INFO ] Deduced a trap composed of 246 places in 263 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 181 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 49/49 constraints]
After SMT, in 62849ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62866ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 101866 ms. Remains : 770/770 places, 1086/1086 transitions.
Built C files in :
/tmp/ltsmin905122876690319024
[2024-05-28 21:25:21] [INFO ] Computing symmetric may disable matrix : 1086 transitions.
[2024-05-28 21:25:21] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:25:21] [INFO ] Computing symmetric may enable matrix : 1086 transitions.
[2024-05-28 21:25:21] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:25:22] [INFO ] Computing Do-Not-Accords matrix : 1086 transitions.
[2024-05-28 21:25:22] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:25:22] [INFO ] Built C files in 378ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin905122876690319024
Running compilation step : cd /tmp/ltsmin905122876690319024;'/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/ltsmin905122876690319024;'/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/ltsmin905122876690319024;'/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-28 21:25:25] [INFO ] Flatten gal took : 143 ms
[2024-05-28 21:25:25] [INFO ] Flatten gal took : 105 ms
[2024-05-28 21:25:25] [INFO ] Time to serialize gal into /tmp/LTL5919736727855576309.gal : 46 ms
[2024-05-28 21:25:25] [INFO ] Time to serialize properties into /tmp/LTL14385110026306812006.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/LTL5919736727855576309.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1973318575065986868.hoa' '-atoms' '/tmp/LTL14385110026306812006.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/LTL14385110026306812006.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1973318575065986868.hoa
Detected timeout of ITS tools.
[2024-05-28 21:25:40] [INFO ] Flatten gal took : 38 ms
[2024-05-28 21:25:40] [INFO ] Flatten gal took : 38 ms
[2024-05-28 21:25:40] [INFO ] Time to serialize gal into /tmp/LTL17585943860549546707.gal : 7 ms
[2024-05-28 21:25:40] [INFO ] Time to serialize properties into /tmp/LTL2613444419719469193.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17585943860549546707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2613444419719469193.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(F("(((((((((f2_13<1)||(FetchJobB_1<1))||(mo2<1))&&(((f2_40<1)||(FetchJobB_1<1))||(mo2<1)))&&((((FetchJobB_1<1)||(mo2<1))||(f2_31<...2643
Formula 0 simplified : FG!"(((((((((f2_13<1)||(FetchJobB_1<1))||(mo2<1))&&(((f2_40<1)||(FetchJobB_1<1))||(mo2<1)))&&((((FetchJobB_1<1)||(mo2<1))||(f2_31<1)...2637
Detected timeout of ITS tools.
[2024-05-28 21:25:55] [INFO ] Flatten gal took : 63 ms
[2024-05-28 21:25:55] [INFO ] Applying decomposition
[2024-05-28 21:25:56] [INFO ] Flatten gal took : 53 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/graph7368774253360719329.txt' '-o' '/tmp/graph7368774253360719329.bin' '-w' '/tmp/graph7368774253360719329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7368774253360719329.bin' '-l' '-1' '-v' '-w' '/tmp/graph7368774253360719329.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:25:56] [INFO ] Decomposing Gal with order
[2024-05-28 21:25:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:25:56] [INFO ] Removed a total of 1276 redundant transitions.
[2024-05-28 21:25:56] [INFO ] Flatten gal took : 339 ms
[2024-05-28 21:25:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 41 ms.
[2024-05-28 21:25:57] [INFO ] Time to serialize gal into /tmp/LTL15607460052427795322.gal : 16 ms
[2024-05-28 21:25:57] [INFO ] Time to serialize properties into /tmp/LTL9475035942927728311.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15607460052427795322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9475035942927728311.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(F("(((((((((i33.u56.f2_13<1)||(i33.u3.FetchJobB_1<1))||(i33.u3.mo2<1))&&(((i33.u56.f2_40<1)||(i33.u3.FetchJobB_1<1))||(i33.u3.mo2...3967
Formula 0 simplified : FG!"(((((((((i33.u56.f2_13<1)||(i33.u3.FetchJobB_1<1))||(i33.u3.mo2<1))&&(((i33.u56.f2_40<1)||(i33.u3.FetchJobB_1<1))||(i33.u3.mo2<1...3961
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-00 finished in 387609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p1) U p2))))'
Support contains 5 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 903 transition count 1219
Applied a total of 4 rules in 91 ms. Remains 903 /906 variables (removed 3) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:26:12] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2024-05-28 21:26:12] [INFO ] Computed 137 invariants in 35 ms
[2024-05-28 21:26:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 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 Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 26 ms to minimize.
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:26:38] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:26:40] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 3 ms to minimize.
[2024-05-28 21:26:40] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-05-28 21:26:42] [INFO ] Deduced a trap composed of 137 places in 272 ms of which 3 ms to minimize.
[2024-05-28 21:26:44] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 21:26:45] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 3 ms to minimize.
[2024-05-28 21:26:48] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:26:48] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 3 ms to minimize.
[2024-05-28 21:26:50] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 3 ms to minimize.
[2024-05-28 21:26:53] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 4 ms to minimize.
[2024-05-28 21:26:54] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 144 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 13/13 constraints]
After SMT, in 42232ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42250ms
[2024-05-28 21:26:54] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:26:54] [INFO ] Invariant cache hit.
[2024-05-28 21:26:55] [INFO ] Implicit Places using invariants in 1377 ms returned []
[2024-05-28 21:26:55] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:26:55] [INFO ] Invariant cache hit.
[2024-05-28 21:26:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:27:13] [INFO ] Implicit Places using invariants and state equation in 17520 ms returned []
Implicit Place search using SMT with State Equation took 18900 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:27:13] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:27:13] [INFO ] Invariant cache hit.
[2024-05-28 21:27:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2118 variables, and 137 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:27:58] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 3 ms to minimize.
[2024-05-28 21:27:59] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 3 ms to minimize.
[2024-05-28 21:27:59] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 3 ms to minimize.
[2024-05-28 21:28:02] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 2 ms to minimize.
[2024-05-28 21:28:02] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 3 ms to minimize.
[2024-05-28 21:28:02] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:28:03] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-28 21:28:03] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 5 ms to minimize.
[2024-05-28 21:28:03] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 2 ms to minimize.
[2024-05-28 21:28:04] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 3 ms to minimize.
[2024-05-28 21:28:04] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:28:11] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-05-28 21:28:14] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
[2024-05-28 21:28:14] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 2 ms to minimize.
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 897/2118 variables, and 145 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 14/14 constraints]
After SMT, in 62146ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 62162ms
Starting structural reductions in LTL mode, iteration 1 : 903/906 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123409 ms. Remains : 903/906 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-01 finished in 123651 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&&F((G(!p1)||G(p0)))))))'
Support contains 1 out of 906 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 903 transition count 1219
Applied a total of 4 rules in 81 ms. Remains 903 /906 variables (removed 3) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:28:15] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:28:15] [INFO ] Invariant cache hit.
[2024-05-28 21:28:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:28:51] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:28:51] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 2 ms to minimize.
[2024-05-28 21:28:51] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 2 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-05-28 21:28:56] [INFO ] Deduced a trap composed of 140 places in 200 ms of which 3 ms to minimize.
[2024-05-28 21:28:56] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 3 ms to minimize.
[2024-05-28 21:28:56] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 21:28:56] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 2 ms to minimize.
[2024-05-28 21:28:57] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 2 ms to minimize.
[2024-05-28 21:28:57] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 3 ms to minimize.
[2024-05-28 21:28:58] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 3 ms to minimize.
(s624 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 1)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 1)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 10)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 1)
(s411 1)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 1)
(s417 1)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 1)
(s430 0)
(s431 1)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 1)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 1)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 1)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s503 0)
(s504 1)
(s505 0)
(s506 0)
(s507 0)
(s508 1)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 1)
(s521 0)
(s522 0)
(s523 1)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 1)
(s529 1)
(s530 0)
(s531 1)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 1)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 1)
(s543 1)
(s544 1)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 1)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 1)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 1)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 1)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 1)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 142 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 11/11 constraints]
After SMT, in 42370ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42383ms
[2024-05-28 21:28:58] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:28:58] [INFO ] Invariant cache hit.
[2024-05-28 21:28:59] [INFO ] Implicit Places using invariants in 1298 ms returned []
[2024-05-28 21:28:59] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:28:59] [INFO ] Invariant cache hit.
[2024-05-28 21:29:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:29:18] [INFO ] Implicit Places using invariants and state equation in 19260 ms returned []
Implicit Place search using SMT with State Equation took 20567 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:29:18] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:29:18] [INFO ] Invariant cache hit.
[2024-05-28 21:29:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2118 variables, and 137 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:30:04] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 3 ms to minimize.
[2024-05-28 21:30:04] [INFO ] Deduced a trap composed of 140 places in 216 ms of which 3 ms to minimize.
[2024-05-28 21:30:04] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 21:30:08] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 2 ms to minimize.
[2024-05-28 21:30:08] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 2 ms to minimize.
[2024-05-28 21:30:08] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 2 ms to minimize.
[2024-05-28 21:30:08] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 3 ms to minimize.
[2024-05-28 21:30:09] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 3 ms to minimize.
[2024-05-28 21:30:09] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 3 ms to minimize.
[2024-05-28 21:30:09] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-28 21:30:10] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:30:17] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 2 ms to minimize.
[2024-05-28 21:30:20] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 3 ms to minimize.
[2024-05-28 21:30:20] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 145 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 14/14 constraints]
After SMT, in 62004ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 62013ms
Starting structural reductions in LTL mode, iteration 1 : 903/906 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125051 ms. Remains : 903/906 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-03
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-03 finished in 125160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(X((F(p3)||p2))||p1))))'
Support contains 67 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1220
Applied a total of 2 rules in 63 ms. Remains 904 /906 variables (removed 2) and now considering 1220/1220 (removed 0) transitions.
Running 1214 sub problems to find dead transitions.
[2024-05-28 21:30:21] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 904 cols
[2024-05-28 21:30:21] [INFO ] Computed 137 invariants in 37 ms
[2024-05-28 21:30:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 (/ 1.0 3.0))
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2120 variables, and 131 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1214/1214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-28 21:30:47] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 3 ms to minimize.
[2024-05-28 21:30:54] [INFO ] Deduced a trap composed of 137 places in 311 ms of which 4 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 2 ms to minimize.
[2024-05-28 21:30:58] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 3 ms to minimize.
[2024-05-28 21:30:58] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
[2024-05-28 21:31:02] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 21:31:02] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 2 ms to minimize.
[2024-05-28 21:31:02] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 2 ms to minimize.
[2024-05-28 21:31:02] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2120 variables, and 140 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1214 constraints, Known Traps: 9/9 constraints]
After SMT, in 42752ms problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 42770ms
[2024-05-28 21:31:03] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2024-05-28 21:31:03] [INFO ] Invariant cache hit.
[2024-05-28 21:31:05] [INFO ] Implicit Places using invariants in 1393 ms returned []
[2024-05-28 21:31:05] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2024-05-28 21:31:05] [INFO ] Invariant cache hit.
[2024-05-28 21:31:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:31:21] [INFO ] Implicit Places using invariants and state equation in 16577 ms returned []
Implicit Place search using SMT with State Equation took 17978 ms to find 0 implicit places.
Running 1214 sub problems to find dead transitions.
[2024-05-28 21:31:21] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2024-05-28 21:31:21] [INFO ] Invariant cache hit.
[2024-05-28 21:31:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 6/904 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/2120 variables, and 137 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1214/1214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-28 21:31:55] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:31:59] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:32:04] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 2 ms to minimize.
[2024-05-28 21:32:08] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 2 ms to minimize.
[2024-05-28 21:32:10] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 2 ms to minimize.
[2024-05-28 21:32:10] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 2 ms to minimize.
[2024-05-28 21:32:11] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 2 ms to minimize.
[2024-05-28 21:32:12] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 8/139 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-28 21:32:23] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2120 variables, and 140 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1214 constraints, Known Traps: 9/9 constraints]
After SMT, in 62280ms problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 62295ms
Starting structural reductions in LTL mode, iteration 1 : 904/906 places, 1220/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123116 ms. Remains : 904/906 places, 1220/1220 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-04 finished in 123287 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(X(p1))||G(!p2)||p0)) U p1))'
Support contains 72 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 903 transition count 1219
Applied a total of 4 rules in 30 ms. Remains 903 /906 variables (removed 3) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:32:24] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2024-05-28 21:32:24] [INFO ] Computed 137 invariants in 16 ms
[2024-05-28 21:32:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:32:50] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 2 ms to minimize.
[2024-05-28 21:32:50] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 3 ms to minimize.
[2024-05-28 21:32:50] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 2 ms to minimize.
[2024-05-28 21:32:52] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 2 ms to minimize.
[2024-05-28 21:32:52] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 2 ms to minimize.
[2024-05-28 21:32:54] [INFO ] Deduced a trap composed of 137 places in 311 ms of which 4 ms to minimize.
[2024-05-28 21:32:58] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 2 ms to minimize.
[2024-05-28 21:32:58] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 2 ms to minimize.
[2024-05-28 21:33:01] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 2 ms to minimize.
[2024-05-28 21:33:01] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 2 ms to minimize.
[2024-05-28 21:33:04] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 2 ms to minimize.
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 897/2118 variables, and 142 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 11/11 constraints]
After SMT, in 42204ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42214ms
[2024-05-28 21:33:06] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:33:06] [INFO ] Invariant cache hit.
[2024-05-28 21:33:07] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2024-05-28 21:33:07] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:33:07] [INFO ] Invariant cache hit.
[2024-05-28 21:33:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:33:27] [INFO ] Implicit Places using invariants and state equation in 19700 ms returned []
Implicit Place search using SMT with State Equation took 20907 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:33:27] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:33:27] [INFO ] Invariant cache hit.
[2024-05-28 21:33:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2118 variables, and 137 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:34:13] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 5 ms to minimize.
[2024-05-28 21:34:14] [INFO ] Deduced a trap composed of 140 places in 225 ms of which 6 ms to minimize.
[2024-05-28 21:34:14] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 3 ms to minimize.
[2024-05-28 21:34:18] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2024-05-28 21:34:18] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 2 ms to minimize.
[2024-05-28 21:34:18] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 2 ms to minimize.
[2024-05-28 21:34:19] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:34:19] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-05-28 21:34:19] [INFO ] Deduced a trap composed of 137 places in 119 ms of which 2 ms to minimize.
[2024-05-28 21:34:20] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 2 ms to minimize.
[2024-05-28 21:34:20] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:34:26] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 3 ms to minimize.
[2024-05-28 21:34:29] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 2 ms to minimize.
[2024-05-28 21:34:30] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 145 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 14/14 constraints]
After SMT, in 62922ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 62933ms
Starting structural reductions in LTL mode, iteration 1 : 903/906 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126094 ms. Remains : 903/906 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), true, (AND p2 (NOT p1)), p2]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-05
Entered a terminal (fully accepting) state of product in 11179 steps with 777 reset in 68 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-05 finished in 126411 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))||G((F(p2)&&p1))))'
Support contains 369 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 904 transition count 1216
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 900 transition count 1215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 899 transition count 1215
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 10 place count 899 transition count 1152
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 136 place count 836 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 835 transition count 1151
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 835 transition count 1151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 833 transition count 1149
Applied a total of 142 rules in 70 ms. Remains 833 /906 variables (removed 73) and now considering 1149/1220 (removed 71) transitions.
Running 1143 sub problems to find dead transitions.
[2024-05-28 21:34:30] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
// Phase 1: matrix 1145 rows 833 cols
[2024-05-28 21:34:30] [INFO ] Computed 137 invariants in 37 ms
[2024-05-28 21:34:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 21:34:44] [INFO ] Deduced a trap composed of 325 places in 304 ms of which 4 ms to minimize.
[2024-05-28 21:34:44] [INFO ] Deduced a trap composed of 268 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:34:45] [INFO ] Deduced a trap composed of 260 places in 268 ms of which 4 ms to minimize.
[2024-05-28 21:34:45] [INFO ] Deduced a trap composed of 260 places in 330 ms of which 5 ms to minimize.
[2024-05-28 21:34:45] [INFO ] Deduced a trap composed of 260 places in 316 ms of which 5 ms to minimize.
[2024-05-28 21:34:46] [INFO ] Deduced a trap composed of 260 places in 274 ms of which 4 ms to minimize.
[2024-05-28 21:34:47] [INFO ] Deduced a trap composed of 260 places in 315 ms of which 5 ms to minimize.
[2024-05-28 21:34:47] [INFO ] Deduced a trap composed of 259 places in 332 ms of which 6 ms to minimize.
[2024-05-28 21:34:48] [INFO ] Deduced a trap composed of 259 places in 348 ms of which 6 ms to minimize.
[2024-05-28 21:34:48] [INFO ] Deduced a trap composed of 310 places in 280 ms of which 5 ms to minimize.
[2024-05-28 21:34:48] [INFO ] Deduced a trap composed of 259 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:34:48] [INFO ] Deduced a trap composed of 305 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:34:49] [INFO ] Deduced a trap composed of 316 places in 351 ms of which 5 ms to minimize.
[2024-05-28 21:34:49] [INFO ] Deduced a trap composed of 317 places in 516 ms of which 6 ms to minimize.
[2024-05-28 21:34:50] [INFO ] Deduced a trap composed of 259 places in 372 ms of which 6 ms to minimize.
[2024-05-28 21:34:50] [INFO ] Deduced a trap composed of 259 places in 380 ms of which 6 ms to minimize.
[2024-05-28 21:34:51] [INFO ] Deduced a trap composed of 259 places in 370 ms of which 5 ms to minimize.
[2024-05-28 21:34:51] [INFO ] Deduced a trap composed of 259 places in 355 ms of which 6 ms to minimize.
[2024-05-28 21:34:52] [INFO ] Deduced a trap composed of 260 places in 336 ms of which 5 ms to minimize.
[2024-05-28 21:34:52] [INFO ] Deduced a trap composed of 259 places in 301 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1978 variables, and 152 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1143/1143 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 21:34:57] [INFO ] Deduced a trap composed of 327 places in 345 ms of which 4 ms to minimize.
[2024-05-28 21:34:57] [INFO ] Deduced a trap composed of 306 places in 370 ms of which 4 ms to minimize.
[2024-05-28 21:34:57] [INFO ] Deduced a trap composed of 295 places in 298 ms of which 4 ms to minimize.
[2024-05-28 21:34:58] [INFO ] Deduced a trap composed of 291 places in 353 ms of which 6 ms to minimize.
[2024-05-28 21:34:58] [INFO ] Deduced a trap composed of 271 places in 372 ms of which 6 ms to minimize.
[2024-05-28 21:34:58] [INFO ] Deduced a trap composed of 274 places in 313 ms of which 6 ms to minimize.
[2024-05-28 21:34:59] [INFO ] Deduced a trap composed of 300 places in 369 ms of which 5 ms to minimize.
[2024-05-28 21:34:59] [INFO ] Deduced a trap composed of 273 places in 361 ms of which 6 ms to minimize.
[2024-05-28 21:35:00] [INFO ] Deduced a trap composed of 282 places in 336 ms of which 6 ms to minimize.
[2024-05-28 21:35:00] [INFO ] Deduced a trap composed of 264 places in 363 ms of which 5 ms to minimize.
[2024-05-28 21:35:00] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-05-28 21:35:01] [INFO ] Deduced a trap composed of 307 places in 350 ms of which 5 ms to minimize.
[2024-05-28 21:35:01] [INFO ] Deduced a trap composed of 316 places in 342 ms of which 6 ms to minimize.
[2024-05-28 21:35:02] [INFO ] Deduced a trap composed of 310 places in 405 ms of which 6 ms to minimize.
[2024-05-28 21:35:02] [INFO ] Deduced a trap composed of 311 places in 427 ms of which 6 ms to minimize.
[2024-05-28 21:35:03] [INFO ] Deduced a trap composed of 263 places in 417 ms of which 6 ms to minimize.
[2024-05-28 21:35:03] [INFO ] Deduced a trap composed of 273 places in 415 ms of which 6 ms to minimize.
[2024-05-28 21:35:03] [INFO ] Deduced a trap composed of 262 places in 346 ms of which 5 ms to minimize.
[2024-05-28 21:35:04] [INFO ] Deduced a trap composed of 262 places in 359 ms of which 5 ms to minimize.
[2024-05-28 21:35:04] [INFO ] Deduced a trap composed of 262 places in 318 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1978 variables, and 172 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1143 constraints, Known Traps: 40/40 constraints]
After SMT, in 42062ms problems are : Problem set: 0 solved, 1143 unsolved
Search for dead transitions found 0 dead transitions in 42072ms
[2024-05-28 21:35:12] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 21:35:12] [INFO ] Invariant cache hit.
[2024-05-28 21:35:13] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-05-28 21:35:13] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 21:35:13] [INFO ] Invariant cache hit.
[2024-05-28 21:35:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:35:22] [INFO ] Implicit Places using invariants and state equation in 9053 ms returned []
Implicit Place search using SMT with State Equation took 9909 ms to find 0 implicit places.
[2024-05-28 21:35:22] [INFO ] Redundant transitions in 16 ms returned []
Running 1143 sub problems to find dead transitions.
[2024-05-28 21:35:22] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 21:35:22] [INFO ] Invariant cache hit.
[2024-05-28 21:35:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 21:35:35] [INFO ] Deduced a trap composed of 313 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:35:36] [INFO ] Deduced a trap composed of 268 places in 385 ms of which 5 ms to minimize.
[2024-05-28 21:35:36] [INFO ] Deduced a trap composed of 271 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:35:36] [INFO ] Deduced a trap composed of 259 places in 355 ms of which 6 ms to minimize.
[2024-05-28 21:35:37] [INFO ] Deduced a trap composed of 260 places in 364 ms of which 5 ms to minimize.
[2024-05-28 21:35:37] [INFO ] Deduced a trap composed of 269 places in 325 ms of which 5 ms to minimize.
[2024-05-28 21:35:38] [INFO ] Deduced a trap composed of 313 places in 365 ms of which 6 ms to minimize.
[2024-05-28 21:35:38] [INFO ] Deduced a trap composed of 259 places in 311 ms of which 4 ms to minimize.
[2024-05-28 21:35:39] [INFO ] Deduced a trap composed of 259 places in 270 ms of which 4 ms to minimize.
[2024-05-28 21:35:40] [INFO ] Deduced a trap composed of 259 places in 411 ms of which 6 ms to minimize.
[2024-05-28 21:35:40] [INFO ] Deduced a trap composed of 259 places in 351 ms of which 5 ms to minimize.
[2024-05-28 21:35:41] [INFO ] Deduced a trap composed of 259 places in 370 ms of which 6 ms to minimize.
[2024-05-28 21:35:41] [INFO ] Deduced a trap composed of 322 places in 344 ms of which 6 ms to minimize.
[2024-05-28 21:35:42] [INFO ] Deduced a trap composed of 259 places in 397 ms of which 6 ms to minimize.
[2024-05-28 21:35:43] [INFO ] Deduced a trap composed of 268 places in 344 ms of which 5 ms to minimize.
[2024-05-28 21:35:43] [INFO ] Deduced a trap composed of 268 places in 354 ms of which 5 ms to minimize.
[2024-05-28 21:35:44] [INFO ] Deduced a trap composed of 267 places in 355 ms of which 5 ms to minimize.
[2024-05-28 21:35:44] [INFO ] Deduced a trap composed of 266 places in 304 ms of which 5 ms to minimize.
[2024-05-28 21:35:44] [INFO ] Deduced a trap composed of 267 places in 362 ms of which 8 ms to minimize.
[2024-05-28 21:35:45] [INFO ] Deduced a trap composed of 267 places in 341 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 260 places in 376 ms of which 5 ms to minimize.
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 260 places in 377 ms of which 6 ms to minimize.
[2024-05-28 21:35:48] [INFO ] Deduced a trap composed of 259 places in 341 ms of which 5 ms to minimize.
[2024-05-28 21:35:48] [INFO ] Deduced a trap composed of 260 places in 336 ms of which 5 ms to minimize.
[2024-05-28 21:35:48] [INFO ] Deduced a trap composed of 260 places in 315 ms of which 4 ms to minimize.
[2024-05-28 21:35:49] [INFO ] Deduced a trap composed of 259 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:35:49] [INFO ] Deduced a trap composed of 266 places in 346 ms of which 6 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 274 places in 301 ms of which 4 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 269 places in 297 ms of which 4 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 266 places in 278 ms of which 3 ms to minimize.
[2024-05-28 21:35:51] [INFO ] Deduced a trap composed of 260 places in 366 ms of which 5 ms to minimize.
[2024-05-28 21:35:52] [INFO ] Deduced a trap composed of 260 places in 352 ms of which 4 ms to minimize.
[2024-05-28 21:35:52] [INFO ] Deduced a trap composed of 260 places in 313 ms of which 4 ms to minimize.
[2024-05-28 21:35:53] [INFO ] Deduced a trap composed of 260 places in 297 ms of which 5 ms to minimize.
[2024-05-28 21:35:53] [INFO ] Deduced a trap composed of 260 places in 345 ms of which 5 ms to minimize.
[2024-05-28 21:35:53] [INFO ] Deduced a trap composed of 259 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:35:54] [INFO ] Deduced a trap composed of 259 places in 355 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1978 variables, and 169 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1143/1143 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 37/169 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 21:36:04] [INFO ] Deduced a trap composed of 319 places in 306 ms of which 4 ms to minimize.
[2024-05-28 21:36:05] [INFO ] Deduced a trap composed of 310 places in 303 ms of which 4 ms to minimize.
[2024-05-28 21:36:05] [INFO ] Deduced a trap composed of 311 places in 325 ms of which 4 ms to minimize.
[2024-05-28 21:36:05] [INFO ] Deduced a trap composed of 266 places in 321 ms of which 5 ms to minimize.
[2024-05-28 21:36:06] [INFO ] Deduced a trap composed of 273 places in 297 ms of which 4 ms to minimize.
[2024-05-28 21:36:06] [INFO ] Deduced a trap composed of 266 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:36:06] [INFO ] Deduced a trap composed of 299 places in 341 ms of which 4 ms to minimize.
[2024-05-28 21:36:07] [INFO ] Deduced a trap composed of 271 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:36:07] [INFO ] Deduced a trap composed of 138 places in 319 ms of which 4 ms to minimize.
[2024-05-28 21:36:08] [INFO ] Deduced a trap composed of 264 places in 333 ms of which 4 ms to minimize.
[2024-05-28 21:36:08] [INFO ] Deduced a trap composed of 264 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:36:08] [INFO ] Deduced a trap composed of 272 places in 276 ms of which 4 ms to minimize.
[2024-05-28 21:36:09] [INFO ] Deduced a trap composed of 270 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:36:09] [INFO ] Deduced a trap composed of 268 places in 312 ms of which 4 ms to minimize.
[2024-05-28 21:36:09] [INFO ] Deduced a trap composed of 270 places in 328 ms of which 4 ms to minimize.
[2024-05-28 21:36:10] [INFO ] Deduced a trap composed of 269 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:36:10] [INFO ] Deduced a trap composed of 307 places in 297 ms of which 4 ms to minimize.
[2024-05-28 21:36:10] [INFO ] Deduced a trap composed of 266 places in 283 ms of which 4 ms to minimize.
[2024-05-28 21:36:10] [INFO ] Deduced a trap composed of 268 places in 322 ms of which 5 ms to minimize.
[2024-05-28 21:36:11] [INFO ] Deduced a trap composed of 269 places in 271 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1978 variables, and 189 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1143 constraints, Known Traps: 57/57 constraints]
After SMT, in 61998ms problems are : Problem set: 0 solved, 1143 unsolved
Search for dead transitions found 0 dead transitions in 62009ms
Starting structural reductions in SI_LTL mode, iteration 1 : 833/906 places, 1149/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114090 ms. Remains : 833/906 places, 1149/1220 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-06
Product exploration explored 100000 steps with 4427 reset in 3493 ms.
Product exploration explored 100000 steps with 4444 reset in 3473 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 193 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 363 steps (15 resets) in 21 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 13 factoid took 268 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 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Support contains 366 out of 833 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 1149/1149 transitions.
Applied a total of 0 rules in 49 ms. Remains 833 /833 variables (removed 0) and now considering 1149/1149 (removed 0) transitions.
Running 1143 sub problems to find dead transitions.
[2024-05-28 21:36:32] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 21:36:32] [INFO ] Invariant cache hit.
[2024-05-28 21:36:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 21:36:46] [INFO ] Deduced a trap composed of 313 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:36:46] [INFO ] Deduced a trap composed of 268 places in 691 ms of which 4 ms to minimize.
[2024-05-28 21:36:47] [INFO ] Deduced a trap composed of 271 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:36:47] [INFO ] Deduced a trap composed of 259 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:36:47] [INFO ] Deduced a trap composed of 260 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:36:47] [INFO ] Deduced a trap composed of 269 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:36:48] [INFO ] Deduced a trap composed of 313 places in 388 ms of which 4 ms to minimize.
[2024-05-28 21:36:49] [INFO ] Deduced a trap composed of 259 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:36:49] [INFO ] Deduced a trap composed of 259 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:36:50] [INFO ] Deduced a trap composed of 259 places in 355 ms of which 5 ms to minimize.
[2024-05-28 21:36:51] [INFO ] Deduced a trap composed of 259 places in 394 ms of which 6 ms to minimize.
[2024-05-28 21:36:51] [INFO ] Deduced a trap composed of 259 places in 350 ms of which 4 ms to minimize.
[2024-05-28 21:36:51] [INFO ] Deduced a trap composed of 322 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:36:52] [INFO ] Deduced a trap composed of 259 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:36:53] [INFO ] Deduced a trap composed of 268 places in 282 ms of which 4 ms to minimize.
[2024-05-28 21:36:53] [INFO ] Deduced a trap composed of 268 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:36:53] [INFO ] Deduced a trap composed of 267 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:36:53] [INFO ] Deduced a trap composed of 266 places in 318 ms of which 5 ms to minimize.
[2024-05-28 21:36:54] [INFO ] Deduced a trap composed of 267 places in 293 ms of which 4 ms to minimize.
[2024-05-28 21:36:54] [INFO ] Deduced a trap composed of 267 places in 295 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1978 variables, and 152 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1143/1143 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 21:37:01] [INFO ] Deduced a trap composed of 294 places in 381 ms of which 5 ms to minimize.
[2024-05-28 21:37:01] [INFO ] Deduced a trap composed of 329 places in 379 ms of which 5 ms to minimize.
[2024-05-28 21:37:01] [INFO ] Deduced a trap composed of 297 places in 354 ms of which 6 ms to minimize.
[2024-05-28 21:37:02] [INFO ] Deduced a trap composed of 307 places in 378 ms of which 5 ms to minimize.
[2024-05-28 21:37:02] [INFO ] Deduced a trap composed of 298 places in 351 ms of which 6 ms to minimize.
[2024-05-28 21:37:03] [INFO ] Deduced a trap composed of 298 places in 361 ms of which 5 ms to minimize.
[2024-05-28 21:37:03] [INFO ] Deduced a trap composed of 262 places in 326 ms of which 4 ms to minimize.
[2024-05-28 21:37:03] [INFO ] Deduced a trap composed of 259 places in 315 ms of which 4 ms to minimize.
[2024-05-28 21:37:04] [INFO ] Deduced a trap composed of 307 places in 286 ms of which 4 ms to minimize.
[2024-05-28 21:37:04] [INFO ] Deduced a trap composed of 259 places in 279 ms of which 4 ms to minimize.
[2024-05-28 21:37:04] [INFO ] Deduced a trap composed of 262 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:37:05] [INFO ] Deduced a trap composed of 259 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:37:05] [INFO ] Deduced a trap composed of 262 places in 327 ms of which 4 ms to minimize.
[2024-05-28 21:37:05] [INFO ] Deduced a trap composed of 259 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:37:06] [INFO ] Deduced a trap composed of 262 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:37:06] [INFO ] Deduced a trap composed of 259 places in 271 ms of which 4 ms to minimize.
[2024-05-28 21:37:06] [INFO ] Deduced a trap composed of 262 places in 304 ms of which 4 ms to minimize.
[2024-05-28 21:37:07] [INFO ] Deduced a trap composed of 259 places in 366 ms of which 6 ms to minimize.
[2024-05-28 21:37:07] [INFO ] Deduced a trap composed of 262 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:37:07] [INFO ] Deduced a trap composed of 259 places in 271 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1978 variables, and 172 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1143 constraints, Known Traps: 40/40 constraints]
After SMT, in 42298ms problems are : Problem set: 0 solved, 1143 unsolved
Search for dead transitions found 0 dead transitions in 42313ms
[2024-05-28 21:37:14] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 21:37:14] [INFO ] Invariant cache hit.
[2024-05-28 21:37:15] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2024-05-28 21:37:15] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 21:37:15] [INFO ] Invariant cache hit.
[2024-05-28 21:37:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:37:24] [INFO ] Implicit Places using invariants and state equation in 8387 ms returned []
Implicit Place search using SMT with State Equation took 9434 ms to find 0 implicit places.
[2024-05-28 21:37:24] [INFO ] Redundant transitions in 44 ms returned []
Running 1143 sub problems to find dead transitions.
[2024-05-28 21:37:24] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 21:37:24] [INFO ] Invariant cache hit.
[2024-05-28 21:37:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 21:37:38] [INFO ] Deduced a trap composed of 313 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:37:39] [INFO ] Deduced a trap composed of 268 places in 519 ms of which 5 ms to minimize.
[2024-05-28 21:37:39] [INFO ] Deduced a trap composed of 271 places in 312 ms of which 4 ms to minimize.
[2024-05-28 21:37:40] [INFO ] Deduced a trap composed of 259 places in 312 ms of which 4 ms to minimize.
[2024-05-28 21:37:40] [INFO ] Deduced a trap composed of 260 places in 404 ms of which 6 ms to minimize.
[2024-05-28 21:37:41] [INFO ] Deduced a trap composed of 269 places in 412 ms of which 6 ms to minimize.
[2024-05-28 21:37:42] [INFO ] Deduced a trap composed of 313 places in 403 ms of which 6 ms to minimize.
[2024-05-28 21:37:42] [INFO ] Deduced a trap composed of 259 places in 387 ms of which 6 ms to minimize.
[2024-05-28 21:37:43] [INFO ] Deduced a trap composed of 259 places in 387 ms of which 6 ms to minimize.
[2024-05-28 21:37:44] [INFO ] Deduced a trap composed of 259 places in 349 ms of which 6 ms to minimize.
[2024-05-28 21:37:44] [INFO ] Deduced a trap composed of 259 places in 391 ms of which 6 ms to minimize.
[2024-05-28 21:37:45] [INFO ] Deduced a trap composed of 259 places in 423 ms of which 5 ms to minimize.
[2024-05-28 21:37:45] [INFO ] Deduced a trap composed of 322 places in 392 ms of which 5 ms to minimize.
[2024-05-28 21:37:46] [INFO ] Deduced a trap composed of 259 places in 300 ms of which 5 ms to minimize.
[2024-05-28 21:37:47] [INFO ] Deduced a trap composed of 268 places in 366 ms of which 6 ms to minimize.
[2024-05-28 21:37:47] [INFO ] Deduced a trap composed of 268 places in 350 ms of which 6 ms to minimize.
[2024-05-28 21:37:47] [INFO ] Deduced a trap composed of 267 places in 321 ms of which 6 ms to minimize.
[2024-05-28 21:37:48] [INFO ] Deduced a trap composed of 266 places in 362 ms of which 5 ms to minimize.
[2024-05-28 21:37:48] [INFO ] Deduced a trap composed of 267 places in 350 ms of which 5 ms to minimize.
[2024-05-28 21:37:48] [INFO ] Deduced a trap composed of 267 places in 340 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 21:37:50] [INFO ] Deduced a trap composed of 260 places in 379 ms of which 6 ms to minimize.
[2024-05-28 21:37:51] [INFO ] Deduced a trap composed of 260 places in 414 ms of which 5 ms to minimize.
[2024-05-28 21:37:51] [INFO ] Deduced a trap composed of 259 places in 399 ms of which 5 ms to minimize.
[2024-05-28 21:37:52] [INFO ] Deduced a trap composed of 260 places in 401 ms of which 6 ms to minimize.
[2024-05-28 21:37:52] [INFO ] Deduced a trap composed of 260 places in 389 ms of which 5 ms to minimize.
[2024-05-28 21:37:52] [INFO ] Deduced a trap composed of 259 places in 361 ms of which 5 ms to minimize.
[2024-05-28 21:37:53] [INFO ] Deduced a trap composed of 266 places in 374 ms of which 6 ms to minimize.
[2024-05-28 21:37:53] [INFO ] Deduced a trap composed of 274 places in 347 ms of which 6 ms to minimize.
[2024-05-28 21:37:54] [INFO ] Deduced a trap composed of 269 places in 311 ms of which 4 ms to minimize.
[2024-05-28 21:37:54] [INFO ] Deduced a trap composed of 266 places in 270 ms of which 4 ms to minimize.
[2024-05-28 21:37:55] [INFO ] Deduced a trap composed of 260 places in 383 ms of which 6 ms to minimize.
[2024-05-28 21:37:55] [INFO ] Deduced a trap composed of 260 places in 401 ms of which 6 ms to minimize.
[2024-05-28 21:37:56] [INFO ] Deduced a trap composed of 260 places in 367 ms of which 6 ms to minimize.
[2024-05-28 21:37:56] [INFO ] Deduced a trap composed of 260 places in 355 ms of which 6 ms to minimize.
[2024-05-28 21:37:57] [INFO ] Deduced a trap composed of 260 places in 341 ms of which 4 ms to minimize.
[2024-05-28 21:37:57] [INFO ] Deduced a trap composed of 259 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:37:57] [INFO ] Deduced a trap composed of 259 places in 254 ms of which 3 ms to minimize.
SMT process timed out in 33139ms, After SMT, problems are : Problem set: 0 solved, 1143 unsolved
Search for dead transitions found 0 dead transitions in 33160ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 85014 ms. Remains : 833/833 places, 1149/1149 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 56 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 26 ms :[(NOT p0)]
RANDOM walk for 229 steps (8 resets) in 10 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 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 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4431 reset in 3559 ms.
Product exploration explored 100000 steps with 4427 reset in 3594 ms.
Built C files in :
/tmp/ltsmin15129588466369073072
[2024-05-28 21:38:05] [INFO ] Computing symmetric may disable matrix : 1149 transitions.
[2024-05-28 21:38:05] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:38:05] [INFO ] Computing symmetric may enable matrix : 1149 transitions.
[2024-05-28 21:38:05] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:38:05] [INFO ] Computing Do-Not-Accords matrix : 1149 transitions.
[2024-05-28 21:38:05] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:38:05] [INFO ] Built C files in 448ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15129588466369073072
Running compilation step : cd /tmp/ltsmin15129588466369073072;'/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/ltsmin15129588466369073072;'/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/ltsmin15129588466369073072;'/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 366 out of 833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 1149/1149 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 833 transition count 1147
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 831 transition count 1147
Applied a total of 4 rules in 77 ms. Remains 831 /833 variables (removed 2) and now considering 1147/1149 (removed 2) transitions.
Running 1141 sub problems to find dead transitions.
[2024-05-28 21:38:08] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
// Phase 1: matrix 1143 rows 831 cols
[2024-05-28 21:38:08] [INFO ] Computed 137 invariants in 48 ms
[2024-05-28 21:38:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-28 21:38:22] [INFO ] Deduced a trap composed of 270 places in 234 ms of which 4 ms to minimize.
[2024-05-28 21:38:22] [INFO ] Deduced a trap composed of 258 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:38:23] [INFO ] Deduced a trap composed of 306 places in 341 ms of which 5 ms to minimize.
[2024-05-28 21:38:23] [INFO ] Deduced a trap composed of 258 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:38:24] [INFO ] Deduced a trap composed of 302 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:38:24] [INFO ] Deduced a trap composed of 319 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:38:24] [INFO ] Deduced a trap composed of 321 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:38:25] [INFO ] Deduced a trap composed of 257 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:38:26] [INFO ] Deduced a trap composed of 257 places in 350 ms of which 5 ms to minimize.
[2024-05-28 21:38:26] [INFO ] Deduced a trap composed of 313 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:38:27] [INFO ] Deduced a trap composed of 265 places in 367 ms of which 5 ms to minimize.
[2024-05-28 21:38:27] [INFO ] Deduced a trap composed of 268 places in 335 ms of which 6 ms to minimize.
[2024-05-28 21:38:28] [INFO ] Deduced a trap composed of 268 places in 305 ms of which 4 ms to minimize.
[2024-05-28 21:38:28] [INFO ] Deduced a trap composed of 271 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:38:28] [INFO ] Deduced a trap composed of 267 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:38:31] [INFO ] Deduced a trap composed of 265 places in 274 ms of which 4 ms to minimize.
[2024-05-28 21:38:31] [INFO ] Deduced a trap composed of 264 places in 276 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 826/1974 variables, and 149 constraints, problems are : Problem set: 0 solved, 1141 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/831 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1141/1141 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 17/149 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-28 21:38:44] [INFO ] Deduced a trap composed of 321 places in 451 ms of which 6 ms to minimize.
[2024-05-28 21:38:45] [INFO ] Deduced a trap composed of 257 places in 392 ms of which 5 ms to minimize.
[2024-05-28 21:38:45] [INFO ] Deduced a trap composed of 303 places in 368 ms of which 6 ms to minimize.
[2024-05-28 21:38:46] [INFO ] Deduced a trap composed of 257 places in 340 ms of which 6 ms to minimize.
[2024-05-28 21:38:46] [INFO ] Deduced a trap composed of 306 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:38:46] [INFO ] Deduced a trap composed of 257 places in 341 ms of which 5 ms to minimize.
[2024-05-28 21:38:47] [INFO ] Deduced a trap composed of 136 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:38:47] [INFO ] Deduced a trap composed of 257 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:38:47] [INFO ] Deduced a trap composed of 297 places in 355 ms of which 6 ms to minimize.
[2024-05-28 21:38:48] [INFO ] Deduced a trap composed of 136 places in 377 ms of which 6 ms to minimize.
[2024-05-28 21:38:48] [INFO ] Deduced a trap composed of 136 places in 363 ms of which 6 ms to minimize.
[2024-05-28 21:38:49] [INFO ] Deduced a trap composed of 136 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:38:49] [INFO ] Deduced a trap composed of 295 places in 369 ms of which 4 ms to minimize.
[2024-05-28 21:38:49] [INFO ] Deduced a trap composed of 306 places in 402 ms of which 6 ms to minimize.
[2024-05-28 21:38:50] [INFO ] Deduced a trap composed of 257 places in 390 ms of which 6 ms to minimize.
[2024-05-28 21:38:51] [INFO ] Deduced a trap composed of 136 places in 458 ms of which 6 ms to minimize.
[2024-05-28 21:38:51] [INFO ] Deduced a trap composed of 136 places in 417 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/1974 variables, and 166 constraints, problems are : Problem set: 0 solved, 1141 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/831 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1141 constraints, Known Traps: 34/34 constraints]
After SMT, in 42890ms problems are : Problem set: 0 solved, 1141 unsolved
Search for dead transitions found 0 dead transitions in 42904ms
[2024-05-28 21:38:51] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2024-05-28 21:38:51] [INFO ] Invariant cache hit.
[2024-05-28 21:38:52] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2024-05-28 21:38:52] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2024-05-28 21:38:52] [INFO ] Invariant cache hit.
[2024-05-28 21:38:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:39:01] [INFO ] Implicit Places using invariants and state equation in 8421 ms returned []
Implicit Place search using SMT with State Equation took 9526 ms to find 0 implicit places.
[2024-05-28 21:39:01] [INFO ] Redundant transitions in 15 ms returned []
Running 1141 sub problems to find dead transitions.
[2024-05-28 21:39:01] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2024-05-28 21:39:01] [INFO ] Invariant cache hit.
[2024-05-28 21:39:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-28 21:39:14] [INFO ] Deduced a trap composed of 257 places in 326 ms of which 5 ms to minimize.
[2024-05-28 21:39:15] [INFO ] Deduced a trap composed of 258 places in 354 ms of which 5 ms to minimize.
[2024-05-28 21:39:15] [INFO ] Deduced a trap composed of 258 places in 284 ms of which 4 ms to minimize.
[2024-05-28 21:39:15] [INFO ] Deduced a trap composed of 298 places in 318 ms of which 5 ms to minimize.
[2024-05-28 21:39:16] [INFO ] Deduced a trap composed of 269 places in 312 ms of which 4 ms to minimize.
[2024-05-28 21:39:17] [INFO ] Deduced a trap composed of 306 places in 356 ms of which 4 ms to minimize.
[2024-05-28 21:39:17] [INFO ] Deduced a trap composed of 257 places in 329 ms of which 4 ms to minimize.
[2024-05-28 21:39:17] [INFO ] Deduced a trap composed of 257 places in 306 ms of which 5 ms to minimize.
[2024-05-28 21:39:18] [INFO ] Deduced a trap composed of 315 places in 241 ms of which 3 ms to minimize.
[2024-05-28 21:39:19] [INFO ] Deduced a trap composed of 257 places in 290 ms of which 6 ms to minimize.
[2024-05-28 21:39:19] [INFO ] Deduced a trap composed of 257 places in 258 ms of which 3 ms to minimize.
[2024-05-28 21:39:19] [INFO ] Deduced a trap composed of 263 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:39:19] [INFO ] Deduced a trap composed of 266 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:39:20] [INFO ] Deduced a trap composed of 270 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:39:20] [INFO ] Deduced a trap composed of 269 places in 412 ms of which 4 ms to minimize.
[2024-05-28 21:39:20] [INFO ] Deduced a trap composed of 263 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:39:21] [INFO ] Deduced a trap composed of 257 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:39:21] [INFO ] Deduced a trap composed of 268 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:39:21] [INFO ] Deduced a trap composed of 258 places in 471 ms of which 5 ms to minimize.
[2024-05-28 21:39:22] [INFO ] Deduced a trap composed of 257 places in 322 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-28 21:39:24] [INFO ] Deduced a trap composed of 320 places in 352 ms of which 6 ms to minimize.
[2024-05-28 21:39:24] [INFO ] Deduced a trap composed of 275 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:39:25] [INFO ] Deduced a trap composed of 267 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:39:25] [INFO ] Deduced a trap composed of 270 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:39:25] [INFO ] Deduced a trap composed of 312 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:39:25] [INFO ] Deduced a trap composed of 269 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:39:26] [INFO ] Deduced a trap composed of 269 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:39:26] [INFO ] Deduced a trap composed of 265 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:39:26] [INFO ] Deduced a trap composed of 257 places in 349 ms of which 6 ms to minimize.
[2024-05-28 21:39:27] [INFO ] Deduced a trap composed of 258 places in 350 ms of which 5 ms to minimize.
[2024-05-28 21:39:27] [INFO ] Deduced a trap composed of 257 places in 312 ms of which 4 ms to minimize.
[2024-05-28 21:39:27] [INFO ] Deduced a trap composed of 257 places in 267 ms of which 5 ms to minimize.
[2024-05-28 21:39:28] [INFO ] Deduced a trap composed of 270 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:39:28] [INFO ] Deduced a trap composed of 257 places in 325 ms of which 4 ms to minimize.
[2024-05-28 21:39:28] [INFO ] Deduced a trap composed of 257 places in 352 ms of which 6 ms to minimize.
[2024-05-28 21:39:29] [INFO ] Deduced a trap composed of 257 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:39:29] [INFO ] Deduced a trap composed of 257 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:39:30] [INFO ] Deduced a trap composed of 136 places in 353 ms of which 5 ms to minimize.
[2024-05-28 21:39:30] [INFO ] Deduced a trap composed of 136 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:39:30] [INFO ] Deduced a trap composed of 136 places in 377 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/826 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 826/1974 variables, and 172 constraints, problems are : Problem set: 0 solved, 1141 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/831 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1141/1141 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-28 21:40:01] [INFO ] Deduced a trap composed of 381 places in 394 ms of which 5 ms to minimize.
[2024-05-28 21:40:01] [INFO ] Deduced a trap composed of 377 places in 354 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/1974 variables, and 174 constraints, problems are : Problem set: 0 solved, 1141 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/831 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1141 constraints, Known Traps: 42/42 constraints]
After SMT, in 62956ms problems are : Problem set: 0 solved, 1141 unsolved
Search for dead transitions found 0 dead transitions in 62965ms
Starting structural reductions in SI_LTL mode, iteration 1 : 831/833 places, 1147/1149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115501 ms. Remains : 831/833 places, 1147/1149 transitions.
Built C files in :
/tmp/ltsmin10090049071968589067
[2024-05-28 21:40:04] [INFO ] Computing symmetric may disable matrix : 1147 transitions.
[2024-05-28 21:40:04] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:40:04] [INFO ] Computing symmetric may enable matrix : 1147 transitions.
[2024-05-28 21:40:04] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:40:04] [INFO ] Computing Do-Not-Accords matrix : 1147 transitions.
[2024-05-28 21:40:04] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:40:04] [INFO ] Built C files in 410ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10090049071968589067
Running compilation step : cd /tmp/ltsmin10090049071968589067;'/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/ltsmin10090049071968589067;'/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/ltsmin10090049071968589067;'/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-28 21:40:07] [INFO ] Flatten gal took : 94 ms
[2024-05-28 21:40:07] [INFO ] Flatten gal took : 87 ms
[2024-05-28 21:40:07] [INFO ] Time to serialize gal into /tmp/LTL15636022188622132741.gal : 21 ms
[2024-05-28 21:40:07] [INFO ] Time to serialize properties into /tmp/LTL11327618325379484688.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/LTL15636022188622132741.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5297201440457595739.hoa' '-atoms' '/tmp/LTL11327618325379484688.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11327618325379484688.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5297201440457595739.hoa
Detected timeout of ITS tools.
[2024-05-28 21:40:23] [INFO ] Flatten gal took : 51 ms
[2024-05-28 21:40:23] [INFO ] Flatten gal took : 52 ms
[2024-05-28 21:40:23] [INFO ] Time to serialize gal into /tmp/LTL8774230623770369693.gal : 89 ms
[2024-05-28 21:40:23] [INFO ] Time to serialize properties into /tmp/LTL905844232326716189.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/LTL8774230623770369693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL905844232326716189.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...274
Read 1 LTL properties
Checking formula 0 : !(((F(G("(((((((((((CreatedJobs_23_5<1)||(Perform_Work_B_1_23<1))&&((CreatedJobs_53_2<1)||(Perform_Work_B_1_53<1)))&&(((Perform_Work_B...15575
Formula 0 simplified : GF!"(((((((((((CreatedJobs_23_5<1)||(Perform_Work_B_1_23<1))&&((CreatedJobs_53_2<1)||(Perform_Work_B_1_53<1)))&&(((Perform_Work_B_1_...15563
Detected timeout of ITS tools.
[2024-05-28 21:40:38] [INFO ] Flatten gal took : 78 ms
[2024-05-28 21:40:38] [INFO ] Applying decomposition
[2024-05-28 21:40:38] [INFO ] Flatten gal took : 55 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/graph7778706232258400053.txt' '-o' '/tmp/graph7778706232258400053.bin' '-w' '/tmp/graph7778706232258400053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7778706232258400053.bin' '-l' '-1' '-v' '-w' '/tmp/graph7778706232258400053.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:40:38] [INFO ] Decomposing Gal with order
[2024-05-28 21:40:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:40:38] [INFO ] Removed a total of 1500 redundant transitions.
[2024-05-28 21:40:38] [INFO ] Flatten gal took : 200 ms
[2024-05-28 21:40:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 82 ms.
[2024-05-28 21:40:39] [INFO ] Time to serialize gal into /tmp/LTL15261941220428011343.gal : 41 ms
[2024-05-28 21:40:39] [INFO ] Time to serialize properties into /tmp/LTL14136800314141717923.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/LTL15261941220428011343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14136800314141717923.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...256
Read 1 LTL properties
Checking formula 0 : !(((F(G("(((((((((((i23.u14.CreatedJobs_23_5<1)||(i23.u66.Perform_Work_B_1_23<1))&&((i35.u57.CreatedJobs_53_2<1)||(i35.u95.Perform_Wor...20975
Formula 0 simplified : GF!"(((((((((((i23.u14.CreatedJobs_23_5<1)||(i23.u66.Perform_Work_B_1_23<1))&&((i35.u57.CreatedJobs_53_2<1)||(i35.u95.Perform_Work_B...20963
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-06 finished in 383491 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 2 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1154
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1154
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1089
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1088
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1088
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1086
Applied a total of 268 rules in 179 ms. Remains 770 /906 variables (removed 136) and now considering 1086/1220 (removed 134) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:40:54] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-28 21:40:54] [INFO ] Computed 137 invariants in 33 ms
[2024-05-28 21:40:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:41:07] [INFO ] Deduced a trap composed of 247 places in 322 ms of which 5 ms to minimize.
[2024-05-28 21:41:07] [INFO ] Deduced a trap composed of 248 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:41:07] [INFO ] Deduced a trap composed of 260 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:41:08] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 3 ms to minimize.
[2024-05-28 21:41:08] [INFO ] Deduced a trap composed of 239 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:41:08] [INFO ] Deduced a trap composed of 208 places in 308 ms of which 5 ms to minimize.
[2024-05-28 21:41:09] [INFO ] Deduced a trap composed of 207 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:41:09] [INFO ] Deduced a trap composed of 213 places in 257 ms of which 5 ms to minimize.
[2024-05-28 21:41:09] [INFO ] Deduced a trap composed of 197 places in 275 ms of which 4 ms to minimize.
[2024-05-28 21:41:09] [INFO ] Deduced a trap composed of 207 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:41:10] [INFO ] Deduced a trap composed of 203 places in 313 ms of which 5 ms to minimize.
[2024-05-28 21:41:10] [INFO ] Deduced a trap composed of 206 places in 341 ms of which 5 ms to minimize.
[2024-05-28 21:41:11] [INFO ] Deduced a trap composed of 208 places in 302 ms of which 4 ms to minimize.
[2024-05-28 21:41:11] [INFO ] Deduced a trap composed of 201 places in 296 ms of which 4 ms to minimize.
[2024-05-28 21:41:11] [INFO ] Deduced a trap composed of 205 places in 231 ms of which 4 ms to minimize.
[2024-05-28 21:41:11] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 3 ms to minimize.
[2024-05-28 21:41:12] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:41:12] [INFO ] Deduced a trap composed of 206 places in 222 ms of which 4 ms to minimize.
[2024-05-28 21:41:12] [INFO ] Deduced a trap composed of 225 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:41:12] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:41:14] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:41:14] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:41:15] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 3 ms to minimize.
[2024-05-28 21:41:16] [INFO ] Deduced a trap composed of 244 places in 232 ms of which 3 ms to minimize.
[2024-05-28 21:41:16] [INFO ] Deduced a trap composed of 202 places in 245 ms of which 3 ms to minimize.
[2024-05-28 21:41:16] [INFO ] Deduced a trap composed of 204 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:41:17] [INFO ] Deduced a trap composed of 204 places in 286 ms of which 3 ms to minimize.
SMT process timed out in 22864ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 22876ms
[2024-05-28 21:41:17] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:41:17] [INFO ] Invariant cache hit.
[2024-05-28 21:41:18] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2024-05-28 21:41:18] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:41:18] [INFO ] Invariant cache hit.
[2024-05-28 21:41:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:41:32] [INFO ] Implicit Places using invariants and state equation in 14172 ms returned []
Implicit Place search using SMT with State Equation took 15261 ms to find 0 implicit places.
[2024-05-28 21:41:32] [INFO ] Redundant transitions in 14 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:41:32] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:41:32] [INFO ] Invariant cache hit.
[2024-05-28 21:41:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:41:44] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:41:44] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 3 ms to minimize.
[2024-05-28 21:41:45] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
[2024-05-28 21:41:45] [INFO ] Deduced a trap composed of 206 places in 228 ms of which 4 ms to minimize.
[2024-05-28 21:41:45] [INFO ] Deduced a trap composed of 207 places in 254 ms of which 3 ms to minimize.
[2024-05-28 21:41:45] [INFO ] Deduced a trap composed of 208 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:41:46] [INFO ] Deduced a trap composed of 209 places in 331 ms of which 4 ms to minimize.
[2024-05-28 21:41:46] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:41:46] [INFO ] Deduced a trap composed of 206 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:41:46] [INFO ] Deduced a trap composed of 208 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:41:47] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 3 ms to minimize.
[2024-05-28 21:41:47] [INFO ] Deduced a trap composed of 202 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:41:47] [INFO ] Deduced a trap composed of 209 places in 305 ms of which 5 ms to minimize.
[2024-05-28 21:41:48] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-05-28 21:41:48] [INFO ] Deduced a trap composed of 206 places in 258 ms of which 3 ms to minimize.
[2024-05-28 21:41:48] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 3 ms to minimize.
[2024-05-28 21:41:48] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:41:49] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 3 ms to minimize.
[2024-05-28 21:41:49] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:41:49] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:41:51] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:41:51] [INFO ] Deduced a trap composed of 136 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:41:51] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 3 ms to minimize.
[2024-05-28 21:41:52] [INFO ] Deduced a trap composed of 136 places in 247 ms of which 3 ms to minimize.
[2024-05-28 21:41:52] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:41:52] [INFO ] Deduced a trap composed of 136 places in 266 ms of which 5 ms to minimize.
[2024-05-28 21:41:53] [INFO ] Deduced a trap composed of 136 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:41:53] [INFO ] Deduced a trap composed of 239 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:41:53] [INFO ] Deduced a trap composed of 266 places in 231 ms of which 4 ms to minimize.
[2024-05-28 21:41:54] [INFO ] Deduced a trap composed of 197 places in 219 ms of which 3 ms to minimize.
[2024-05-28 21:41:54] [INFO ] Deduced a trap composed of 197 places in 226 ms of which 4 ms to minimize.
[2024-05-28 21:41:54] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:41:54] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:41:55] [INFO ] Deduced a trap composed of 197 places in 226 ms of which 3 ms to minimize.
[2024-05-28 21:41:55] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 3 ms to minimize.
[2024-05-28 21:41:56] [INFO ] Deduced a trap composed of 245 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:41:56] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:41:56] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:41:57] [INFO ] Deduced a trap composed of 197 places in 358 ms of which 3 ms to minimize.
[2024-05-28 21:41:57] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:42:18] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 2 ms to minimize.
[2024-05-28 21:42:22] [INFO ] Deduced a trap composed of 267 places in 431 ms of which 5 ms to minimize.
[2024-05-28 21:42:22] [INFO ] Deduced a trap composed of 248 places in 432 ms of which 5 ms to minimize.
[2024-05-28 21:42:23] [INFO ] Deduced a trap composed of 236 places in 436 ms of which 5 ms to minimize.
[2024-05-28 21:42:24] [INFO ] Deduced a trap composed of 240 places in 404 ms of which 5 ms to minimize.
[2024-05-28 21:42:26] [INFO ] Deduced a trap composed of 349 places in 419 ms of which 6 ms to minimize.
[2024-05-28 21:42:27] [INFO ] Deduced a trap composed of 337 places in 397 ms of which 5 ms to minimize.
[2024-05-28 21:42:27] [INFO ] Deduced a trap composed of 265 places in 403 ms of which 6 ms to minimize.
[2024-05-28 21:42:28] [INFO ] Deduced a trap composed of 246 places in 340 ms of which 5 ms to minimize.
[2024-05-28 21:42:34] [INFO ] Deduced a trap composed of 243 places in 397 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 182 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 50/50 constraints]
After SMT, in 62468ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62479ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/906 places, 1086/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100846 ms. Remains : 770/906 places, 1086/1220 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-08
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 3 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-08 finished in 100919 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)))))'
Support contains 4 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 903 transition count 1219
Applied a total of 4 rules in 41 ms. Remains 903 /906 variables (removed 3) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:42:35] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2024-05-28 21:42:35] [INFO ] Computed 137 invariants in 62 ms
[2024-05-28 21:42:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 3.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 10.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:43:01] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 3 ms to minimize.
[2024-05-28 21:43:01] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 2 ms to minimize.
[2024-05-28 21:43:01] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:43:03] [INFO ] Deduced a trap composed of 137 places in 112 ms of which 2 ms to minimize.
[2024-05-28 21:43:03] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 3 ms to minimize.
[2024-05-28 21:43:05] [INFO ] Deduced a trap composed of 137 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:43:08] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 3 ms to minimize.
[2024-05-28 21:43:08] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-28 21:43:11] [INFO ] Deduced a trap composed of 137 places in 119 ms of which 2 ms to minimize.
[2024-05-28 21:43:11] [INFO ] Deduced a trap composed of 137 places in 119 ms of which 1 ms to minimize.
[2024-05-28 21:43:13] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 2 ms to minimize.
[2024-05-28 21:43:16] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:43:16] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 1)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 4)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 3)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 1)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 10)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s380 1)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 1)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 1)
(s439 1)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 144 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 13/13 constraints]
After SMT, in 42150ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42162ms
[2024-05-28 21:43:17] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:43:17] [INFO ] Invariant cache hit.
[2024-05-28 21:43:18] [INFO ] Implicit Places using invariants in 1526 ms returned []
[2024-05-28 21:43:18] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:43:18] [INFO ] Invariant cache hit.
[2024-05-28 21:43:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:43:36] [INFO ] Implicit Places using invariants and state equation in 17774 ms returned []
Implicit Place search using SMT with State Equation took 19302 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:43:36] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:43:36] [INFO ] Invariant cache hit.
[2024-05-28 21:43:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 (/ 2.0 3.0))
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 7.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 (/ 2.0 3.0))
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 3.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 1.0)timeout

(s539 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2118 variables, and 137 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:44:20] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 2 ms to minimize.
[2024-05-28 21:44:21] [INFO ] Deduced a trap composed of 140 places in 124 ms of which 2 ms to minimize.
[2024-05-28 21:44:21] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 2 ms to minimize.
[2024-05-28 21:44:24] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 2 ms to minimize.
[2024-05-28 21:44:24] [INFO ] Deduced a trap composed of 140 places in 127 ms of which 3 ms to minimize.
[2024-05-28 21:44:24] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 2 ms to minimize.
[2024-05-28 21:44:24] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 2 ms to minimize.
[2024-05-28 21:44:25] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:44:25] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 2 ms to minimize.
[2024-05-28 21:44:25] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 2 ms to minimize.
[2024-05-28 21:44:25] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:44:32] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 2 ms to minimize.
[2024-05-28 21:44:35] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:44:35] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 2 ms to minimize.
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 897/2118 variables, and 145 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 14/14 constraints]
After SMT, in 62167ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 62179ms
Starting structural reductions in LTL mode, iteration 1 : 903/906 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123690 ms. Remains : 903/906 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (AND (NOT p0) p1), p1]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-09
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-09 finished in 123771 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)&&F(G(p1)))))'
Support contains 5 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 905 transition count 1155
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 840 transition count 1155
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 130 place count 840 transition count 1091
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 258 place count 776 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 259 place count 775 transition count 1090
Iterating global reduction 2 with 1 rules applied. Total rules applied 260 place count 775 transition count 1090
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 2 with 2 rules applied. Total rules applied 262 place count 774 transition count 1089
Applied a total of 262 rules in 102 ms. Remains 774 /906 variables (removed 132) and now considering 1089/1220 (removed 131) transitions.
Running 1083 sub problems to find dead transitions.
[2024-05-28 21:44:38] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 774 cols
[2024-05-28 21:44:38] [INFO ] Computed 138 invariants in 16 ms
[2024-05-28 21:44:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-05-28 21:44:50] [INFO ] Deduced a trap composed of 199 places in 342 ms of which 5 ms to minimize.
[2024-05-28 21:44:51] [INFO ] Deduced a trap composed of 199 places in 332 ms of which 5 ms to minimize.
[2024-05-28 21:44:52] [INFO ] Deduced a trap composed of 268 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:44:52] [INFO ] Deduced a trap composed of 259 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:44:52] [INFO ] Deduced a trap composed of 219 places in 231 ms of which 3 ms to minimize.
[2024-05-28 21:44:52] [INFO ] Deduced a trap composed of 210 places in 342 ms of which 5 ms to minimize.
[2024-05-28 21:44:53] [INFO ] Deduced a trap composed of 237 places in 310 ms of which 5 ms to minimize.
[2024-05-28 21:44:53] [INFO ] Deduced a trap composed of 210 places in 291 ms of which 4 ms to minimize.
[2024-05-28 21:44:53] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 3 ms to minimize.
[2024-05-28 21:44:54] [INFO ] Deduced a trap composed of 256 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:44:54] [INFO ] Deduced a trap composed of 250 places in 329 ms of which 5 ms to minimize.
[2024-05-28 21:44:54] [INFO ] Deduced a trap composed of 199 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:44:54] [INFO ] Deduced a trap composed of 256 places in 326 ms of which 5 ms to minimize.
[2024-05-28 21:44:55] [INFO ] Deduced a trap composed of 199 places in 218 ms of which 4 ms to minimize.
[2024-05-28 21:44:55] [INFO ] Deduced a trap composed of 199 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:44:55] [INFO ] Deduced a trap composed of 199 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:44:55] [INFO ] Deduced a trap composed of 199 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:44:56] [INFO ] Deduced a trap composed of 200 places in 272 ms of which 3 ms to minimize.
[2024-05-28 21:44:56] [INFO ] Deduced a trap composed of 200 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:44:57] [INFO ] Deduced a trap composed of 247 places in 220 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-05-28 21:44:58] [INFO ] Deduced a trap composed of 209 places in 214 ms of which 4 ms to minimize.
[2024-05-28 21:44:59] [INFO ] Deduced a trap composed of 200 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:44:59] [INFO ] Deduced a trap composed of 200 places in 262 ms of which 3 ms to minimize.
[2024-05-28 21:44:59] [INFO ] Deduced a trap composed of 241 places in 233 ms of which 3 ms to minimize.
[2024-05-28 21:44:59] [INFO ] Deduced a trap composed of 200 places in 241 ms of which 3 ms to minimize.
[2024-05-28 21:45:00] [INFO ] Deduced a trap composed of 272 places in 237 ms of which 3 ms to minimize.
[2024-05-28 21:45:00] [INFO ] Deduced a trap composed of 200 places in 259 ms of which 3 ms to minimize.
[2024-05-28 21:45:01] [INFO ] Deduced a trap composed of 199 places in 249 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/1859 variables, and 160 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1083/1083 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1083 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 28/160 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-05-28 21:45:13] [INFO ] Deduced a trap composed of 251 places in 330 ms of which 5 ms to minimize.
[2024-05-28 21:45:13] [INFO ] Deduced a trap composed of 266 places in 312 ms of which 5 ms to minimize.
[2024-05-28 21:45:14] [INFO ] Deduced a trap composed of 357 places in 252 ms of which 3 ms to minimize.
[2024-05-28 21:45:14] [INFO ] Deduced a trap composed of 381 places in 234 ms of which 3 ms to minimize.
[2024-05-28 21:45:15] [INFO ] Deduced a trap composed of 377 places in 265 ms of which 4 ms to minimize.
[2024-05-28 21:45:15] [INFO ] Deduced a trap composed of 365 places in 258 ms of which 3 ms to minimize.
[2024-05-28 21:45:16] [INFO ] Deduced a trap composed of 244 places in 535 ms of which 3 ms to minimize.
[2024-05-28 21:45:16] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:45:16] [INFO ] Deduced a trap composed of 238 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:45:17] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-28 21:45:17] [INFO ] Deduced a trap composed of 344 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:45:18] [INFO ] Deduced a trap composed of 352 places in 489 ms of which 4 ms to minimize.
[2024-05-28 21:45:18] [INFO ] Deduced a trap composed of 349 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:45:18] [INFO ] Deduced a trap composed of 239 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:45:19] [INFO ] Deduced a trap composed of 311 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:45:19] [INFO ] Deduced a trap composed of 329 places in 264 ms of which 3 ms to minimize.
[2024-05-28 21:45:19] [INFO ] Deduced a trap composed of 318 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:45:20] [INFO ] Deduced a trap composed of 309 places in 259 ms of which 3 ms to minimize.
[2024-05-28 21:45:20] [INFO ] Deduced a trap composed of 319 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:45:20] [INFO ] Deduced a trap composed of 307 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/1859 variables, and 180 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1083 constraints, Known Traps: 48/48 constraints]
After SMT, in 42395ms problems are : Problem set: 0 solved, 1083 unsolved
Search for dead transitions found 0 dead transitions in 42407ms
[2024-05-28 21:45:21] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2024-05-28 21:45:21] [INFO ] Invariant cache hit.
[2024-05-28 21:45:22] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2024-05-28 21:45:22] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2024-05-28 21:45:22] [INFO ] Invariant cache hit.
[2024-05-28 21:45:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:45:36] [INFO ] Implicit Places using invariants and state equation in 13607 ms returned []
Implicit Place search using SMT with State Equation took 14795 ms to find 0 implicit places.
[2024-05-28 21:45:36] [INFO ] Redundant transitions in 36 ms returned []
Running 1083 sub problems to find dead transitions.
[2024-05-28 21:45:36] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2024-05-28 21:45:36] [INFO ] Invariant cache hit.
[2024-05-28 21:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-05-28 21:45:48] [INFO ] Deduced a trap composed of 250 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:45:49] [INFO ] Deduced a trap composed of 199 places in 216 ms of which 3 ms to minimize.
[2024-05-28 21:45:49] [INFO ] Deduced a trap composed of 199 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:45:49] [INFO ] Deduced a trap composed of 199 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:45:49] [INFO ] Deduced a trap composed of 200 places in 239 ms of which 3 ms to minimize.
[2024-05-28 21:45:50] [INFO ] Deduced a trap composed of 200 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:45:50] [INFO ] Deduced a trap composed of 199 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:45:50] [INFO ] Deduced a trap composed of 199 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:45:50] [INFO ] Deduced a trap composed of 267 places in 241 ms of which 3 ms to minimize.
[2024-05-28 21:45:51] [INFO ] Deduced a trap composed of 288 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:45:51] [INFO ] Deduced a trap composed of 262 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:45:51] [INFO ] Deduced a trap composed of 208 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:45:51] [INFO ] Deduced a trap composed of 199 places in 239 ms of which 3 ms to minimize.
[2024-05-28 21:45:52] [INFO ] Deduced a trap composed of 240 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:45:52] [INFO ] Deduced a trap composed of 250 places in 281 ms of which 4 ms to minimize.
[2024-05-28 21:45:52] [INFO ] Deduced a trap composed of 213 places in 224 ms of which 4 ms to minimize.
[2024-05-28 21:45:53] [INFO ] Deduced a trap composed of 200 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:45:53] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 3 ms to minimize.
[2024-05-28 21:45:53] [INFO ] Deduced a trap composed of 247 places in 265 ms of which 4 ms to minimize.
[2024-05-28 21:45:54] [INFO ] Deduced a trap composed of 199 places in 284 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-05-28 21:45:55] [INFO ] Deduced a trap composed of 250 places in 287 ms of which 4 ms to minimize.
[2024-05-28 21:45:55] [INFO ] Deduced a trap composed of 199 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:45:55] [INFO ] Deduced a trap composed of 239 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:45:56] [INFO ] Deduced a trap composed of 199 places in 281 ms of which 4 ms to minimize.
[2024-05-28 21:45:56] [INFO ] Deduced a trap composed of 199 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:45:56] [INFO ] Deduced a trap composed of 199 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:45:56] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:45:57] [INFO ] Deduced a trap composed of 213 places in 222 ms of which 4 ms to minimize.
[2024-05-28 21:45:57] [INFO ] Deduced a trap composed of 199 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:45:57] [INFO ] Deduced a trap composed of 205 places in 236 ms of which 3 ms to minimize.
[2024-05-28 21:45:57] [INFO ] Deduced a trap composed of 199 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:45:58] [INFO ] Deduced a trap composed of 199 places in 232 ms of which 3 ms to minimize.
[2024-05-28 21:45:58] [INFO ] Deduced a trap composed of 199 places in 240 ms of which 3 ms to minimize.
[2024-05-28 21:45:59] [INFO ] Deduced a trap composed of 199 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:45:59] [INFO ] Deduced a trap composed of 199 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:46:00] [INFO ] Deduced a trap composed of 297 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:46:00] [INFO ] Deduced a trap composed of 330 places in 254 ms of which 3 ms to minimize.
[2024-05-28 21:46:00] [INFO ] Deduced a trap composed of 254 places in 251 ms of which 3 ms to minimize.
[2024-05-28 21:46:00] [INFO ] Deduced a trap composed of 235 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:46:01] [INFO ] Deduced a trap composed of 200 places in 245 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/1859 variables, and 172 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1083/1083 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1083 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-05-28 21:46:12] [INFO ] Deduced a trap composed of 203 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:46:12] [INFO ] Deduced a trap composed of 200 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:46:12] [INFO ] Deduced a trap composed of 199 places in 235 ms of which 3 ms to minimize.
[2024-05-28 21:46:13] [INFO ] Deduced a trap composed of 200 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:46:13] [INFO ] Deduced a trap composed of 200 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:46:13] [INFO ] Deduced a trap composed of 199 places in 271 ms of which 4 ms to minimize.
[2024-05-28 21:46:13] [INFO ] Deduced a trap composed of 199 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:46:14] [INFO ] Deduced a trap composed of 199 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:46:14] [INFO ] Deduced a trap composed of 200 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:46:14] [INFO ] Deduced a trap composed of 200 places in 242 ms of which 3 ms to minimize.
[2024-05-28 21:46:14] [INFO ] Deduced a trap composed of 199 places in 239 ms of which 3 ms to minimize.
[2024-05-28 21:46:15] [INFO ] Deduced a trap composed of 203 places in 261 ms of which 3 ms to minimize.
[2024-05-28 21:46:15] [INFO ] Deduced a trap composed of 199 places in 259 ms of which 3 ms to minimize.
[2024-05-28 21:46:15] [INFO ] Deduced a trap composed of 203 places in 267 ms of which 3 ms to minimize.
[2024-05-28 21:46:16] [INFO ] Deduced a trap composed of 199 places in 302 ms of which 3 ms to minimize.
[2024-05-28 21:46:16] [INFO ] Deduced a trap composed of 199 places in 237 ms of which 3 ms to minimize.
[2024-05-28 21:46:16] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:46:16] [INFO ] Deduced a trap composed of 256 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:46:17] [INFO ] Deduced a trap composed of 203 places in 267 ms of which 3 ms to minimize.
[2024-05-28 21:46:17] [INFO ] Deduced a trap composed of 199 places in 297 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/1859 variables, and 192 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1083 constraints, Known Traps: 60/60 constraints]
After SMT, in 62117ms problems are : Problem set: 0 solved, 1083 unsolved
Search for dead transitions found 0 dead transitions in 62132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 774/906 places, 1089/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119489 ms. Remains : 774/906 places, 1089/1220 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-10
Stuttering criterion allowed to conclude after 32 steps with 2 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-10 finished in 119618 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 3 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1154
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1154
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1089
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1088
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1088
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1086
Applied a total of 268 rules in 102 ms. Remains 770 /906 variables (removed 136) and now considering 1086/1220 (removed 134) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:46:38] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-28 21:46:38] [INFO ] Computed 137 invariants in 13 ms
[2024-05-28 21:46:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:46:50] [INFO ] Deduced a trap composed of 247 places in 346 ms of which 5 ms to minimize.
[2024-05-28 21:46:50] [INFO ] Deduced a trap composed of 248 places in 236 ms of which 3 ms to minimize.
[2024-05-28 21:46:51] [INFO ] Deduced a trap composed of 260 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:46:51] [INFO ] Deduced a trap composed of 197 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:46:51] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 3 ms to minimize.
[2024-05-28 21:46:51] [INFO ] Deduced a trap composed of 208 places in 220 ms of which 4 ms to minimize.
[2024-05-28 21:46:52] [INFO ] Deduced a trap composed of 207 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:46:52] [INFO ] Deduced a trap composed of 213 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:46:52] [INFO ] Deduced a trap composed of 197 places in 218 ms of which 4 ms to minimize.
[2024-05-28 21:46:52] [INFO ] Deduced a trap composed of 207 places in 327 ms of which 5 ms to minimize.
[2024-05-28 21:46:53] [INFO ] Deduced a trap composed of 203 places in 224 ms of which 3 ms to minimize.
[2024-05-28 21:46:53] [INFO ] Deduced a trap composed of 206 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:46:53] [INFO ] Deduced a trap composed of 208 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:46:54] [INFO ] Deduced a trap composed of 201 places in 272 ms of which 4 ms to minimize.
[2024-05-28 21:46:54] [INFO ] Deduced a trap composed of 205 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:46:54] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 3 ms to minimize.
[2024-05-28 21:46:54] [INFO ] Deduced a trap composed of 197 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:46:55] [INFO ] Deduced a trap composed of 206 places in 228 ms of which 4 ms to minimize.
[2024-05-28 21:46:55] [INFO ] Deduced a trap composed of 225 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:46:55] [INFO ] Deduced a trap composed of 242 places in 334 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:46:57] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 4 ms to minimize.
[2024-05-28 21:46:57] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 3 ms to minimize.
[2024-05-28 21:46:58] [INFO ] Deduced a trap composed of 197 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:46:59] [INFO ] Deduced a trap composed of 244 places in 213 ms of which 4 ms to minimize.
[2024-05-28 21:46:59] [INFO ] Deduced a trap composed of 202 places in 231 ms of which 4 ms to minimize.
[2024-05-28 21:46:59] [INFO ] Deduced a trap composed of 204 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:47:00] [INFO ] Deduced a trap composed of 204 places in 351 ms of which 5 ms to minimize.
[2024-05-28 21:47:00] [INFO ] Deduced a trap composed of 202 places in 235 ms of which 3 ms to minimize.
[2024-05-28 21:47:00] [INFO ] Deduced a trap composed of 201 places in 334 ms of which 6 ms to minimize.
[2024-05-28 21:47:00] [INFO ] Deduced a trap composed of 207 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:47:01] [INFO ] Deduced a trap composed of 204 places in 222 ms of which 4 ms to minimize.
[2024-05-28 21:47:01] [INFO ] Deduced a trap composed of 199 places in 245 ms of which 4 ms to minimize.
SMT process timed out in 22929ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 22941ms
[2024-05-28 21:47:01] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:47:01] [INFO ] Invariant cache hit.
[2024-05-28 21:47:02] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2024-05-28 21:47:02] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:47:02] [INFO ] Invariant cache hit.
[2024-05-28 21:47:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:47:13] [INFO ] Implicit Places using invariants and state equation in 10948 ms returned []
Implicit Place search using SMT with State Equation took 12095 ms to find 0 implicit places.
[2024-05-28 21:47:13] [INFO ] Redundant transitions in 14 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:47:13] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:47:13] [INFO ] Invariant cache hit.
[2024-05-28 21:47:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:47:26] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 3 ms to minimize.
[2024-05-28 21:47:26] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 4 ms to minimize.
[2024-05-28 21:47:26] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 4 ms to minimize.
[2024-05-28 21:47:27] [INFO ] Deduced a trap composed of 206 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:47:27] [INFO ] Deduced a trap composed of 207 places in 316 ms of which 5 ms to minimize.
[2024-05-28 21:47:27] [INFO ] Deduced a trap composed of 208 places in 301 ms of which 5 ms to minimize.
[2024-05-28 21:47:28] [INFO ] Deduced a trap composed of 209 places in 231 ms of which 4 ms to minimize.
[2024-05-28 21:47:28] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
[2024-05-28 21:47:28] [INFO ] Deduced a trap composed of 206 places in 223 ms of which 3 ms to minimize.
[2024-05-28 21:47:28] [INFO ] Deduced a trap composed of 208 places in 316 ms of which 5 ms to minimize.
[2024-05-28 21:47:29] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-05-28 21:47:29] [INFO ] Deduced a trap composed of 202 places in 313 ms of which 5 ms to minimize.
[2024-05-28 21:47:29] [INFO ] Deduced a trap composed of 209 places in 220 ms of which 4 ms to minimize.
[2024-05-28 21:47:29] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 3 ms to minimize.
[2024-05-28 21:47:30] [INFO ] Deduced a trap composed of 206 places in 288 ms of which 5 ms to minimize.
[2024-05-28 21:47:30] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 3 ms to minimize.
[2024-05-28 21:47:30] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-05-28 21:47:30] [INFO ] Deduced a trap composed of 239 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:47:31] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:47:31] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:47:33] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 3 ms to minimize.
[2024-05-28 21:47:33] [INFO ] Deduced a trap composed of 136 places in 263 ms of which 3 ms to minimize.
[2024-05-28 21:47:33] [INFO ] Deduced a trap composed of 136 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:47:33] [INFO ] Deduced a trap composed of 136 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:47:34] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:47:34] [INFO ] Deduced a trap composed of 136 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:47:34] [INFO ] Deduced a trap composed of 136 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:47:35] [INFO ] Deduced a trap composed of 239 places in 324 ms of which 5 ms to minimize.
[2024-05-28 21:47:35] [INFO ] Deduced a trap composed of 266 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:47:35] [INFO ] Deduced a trap composed of 197 places in 213 ms of which 4 ms to minimize.
[2024-05-28 21:47:36] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 6 ms to minimize.
[2024-05-28 21:47:36] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
[2024-05-28 21:47:36] [INFO ] Deduced a trap composed of 197 places in 223 ms of which 3 ms to minimize.
[2024-05-28 21:47:36] [INFO ] Deduced a trap composed of 197 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:47:37] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:47:38] [INFO ] Deduced a trap composed of 245 places in 287 ms of which 4 ms to minimize.
[2024-05-28 21:47:38] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-05-28 21:47:38] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 3 ms to minimize.
[2024-05-28 21:47:39] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:47:39] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:47:59] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 2 ms to minimize.
[2024-05-28 21:48:02] [INFO ] Deduced a trap composed of 267 places in 321 ms of which 5 ms to minimize.
[2024-05-28 21:48:03] [INFO ] Deduced a trap composed of 248 places in 396 ms of which 5 ms to minimize.
[2024-05-28 21:48:04] [INFO ] Deduced a trap composed of 236 places in 388 ms of which 5 ms to minimize.
[2024-05-28 21:48:04] [INFO ] Deduced a trap composed of 240 places in 314 ms of which 4 ms to minimize.
[2024-05-28 21:48:07] [INFO ] Deduced a trap composed of 349 places in 395 ms of which 5 ms to minimize.
[2024-05-28 21:48:07] [INFO ] Deduced a trap composed of 337 places in 314 ms of which 5 ms to minimize.
[2024-05-28 21:48:08] [INFO ] Deduced a trap composed of 265 places in 387 ms of which 6 ms to minimize.
[2024-05-28 21:48:08] [INFO ] Deduced a trap composed of 246 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:48:14] [INFO ] Deduced a trap composed of 243 places in 374 ms of which 6 ms to minimize.
[2024-05-28 21:48:15] [INFO ] Deduced a trap composed of 259 places in 252 ms of which 4 ms to minimize.
SMT process timed out in 62261ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/906 places, 1086/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97464 ms. Remains : 770/906 places, 1086/1220 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-11
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-11 finished in 97534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 904 transition count 1156
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 840 transition count 1155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1091
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 775 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 774 transition count 1090
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 774 transition count 1090
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 772 transition count 1088
Applied a total of 264 rules in 104 ms. Remains 772 /906 variables (removed 134) and now considering 1088/1220 (removed 132) transitions.
Running 1082 sub problems to find dead transitions.
[2024-05-28 21:48:16] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
// Phase 1: matrix 1084 rows 772 cols
[2024-05-28 21:48:16] [INFO ] Computed 137 invariants in 14 ms
[2024-05-28 21:48:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:48:29] [INFO ] Deduced a trap composed of 205 places in 353 ms of which 6 ms to minimize.
[2024-05-28 21:48:30] [INFO ] Deduced a trap composed of 199 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:48:30] [INFO ] Deduced a trap composed of 204 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:48:30] [INFO ] Deduced a trap composed of 210 places in 235 ms of which 3 ms to minimize.
[2024-05-28 21:48:30] [INFO ] Deduced a trap composed of 210 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:48:31] [INFO ] Deduced a trap composed of 199 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:48:31] [INFO ] Deduced a trap composed of 245 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:48:31] [INFO ] Deduced a trap composed of 242 places in 318 ms of which 5 ms to minimize.
[2024-05-28 21:48:32] [INFO ] Deduced a trap composed of 241 places in 310 ms of which 4 ms to minimize.
[2024-05-28 21:48:32] [INFO ] Deduced a trap composed of 229 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:48:32] [INFO ] Deduced a trap composed of 220 places in 322 ms of which 5 ms to minimize.
[2024-05-28 21:48:33] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 5 ms to minimize.
[2024-05-28 21:48:34] [INFO ] Deduced a trap composed of 238 places in 330 ms of which 6 ms to minimize.
[2024-05-28 21:48:34] [INFO ] Deduced a trap composed of 261 places in 311 ms of which 5 ms to minimize.
[2024-05-28 21:48:34] [INFO ] Deduced a trap composed of 212 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:48:35] [INFO ] Deduced a trap composed of 245 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:48:35] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:48:36] [INFO ] Deduced a trap composed of 265 places in 341 ms of which 5 ms to minimize.
[2024-05-28 21:48:36] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 3 ms to minimize.
[2024-05-28 21:48:36] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:48:38] [INFO ] Deduced a trap composed of 198 places in 321 ms of which 5 ms to minimize.
[2024-05-28 21:48:38] [INFO ] Deduced a trap composed of 210 places in 352 ms of which 5 ms to minimize.
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 208 places in 333 ms of which 5 ms to minimize.
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 208 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 207 places in 314 ms of which 5 ms to minimize.
SMT process timed out in 23622ms, After SMT, problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 23635ms
[2024-05-28 21:48:39] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2024-05-28 21:48:39] [INFO ] Invariant cache hit.
[2024-05-28 21:48:40] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2024-05-28 21:48:40] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2024-05-28 21:48:40] [INFO ] Invariant cache hit.
[2024-05-28 21:48:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:48:54] [INFO ] Implicit Places using invariants and state equation in 13568 ms returned []
Implicit Place search using SMT with State Equation took 14716 ms to find 0 implicit places.
[2024-05-28 21:48:54] [INFO ] Redundant transitions in 15 ms returned []
Running 1082 sub problems to find dead transitions.
[2024-05-28 21:48:54] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2024-05-28 21:48:54] [INFO ] Invariant cache hit.
[2024-05-28 21:48:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:49:06] [INFO ] Deduced a trap composed of 245 places in 328 ms of which 5 ms to minimize.
[2024-05-28 21:49:07] [INFO ] Deduced a trap composed of 257 places in 296 ms of which 3 ms to minimize.
[2024-05-28 21:49:07] [INFO ] Deduced a trap composed of 253 places in 312 ms of which 6 ms to minimize.
[2024-05-28 21:49:08] [INFO ] Deduced a trap composed of 250 places in 356 ms of which 5 ms to minimize.
[2024-05-28 21:49:08] [INFO ] Deduced a trap composed of 231 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:49:08] [INFO ] Deduced a trap composed of 232 places in 336 ms of which 5 ms to minimize.
[2024-05-28 21:49:08] [INFO ] Deduced a trap composed of 199 places in 307 ms of which 5 ms to minimize.
[2024-05-28 21:49:09] [INFO ] Deduced a trap composed of 199 places in 231 ms of which 3 ms to minimize.
[2024-05-28 21:49:09] [INFO ] Deduced a trap composed of 199 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:49:09] [INFO ] Deduced a trap composed of 199 places in 326 ms of which 5 ms to minimize.
[2024-05-28 21:49:10] [INFO ] Deduced a trap composed of 198 places in 336 ms of which 7 ms to minimize.
[2024-05-28 21:49:10] [INFO ] Deduced a trap composed of 198 places in 305 ms of which 6 ms to minimize.
[2024-05-28 21:49:10] [INFO ] Deduced a trap composed of 251 places in 233 ms of which 3 ms to minimize.
[2024-05-28 21:49:11] [INFO ] Deduced a trap composed of 199 places in 346 ms of which 4 ms to minimize.
[2024-05-28 21:49:11] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 3 ms to minimize.
[2024-05-28 21:49:11] [INFO ] Deduced a trap composed of 199 places in 345 ms of which 5 ms to minimize.
[2024-05-28 21:49:12] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 3 ms to minimize.
[2024-05-28 21:49:12] [INFO ] Deduced a trap composed of 199 places in 238 ms of which 3 ms to minimize.
[2024-05-28 21:49:12] [INFO ] Deduced a trap composed of 199 places in 333 ms of which 5 ms to minimize.
[2024-05-28 21:49:12] [INFO ] Deduced a trap composed of 199 places in 326 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:49:14] [INFO ] Deduced a trap composed of 240 places in 214 ms of which 4 ms to minimize.
[2024-05-28 21:49:14] [INFO ] Deduced a trap composed of 205 places in 305 ms of which 5 ms to minimize.
[2024-05-28 21:49:15] [INFO ] Deduced a trap composed of 224 places in 340 ms of which 6 ms to minimize.
[2024-05-28 21:49:16] [INFO ] Deduced a trap composed of 198 places in 384 ms of which 4 ms to minimize.
[2024-05-28 21:49:17] [INFO ] Deduced a trap composed of 198 places in 368 ms of which 5 ms to minimize.
[2024-05-28 21:49:18] [INFO ] Deduced a trap composed of 259 places in 321 ms of which 5 ms to minimize.
[2024-05-28 21:49:19] [INFO ] Deduced a trap composed of 210 places in 295 ms of which 5 ms to minimize.
[2024-05-28 21:49:19] [INFO ] Deduced a trap composed of 198 places in 269 ms of which 4 ms to minimize.
[2024-05-28 21:49:20] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 3 ms to minimize.
[2024-05-28 21:49:20] [INFO ] Deduced a trap composed of 199 places in 218 ms of which 3 ms to minimize.
[2024-05-28 21:49:21] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 3 ms to minimize.
[2024-05-28 21:49:21] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 6 ms to minimize.
[2024-05-28 21:49:21] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:49:23] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:49:23] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 3 ms to minimize.
[2024-05-28 21:49:24] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 4 ms to minimize.
[2024-05-28 21:49:24] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 4 ms to minimize.
[2024-05-28 21:49:25] [INFO ] Deduced a trap composed of 253 places in 373 ms of which 4 ms to minimize.
[2024-05-28 21:49:25] [INFO ] Deduced a trap composed of 198 places in 305 ms of which 3 ms to minimize.
[2024-05-28 21:49:25] [INFO ] Deduced a trap composed of 206 places in 247 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1856 variables, and 172 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:49:32] [INFO ] Deduced a trap composed of 266 places in 276 ms of which 5 ms to minimize.
[2024-05-28 21:49:33] [INFO ] Deduced a trap composed of 248 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:49:33] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 3 ms to minimize.
[2024-05-28 21:49:33] [INFO ] Deduced a trap composed of 251 places in 229 ms of which 3 ms to minimize.
[2024-05-28 21:49:34] [INFO ] Deduced a trap composed of 245 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:49:34] [INFO ] Deduced a trap composed of 260 places in 256 ms of which 5 ms to minimize.
[2024-05-28 21:49:34] [INFO ] Deduced a trap composed of 246 places in 211 ms of which 3 ms to minimize.
[2024-05-28 21:49:34] [INFO ] Deduced a trap composed of 274 places in 252 ms of which 3 ms to minimize.
[2024-05-28 21:49:35] [INFO ] Deduced a trap composed of 271 places in 220 ms of which 3 ms to minimize.
[2024-05-28 21:49:35] [INFO ] Deduced a trap composed of 253 places in 230 ms of which 3 ms to minimize.
[2024-05-28 21:49:35] [INFO ] Deduced a trap composed of 277 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:49:35] [INFO ] Deduced a trap composed of 249 places in 213 ms of which 3 ms to minimize.
[2024-05-28 21:49:36] [INFO ] Deduced a trap composed of 243 places in 218 ms of which 3 ms to minimize.
[2024-05-28 21:49:36] [INFO ] Deduced a trap composed of 251 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:49:36] [INFO ] Deduced a trap composed of 241 places in 229 ms of which 3 ms to minimize.
[2024-05-28 21:49:36] [INFO ] Deduced a trap composed of 267 places in 296 ms of which 4 ms to minimize.
[2024-05-28 21:49:37] [INFO ] Deduced a trap composed of 249 places in 275 ms of which 4 ms to minimize.
[2024-05-28 21:49:37] [INFO ] Deduced a trap composed of 261 places in 218 ms of which 4 ms to minimize.
[2024-05-28 21:49:37] [INFO ] Deduced a trap composed of 253 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:49:38] [INFO ] Deduced a trap composed of 285 places in 240 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:49:44] [INFO ] Deduced a trap composed of 202 places in 363 ms of which 5 ms to minimize.
[2024-05-28 21:49:45] [INFO ] Deduced a trap composed of 199 places in 312 ms of which 5 ms to minimize.
[2024-05-28 21:49:45] [INFO ] Deduced a trap composed of 198 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:49:45] [INFO ] Deduced a trap composed of 202 places in 286 ms of which 5 ms to minimize.
[2024-05-28 21:49:46] [INFO ] Deduced a trap composed of 199 places in 312 ms of which 5 ms to minimize.
[2024-05-28 21:49:46] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 3 ms to minimize.
[2024-05-28 21:49:47] [INFO ] Deduced a trap composed of 235 places in 331 ms of which 4 ms to minimize.
[2024-05-28 21:49:47] [INFO ] Deduced a trap composed of 199 places in 274 ms of which 5 ms to minimize.
[2024-05-28 21:49:47] [INFO ] Deduced a trap composed of 202 places in 297 ms of which 4 ms to minimize.
[2024-05-28 21:49:48] [INFO ] Deduced a trap composed of 199 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:49:48] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:49:48] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:49:48] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:49:49] [INFO ] Deduced a trap composed of 203 places in 300 ms of which 4 ms to minimize.
[2024-05-28 21:49:49] [INFO ] Deduced a trap composed of 199 places in 282 ms of which 4 ms to minimize.
[2024-05-28 21:49:49] [INFO ] Deduced a trap composed of 202 places in 270 ms of which 4 ms to minimize.
[2024-05-28 21:49:50] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 6 ms to minimize.
[2024-05-28 21:49:50] [INFO ] Deduced a trap composed of 202 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:49:50] [INFO ] Deduced a trap composed of 199 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:49:51] [INFO ] Deduced a trap composed of 198 places in 286 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1856 variables, and 212 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1082 constraints, Known Traps: 80/80 constraints]
After SMT, in 62809ms problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 62819ms
Starting structural reductions in SI_LTL mode, iteration 1 : 772/906 places, 1088/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101306 ms. Remains : 772/906 places, 1088/1220 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-12
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-12 finished in 101383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 905 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 904 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 904 transition count 1219
Applied a total of 3 rules in 51 ms. Remains 904 /906 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:49:57] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 904 cols
[2024-05-28 21:49:57] [INFO ] Computed 138 invariants in 36 ms
[2024-05-28 21:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 1213 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 Real declared 897/2119 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, Generalized P Invariants (flows): 18/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:50:23] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 2 ms to minimize.
[2024-05-28 21:50:24] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 2 ms to minimize.
[2024-05-28 21:50:31] [INFO ] Deduced a trap composed of 137 places in 277 ms of which 4 ms to minimize.
[2024-05-28 21:50:32] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:50:38] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 21:50:39] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:50:39] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2119 variables, and 138 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, Generalized P Invariants (flows): 18/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 7/7 constraints]
After SMT, in 43266ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 43280ms
[2024-05-28 21:50:40] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:50:40] [INFO ] Invariant cache hit.
[2024-05-28 21:50:42] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2024-05-28 21:50:42] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:50:42] [INFO ] Invariant cache hit.
[2024-05-28 21:50:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:51:03] [INFO ] Implicit Places using invariants and state equation in 21439 ms returned []
Implicit Place search using SMT with State Equation took 22760 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:51:03] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:51:03] [INFO ] Invariant cache hit.
[2024-05-28 21:51:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 7/904 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/2119 variables, and 138 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:51:40] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 21:51:40] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 3 ms to minimize.
[2024-05-28 21:51:48] [INFO ] Deduced a trap composed of 137 places in 277 ms of which 4 ms to minimize.
[2024-05-28 21:51:48] [INFO ] Deduced a trap composed of 137 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:51:49] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 2 ms to minimize.
[2024-05-28 21:51:50] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 2 ms to minimize.
[2024-05-28 21:51:56] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 8 ms to minimize.
[2024-05-28 21:51:56] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
[2024-05-28 21:51:57] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 3 ms to minimize.
[2024-05-28 21:51:57] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 10/141 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2119 variables, and 141 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, Generalized P Invariants (flows): 18/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 10/10 constraints]
After SMT, in 63341ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 63355ms
Starting structural reductions in LTL mode, iteration 1 : 904/906 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129454 ms. Remains : 904/906 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-14 finished in 129594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 1220/1220 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1155
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1091
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 258 place count 775 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 259 place count 774 transition count 1090
Iterating global reduction 2 with 1 rules applied. Total rules applied 260 place count 774 transition count 1090
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 772 transition count 1088
Applied a total of 264 rules in 124 ms. Remains 772 /906 variables (removed 134) and now considering 1088/1220 (removed 132) transitions.
Running 1082 sub problems to find dead transitions.
[2024-05-28 21:52:07] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
// Phase 1: matrix 1084 rows 772 cols
[2024-05-28 21:52:07] [INFO ] Computed 137 invariants in 37 ms
[2024-05-28 21:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:52:21] [INFO ] Deduced a trap composed of 198 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:52:21] [INFO ] Deduced a trap composed of 198 places in 282 ms of which 3 ms to minimize.
[2024-05-28 21:52:22] [INFO ] Deduced a trap composed of 198 places in 476 ms of which 23 ms to minimize.
[2024-05-28 21:52:22] [INFO ] Deduced a trap composed of 256 places in 330 ms of which 4 ms to minimize.
[2024-05-28 21:52:22] [INFO ] Deduced a trap composed of 135 places in 300 ms of which 5 ms to minimize.
[2024-05-28 21:52:23] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:52:23] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 3 ms to minimize.
[2024-05-28 21:52:23] [INFO ] Deduced a trap composed of 247 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:52:23] [INFO ] Deduced a trap composed of 241 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:52:24] [INFO ] Deduced a trap composed of 247 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:52:24] [INFO ] Deduced a trap composed of 229 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:52:24] [INFO ] Deduced a trap composed of 245 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:52:25] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:52:25] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:52:25] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:52:25] [INFO ] Deduced a trap composed of 246 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:52:26] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:52:26] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:52:26] [INFO ] Deduced a trap composed of 198 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:52:27] [INFO ] Deduced a trap composed of 198 places in 397 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:52:28] [INFO ] Deduced a trap composed of 198 places in 331 ms of which 5 ms to minimize.
[2024-05-28 21:52:28] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 5 ms to minimize.
[2024-05-28 21:52:29] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 5 ms to minimize.
[2024-05-28 21:52:29] [INFO ] Deduced a trap composed of 198 places in 292 ms of which 5 ms to minimize.
[2024-05-28 21:52:30] [INFO ] Deduced a trap composed of 247 places in 348 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1856 variables, and 157 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 25/157 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:52:38] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2024-05-28 21:52:43] [INFO ] Deduced a trap composed of 243 places in 367 ms of which 5 ms to minimize.
[2024-05-28 21:52:43] [INFO ] Deduced a trap composed of 237 places in 385 ms of which 5 ms to minimize.
[2024-05-28 21:52:44] [INFO ] Deduced a trap composed of 247 places in 392 ms of which 5 ms to minimize.
[2024-05-28 21:52:44] [INFO ] Deduced a trap composed of 297 places in 344 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1856 variables, and 162 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1082 constraints, Known Traps: 30/30 constraints]
After SMT, in 43212ms problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 43227ms
[2024-05-28 21:52:50] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2024-05-28 21:52:50] [INFO ] Invariant cache hit.
[2024-05-28 21:52:51] [INFO ] Implicit Places using invariants in 1292 ms returned []
[2024-05-28 21:52:51] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2024-05-28 21:52:51] [INFO ] Invariant cache hit.
[2024-05-28 21:52:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:53:06] [INFO ] Implicit Places using invariants and state equation in 15183 ms returned []
Implicit Place search using SMT with State Equation took 16475 ms to find 0 implicit places.
[2024-05-28 21:53:06] [INFO ] Redundant transitions in 34 ms returned []
Running 1082 sub problems to find dead transitions.
[2024-05-28 21:53:06] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2024-05-28 21:53:06] [INFO ] Invariant cache hit.
[2024-05-28 21:53:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:53:19] [INFO ] Deduced a trap composed of 244 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:53:19] [INFO ] Deduced a trap composed of 211 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:53:20] [INFO ] Deduced a trap composed of 238 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:53:20] [INFO ] Deduced a trap composed of 250 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:53:20] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:53:21] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 3 ms to minimize.
[2024-05-28 21:53:21] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 5 ms to minimize.
[2024-05-28 21:53:21] [INFO ] Deduced a trap composed of 199 places in 306 ms of which 4 ms to minimize.
[2024-05-28 21:53:22] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 5 ms to minimize.
[2024-05-28 21:53:22] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:53:23] [INFO ] Deduced a trap composed of 199 places in 323 ms of which 5 ms to minimize.
[2024-05-28 21:53:23] [INFO ] Deduced a trap composed of 199 places in 271 ms of which 4 ms to minimize.
[2024-05-28 21:53:24] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 4 ms to minimize.
[2024-05-28 21:53:24] [INFO ] Deduced a trap composed of 198 places in 224 ms of which 4 ms to minimize.
[2024-05-28 21:53:24] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 3 ms to minimize.
[2024-05-28 21:53:25] [INFO ] Deduced a trap composed of 235 places in 230 ms of which 7 ms to minimize.
[2024-05-28 21:53:25] [INFO ] Deduced a trap composed of 198 places in 360 ms of which 5 ms to minimize.
[2024-05-28 21:53:25] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 3 ms to minimize.
[2024-05-28 21:53:26] [INFO ] Deduced a trap composed of 241 places in 235 ms of which 3 ms to minimize.
[2024-05-28 21:53:26] [INFO ] Deduced a trap composed of 209 places in 319 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:53:28] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 5 ms to minimize.
[2024-05-28 21:53:28] [INFO ] Deduced a trap composed of 198 places in 330 ms of which 5 ms to minimize.
[2024-05-28 21:53:28] [INFO ] Deduced a trap composed of 238 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:53:29] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:53:29] [INFO ] Deduced a trap composed of 205 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:53:29] [INFO ] Deduced a trap composed of 198 places in 334 ms of which 6 ms to minimize.
[2024-05-28 21:53:30] [INFO ] Deduced a trap composed of 226 places in 324 ms of which 5 ms to minimize.
[2024-05-28 21:53:30] [INFO ] Deduced a trap composed of 259 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:53:31] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:53:31] [INFO ] Deduced a trap composed of 199 places in 236 ms of which 3 ms to minimize.
[2024-05-28 21:53:31] [INFO ] Deduced a trap composed of 199 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:53:33] [INFO ] Deduced a trap composed of 208 places in 316 ms of which 5 ms to minimize.
[2024-05-28 21:53:33] [INFO ] Deduced a trap composed of 250 places in 287 ms of which 4 ms to minimize.
[2024-05-28 21:53:33] [INFO ] Deduced a trap composed of 198 places in 276 ms of which 4 ms to minimize.
[2024-05-28 21:53:34] [INFO ] Deduced a trap composed of 206 places in 271 ms of which 4 ms to minimize.
[2024-05-28 21:53:34] [INFO ] Deduced a trap composed of 239 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:53:34] [INFO ] Deduced a trap composed of 198 places in 286 ms of which 4 ms to minimize.
[2024-05-28 21:53:34] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:53:35] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 4 ms to minimize.
[2024-05-28 21:53:35] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1856 variables, and 172 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:53:48] [INFO ] Deduced a trap composed of 198 places in 326 ms of which 5 ms to minimize.
[2024-05-28 21:53:49] [INFO ] Deduced a trap composed of 208 places in 321 ms of which 4 ms to minimize.
[2024-05-28 21:53:49] [INFO ] Deduced a trap composed of 244 places in 323 ms of which 7 ms to minimize.
[2024-05-28 21:53:49] [INFO ] Deduced a trap composed of 198 places in 337 ms of which 5 ms to minimize.
[2024-05-28 21:53:50] [INFO ] Deduced a trap composed of 243 places in 310 ms of which 5 ms to minimize.
[2024-05-28 21:53:50] [INFO ] Deduced a trap composed of 256 places in 326 ms of which 5 ms to minimize.
[2024-05-28 21:53:50] [INFO ] Deduced a trap composed of 243 places in 324 ms of which 5 ms to minimize.
[2024-05-28 21:53:51] [INFO ] Deduced a trap composed of 262 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:53:51] [INFO ] Deduced a trap composed of 264 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:53:51] [INFO ] Deduced a trap composed of 198 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:53:52] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:53:52] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-28 21:53:53] [INFO ] Deduced a trap composed of 200 places in 303 ms of which 4 ms to minimize.
[2024-05-28 21:53:53] [INFO ] Deduced a trap composed of 201 places in 286 ms of which 4 ms to minimize.
[2024-05-28 21:53:53] [INFO ] Deduced a trap composed of 198 places in 279 ms of which 4 ms to minimize.
[2024-05-28 21:53:54] [INFO ] Deduced a trap composed of 198 places in 269 ms of which 4 ms to minimize.
[2024-05-28 21:53:54] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:53:54] [INFO ] Deduced a trap composed of 198 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:53:55] [INFO ] Deduced a trap composed of 201 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:53:55] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1856 variables, and 192 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1082 constraints, Known Traps: 60/60 constraints]
After SMT, in 62602ms problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 62616ms
Starting structural reductions in SI_LTL mode, iteration 1 : 772/906 places, 1088/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122489 ms. Remains : 772/906 places, 1088/1220 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-15
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-15 finished in 122543 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)))'
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))||G((F(p2)&&p1))))'
[2024-05-28 21:54:09] [INFO ] Flatten gal took : 86 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10882453925107581214
[2024-05-28 21:54:10] [INFO ] Computing symmetric may disable matrix : 1220 transitions.
[2024-05-28 21:54:10] [INFO ] Applying decomposition
[2024-05-28 21:54:10] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:54:10] [INFO ] Computing symmetric may enable matrix : 1220 transitions.
[2024-05-28 21:54:10] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:54:10] [INFO ] Flatten gal took : 89 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/graph412050154189036446.txt' '-o' '/tmp/graph412050154189036446.bin' '-w' '/tmp/graph412050154189036446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph412050154189036446.bin' '-l' '-1' '-v' '-w' '/tmp/graph412050154189036446.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:54:10] [INFO ] Decomposing Gal with order
[2024-05-28 21:54:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:54:10] [INFO ] Computing Do-Not-Accords matrix : 1220 transitions.
[2024-05-28 21:54:10] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:54:10] [INFO ] Built C files in 610ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10882453925107581214
Running compilation step : cd /tmp/ltsmin10882453925107581214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
[2024-05-28 21:54:10] [INFO ] Removed a total of 1625 redundant transitions.
[2024-05-28 21:54:10] [INFO ] Flatten gal took : 134 ms
[2024-05-28 21:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 16 ms.
[2024-05-28 21:54:10] [INFO ] Time to serialize gal into /tmp/LTLFireability8330330428125258678.gal : 17 ms
[2024-05-28 21:54:10] [INFO ] Time to serialize properties into /tmp/LTLFireability17685717050438559792.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/LTLFireability8330330428125258678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17685717050438559792.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...277
Read 2 LTL properties
Checking formula 0 : !((G(F("(((((((((i6.u119.f2_13<1)||(i6.u8.FetchJobB_1<1))||(i6.u8.mo2<1))&&(((i6.u119.f2_40<1)||(i6.u8.FetchJobB_1<1))||(i6.u8.mo2<1))...3863
Formula 0 simplified : FG!"(((((((((i6.u119.f2_13<1)||(i6.u8.FetchJobB_1<1))||(i6.u8.mo2<1))&&(((i6.u119.f2_40<1)||(i6.u8.FetchJobB_1<1))||(i6.u8.mo2<1)))&...3857
Compilation finished in 6231 ms.
Running link step : cd /tmp/ltsmin10882453925107581214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 114 ms.
Running LTSmin : cd /tmp/ltsmin10882453925107581214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10882453925107581214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10882453925107581214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp1==true)))||[]((<>((LTLAPp3==true))&&(LTLAPp2==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="PolyORBNT-PT-S05J60"
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 PolyORBNT-PT-S05J60, 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 r290-tajo-171654447200468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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