fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

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

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447200489.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-S10J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200489
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 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 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 14M 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-S10J30-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716933143479

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 21:52:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:52:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:52:25] [INFO ] Load time of PNML (sax parser for PT used): 747 ms
[2024-05-28 21:52:25] [INFO ] Transformed 664 places.
[2024-05-28 21:52:25] [INFO ] Transformed 12050 transitions.
[2024-05-28 21:52:25] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 1012 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 185 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Applied a total of 10 rules in 124 ms. Remains 654 /664 variables (removed 10) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-05-28 21:52:26] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 654 cols
[2024-05-28 21:52:26] [INFO ] Computed 82 invariants in 145 ms
[2024-05-28 21:52:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 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 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.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 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.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 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.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 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.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 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 (/ 1.0 2.0))
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.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 9.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 4.0)
(s112 0.0)
(s113 4.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 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 2.0)
(s140 0.0)
(s141 0.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.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 (/ 1.0 2.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 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 4.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20108 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 57980ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 58084ms
[2024-05-28 21:53:24] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:53:24] [INFO ] Invariant cache hit.
[2024-05-28 21:53:25] [INFO ] Implicit Places using invariants in 1012 ms returned []
[2024-05-28 21:53:25] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:53:25] [INFO ] Invariant cache hit.
[2024-05-28 21:53:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:53:32] [INFO ] Implicit Places using invariants and state equation in 7539 ms returned []
Implicit Place search using SMT with State Equation took 8560 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-28 21:53:33] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:53:33] [INFO ] Invariant cache hit.
[2024-05-28 21:53:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 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 1.0)
(s7 1.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 1.0)
(s21 0.0)
(s22 0.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 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.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 0.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 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 1.0)
(s102 9.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 4.0)
(s112 0.0)
(s113 4.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.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 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 1.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 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.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)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 4.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 0.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 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 4.0)
(s209 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 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 0.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 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 9.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 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.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 0.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 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 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 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.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 1.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 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 4.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 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.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 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.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 1.0)
(s438 4.0)
(s439 0.0)
(s440 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 4.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 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 4.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 1.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)
(s500 0.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 4.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 1.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 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/654 variables, 11/82 constraints. Problems are: Problem set: 46 solved, 1883 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/2585 variables, and 82 constraints, problems are : Problem set: 46 solved, 1883 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 80699ms problems are : Problem set: 46 solved, 1883 unsolved
Search for dead transitions found 46 dead transitions in 80740ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1894/1940 transitions.
Applied a total of 0 rules in 18 ms. Remains 654 /654 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147640 ms. Remains : 654/664 places, 1894/1940 transitions.
Support contains 185 out of 654 places after structural reductions.
[2024-05-28 21:54:54] [INFO ] Flatten gal took : 310 ms
[2024-05-28 21:54:54] [INFO ] Flatten gal took : 197 ms
[2024-05-28 21:54:54] [INFO ] Input system was already deterministic with 1894 transitions.
RANDOM walk for 40000 steps (2240 resets) in 6052 ms. (6 steps per ms) remains 60/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 63 ms. (62 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (37 resets) in 35 ms. (111 steps per ms) remains 58/60 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 49 ms. (80 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 62 ms. (63 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (40 resets) in 104 ms. (38 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (39 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (41 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 27 ms. (142 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (39 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (41 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 60 ms. (65 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (41 resets) in 46 ms. (85 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (41 resets) in 27 ms. (142 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (39 resets) in 41 ms. (95 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (39 resets) in 35 ms. (111 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (42 resets) in 34 ms. (114 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 34 ms. (114 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (41 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (41 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 47 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (39 resets) in 30 ms. (129 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (41 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (41 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (40 resets) in 29 ms. (133 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 50 ms. (78 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (41 resets) in 36 ms. (108 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 30 ms. (129 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (37 resets) in 41 ms. (95 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 38 ms. (102 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (38 resets) in 434 ms. (9 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
[2024-05-28 21:54:57] [INFO ] Flow matrix only has 1885 transitions (discarded 9 similar events)
// Phase 1: matrix 1885 rows 654 cols
[2024-05-28 21:54:57] [INFO ] Computed 82 invariants in 67 ms
[2024-05-28 21:54:57] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 335/504 variables, 52/52 constraints. Problems are: Problem set: 24 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 2/54 constraints. Problems are: Problem set: 24 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/54 constraints. Problems are: Problem set: 24 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 100/604 variables, 10/64 constraints. Problems are: Problem set: 24 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/64 constraints. Problems are: Problem set: 24 solved, 33 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 6 (OVERLAPS) 49/653 variables, 17/81 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/81 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/654 variables, 1/82 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/82 constraints. Problems are: Problem set: 41 solved, 16 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 10 (OVERLAPS) 1885/2539 variables, 654/736 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2539 variables, 1/737 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2539 variables, 0/737 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/2539 variables, 0/737 constraints. Problems are: Problem set: 42 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2539/2539 variables, and 737 constraints, problems are : Problem set: 42 solved, 15 unsolved in 3070 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 654/654 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 244/275 variables, 21/21 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/21 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 177/452 variables, 27/48 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/48 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 120/572 variables, 12/60 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/60 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 78/650 variables, 19/79 constraints. Problems are: Problem set: 42 solved, 15 unsolved
[2024-05-28 21:55:02] [INFO ] Deduced a trap composed of 24 places in 653 ms of which 43 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/80 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 0/80 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 3/653 variables, 3/83 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 0/83 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1885/2538 variables, 653/736 constraints. Problems are: Problem set: 42 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2538 variables, 1/737 constraints. Problems are: Problem set: 42 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2538/2539 variables, and 752 constraints, problems are : Problem set: 42 solved, 15 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 653/654 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/55 constraints, Known Traps: 1/1 constraints]
After SMT, in 8348ms problems are : Problem set: 42 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 654/654 places, 1894/1894 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 654 transition count 1866
Reduce places removed 28 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 33 rules applied. Total rules applied 61 place count 626 transition count 1861
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 621 transition count 1861
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 66 place count 621 transition count 1831
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 126 place count 591 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 590 transition count 1830
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 590 transition count 1830
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 588 transition count 1828
Applied a total of 132 rules in 383 ms. Remains 588 /654 variables (removed 66) and now considering 1828/1894 (removed 66) transitions.
Running 1817 sub problems to find dead transitions.
[2024-05-28 21:55:06] [INFO ] Flow matrix only has 1819 transitions (discarded 9 similar events)
// Phase 1: matrix 1819 rows 588 cols
[2024-05-28 21:55:06] [INFO ] Computed 82 invariants in 28 ms
[2024-05-28 21:55:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/2407 variables, and 72 constraints, problems are : Problem set: 0 solved, 1817 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/588 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1817/1817 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1817 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1817 unsolved
[2024-05-28 21:55:51] [INFO ] Deduced a trap composed of 18 places in 399 ms of which 3 ms to minimize.
[2024-05-28 21:55:56] [INFO ] Deduced a trap composed of 163 places in 381 ms of which 6 ms to minimize.
[2024-05-28 21:55:56] [INFO ] Deduced a trap composed of 141 places in 497 ms of which 3 ms to minimize.
[2024-05-28 21:55:57] [INFO ] Deduced a trap composed of 144 places in 519 ms of which 4 ms to minimize.
[2024-05-28 21:55:58] [INFO ] Deduced a trap composed of 183 places in 488 ms of which 3 ms to minimize.
[2024-05-28 21:55:59] [INFO ] Deduced a trap composed of 15 places in 426 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/2407 variables, and 78 constraints, problems are : Problem set: 0 solved, 1817 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/588 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1817 constraints, Known Traps: 6/6 constraints]
After SMT, in 62397ms problems are : Problem set: 0 solved, 1817 unsolved
Search for dead transitions found 0 dead transitions in 62424ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62818 ms. Remains : 588/654 places, 1828/1894 transitions.
RANDOM walk for 40000 steps (2825 resets) in 1723 ms. (23 steps per ms) remains 0/15 properties
Successfully simplified 42 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:56:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 21:56:09] [INFO ] Flatten gal took : 157 ms
[2024-05-28 21:56:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:56:09] [INFO ] Flatten gal took : 125 ms
[2024-05-28 21:56:10] [INFO ] Input system was already deterministic with 1894 transitions.
Support contains 59 out of 654 places (down from 61) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1894/1894 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1893
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1893
Applied a total of 2 rules in 42 ms. Remains 653 /654 variables (removed 1) and now considering 1893/1894 (removed 1) transitions.
Running 1882 sub problems to find dead transitions.
[2024-05-28 21:56:10] [INFO ] Flow matrix only has 1884 transitions (discarded 9 similar events)
// Phase 1: matrix 1884 rows 653 cols
[2024-05-28 21:56:10] [INFO ] Computed 82 invariants in 51 ms
[2024-05-28 21:56:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2537 variables, and 71 constraints, problems are : Problem set: 0 solved, 1882 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1882/1882 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
[2024-05-28 21:57:02] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 7 ms to minimize.
[2024-05-28 21:57:04] [INFO ] Deduced a trap composed of 82 places in 206 ms of which 2 ms to minimize.
[2024-05-28 21:57:12] [INFO ] Deduced a trap composed of 83 places in 239 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2537 variables, and 74 constraints, problems are : Problem set: 0 solved, 1882 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1882 constraints, Known Traps: 3/3 constraints]
After SMT, in 64173ms problems are : Problem set: 0 solved, 1882 unsolved
Search for dead transitions found 0 dead transitions in 64199ms
[2024-05-28 21:57:14] [INFO ] Flow matrix only has 1884 transitions (discarded 9 similar events)
[2024-05-28 21:57:14] [INFO ] Invariant cache hit.
[2024-05-28 21:57:15] [INFO ] Implicit Places using invariants in 715 ms returned []
[2024-05-28 21:57:15] [INFO ] Flow matrix only has 1884 transitions (discarded 9 similar events)
[2024-05-28 21:57:15] [INFO ] Invariant cache hit.
[2024-05-28 21:57:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:57:26] [INFO ] Implicit Places using invariants and state equation in 11049 ms returned []
Implicit Place search using SMT with State Equation took 11770 ms to find 0 implicit places.
Running 1882 sub problems to find dead transitions.
[2024-05-28 21:57:26] [INFO ] Flow matrix only has 1884 transitions (discarded 9 similar events)
[2024-05-28 21:57:26] [INFO ] Invariant cache hit.
[2024-05-28 21:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2537 variables, and 71 constraints, problems are : Problem set: 0 solved, 1882 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1882/1882 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
[2024-05-28 21:58:45] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2537 variables, and 72 constraints, problems are : Problem set: 0 solved, 1882 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1882 constraints, Known Traps: 1/1 constraints]
After SMT, in 85138ms problems are : Problem set: 0 solved, 1882 unsolved
Search for dead transitions found 0 dead transitions in 85177ms
Starting structural reductions in LTL mode, iteration 1 : 653/654 places, 1893/1894 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161207 ms. Remains : 653/654 places, 1893/1894 transitions.
[2024-05-28 21:58:51] [INFO ] Flatten gal took : 100 ms
[2024-05-28 21:58:51] [INFO ] Flatten gal took : 108 ms
[2024-05-28 21:58:51] [INFO ] Input system was already deterministic with 1893 transitions.
[2024-05-28 21:58:51] [INFO ] Flatten gal took : 83 ms
[2024-05-28 21:58:51] [INFO ] Flatten gal took : 87 ms
[2024-05-28 21:58:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality10379103473950022493.gal : 79 ms
[2024-05-28 21:58:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality12361432942091497742.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10379103473950022493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12361432942091497742.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:59:22] [INFO ] Flatten gal took : 128 ms
[2024-05-28 21:59:22] [INFO ] Applying decomposition
[2024-05-28 21:59:22] [INFO ] Flatten gal took : 96 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/graph11605146534182883594.txt' '-o' '/tmp/graph11605146534182883594.bin' '-w' '/tmp/graph11605146534182883594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11605146534182883594.bin' '-l' '-1' '-v' '-w' '/tmp/graph11605146534182883594.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:59:22] [INFO ] Decomposing Gal with order
[2024-05-28 21:59:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:59:22] [INFO ] Removed a total of 1052 redundant transitions.
[2024-05-28 21:59:23] [INFO ] Flatten gal took : 244 ms
[2024-05-28 21:59:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 18 ms.
[2024-05-28 21:59:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality5787776147265929841.gal : 27 ms
[2024-05-28 21:59:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality11097988300209880961.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5787776147265929841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11097988300209880961.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1894/1894 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1859
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1859
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 70 place count 619 transition count 1826
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 136 place count 586 transition count 1826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 585 transition count 1825
Applied a total of 138 rules in 189 ms. Remains 585 /654 variables (removed 69) and now considering 1825/1894 (removed 69) transitions.
Running 1814 sub problems to find dead transitions.
[2024-05-28 21:59:53] [INFO ] Flow matrix only has 1816 transitions (discarded 9 similar events)
// Phase 1: matrix 1816 rows 585 cols
[2024-05-28 21:59:53] [INFO ] Computed 82 invariants in 36 ms
[2024-05-28 21:59:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/575 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/575 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/2401 variables, and 72 constraints, problems are : Problem set: 0 solved, 1814 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/585 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1814/1814 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1814 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/575 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/575 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
[2024-05-28 22:00:38] [INFO ] Deduced a trap composed of 19 places in 371 ms of which 3 ms to minimize.
[2024-05-28 22:00:42] [INFO ] Deduced a trap composed of 254 places in 307 ms of which 4 ms to minimize.
[2024-05-28 22:00:43] [INFO ] Deduced a trap composed of 266 places in 297 ms of which 4 ms to minimize.
[2024-05-28 22:00:43] [INFO ] Deduced a trap composed of 206 places in 322 ms of which 6 ms to minimize.
[2024-05-28 22:00:43] [INFO ] Deduced a trap composed of 240 places in 277 ms of which 3 ms to minimize.
[2024-05-28 22:00:44] [INFO ] Deduced a trap composed of 249 places in 280 ms of which 3 ms to minimize.
[2024-05-28 22:00:44] [INFO ] Deduced a trap composed of 253 places in 260 ms of which 4 ms to minimize.
[2024-05-28 22:00:44] [INFO ] Deduced a trap composed of 123 places in 321 ms of which 4 ms to minimize.
[2024-05-28 22:00:45] [INFO ] Deduced a trap composed of 114 places in 312 ms of which 4 ms to minimize.
[2024-05-28 22:00:47] [INFO ] Deduced a trap composed of 84 places in 297 ms of which 4 ms to minimize.
[2024-05-28 22:00:48] [INFO ] Deduced a trap composed of 131 places in 293 ms of which 4 ms to minimize.
[2024-05-28 22:00:48] [INFO ] Deduced a trap composed of 84 places in 293 ms of which 4 ms to minimize.
[2024-05-28 22:00:48] [INFO ] Deduced a trap composed of 84 places in 326 ms of which 4 ms to minimize.
[2024-05-28 22:00:49] [INFO ] Deduced a trap composed of 181 places in 315 ms of which 4 ms to minimize.
[2024-05-28 22:00:50] [INFO ] Deduced a trap composed of 84 places in 310 ms of which 4 ms to minimize.
[2024-05-28 22:00:51] [INFO ] Deduced a trap composed of 167 places in 307 ms of which 4 ms to minimize.
[2024-05-28 22:00:51] [INFO ] Deduced a trap composed of 152 places in 301 ms of which 4 ms to minimize.
[2024-05-28 22:00:51] [INFO ] Deduced a trap composed of 84 places in 287 ms of which 4 ms to minimize.
[2024-05-28 22:00:52] [INFO ] Deduced a trap composed of 181 places in 314 ms of which 5 ms to minimize.
[2024-05-28 22:00:52] [INFO ] Deduced a trap composed of 84 places in 305 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/575 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
[2024-05-28 22:00:55] [INFO ] Deduced a trap composed of 228 places in 321 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/2401 variables, and 93 constraints, problems are : Problem set: 0 solved, 1814 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/585 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1814 constraints, Known Traps: 21/21 constraints]
After SMT, in 63111ms problems are : Problem set: 0 solved, 1814 unsolved
Search for dead transitions found 0 dead transitions in 63129ms
[2024-05-28 22:00:56] [INFO ] Flow matrix only has 1816 transitions (discarded 9 similar events)
[2024-05-28 22:00:56] [INFO ] Invariant cache hit.
[2024-05-28 22:00:57] [INFO ] Implicit Places using invariants in 852 ms returned []
[2024-05-28 22:00:57] [INFO ] Flow matrix only has 1816 transitions (discarded 9 similar events)
[2024-05-28 22:00:57] [INFO ] Invariant cache hit.
[2024-05-28 22:00:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:01:07] [INFO ] Implicit Places using invariants and state equation in 9303 ms returned []
Implicit Place search using SMT with State Equation took 10156 ms to find 0 implicit places.
[2024-05-28 22:01:07] [INFO ] Redundant transitions in 176 ms returned []
Running 1814 sub problems to find dead transitions.
[2024-05-28 22:01:07] [INFO ] Flow matrix only has 1816 transitions (discarded 9 similar events)
[2024-05-28 22:01:07] [INFO ] Invariant cache hit.
[2024-05-28 22:01:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/575 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/575 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
[2024-05-28 22:01:44] [INFO ] Deduced a trap composed of 249 places in 368 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/575 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1814 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 575/2401 variables, and 73 constraints, problems are : Problem set: 0 solved, 1814 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/585 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1814/1814 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1814 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/575 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/575 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/575 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
[2024-05-28 22:02:02] [INFO ] Deduced a trap composed of 83 places in 309 ms of which 5 ms to minimize.
[2024-05-28 22:02:03] [INFO ] Deduced a trap composed of 137 places in 327 ms of which 4 ms to minimize.
[2024-05-28 22:02:04] [INFO ] Deduced a trap composed of 19 places in 464 ms of which 2 ms to minimize.
[2024-05-28 22:02:06] [INFO ] Deduced a trap composed of 83 places in 290 ms of which 4 ms to minimize.
[2024-05-28 22:02:06] [INFO ] Deduced a trap composed of 82 places in 324 ms of which 4 ms to minimize.
[2024-05-28 22:02:07] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 2 ms to minimize.
[2024-05-28 22:02:07] [INFO ] Deduced a trap composed of 262 places in 551 ms of which 4 ms to minimize.
[2024-05-28 22:02:08] [INFO ] Deduced a trap composed of 238 places in 569 ms of which 6 ms to minimize.
[2024-05-28 22:02:09] [INFO ] Deduced a trap composed of 269 places in 393 ms of which 4 ms to minimize.
[2024-05-28 22:02:10] [INFO ] Deduced a trap composed of 265 places in 356 ms of which 4 ms to minimize.
[2024-05-28 22:02:10] [INFO ] Deduced a trap composed of 137 places in 349 ms of which 5 ms to minimize.
[2024-05-28 22:02:11] [INFO ] Deduced a trap composed of 83 places in 325 ms of which 4 ms to minimize.
[2024-05-28 22:02:12] [INFO ] Deduced a trap composed of 122 places in 302 ms of which 4 ms to minimize.
[2024-05-28 22:02:12] [INFO ] Deduced a trap composed of 108 places in 272 ms of which 3 ms to minimize.
[2024-05-28 22:02:12] [INFO ] Deduced a trap composed of 82 places in 282 ms of which 5 ms to minimize.
[2024-05-28 22:02:13] [INFO ] Deduced a trap composed of 144 places in 337 ms of which 5 ms to minimize.
[2024-05-28 22:02:14] [INFO ] Deduced a trap composed of 166 places in 317 ms of which 4 ms to minimize.
[2024-05-28 22:02:16] [INFO ] Deduced a trap composed of 174 places in 293 ms of which 4 ms to minimize.
[2024-05-28 22:02:16] [INFO ] Deduced a trap composed of 174 places in 323 ms of which 4 ms to minimize.
[2024-05-28 22:02:18] [INFO ] Deduced a trap composed of 83 places in 331 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 1814 unsolved
[2024-05-28 22:02:21] [INFO ] Deduced a trap composed of 129 places in 475 ms of which 4 ms to minimize.
[2024-05-28 22:02:28] [INFO ] Deduced a trap composed of 248 places in 316 ms of which 4 ms to minimize.
[2024-05-28 22:02:28] [INFO ] Deduced a trap composed of 254 places in 288 ms of which 4 ms to minimize.
[2024-05-28 22:02:29] [INFO ] Deduced a trap composed of 270 places in 290 ms of which 4 ms to minimize.
[2024-05-28 22:02:29] [INFO ] Deduced a trap composed of 210 places in 320 ms of which 4 ms to minimize.
[2024-05-28 22:02:29] [INFO ] Deduced a trap composed of 256 places in 291 ms of which 5 ms to minimize.
[2024-05-28 22:02:30] [INFO ] Deduced a trap composed of 248 places in 414 ms of which 6 ms to minimize.
SMT process timed out in 82898ms, After SMT, problems are : Problem set: 0 solved, 1814 unsolved
Search for dead transitions found 0 dead transitions in 82930ms
Starting structural reductions in SI_CTL mode, iteration 1 : 585/654 places, 1825/1894 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 156609 ms. Remains : 585/654 places, 1825/1894 transitions.
[2024-05-28 22:02:30] [INFO ] Flatten gal took : 240 ms
[2024-05-28 22:02:30] [INFO ] Flatten gal took : 249 ms
[2024-05-28 22:02:31] [INFO ] Input system was already deterministic with 1825 transitions.
[2024-05-28 22:02:31] [INFO ] Flatten gal took : 233 ms
[2024-05-28 22:02:31] [INFO ] Flatten gal took : 117 ms
[2024-05-28 22:02:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality12679332956596083719.gal : 20 ms
[2024-05-28 22:02:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality9798012302302227038.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12679332956596083719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9798012302302227038.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:03:01] [INFO ] Flatten gal took : 149 ms
[2024-05-28 22:03:01] [INFO ] Applying decomposition
[2024-05-28 22:03:01] [INFO ] Flatten gal took : 104 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/graph5423175118838814534.txt' '-o' '/tmp/graph5423175118838814534.bin' '-w' '/tmp/graph5423175118838814534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5423175118838814534.bin' '-l' '-1' '-v' '-w' '/tmp/graph5423175118838814534.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:03:02] [INFO ] Decomposing Gal with order
[2024-05-28 22:03:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:03:02] [INFO ] Removed a total of 1114 redundant transitions.
[2024-05-28 22:03:02] [INFO ] Flatten gal took : 226 ms
[2024-05-28 22:03:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1034 labels/synchronizations in 73 ms.
[2024-05-28 22:03:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality2596171856310321440.gal : 21 ms
[2024-05-28 22:03:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality1371461306003113171.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2596171856310321440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1371461306003113171.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1894/1894 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1858
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1858
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1824
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 584 transition count 1824
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1823
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1823
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 146 place count 581 transition count 1821
Applied a total of 146 rules in 197 ms. Remains 581 /654 variables (removed 73) and now considering 1821/1894 (removed 73) transitions.
Running 1810 sub problems to find dead transitions.
[2024-05-28 22:03:33] [INFO ] Flow matrix only has 1812 transitions (discarded 9 similar events)
// Phase 1: matrix 1812 rows 581 cols
[2024-05-28 22:03:33] [INFO ] Computed 82 invariants in 25 ms
[2024-05-28 22:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2393 variables, and 72 constraints, problems are : Problem set: 0 solved, 1810 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1810/1810 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
[2024-05-28 22:04:20] [INFO ] Deduced a trap composed of 18 places in 404 ms of which 2 ms to minimize.
[2024-05-28 22:04:21] [INFO ] Deduced a trap composed of 184 places in 578 ms of which 5 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 260 places in 531 ms of which 4 ms to minimize.
[2024-05-28 22:04:24] [INFO ] Deduced a trap composed of 274 places in 545 ms of which 4 ms to minimize.
[2024-05-28 22:04:24] [INFO ] Deduced a trap composed of 260 places in 458 ms of which 6 ms to minimize.
[2024-05-28 22:04:25] [INFO ] Deduced a trap composed of 265 places in 533 ms of which 4 ms to minimize.
[2024-05-28 22:04:26] [INFO ] Deduced a trap composed of 79 places in 496 ms of which 3 ms to minimize.
[2024-05-28 22:04:30] [INFO ] Deduced a trap composed of 212 places in 529 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2393 variables, and 80 constraints, problems are : Problem set: 0 solved, 1810 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1810 constraints, Known Traps: 8/8 constraints]
After SMT, in 65141ms problems are : Problem set: 0 solved, 1810 unsolved
Search for dead transitions found 0 dead transitions in 65159ms
[2024-05-28 22:04:38] [INFO ] Flow matrix only has 1812 transitions (discarded 9 similar events)
[2024-05-28 22:04:38] [INFO ] Invariant cache hit.
[2024-05-28 22:04:39] [INFO ] Implicit Places using invariants in 807 ms returned []
[2024-05-28 22:04:39] [INFO ] Flow matrix only has 1812 transitions (discarded 9 similar events)
[2024-05-28 22:04:39] [INFO ] Invariant cache hit.
[2024-05-28 22:04:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:04:52] [INFO ] Implicit Places using invariants and state equation in 12848 ms returned []
Implicit Place search using SMT with State Equation took 13659 ms to find 0 implicit places.
[2024-05-28 22:04:52] [INFO ] Redundant transitions in 101 ms returned []
Running 1810 sub problems to find dead transitions.
[2024-05-28 22:04:52] [INFO ] Flow matrix only has 1812 transitions (discarded 9 similar events)
[2024-05-28 22:04:52] [INFO ] Invariant cache hit.
[2024-05-28 22:04:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/581 variables, 10/82 constraints. Problems are: Problem set: 569 solved, 1241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/2393 variables, and 82 constraints, problems are : Problem set: 569 solved, 1241 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1810/1810 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 569 solved, 1241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 569 solved, 1241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 569 solved, 1241 unsolved
[2024-05-28 22:05:48] [INFO ] Deduced a trap composed of 18 places in 367 ms of which 1 ms to minimize.
[2024-05-28 22:05:57] [INFO ] Deduced a trap composed of 14 places in 342 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 2/74 constraints. Problems are: Problem set: 569 solved, 1241 unsolved
[2024-05-28 22:06:02] [INFO ] Deduced a trap composed of 80 places in 384 ms of which 4 ms to minimize.
[2024-05-28 22:06:07] [INFO ] Deduced a trap composed of 147 places in 533 ms of which 5 ms to minimize.
[2024-05-28 22:06:16] [INFO ] Deduced a trap composed of 250 places in 261 ms of which 3 ms to minimize.
[2024-05-28 22:06:16] [INFO ] Deduced a trap composed of 249 places in 306 ms of which 4 ms to minimize.
[2024-05-28 22:06:16] [INFO ] Deduced a trap composed of 262 places in 318 ms of which 4 ms to minimize.
[2024-05-28 22:06:17] [INFO ] Deduced a trap composed of 248 places in 283 ms of which 4 ms to minimize.
SMT process timed out in 84920ms, After SMT, problems are : Problem set: 569 solved, 1241 unsolved
Search for dead transitions found 569 dead transitions in 84946ms
Found 569 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 569 transitions
Dead transitions reduction (with SMT) removed 569 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 581/654 places, 1252/1894 transitions.
Applied a total of 0 rules in 59 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2024-05-28 22:06:17] [INFO ] Redundant transitions in 45 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 164198 ms. Remains : 581/654 places, 1252/1894 transitions.
[2024-05-28 22:06:17] [INFO ] Flatten gal took : 66 ms
[2024-05-28 22:06:17] [INFO ] Flatten gal took : 68 ms
[2024-05-28 22:06:17] [INFO ] Input system was already deterministic with 1252 transitions.
[2024-05-28 22:06:17] [INFO ] Flatten gal took : 75 ms
[2024-05-28 22:06:17] [INFO ] Flatten gal took : 77 ms
[2024-05-28 22:06:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality5503459305575352711.gal : 12 ms
[2024-05-28 22:06:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5994089159859419425.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5503459305575352711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5994089159859419425.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:06:47] [INFO ] Flatten gal took : 101 ms
[2024-05-28 22:06:47] [INFO ] Applying decomposition
[2024-05-28 22:06:47] [INFO ] Flatten gal took : 79 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/graph2041007380339347129.txt' '-o' '/tmp/graph2041007380339347129.bin' '-w' '/tmp/graph2041007380339347129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2041007380339347129.bin' '-l' '-1' '-v' '-w' '/tmp/graph2041007380339347129.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:06:48] [INFO ] Decomposing Gal with order
[2024-05-28 22:06:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:06:48] [INFO ] Removed a total of 2652 redundant transitions.
[2024-05-28 22:06:48] [INFO ] Flatten gal took : 268 ms
[2024-05-28 22:06:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 471 labels/synchronizations in 83 ms.
[2024-05-28 22:06:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality11715157145503452826.gal : 12 ms
[2024-05-28 22:06:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3850393227811619794.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11715157145503452826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3850393227811619794.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1894/1894 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1893
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1893
Applied a total of 2 rules in 83 ms. Remains 653 /654 variables (removed 1) and now considering 1893/1894 (removed 1) transitions.
Running 1882 sub problems to find dead transitions.
[2024-05-28 22:07:18] [INFO ] Flow matrix only has 1884 transitions (discarded 9 similar events)
// Phase 1: matrix 1884 rows 653 cols
[2024-05-28 22:07:18] [INFO ] Computed 82 invariants in 51 ms
[2024-05-28 22:07:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2537 variables, and 71 constraints, problems are : Problem set: 0 solved, 1882 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1882/1882 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
[2024-05-28 22:08:11] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 2 ms to minimize.
[2024-05-28 22:08:12] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 1 ms to minimize.
[2024-05-28 22:08:19] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2537 variables, and 74 constraints, problems are : Problem set: 0 solved, 1882 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1882 constraints, Known Traps: 3/3 constraints]
After SMT, in 64930ms problems are : Problem set: 0 solved, 1882 unsolved
Search for dead transitions found 0 dead transitions in 64952ms
[2024-05-28 22:08:23] [INFO ] Flow matrix only has 1884 transitions (discarded 9 similar events)
[2024-05-28 22:08:23] [INFO ] Invariant cache hit.
[2024-05-28 22:08:24] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-28 22:08:24] [INFO ] Flow matrix only has 1884 transitions (discarded 9 similar events)
[2024-05-28 22:08:24] [INFO ] Invariant cache hit.
[2024-05-28 22:08:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:08:36] [INFO ] Implicit Places using invariants and state equation in 11925 ms returned []
Implicit Place search using SMT with State Equation took 12622 ms to find 0 implicit places.
Running 1882 sub problems to find dead transitions.
[2024-05-28 22:08:36] [INFO ] Flow matrix only has 1884 transitions (discarded 9 similar events)
[2024-05-28 22:08:36] [INFO ] Invariant cache hit.
[2024-05-28 22:08:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2537 variables, and 71 constraints, problems are : Problem set: 0 solved, 1882 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1882/1882 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
[2024-05-28 22:09:52] [INFO ] Deduced a trap composed of 82 places in 211 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2537 variables, and 72 constraints, problems are : Problem set: 0 solved, 1882 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1882 constraints, Known Traps: 1/1 constraints]
After SMT, in 84603ms problems are : Problem set: 0 solved, 1882 unsolved
Search for dead transitions found 0 dead transitions in 84628ms
Starting structural reductions in LTL mode, iteration 1 : 653/654 places, 1893/1894 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162300 ms. Remains : 653/654 places, 1893/1894 transitions.
[2024-05-28 22:10:01] [INFO ] Flatten gal took : 98 ms
[2024-05-28 22:10:01] [INFO ] Flatten gal took : 107 ms
[2024-05-28 22:10:01] [INFO ] Input system was already deterministic with 1893 transitions.
[2024-05-28 22:10:01] [INFO ] Flatten gal took : 98 ms
[2024-05-28 22:10:01] [INFO ] Flatten gal took : 108 ms
[2024-05-28 22:10:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality9979416529820164905.gal : 16 ms
[2024-05-28 22:10:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality9864968054255990928.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9979416529820164905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9864968054255990928.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:10:32] [INFO ] Flatten gal took : 156 ms
[2024-05-28 22:10:32] [INFO ] Applying decomposition
[2024-05-28 22:10:32] [INFO ] Flatten gal took : 128 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/graph11706118836353811536.txt' '-o' '/tmp/graph11706118836353811536.bin' '-w' '/tmp/graph11706118836353811536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11706118836353811536.bin' '-l' '-1' '-v' '-w' '/tmp/graph11706118836353811536.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:10:32] [INFO ] Decomposing Gal with order
[2024-05-28 22:10:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:10:32] [INFO ] Removed a total of 3502 redundant transitions.
[2024-05-28 22:10:32] [INFO ] Flatten gal took : 188 ms
[2024-05-28 22:10:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 373 labels/synchronizations in 29 ms.
[2024-05-28 22:10:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality1687642455302800546.gal : 17 ms
[2024-05-28 22:10:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality16037622481843991332.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1687642455302800546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16037622481843991332.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1894/1894 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1860
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 620 transition count 1860
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 68 place count 620 transition count 1825
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 138 place count 585 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1824
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1824
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 142 place count 583 transition count 1823
Applied a total of 142 rules in 217 ms. Remains 583 /654 variables (removed 71) and now considering 1823/1894 (removed 71) transitions.
Running 1812 sub problems to find dead transitions.
[2024-05-28 22:11:03] [INFO ] Flow matrix only has 1814 transitions (discarded 9 similar events)
// Phase 1: matrix 1814 rows 583 cols
[2024-05-28 22:11:03] [INFO ] Computed 82 invariants in 42 ms
[2024-05-28 22:11:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2397 variables, and 71 constraints, problems are : Problem set: 0 solved, 1812 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1812/1812 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1812 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1812 unsolved
At refinement iteration 3 (OVERLAPS) 11/583 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/2397 variables, and 82 constraints, problems are : Problem set: 0 solved, 1812 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1812 constraints, Known Traps: 0/0 constraints]
After SMT, in 63026ms problems are : Problem set: 0 solved, 1812 unsolved
Search for dead transitions found 0 dead transitions in 63046ms
[2024-05-28 22:12:06] [INFO ] Flow matrix only has 1814 transitions (discarded 9 similar events)
[2024-05-28 22:12:06] [INFO ] Invariant cache hit.
[2024-05-28 22:12:07] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-05-28 22:12:07] [INFO ] Flow matrix only has 1814 transitions (discarded 9 similar events)
[2024-05-28 22:12:07] [INFO ] Invariant cache hit.
[2024-05-28 22:12:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:12:18] [INFO ] Implicit Places using invariants and state equation in 11509 ms returned []
Implicit Place search using SMT with State Equation took 12432 ms to find 0 implicit places.
[2024-05-28 22:12:18] [INFO ] Redundant transitions in 42 ms returned []
Running 1812 sub problems to find dead transitions.
[2024-05-28 22:12:18] [INFO ] Flow matrix only has 1814 transitions (discarded 9 similar events)
[2024-05-28 22:12:18] [INFO ] Invariant cache hit.
[2024-05-28 22:12:18] [INFO ] State equation strengthened by 1 read => feed constraints.

BK_STOP 1716934349229

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-S10J30"
export BK_EXAMINATION="CTLCardinality"
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-S10J30, examination is CTLCardinality"
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-171654447200489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;