Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 17K Apr 11 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716916948078

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 17:22:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:22:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:22:29] [INFO ] Load time of PNML (sax parser for PT used): 357 ms
[2024-05-28 17:22:29] [INFO ] Transformed 554 places.
[2024-05-28 17:22:30] [INFO ] Transformed 2998 transitions.
[2024-05-28 17:22:30] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 541 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 195 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 546 transition count 1368
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 546 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 543 transition count 1365
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 543 transition count 1365
Applied a total of 18 rules in 152 ms. Remains 543 /554 variables (removed 11) and now considering 1365/1372 (removed 7) transitions.
Running 1361 sub problems to find dead transitions.
[2024-05-28 17:22:30] [INFO ] Flow matrix only has 1341 transitions (discarded 24 similar events)
// Phase 1: matrix 1341 rows 543 cols
[2024-05-28 17:22:30] [INFO ] Computed 46 invariants in 105 ms
[2024-05-28 17:22:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
[2024-05-28 17:22:47] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 10 ms to minimize.
[2024-05-28 17:22:47] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 3 ms to minimize.
[2024-05-28 17:22:47] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 2 ms to minimize.
[2024-05-28 17:22:47] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 1 ms to minimize.
[2024-05-28 17:22:48] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 1 ms to minimize.
[2024-05-28 17:22:49] [INFO ] Deduced a trap composed of 93 places in 465 ms of which 2 ms to minimize.
[2024-05-28 17:22:49] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 0 ms to minimize.
[2024-05-28 17:22:49] [INFO ] Deduced a trap composed of 265 places in 479 ms of which 6 ms to minimize.
[2024-05-28 17:22:50] [INFO ] Deduced a trap composed of 291 places in 670 ms of which 20 ms to minimize.
[2024-05-28 17:22:51] [INFO ] Deduced a trap composed of 15 places in 482 ms of which 3 ms to minimize.
[2024-05-28 17:22:51] [INFO ] Deduced a trap composed of 322 places in 397 ms of which 6 ms to minimize.
[2024-05-28 17:22:52] [INFO ] Deduced a trap composed of 309 places in 372 ms of which 3 ms to minimize.
[2024-05-28 17:22:52] [INFO ] Deduced a trap composed of 315 places in 268 ms of which 3 ms to minimize.
[2024-05-28 17:22:52] [INFO ] Deduced a trap composed of 284 places in 243 ms of which 3 ms to minimize.
[2024-05-28 17:22:53] [INFO ] Deduced a trap composed of 265 places in 267 ms of which 3 ms to minimize.
[2024-05-28 17:22:53] [INFO ] Deduced a trap composed of 177 places in 262 ms of which 3 ms to minimize.
[2024-05-28 17:22:53] [INFO ] Deduced a trap composed of 144 places in 219 ms of which 3 ms to minimize.
[2024-05-28 17:22:54] [INFO ] Deduced a trap composed of 288 places in 323 ms of which 4 ms to minimize.
[2024-05-28 17:22:54] [INFO ] Deduced a trap composed of 278 places in 288 ms of which 3 ms to minimize.
[2024-05-28 17:22:55] [INFO ] Deduced a trap composed of 283 places in 309 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1884 variables, and 60 constraints, problems are : Problem set: 0 solved, 1361 unsolved in 20092 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/543 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1361/1361 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
[2024-05-28 17:23:07] [INFO ] Deduced a trap composed of 279 places in 280 ms of which 4 ms to minimize.
[2024-05-28 17:23:07] [INFO ] Deduced a trap composed of 245 places in 286 ms of which 2 ms to minimize.
[2024-05-28 17:23:08] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 2 ms to minimize.
[2024-05-28 17:23:08] [INFO ] Deduced a trap composed of 320 places in 381 ms of which 4 ms to minimize.
[2024-05-28 17:23:10] [INFO ] Deduced a trap composed of 281 places in 267 ms of which 3 ms to minimize.
[2024-05-28 17:23:10] [INFO ] Deduced a trap composed of 282 places in 346 ms of which 5 ms to minimize.
[2024-05-28 17:23:11] [INFO ] Deduced a trap composed of 275 places in 242 ms of which 3 ms to minimize.
[2024-05-28 17:23:11] [INFO ] Deduced a trap composed of 274 places in 283 ms of which 3 ms to minimize.
[2024-05-28 17:23:11] [INFO ] Deduced a trap composed of 259 places in 287 ms of which 3 ms to minimize.
[2024-05-28 17:23:12] [INFO ] Deduced a trap composed of 311 places in 325 ms of which 3 ms to minimize.
[2024-05-28 17:23:15] [INFO ] Deduced a trap composed of 314 places in 312 ms of which 4 ms to minimize.
[2024-05-28 17:23:15] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/1884 variables, and 72 constraints, problems are : Problem set: 0 solved, 1361 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/543 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1361 constraints, Known Traps: 32/32 constraints]
After SMT, in 45750ms problems are : Problem set: 0 solved, 1361 unsolved
Search for dead transitions found 0 dead transitions in 45858ms
[2024-05-28 17:23:16] [INFO ] Flow matrix only has 1341 transitions (discarded 24 similar events)
[2024-05-28 17:23:16] [INFO ] Invariant cache hit.
[2024-05-28 17:23:16] [INFO ] Implicit Places using invariants in 429 ms returned [89, 244, 274, 360, 382, 479]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 438 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 537/554 places, 1365/1372 transitions.
Applied a total of 0 rules in 11 ms. Remains 537 /537 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46548 ms. Remains : 537/554 places, 1365/1372 transitions.
Support contains 195 out of 537 places after structural reductions.
[2024-05-28 17:23:17] [INFO ] Flatten gal took : 264 ms
[2024-05-28 17:23:17] [INFO ] Flatten gal took : 141 ms
[2024-05-28 17:23:17] [INFO ] Input system was already deterministic with 1365 transitions.
Support contains 185 out of 537 places (down from 195) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 1830 ms. (21 steps per ms) remains 12/31 properties
BEST_FIRST walk for 40003 steps (8 resets) in 394 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 304 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 272 ms. (146 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 278 ms. (143 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (9 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 192 ms. (207 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 233 ms. (170 steps per ms) remains 12/12 properties
[2024-05-28 17:23:19] [INFO ] Flow matrix only has 1341 transitions (discarded 24 similar events)
// Phase 1: matrix 1341 rows 537 cols
[2024-05-28 17:23:19] [INFO ] Computed 40 invariants in 35 ms
[2024-05-28 17:23:19] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 2 (OVERLAPS) 300/361 variables, 7/8 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 44/405 variables, 6/14 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 6 (OVERLAPS) 129/534 variables, 24/38 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/535 variables, 1/39 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/39 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1341/1876 variables, 535/574 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1876 variables, 120/694 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1876 variables, 0/694 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/1878 variables, 2/696 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/697 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/697 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1878 variables, 0/697 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1878/1878 variables, and 697 constraints, problems are : Problem set: 10 solved, 2 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 537/537 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 262/300 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/346 variables, 8/12 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 187/533 variables, 25/37 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-05-28 17:23:21] [INFO ] Deduced a trap composed of 75 places in 486 ms of which 4 ms to minimize.
[2024-05-28 17:23:21] [INFO ] Deduced a trap composed of 190 places in 269 ms of which 15 ms to minimize.
[2024-05-28 17:23:22] [INFO ] Deduced a trap composed of 103 places in 288 ms of which 16 ms to minimize.
Problem AtomicPropp30 is UNSAT
After SMT solving in domain Int declared 533/1878 variables, and 40 constraints, problems are : Problem set: 12 solved, 0 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/537 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 3/3 constraints]
After SMT, in 2614ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
Support contains 31 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 534 transition count 1362
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 534 transition count 1362
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 532 transition count 1360
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 532 transition count 1360
Applied a total of 10 rules in 36 ms. Remains 532 /537 variables (removed 5) and now considering 1360/1365 (removed 5) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 17:23:22] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 17:23:22] [INFO ] Computed 40 invariants in 30 ms
[2024-05-28 17:23:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:23:37] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2024-05-28 17:23:38] [INFO ] Deduced a trap composed of 139 places in 210 ms of which 3 ms to minimize.
[2024-05-28 17:23:38] [INFO ] Deduced a trap composed of 304 places in 236 ms of which 2 ms to minimize.
[2024-05-28 17:23:38] [INFO ] Deduced a trap composed of 278 places in 188 ms of which 3 ms to minimize.
[2024-05-28 17:23:39] [INFO ] Deduced a trap composed of 258 places in 190 ms of which 3 ms to minimize.
[2024-05-28 17:23:39] [INFO ] Deduced a trap composed of 286 places in 190 ms of which 2 ms to minimize.
[2024-05-28 17:23:40] [INFO ] Deduced a trap composed of 299 places in 217 ms of which 2 ms to minimize.
[2024-05-28 17:23:40] [INFO ] Deduced a trap composed of 253 places in 218 ms of which 3 ms to minimize.
[2024-05-28 17:23:40] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 1 ms to minimize.
[2024-05-28 17:23:40] [INFO ] Deduced a trap composed of 82 places in 202 ms of which 2 ms to minimize.
[2024-05-28 17:23:41] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2024-05-28 17:23:43] [INFO ] Deduced a trap composed of 289 places in 282 ms of which 3 ms to minimize.
[2024-05-28 17:23:43] [INFO ] Deduced a trap composed of 348 places in 213 ms of which 3 ms to minimize.
[2024-05-28 17:23:43] [INFO ] Deduced a trap composed of 291 places in 199 ms of which 2 ms to minimize.
[2024-05-28 17:23:44] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 4 ms to minimize.
[2024-05-28 17:23:45] [INFO ] Deduced a trap composed of 321 places in 242 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:23:55] [INFO ] Deduced a trap composed of 344 places in 274 ms of which 3 ms to minimize.
[2024-05-28 17:24:01] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 3 ms to minimize.
[2024-05-28 17:24:01] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 3 ms to minimize.
[2024-05-28 17:24:01] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 2 ms to minimize.
[2024-05-28 17:24:02] [INFO ] Deduced a trap composed of 74 places in 361 ms of which 4 ms to minimize.
[2024-05-28 17:24:02] [INFO ] Deduced a trap composed of 28 places in 344 ms of which 4 ms to minimize.
[2024-05-28 17:24:02] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 3 ms to minimize.
[2024-05-28 17:24:02] [INFO ] Deduced a trap composed of 303 places in 247 ms of which 3 ms to minimize.
[2024-05-28 17:24:03] [INFO ] Deduced a trap composed of 75 places in 260 ms of which 3 ms to minimize.
[2024-05-28 17:24:03] [INFO ] Deduced a trap composed of 74 places in 243 ms of which 3 ms to minimize.
[2024-05-28 17:24:03] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:24:03] [INFO ] Deduced a trap composed of 317 places in 241 ms of which 3 ms to minimize.
[2024-05-28 17:24:03] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:24:04] [INFO ] Deduced a trap composed of 342 places in 229 ms of which 3 ms to minimize.
[2024-05-28 17:24:04] [INFO ] Deduced a trap composed of 314 places in 252 ms of which 3 ms to minimize.
[2024-05-28 17:24:05] [INFO ] Deduced a trap composed of 310 places in 237 ms of which 3 ms to minimize.
[2024-05-28 17:24:05] [INFO ] Deduced a trap composed of 337 places in 247 ms of which 3 ms to minimize.
[2024-05-28 17:24:05] [INFO ] Deduced a trap composed of 335 places in 247 ms of which 2 ms to minimize.
[2024-05-28 17:24:05] [INFO ] Deduced a trap composed of 330 places in 244 ms of which 3 ms to minimize.
[2024-05-28 17:24:06] [INFO ] Deduced a trap composed of 335 places in 232 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 63 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 36/36 constraints]
After SMT, in 44972ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44988ms
[2024-05-28 17:24:07] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:24:07] [INFO ] Invariant cache hit.
[2024-05-28 17:24:08] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-05-28 17:24:08] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:24:08] [INFO ] Invariant cache hit.
[2024-05-28 17:24:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:24:16] [INFO ] Implicit Places using invariants and state equation in 8614 ms returned []
Implicit Place search using SMT with State Equation took 9233 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-28 17:24:16] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:24:16] [INFO ] Invariant cache hit.
[2024-05-28 17:24:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:24:31] [INFO ] Deduced a trap composed of 142 places in 279 ms of which 4 ms to minimize.
[2024-05-28 17:24:31] [INFO ] Deduced a trap composed of 304 places in 291 ms of which 3 ms to minimize.
[2024-05-28 17:24:32] [INFO ] Deduced a trap composed of 323 places in 291 ms of which 4 ms to minimize.
[2024-05-28 17:24:32] [INFO ] Deduced a trap composed of 262 places in 231 ms of which 3 ms to minimize.
[2024-05-28 17:24:32] [INFO ] Deduced a trap composed of 280 places in 229 ms of which 3 ms to minimize.
[2024-05-28 17:24:33] [INFO ] Deduced a trap composed of 286 places in 266 ms of which 4 ms to minimize.
[2024-05-28 17:24:33] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 2 ms to minimize.
[2024-05-28 17:24:34] [INFO ] Deduced a trap composed of 283 places in 285 ms of which 4 ms to minimize.
[2024-05-28 17:24:34] [INFO ] Deduced a trap composed of 267 places in 235 ms of which 4 ms to minimize.
[2024-05-28 17:24:34] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 2 ms to minimize.
[2024-05-28 17:24:34] [INFO ] Deduced a trap composed of 86 places in 178 ms of which 2 ms to minimize.
[2024-05-28 17:24:35] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 2 ms to minimize.
[2024-05-28 17:24:35] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
[2024-05-28 17:24:35] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-05-28 17:24:37] [INFO ] Deduced a trap composed of 291 places in 269 ms of which 3 ms to minimize.
[2024-05-28 17:24:37] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.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 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s78 1.0)
(s79 0.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 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 10.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.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 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 timeout
0.0)
(s250 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:25:01] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 4 ms to minimize.
[2024-05-28 17:25:01] [INFO ] Deduced a trap composed of 5 places in 336 ms of which 4 ms to minimize.
[2024-05-28 17:25:02] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 4 ms to minimize.
[2024-05-28 17:25:02] [INFO ] Deduced a trap composed of 74 places in 353 ms of which 4 ms to minimize.
[2024-05-28 17:25:03] [INFO ] Deduced a trap composed of 28 places in 349 ms of which 4 ms to minimize.
[2024-05-28 17:25:03] [INFO ] Deduced a trap composed of 74 places in 355 ms of which 4 ms to minimize.
[2024-05-28 17:25:03] [INFO ] Deduced a trap composed of 301 places in 289 ms of which 3 ms to minimize.
[2024-05-28 17:25:04] [INFO ] Deduced a trap composed of 28 places in 404 ms of which 4 ms to minimize.
[2024-05-28 17:25:04] [INFO ] Deduced a trap composed of 74 places in 370 ms of which 4 ms to minimize.
[2024-05-28 17:25:04] [INFO ] Deduced a trap composed of 74 places in 344 ms of which 4 ms to minimize.
[2024-05-28 17:25:05] [INFO ] Deduced a trap composed of 341 places in 343 ms of which 4 ms to minimize.
[2024-05-28 17:25:05] [INFO ] Deduced a trap composed of 350 places in 314 ms of which 4 ms to minimize.
[2024-05-28 17:25:05] [INFO ] Deduced a trap composed of 338 places in 339 ms of which 4 ms to minimize.
[2024-05-28 17:25:06] [INFO ] Deduced a trap composed of 325 places in 366 ms of which 4 ms to minimize.
[2024-05-28 17:25:06] [INFO ] Deduced a trap composed of 292 places in 349 ms of which 4 ms to minimize.
[2024-05-28 17:25:06] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:25:09] [INFO ] Deduced a trap composed of 357 places in 360 ms of which 4 ms to minimize.
[2024-05-28 17:25:10] [INFO ] Deduced a trap composed of 98 places in 324 ms of which 4 ms to minimize.
[2024-05-28 17:25:10] [INFO ] Deduced a trap composed of 352 places in 380 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 62 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 35/35 constraints]
After SMT, in 64313ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 64325ms
Starting structural reductions in LTL mode, iteration 1 : 532/537 places, 1360/1365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118589 ms. Remains : 532/537 places, 1360/1365 transitions.
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-01
Product exploration explored 100000 steps with 7 reset in 651 ms.
Stack based approach found an accepted trace after 5368 steps with 0 reset with depth 5369 and stack size 5369 in 32 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-01 finished in 119693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1 U p2)))))'
Support contains 38 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 534 transition count 1362
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 534 transition count 1362
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 532 transition count 1360
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 532 transition count 1360
Applied a total of 10 rules in 41 ms. Remains 532 /537 variables (removed 5) and now considering 1360/1365 (removed 5) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 17:25:22] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:25:22] [INFO ] Invariant cache hit.
[2024-05-28 17:25:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:25:38] [INFO ] Deduced a trap composed of 142 places in 314 ms of which 4 ms to minimize.
[2024-05-28 17:25:38] [INFO ] Deduced a trap composed of 304 places in 314 ms of which 3 ms to minimize.
[2024-05-28 17:25:39] [INFO ] Deduced a trap composed of 323 places in 297 ms of which 4 ms to minimize.
[2024-05-28 17:25:39] [INFO ] Deduced a trap composed of 262 places in 288 ms of which 3 ms to minimize.
[2024-05-28 17:25:39] [INFO ] Deduced a trap composed of 280 places in 293 ms of which 4 ms to minimize.
[2024-05-28 17:25:40] [INFO ] Deduced a trap composed of 286 places in 304 ms of which 4 ms to minimize.
[2024-05-28 17:25:40] [INFO ] Deduced a trap composed of 39 places in 309 ms of which 2 ms to minimize.
[2024-05-28 17:25:41] [INFO ] Deduced a trap composed of 283 places in 328 ms of which 3 ms to minimize.
[2024-05-28 17:25:41] [INFO ] Deduced a trap composed of 267 places in 298 ms of which 4 ms to minimize.
[2024-05-28 17:25:42] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 2 ms to minimize.
[2024-05-28 17:25:42] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 2 ms to minimize.
[2024-05-28 17:25:42] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 2 ms to minimize.
[2024-05-28 17:25:42] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:25:42] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 2 ms to minimize.
[2024-05-28 17:25:44] [INFO ] Deduced a trap composed of 291 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:25:45] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.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 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s78 0.0)
(s79 0.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 1.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 7.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.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 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:25:58] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 4 ms to minimize.
[2024-05-28 17:25:58] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 4 ms to minimize.
[2024-05-28 17:25:59] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 3 ms to minimize.
[2024-05-28 17:25:59] [INFO ] Deduced a trap composed of 74 places in 301 ms of which 7 ms to minimize.
[2024-05-28 17:25:59] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 4 ms to minimize.
[2024-05-28 17:26:00] [INFO ] Deduced a trap composed of 74 places in 367 ms of which 4 ms to minimize.
[2024-05-28 17:26:00] [INFO ] Deduced a trap composed of 301 places in 341 ms of which 4 ms to minimize.
[2024-05-28 17:26:00] [INFO ] Deduced a trap composed of 28 places in 303 ms of which 2 ms to minimize.
[2024-05-28 17:26:01] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 3 ms to minimize.
[2024-05-28 17:26:01] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 3 ms to minimize.
[2024-05-28 17:26:01] [INFO ] Deduced a trap composed of 341 places in 277 ms of which 3 ms to minimize.
[2024-05-28 17:26:02] [INFO ] Deduced a trap composed of 350 places in 334 ms of which 4 ms to minimize.
[2024-05-28 17:26:02] [INFO ] Deduced a trap composed of 338 places in 364 ms of which 4 ms to minimize.
[2024-05-28 17:26:02] [INFO ] Deduced a trap composed of 325 places in 268 ms of which 3 ms to minimize.
[2024-05-28 17:26:03] [INFO ] Deduced a trap composed of 292 places in 277 ms of which 3 ms to minimize.
[2024-05-28 17:26:03] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 2 ms to minimize.
[2024-05-28 17:26:06] [INFO ] Deduced a trap composed of 357 places in 343 ms of which 4 ms to minimize.
[2024-05-28 17:26:06] [INFO ] Deduced a trap composed of 98 places in 333 ms of which 4 ms to minimize.
[2024-05-28 17:26:07] [INFO ] Deduced a trap composed of 352 places in 343 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 62 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 35/35 constraints]
After SMT, in 45628ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45660ms
[2024-05-28 17:26:07] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:26:07] [INFO ] Invariant cache hit.
[2024-05-28 17:26:08] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-28 17:26:08] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:26:08] [INFO ] Invariant cache hit.
[2024-05-28 17:26:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:26:18] [INFO ] Implicit Places using invariants and state equation in 10285 ms returned []
Implicit Place search using SMT with State Equation took 10858 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-28 17:26:18] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:26:18] [INFO ] Invariant cache hit.
[2024-05-28 17:26:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:26:33] [INFO ] Deduced a trap composed of 142 places in 288 ms of which 3 ms to minimize.
[2024-05-28 17:26:34] [INFO ] Deduced a trap composed of 304 places in 313 ms of which 3 ms to minimize.
[2024-05-28 17:26:34] [INFO ] Deduced a trap composed of 323 places in 304 ms of which 4 ms to minimize.
[2024-05-28 17:26:35] [INFO ] Deduced a trap composed of 262 places in 266 ms of which 4 ms to minimize.
[2024-05-28 17:26:35] [INFO ] Deduced a trap composed of 280 places in 291 ms of which 4 ms to minimize.
[2024-05-28 17:26:35] [INFO ] Deduced a trap composed of 286 places in 305 ms of which 4 ms to minimize.
[2024-05-28 17:26:36] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 2 ms to minimize.
[2024-05-28 17:26:36] [INFO ] Deduced a trap composed of 283 places in 325 ms of which 3 ms to minimize.
[2024-05-28 17:26:37] [INFO ] Deduced a trap composed of 267 places in 282 ms of which 3 ms to minimize.
[2024-05-28 17:26:37] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 2 ms to minimize.
[2024-05-28 17:26:37] [INFO ] Deduced a trap composed of 86 places in 172 ms of which 2 ms to minimize.
[2024-05-28 17:26:37] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 2 ms to minimize.
[2024-05-28 17:26:38] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 2 ms to minimize.
[2024-05-28 17:26:38] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 2 ms to minimize.
[2024-05-28 17:26:40] [INFO ] Deduced a trap composed of 291 places in 274 ms of which 3 ms to minimize.
[2024-05-28 17:26:41] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:27:03] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 4 ms to minimize.
[2024-05-28 17:27:03] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 5 ms to minimize.
[2024-05-28 17:27:04] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 3 ms to minimize.
[2024-05-28 17:27:04] [INFO ] Deduced a trap composed of 74 places in 330 ms of which 4 ms to minimize.
[2024-05-28 17:27:04] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 4 ms to minimize.
[2024-05-28 17:27:05] [INFO ] Deduced a trap composed of 74 places in 358 ms of which 4 ms to minimize.
[2024-05-28 17:27:05] [INFO ] Deduced a trap composed of 301 places in 341 ms of which 4 ms to minimize.
[2024-05-28 17:27:05] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 3 ms to minimize.
[2024-05-28 17:27:06] [INFO ] Deduced a trap composed of 74 places in 345 ms of which 5 ms to minimize.
[2024-05-28 17:27:06] [INFO ] Deduced a trap composed of 74 places in 240 ms of which 3 ms to minimize.
[2024-05-28 17:27:06] [INFO ] Deduced a trap composed of 341 places in 355 ms of which 4 ms to minimize.
[2024-05-28 17:27:07] [INFO ] Deduced a trap composed of 350 places in 294 ms of which 3 ms to minimize.
[2024-05-28 17:27:07] [INFO ] Deduced a trap composed of 338 places in 344 ms of which 4 ms to minimize.
[2024-05-28 17:27:07] [INFO ] Deduced a trap composed of 325 places in 323 ms of which 4 ms to minimize.
[2024-05-28 17:27:08] [INFO ] Deduced a trap composed of 292 places in 345 ms of which 3 ms to minimize.
[2024-05-28 17:27:08] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:27:10] [INFO ] Deduced a trap composed of 357 places in 350 ms of which 5 ms to minimize.
[2024-05-28 17:27:11] [INFO ] Deduced a trap composed of 98 places in 321 ms of which 4 ms to minimize.
[2024-05-28 17:27:11] [INFO ] Deduced a trap composed of 352 places in 346 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 62 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 35/35 constraints]
After SMT, in 64666ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 64698ms
Starting structural reductions in LTL mode, iteration 1 : 532/537 places, 1360/1365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121270 ms. Remains : 532/537 places, 1360/1365 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 901 ms.
Product exploration explored 100000 steps with 50000 reset in 609 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (OR p2 p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 29 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-05 finished in 123171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 537 transition count 1327
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 499 transition count 1327
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 76 place count 499 transition count 1266
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 198 place count 438 transition count 1266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 199 place count 437 transition count 1265
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 437 transition count 1265
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 320 place count 377 transition count 1205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 322 place count 375 transition count 1203
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 375 transition count 1203
Applied a total of 324 rules in 172 ms. Remains 375 /537 variables (removed 162) and now considering 1203/1365 (removed 162) transitions.
Running 1199 sub problems to find dead transitions.
[2024-05-28 17:27:25] [INFO ] Flow matrix only has 1179 transitions (discarded 24 similar events)
// Phase 1: matrix 1179 rows 375 cols
[2024-05-28 17:27:25] [INFO ] Computed 40 invariants in 40 ms
[2024-05-28 17:27:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:27:36] [INFO ] Deduced a trap composed of 49 places in 266 ms of which 3 ms to minimize.
[2024-05-28 17:27:37] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 3 ms to minimize.
[2024-05-28 17:27:37] [INFO ] Deduced a trap composed of 158 places in 271 ms of which 3 ms to minimize.
[2024-05-28 17:27:37] [INFO ] Deduced a trap composed of 19 places in 292 ms of which 3 ms to minimize.
[2024-05-28 17:27:37] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 2 ms to minimize.
[2024-05-28 17:27:37] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:27:38] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:27:38] [INFO ] Deduced a trap composed of 154 places in 247 ms of which 2 ms to minimize.
[2024-05-28 17:27:39] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 1 ms to minimize.
[2024-05-28 17:27:40] [INFO ] Deduced a trap composed of 127 places in 316 ms of which 3 ms to minimize.
[2024-05-28 17:27:41] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 2 ms to minimize.
[2024-05-28 17:27:48] [INFO ] Deduced a trap composed of 193 places in 227 ms of which 2 ms to minimize.
[2024-05-28 17:27:48] [INFO ] Deduced a trap composed of 185 places in 300 ms of which 3 ms to minimize.
[2024-05-28 17:27:49] [INFO ] Deduced a trap composed of 189 places in 276 ms of which 3 ms to minimize.
[2024-05-28 17:27:50] [INFO ] Deduced a trap composed of 147 places in 267 ms of which 3 ms to minimize.
SMT process timed out in 24576ms, After SMT, problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 24593ms
[2024-05-28 17:27:50] [INFO ] Flow matrix only has 1179 transitions (discarded 24 similar events)
[2024-05-28 17:27:50] [INFO ] Invariant cache hit.
[2024-05-28 17:27:50] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-28 17:27:50] [INFO ] Flow matrix only has 1179 transitions (discarded 24 similar events)
[2024-05-28 17:27:50] [INFO ] Invariant cache hit.
[2024-05-28 17:27:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:27:59] [INFO ] Implicit Places using invariants and state equation in 8617 ms returned []
Implicit Place search using SMT with State Equation took 9074 ms to find 0 implicit places.
[2024-05-28 17:27:59] [INFO ] Redundant transitions in 136 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 17:27:59] [INFO ] Flow matrix only has 1179 transitions (discarded 24 similar events)
[2024-05-28 17:27:59] [INFO ] Invariant cache hit.
[2024-05-28 17:27:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 17:28:09] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:28:09] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:28:09] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:28:09] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:28:09] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 3 ms to minimize.
[2024-05-28 17:28:10] [INFO ] Deduced a trap composed of 167 places in 313 ms of which 3 ms to minimize.
[2024-05-28 17:28:10] [INFO ] Deduced a trap composed of 15 places in 327 ms of which 3 ms to minimize.
[2024-05-28 17:28:10] [INFO ] Deduced a trap composed of 181 places in 295 ms of which 2 ms to minimize.
[2024-05-28 17:28:11] [INFO ] Deduced a trap composed of 165 places in 263 ms of which 2 ms to minimize.
[2024-05-28 17:28:11] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:28:11] [INFO ] Deduced a trap composed of 145 places in 260 ms of which 2 ms to minimize.
[2024-05-28 17:28:12] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 3 ms to minimize.
[2024-05-28 17:28:13] [INFO ] Deduced a trap composed of 127 places in 231 ms of which 2 ms to minimize.
[2024-05-28 17:28:14] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 2 ms to minimize.
[2024-05-28 17:28:17] [INFO ] Deduced a trap composed of 169 places in 241 ms of which 3 ms to minimize.
[2024-05-28 17:28:18] [INFO ] Deduced a trap composed of 176 places in 223 ms of which 3 ms to minimize.
[2024-05-28 17:28:21] [INFO ] Deduced a trap composed of 185 places in 268 ms of which 3 ms to minimize.
[2024-05-28 17:28:22] [INFO ] Deduced a trap composed of 171 places in 245 ms of which 2 ms to minimize.
[2024-05-28 17:28:22] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 3 ms to minimize.
[2024-05-28 17:28:23] [INFO ] Deduced a trap composed of 103 places in 272 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 17:28:32] [INFO ] Deduced a trap composed of 143 places in 261 ms of which 3 ms to minimize.
[2024-05-28 17:28:33] [INFO ] Deduced a trap composed of 160 places in 316 ms of which 3 ms to minimize.
SMT process timed out in 34306ms, After SMT, problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 34328ms
Starting structural reductions in SI_LTL mode, iteration 1 : 375/537 places, 1203/1365 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68323 ms. Remains : 375/537 places, 1203/1365 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-09
Stuttering criterion allowed to conclude after 10594 steps with 0 reset in 86 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-09 finished in 68621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(G(p1))))))'
Support contains 3 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 534 transition count 1362
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 534 transition count 1362
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 532 transition count 1360
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 532 transition count 1360
Applied a total of 10 rules in 46 ms. Remains 532 /537 variables (removed 5) and now considering 1360/1365 (removed 5) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 17:28:34] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 17:28:34] [INFO ] Computed 40 invariants in 49 ms
[2024-05-28 17:28:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:28:47] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
[2024-05-28 17:28:47] [INFO ] Deduced a trap composed of 139 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:28:48] [INFO ] Deduced a trap composed of 304 places in 241 ms of which 3 ms to minimize.
[2024-05-28 17:28:48] [INFO ] Deduced a trap composed of 278 places in 252 ms of which 3 ms to minimize.
[2024-05-28 17:28:48] [INFO ] Deduced a trap composed of 258 places in 222 ms of which 3 ms to minimize.
[2024-05-28 17:28:49] [INFO ] Deduced a trap composed of 286 places in 281 ms of which 3 ms to minimize.
[2024-05-28 17:28:50] [INFO ] Deduced a trap composed of 299 places in 288 ms of which 3 ms to minimize.
[2024-05-28 17:28:50] [INFO ] Deduced a trap composed of 253 places in 329 ms of which 3 ms to minimize.
[2024-05-28 17:28:50] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 3 ms to minimize.
[2024-05-28 17:28:51] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 2 ms to minimize.
[2024-05-28 17:28:51] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 2 ms to minimize.
[2024-05-28 17:28:53] [INFO ] Deduced a trap composed of 289 places in 241 ms of which 4 ms to minimize.
[2024-05-28 17:28:53] [INFO ] Deduced a trap composed of 348 places in 215 ms of which 3 ms to minimize.
[2024-05-28 17:28:53] [INFO ] Deduced a trap composed of 291 places in 290 ms of which 4 ms to minimize.
[2024-05-28 17:28:54] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 3 ms to minimize.
[2024-05-28 17:28:55] [INFO ] Deduced a trap composed of 321 places in 325 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:29:07] [INFO ] Deduced a trap composed of 344 places in 367 ms of which 4 ms to minimize.
[2024-05-28 17:29:13] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 4 ms to minimize.
[2024-05-28 17:29:14] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 5 ms to minimize.
[2024-05-28 17:29:14] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 4 ms to minimize.
[2024-05-28 17:29:14] [INFO ] Deduced a trap composed of 74 places in 300 ms of which 6 ms to minimize.
[2024-05-28 17:29:15] [INFO ] Deduced a trap composed of 28 places in 368 ms of which 3 ms to minimize.
[2024-05-28 17:29:15] [INFO ] Deduced a trap composed of 28 places in 384 ms of which 4 ms to minimize.
[2024-05-28 17:29:16] [INFO ] Deduced a trap composed of 303 places in 394 ms of which 4 ms to minimize.
[2024-05-28 17:29:16] [INFO ] Deduced a trap composed of 75 places in 358 ms of which 3 ms to minimize.
[2024-05-28 17:29:16] [INFO ] Deduced a trap composed of 74 places in 280 ms of which 3 ms to minimize.
[2024-05-28 17:29:16] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:29:17] [INFO ] Deduced a trap composed of 317 places in 288 ms of which 3 ms to minimize.
[2024-05-28 17:29:17] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:29:18] [INFO ] Deduced a trap composed of 342 places in 414 ms of which 4 ms to minimize.
[2024-05-28 17:29:18] [INFO ] Deduced a trap composed of 314 places in 401 ms of which 3 ms to minimize.
SMT process timed out in 44920ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44942ms
[2024-05-28 17:29:18] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:29:18] [INFO ] Invariant cache hit.
[2024-05-28 17:29:19] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-28 17:29:19] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:29:19] [INFO ] Invariant cache hit.
[2024-05-28 17:29:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:29:29] [INFO ] Implicit Places using invariants and state equation in 10389 ms returned []
Implicit Place search using SMT with State Equation took 10996 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-28 17:29:29] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:29:29] [INFO ] Invariant cache hit.
[2024-05-28 17:29:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:29:44] [INFO ] Deduced a trap composed of 142 places in 312 ms of which 4 ms to minimize.
[2024-05-28 17:29:45] [INFO ] Deduced a trap composed of 304 places in 323 ms of which 3 ms to minimize.
[2024-05-28 17:29:45] [INFO ] Deduced a trap composed of 323 places in 417 ms of which 5 ms to minimize.
[2024-05-28 17:29:45] [INFO ] Deduced a trap composed of 262 places in 261 ms of which 4 ms to minimize.
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 280 places in 235 ms of which 2 ms to minimize.
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 286 places in 274 ms of which 4 ms to minimize.
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 2 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 283 places in 327 ms of which 4 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 267 places in 312 ms of which 4 ms to minimize.
[2024-05-28 17:29:48] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 5 ms to minimize.
[2024-05-28 17:29:48] [INFO ] Deduced a trap composed of 86 places in 190 ms of which 2 ms to minimize.
[2024-05-28 17:29:48] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 2 ms to minimize.
[2024-05-28 17:29:48] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 2 ms to minimize.
[2024-05-28 17:29:49] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 2 ms to minimize.
[2024-05-28 17:29:51] [INFO ] Deduced a trap composed of 291 places in 269 ms of which 3 ms to minimize.
[2024-05-28 17:29:52] [INFO ] Deduced a trap composed of 42 places in 344 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:30:15] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 4 ms to minimize.
[2024-05-28 17:30:15] [INFO ] Deduced a trap composed of 5 places in 388 ms of which 4 ms to minimize.
[2024-05-28 17:30:16] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 3 ms to minimize.
[2024-05-28 17:30:16] [INFO ] Deduced a trap composed of 74 places in 293 ms of which 3 ms to minimize.
[2024-05-28 17:30:16] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 2 ms to minimize.
[2024-05-28 17:30:17] [INFO ] Deduced a trap composed of 74 places in 337 ms of which 4 ms to minimize.
[2024-05-28 17:30:17] [INFO ] Deduced a trap composed of 301 places in 305 ms of which 4 ms to minimize.
[2024-05-28 17:30:17] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 3 ms to minimize.
[2024-05-28 17:30:17] [INFO ] Deduced a trap composed of 74 places in 243 ms of which 2 ms to minimize.
[2024-05-28 17:30:18] [INFO ] Deduced a trap composed of 74 places in 367 ms of which 4 ms to minimize.
[2024-05-28 17:30:18] [INFO ] Deduced a trap composed of 341 places in 333 ms of which 3 ms to minimize.
[2024-05-28 17:30:18] [INFO ] Deduced a trap composed of 350 places in 273 ms of which 3 ms to minimize.
[2024-05-28 17:30:19] [INFO ] Deduced a trap composed of 338 places in 327 ms of which 3 ms to minimize.
[2024-05-28 17:30:19] [INFO ] Deduced a trap composed of 325 places in 298 ms of which 4 ms to minimize.
[2024-05-28 17:30:19] [INFO ] Deduced a trap composed of 292 places in 351 ms of which 4 ms to minimize.
[2024-05-28 17:30:20] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:30:22] [INFO ] Deduced a trap composed of 357 places in 353 ms of which 5 ms to minimize.
[2024-05-28 17:30:22] [INFO ] Deduced a trap composed of 98 places in 346 ms of which 3 ms to minimize.
[2024-05-28 17:30:23] [INFO ] Deduced a trap composed of 352 places in 393 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 62 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 35/35 constraints]
After SMT, in 65377ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 65406ms
Starting structural reductions in LTL mode, iteration 1 : 532/537 places, 1360/1365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121403 ms. Remains : 532/537 places, 1360/1365 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-11 finished in 121589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 537 transition count 1326
Reduce places removed 39 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 46 rules applied. Total rules applied 85 place count 498 transition count 1319
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 92 place count 491 transition count 1319
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 92 place count 491 transition count 1259
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 212 place count 431 transition count 1259
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 332 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 334 place count 369 transition count 1197
Iterating global reduction 3 with 2 rules applied. Total rules applied 336 place count 369 transition count 1197
Applied a total of 336 rules in 84 ms. Remains 369 /537 variables (removed 168) and now considering 1197/1365 (removed 168) transitions.
Running 1193 sub problems to find dead transitions.
[2024-05-28 17:30:35] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-05-28 17:30:35] [INFO ] Computed 40 invariants in 19 ms
[2024-05-28 17:30:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:30:47] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 2 ms to minimize.
[2024-05-28 17:30:47] [INFO ] Deduced a trap composed of 122 places in 238 ms of which 3 ms to minimize.
[2024-05-28 17:30:47] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 2 ms to minimize.
[2024-05-28 17:30:48] [INFO ] Deduced a trap composed of 58 places in 510 ms of which 3 ms to minimize.
[2024-05-28 17:30:48] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 2 ms to minimize.
[2024-05-28 17:30:49] [INFO ] Deduced a trap composed of 121 places in 228 ms of which 3 ms to minimize.
[2024-05-28 17:30:51] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 2 ms to minimize.
[2024-05-28 17:30:56] [INFO ] Deduced a trap composed of 163 places in 220 ms of which 3 ms to minimize.
[2024-05-28 17:30:56] [INFO ] Deduced a trap composed of 203 places in 259 ms of which 3 ms to minimize.
[2024-05-28 17:30:56] [INFO ] Deduced a trap composed of 199 places in 263 ms of which 3 ms to minimize.
[2024-05-28 17:30:57] [INFO ] Deduced a trap composed of 170 places in 243 ms of which 2 ms to minimize.
[2024-05-28 17:30:57] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 2 ms to minimize.
[2024-05-28 17:30:57] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 2 ms to minimize.
[2024-05-28 17:30:58] [INFO ] Deduced a trap composed of 183 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 56 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:31:17] [INFO ] Deduced a trap composed of 102 places in 260 ms of which 3 ms to minimize.
[2024-05-28 17:31:17] [INFO ] Deduced a trap composed of 154 places in 244 ms of which 2 ms to minimize.
[2024-05-28 17:31:18] [INFO ] Deduced a trap composed of 140 places in 255 ms of which 2 ms to minimize.
[2024-05-28 17:31:18] [INFO ] Deduced a trap composed of 162 places in 267 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 60 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 24/24 constraints]
After SMT, in 44541ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 44556ms
[2024-05-28 17:31:20] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:31:20] [INFO ] Invariant cache hit.
[2024-05-28 17:31:20] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-28 17:31:20] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:31:20] [INFO ] Invariant cache hit.
[2024-05-28 17:31:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:31:26] [INFO ] Implicit Places using invariants and state equation in 6015 ms returned []
Implicit Place search using SMT with State Equation took 6510 ms to find 0 implicit places.
[2024-05-28 17:31:26] [INFO ] Redundant transitions in 89 ms returned []
Running 1193 sub problems to find dead transitions.
[2024-05-28 17:31:26] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:31:26] [INFO ] Invariant cache hit.
[2024-05-28 17:31:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:31:37] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:31:37] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:31:37] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:31:37] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:31:37] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:31:37] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:31:38] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 3 ms to minimize.
[2024-05-28 17:31:38] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 3 ms to minimize.
[2024-05-28 17:31:39] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 2 ms to minimize.
[2024-05-28 17:31:39] [INFO ] Deduced a trap composed of 121 places in 286 ms of which 3 ms to minimize.
[2024-05-28 17:31:40] [INFO ] Deduced a trap composed of 120 places in 204 ms of which 2 ms to minimize.
[2024-05-28 17:31:42] [INFO ] Deduced a trap composed of 179 places in 248 ms of which 2 ms to minimize.
[2024-05-28 17:31:45] [INFO ] Deduced a trap composed of 173 places in 326 ms of which 3 ms to minimize.
[2024-05-28 17:31:45] [INFO ] Deduced a trap composed of 156 places in 275 ms of which 3 ms to minimize.
[2024-05-28 17:31:49] [INFO ] Deduced a trap composed of 178 places in 231 ms of which 5 ms to minimize.
[2024-05-28 17:31:49] [INFO ] Deduced a trap composed of 129 places in 245 ms of which 3 ms to minimize.
[2024-05-28 17:31:49] [INFO ] Deduced a trap composed of 194 places in 248 ms of which 3 ms to minimize.
[2024-05-28 17:31:50] [INFO ] Deduced a trap composed of 212 places in 252 ms of which 3 ms to minimize.
[2024-05-28 17:31:50] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 2 ms to minimize.
[2024-05-28 17:31:50] [INFO ] Deduced a trap composed of 163 places in 260 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:32:00] [INFO ] Deduced a trap composed of 181 places in 297 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 57 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:32:06] [INFO ] Deduced a trap composed of 177 places in 307 ms of which 3 ms to minimize.
[2024-05-28 17:32:12] [INFO ] Deduced a trap composed of 39 places in 294 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 59 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 23/23 constraints]
After SMT, in 64363ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 64382ms
Starting structural reductions in SI_LTL mode, iteration 1 : 369/537 places, 1197/1365 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115640 ms. Remains : 369/537 places, 1197/1365 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-12
Stuttering criterion allowed to conclude after 23432 steps with 2 reset in 140 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-12 finished in 115852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
Support contains 8 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 537 transition count 1321
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 493 transition count 1321
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 88 place count 493 transition count 1260
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 210 place count 432 transition count 1260
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 324 place count 375 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 325 place count 374 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 326 place count 374 transition count 1202
Applied a total of 326 rules in 115 ms. Remains 374 /537 variables (removed 163) and now considering 1202/1365 (removed 163) transitions.
Running 1198 sub problems to find dead transitions.
[2024-05-28 17:32:31] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
// Phase 1: matrix 1178 rows 374 cols
[2024-05-28 17:32:31] [INFO ] Computed 40 invariants in 35 ms
[2024-05-28 17:32:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 17:32:41] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 17:32:50] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1552 variables, and 33 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 17:32:57] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 3 ms to minimize.
[2024-05-28 17:32:57] [INFO ] Deduced a trap composed of 50 places in 254 ms of which 2 ms to minimize.
[2024-05-28 17:32:57] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 2 ms to minimize.
[2024-05-28 17:32:57] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:32:57] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:32:58] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:33:00] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 63 places in 246 ms of which 2 ms to minimize.
[2024-05-28 17:33:06] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 2 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 59 places in 262 ms of which 2 ms to minimize.
[2024-05-28 17:33:09] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 2 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1552 variables, and 45 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 14/14 constraints]
After SMT, in 44267ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 44282ms
[2024-05-28 17:33:15] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
[2024-05-28 17:33:15] [INFO ] Invariant cache hit.
[2024-05-28 17:33:16] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-28 17:33:16] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
[2024-05-28 17:33:16] [INFO ] Invariant cache hit.
[2024-05-28 17:33:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:33:22] [INFO ] Implicit Places using invariants and state equation in 6507 ms returned []
Implicit Place search using SMT with State Equation took 7010 ms to find 0 implicit places.
[2024-05-28 17:33:22] [INFO ] Redundant transitions in 50 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-28 17:33:22] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
[2024-05-28 17:33:22] [INFO ] Invariant cache hit.
[2024-05-28 17:33:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 17:33:33] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:33:38] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Problem TDEAD37 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD832 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/371 variables, 1/34 constraints. Problems are: Problem set: 90 solved, 1108 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 371/1552 variables, and 34 constraints, problems are : Problem set: 90 solved, 1108 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 90 solved, 1108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 2/33 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
[2024-05-28 17:33:59] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 3 ms to minimize.
[2024-05-28 17:33:59] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 1 ms to minimize.
[2024-05-28 17:33:59] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-28 17:33:59] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:34:00] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 2 ms to minimize.
[2024-05-28 17:34:00] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 6/39 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
[2024-05-28 17:34:09] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:34:09] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 2/41 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
[2024-05-28 17:34:16] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1/42 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
[2024-05-28 17:34:22] [INFO ] Deduced a trap composed of 59 places in 240 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1552 variables, and 43 constraints, problems are : Problem set: 90 solved, 1108 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 12/12 constraints]
After SMT, in 64874ms problems are : Problem set: 90 solved, 1108 unsolved
Search for dead transitions found 90 dead transitions in 64892ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 374/537 places, 1112/1365 transitions.
Applied a total of 0 rules in 18 ms. Remains 374 /374 variables (removed 0) and now considering 1112/1112 (removed 0) transitions.
[2024-05-28 17:34:27] [INFO ] Redundant transitions in 16 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 116411 ms. Remains : 374/537 places, 1112/1365 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-13
Product exploration explored 100000 steps with 6810 reset in 620 ms.
Product exploration explored 100000 steps with 6843 reset in 622 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 165 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 17:34:29] [INFO ] Flow matrix only has 1088 transitions (discarded 24 similar events)
// Phase 1: matrix 1088 rows 374 cols
[2024-05-28 17:34:29] [INFO ] Computed 40 invariants in 24 ms
[2024-05-28 17:34:30] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-28 17:34:30] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 44 ms returned sat
[2024-05-28 17:34:31] [INFO ] [Real]Absence check using state equation in 1304 ms returned sat
[2024-05-28 17:34:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:34:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 17:34:32] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 102 ms returned sat
[2024-05-28 17:34:33] [INFO ] [Nat]Absence check using state equation in 1406 ms returned sat
[2024-05-28 17:34:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:34:34] [INFO ] [Nat]Added 120 Read/Feed constraints in 787 ms returned sat
[2024-05-28 17:34:34] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:34:35] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:34:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 875 ms
[2024-05-28 17:34:35] [INFO ] Computed and/alt/rep : 694/3061/676 causal constraints (skipped 408 transitions) in 139 ms.
[2024-05-28 17:34:39] [INFO ] Added : 158 causal constraints over 32 iterations in 3918 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 8 out of 374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 374/374 places, 1112/1112 transitions.
Applied a total of 0 rules in 39 ms. Remains 374 /374 variables (removed 0) and now considering 1112/1112 (removed 0) transitions.
Running 1108 sub problems to find dead transitions.
[2024-05-28 17:34:39] [INFO ] Flow matrix only has 1088 transitions (discarded 24 similar events)
[2024-05-28 17:34:39] [INFO ] Invariant cache hit.
[2024-05-28 17:34:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 17:34:47] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 17:34:55] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:35:00] [INFO ] Deduced a trap composed of 100 places in 128 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1462 variables, and 34 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1108/1108 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 17:35:03] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 3 ms to minimize.
[2024-05-28 17:35:03] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 2 ms to minimize.
[2024-05-28 17:35:03] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:35:06] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:35:06] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:35:09] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 2 ms to minimize.
[2024-05-28 17:35:09] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 5 (OVERLAPS) 1/371 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/1462 variables, and 43 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1108 constraints, Known Traps: 11/11 constraints]
After SMT, in 42855ms problems are : Problem set: 0 solved, 1108 unsolved
Search for dead transitions found 0 dead transitions in 42873ms
[2024-05-28 17:35:22] [INFO ] Flow matrix only has 1088 transitions (discarded 24 similar events)
[2024-05-28 17:35:22] [INFO ] Invariant cache hit.
[2024-05-28 17:35:22] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-28 17:35:22] [INFO ] Flow matrix only has 1088 transitions (discarded 24 similar events)
[2024-05-28 17:35:22] [INFO ] Invariant cache hit.
[2024-05-28 17:35:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:35:29] [INFO ] Implicit Places using invariants and state equation in 6721 ms returned []
Implicit Place search using SMT with State Equation took 7231 ms to find 0 implicit places.
[2024-05-28 17:35:29] [INFO ] Redundant transitions in 16 ms returned []
Running 1108 sub problems to find dead transitions.
[2024-05-28 17:35:29] [INFO ] Flow matrix only has 1088 transitions (discarded 24 similar events)
[2024-05-28 17:35:29] [INFO ] Invariant cache hit.
[2024-05-28 17:35:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 17:35:37] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 17:35:44] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
[2024-05-28 17:35:49] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 5 (OVERLAPS) 1/371 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/1462 variables, and 35 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1108/1108 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 17:36:03] [INFO ] Deduced a trap composed of 50 places in 256 ms of which 3 ms to minimize.
[2024-05-28 17:36:03] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 2 ms to minimize.
[2024-05-28 17:36:04] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:36:04] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:36:05] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:36:06] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:36:08] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 2 ms to minimize.
[2024-05-28 17:36:08] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 5 (OVERLAPS) 1/371 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
At refinement iteration 7 (OVERLAPS) 3/374 variables, 8/51 constraints. Problems are: Problem set: 234 solved, 874 unsolved
[2024-05-28 17:36:27] [INFO ] Deduced a trap composed of 79 places in 285 ms of which 3 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 168 places in 321 ms of which 3 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 171 places in 300 ms of which 3 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 35 places in 293 ms of which 2 ms to minimize.
[2024-05-28 17:36:28] [INFO ] Deduced a trap composed of 135 places in 240 ms of which 2 ms to minimize.
[2024-05-28 17:36:29] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 2 ms to minimize.
[2024-05-28 17:36:30] [INFO ] Deduced a trap composed of 208 places in 281 ms of which 3 ms to minimize.
[2024-05-28 17:36:31] [INFO ] Deduced a trap composed of 202 places in 304 ms of which 3 ms to minimize.
[2024-05-28 17:36:31] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 9)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 3)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/1462 variables, and 60 constraints, problems are : Problem set: 234 solved, 874 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1108 constraints, Known Traps: 20/20 constraints]
After SMT, in 62883ms problems are : Problem set: 234 solved, 874 unsolved
Search for dead transitions found 234 dead transitions in 62895ms
Found 234 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 234 transitions
Dead transitions reduction (with SMT) removed 234 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 374/374 places, 878/1112 transitions.
Applied a total of 0 rules in 31 ms. Remains 374 /374 variables (removed 0) and now considering 878/878 (removed 0) transitions.
[2024-05-28 17:36:32] [INFO ] Redundant transitions in 24 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 113135 ms. Remains : 374/374 places, 878/1112 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 268 steps (0 resets) in 10 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 17:36:33] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
// Phase 1: matrix 854 rows 374 cols
[2024-05-28 17:36:33] [INFO ] Computed 40 invariants in 21 ms
[2024-05-28 17:36:33] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-28 17:36:33] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 42 ms returned sat
[2024-05-28 17:36:34] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2024-05-28 17:36:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:36:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 17:36:35] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 54 ms returned sat
[2024-05-28 17:36:36] [INFO ] [Nat]Absence check using state equation in 1335 ms returned sat
[2024-05-28 17:36:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:36:37] [INFO ] [Nat]Added 120 Read/Feed constraints in 1038 ms returned sat
[2024-05-28 17:36:38] [INFO ] Deduced a trap composed of 186 places in 290 ms of which 4 ms to minimize.
[2024-05-28 17:36:38] [INFO ] Deduced a trap composed of 170 places in 251 ms of which 3 ms to minimize.
[2024-05-28 17:36:39] [INFO ] Deduced a trap composed of 162 places in 255 ms of which 3 ms to minimize.
[2024-05-28 17:36:40] [INFO ] Deduced a trap composed of 173 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:36:40] [INFO ] Deduced a trap composed of 190 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:36:41] [INFO ] Deduced a trap composed of 170 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:36:41] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 3 ms to minimize.
[2024-05-28 17:36:42] [INFO ] Deduced a trap composed of 187 places in 256 ms of which 2 ms to minimize.
[2024-05-28 17:36:42] [INFO ] Deduced a trap composed of 168 places in 254 ms of which 2 ms to minimize.
[2024-05-28 17:36:43] [INFO ] Deduced a trap composed of 183 places in 272 ms of which 3 ms to minimize.
[2024-05-28 17:36:43] [INFO ] Deduced a trap composed of 50 places in 260 ms of which 3 ms to minimize.
[2024-05-28 17:36:44] [INFO ] Deduced a trap composed of 148 places in 254 ms of which 3 ms to minimize.
[2024-05-28 17:36:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6617 ms
[2024-05-28 17:36:44] [INFO ] Computed and/alt/rep : 586/3361/568 causal constraints (skipped 282 transitions) in 94 ms.
[2024-05-28 17:36:50] [INFO ] Added : 265 causal constraints over 53 iterations in 5495 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 6957 reset in 441 ms.
Product exploration explored 100000 steps with 6824 reset in 425 ms.
Built C files in :
/tmp/ltsmin14268506873544676584
[2024-05-28 17:36:51] [INFO ] Computing symmetric may disable matrix : 878 transitions.
[2024-05-28 17:36:51] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:36:51] [INFO ] Computing symmetric may enable matrix : 878 transitions.
[2024-05-28 17:36:51] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:36:51] [INFO ] Computing Do-Not-Accords matrix : 878 transitions.
[2024-05-28 17:36:51] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:36:51] [INFO ] Built C files in 283ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14268506873544676584
Running compilation step : cd /tmp/ltsmin14268506873544676584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14268506873544676584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14268506873544676584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 8 out of 374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 374/374 places, 878/878 transitions.
Applied a total of 0 rules in 26 ms. Remains 374 /374 variables (removed 0) and now considering 878/878 (removed 0) transitions.
Running 874 sub problems to find dead transitions.
[2024-05-28 17:36:54] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2024-05-28 17:36:54] [INFO ] Invariant cache hit.
[2024-05-28 17:36:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 17:36:59] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:36:59] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:36:59] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 0 ms to minimize.
[2024-05-28 17:36:59] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:36:59] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2024-05-28 17:37:00] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:37:00] [INFO ] Deduced a trap composed of 179 places in 228 ms of which 3 ms to minimize.
[2024-05-28 17:37:00] [INFO ] Deduced a trap composed of 187 places in 199 ms of which 3 ms to minimize.
[2024-05-28 17:37:00] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 3 ms to minimize.
[2024-05-28 17:37:00] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 3 ms to minimize.
[2024-05-28 17:37:01] [INFO ] Deduced a trap composed of 142 places in 224 ms of which 2 ms to minimize.
[2024-05-28 17:37:01] [INFO ] Deduced a trap composed of 175 places in 220 ms of which 4 ms to minimize.
[2024-05-28 17:37:01] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 3 ms to minimize.
[2024-05-28 17:37:02] [INFO ] Deduced a trap composed of 143 places in 188 ms of which 2 ms to minimize.
[2024-05-28 17:37:02] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 3 ms to minimize.
[2024-05-28 17:37:02] [INFO ] Deduced a trap composed of 116 places in 237 ms of which 3 ms to minimize.
[2024-05-28 17:37:03] [INFO ] Deduced a trap composed of 190 places in 228 ms of which 2 ms to minimize.
[2024-05-28 17:37:03] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 3 ms to minimize.
[2024-05-28 17:37:03] [INFO ] Deduced a trap composed of 153 places in 210 ms of which 3 ms to minimize.
[2024-05-28 17:37:03] [INFO ] Deduced a trap composed of 195 places in 236 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 17:37:04] [INFO ] Deduced a trap composed of 184 places in 227 ms of which 3 ms to minimize.
[2024-05-28 17:37:04] [INFO ] Deduced a trap composed of 155 places in 200 ms of which 2 ms to minimize.
[2024-05-28 17:37:05] [INFO ] Deduced a trap composed of 196 places in 199 ms of which 3 ms to minimize.
[2024-05-28 17:37:05] [INFO ] Deduced a trap composed of 206 places in 206 ms of which 4 ms to minimize.
[2024-05-28 17:37:05] [INFO ] Deduced a trap composed of 183 places in 198 ms of which 3 ms to minimize.
[2024-05-28 17:37:05] [INFO ] Deduced a trap composed of 177 places in 195 ms of which 2 ms to minimize.
[2024-05-28 17:37:05] [INFO ] Deduced a trap composed of 201 places in 222 ms of which 3 ms to minimize.
[2024-05-28 17:37:06] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 3 ms to minimize.
[2024-05-28 17:37:06] [INFO ] Deduced a trap composed of 190 places in 229 ms of which 2 ms to minimize.
[2024-05-28 17:37:06] [INFO ] Deduced a trap composed of 204 places in 223 ms of which 3 ms to minimize.
[2024-05-28 17:37:06] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 3 ms to minimize.
[2024-05-28 17:37:06] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 3 ms to minimize.
[2024-05-28 17:37:07] [INFO ] Deduced a trap composed of 177 places in 201 ms of which 3 ms to minimize.
[2024-05-28 17:37:07] [INFO ] Deduced a trap composed of 195 places in 219 ms of which 2 ms to minimize.
[2024-05-28 17:37:07] [INFO ] Deduced a trap composed of 188 places in 192 ms of which 3 ms to minimize.
[2024-05-28 17:37:07] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 3 ms to minimize.
[2024-05-28 17:37:08] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 2 ms to minimize.
[2024-05-28 17:37:08] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 2 ms to minimize.
[2024-05-28 17:37:08] [INFO ] Deduced a trap composed of 216 places in 189 ms of which 3 ms to minimize.
[2024-05-28 17:37:09] [INFO ] Deduced a trap composed of 159 places in 229 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 874 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1228 variables, and 76 constraints, problems are : Problem set: 0 solved, 874 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 874/874 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 874 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 40/76 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 17:37:20] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 2 ms to minimize.
[2024-05-28 17:37:21] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 3 ms to minimize.
[2024-05-28 17:37:21] [INFO ] Deduced a trap composed of 170 places in 214 ms of which 2 ms to minimize.
[2024-05-28 17:37:21] [INFO ] Deduced a trap composed of 195 places in 179 ms of which 3 ms to minimize.
[2024-05-28 17:37:21] [INFO ] Deduced a trap composed of 185 places in 205 ms of which 2 ms to minimize.
[2024-05-28 17:37:22] [INFO ] Deduced a trap composed of 181 places in 183 ms of which 3 ms to minimize.
[2024-05-28 17:37:22] [INFO ] Deduced a trap composed of 175 places in 168 ms of which 2 ms to minimize.
[2024-05-28 17:37:22] [INFO ] Deduced a trap composed of 201 places in 192 ms of which 2 ms to minimize.
[2024-05-28 17:37:22] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 2 ms to minimize.
[2024-05-28 17:37:22] [INFO ] Deduced a trap composed of 174 places in 175 ms of which 3 ms to minimize.
[2024-05-28 17:37:22] [INFO ] Deduced a trap composed of 207 places in 180 ms of which 2 ms to minimize.
[2024-05-28 17:37:23] [INFO ] Deduced a trap composed of 185 places in 245 ms of which 4 ms to minimize.
[2024-05-28 17:37:23] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 2 ms to minimize.
[2024-05-28 17:37:23] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
[2024-05-28 17:37:23] [INFO ] Deduced a trap composed of 173 places in 203 ms of which 2 ms to minimize.
[2024-05-28 17:37:24] [INFO ] Deduced a trap composed of 197 places in 184 ms of which 3 ms to minimize.
[2024-05-28 17:37:24] [INFO ] Deduced a trap composed of 183 places in 182 ms of which 2 ms to minimize.
[2024-05-28 17:37:24] [INFO ] Deduced a trap composed of 193 places in 180 ms of which 2 ms to minimize.
[2024-05-28 17:37:24] [INFO ] Deduced a trap composed of 213 places in 151 ms of which 2 ms to minimize.
[2024-05-28 17:37:24] [INFO ] Deduced a trap composed of 180 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 17:37:30] [INFO ] Deduced a trap composed of 180 places in 268 ms of which 3 ms to minimize.
[2024-05-28 17:37:30] [INFO ] Deduced a trap composed of 138 places in 259 ms of which 3 ms to minimize.
[2024-05-28 17:37:31] [INFO ] Deduced a trap composed of 128 places in 257 ms of which 2 ms to minimize.
[2024-05-28 17:37:31] [INFO ] Deduced a trap composed of 147 places in 187 ms of which 2 ms to minimize.
[2024-05-28 17:37:31] [INFO ] Deduced a trap composed of 142 places in 226 ms of which 3 ms to minimize.
[2024-05-28 17:37:32] [INFO ] Deduced a trap composed of 165 places in 227 ms of which 3 ms to minimize.
[2024-05-28 17:37:32] [INFO ] Deduced a trap composed of 189 places in 255 ms of which 3 ms to minimize.
[2024-05-28 17:37:33] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 3 ms to minimize.
[2024-05-28 17:37:33] [INFO ] Deduced a trap composed of 191 places in 236 ms of which 3 ms to minimize.
[2024-05-28 17:37:33] [INFO ] Deduced a trap composed of 182 places in 219 ms of which 2 ms to minimize.
[2024-05-28 17:37:33] [INFO ] Deduced a trap composed of 184 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:37:34] [INFO ] Deduced a trap composed of 170 places in 226 ms of which 3 ms to minimize.
[2024-05-28 17:37:34] [INFO ] Deduced a trap composed of 171 places in 236 ms of which 3 ms to minimize.
[2024-05-28 17:37:34] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2024-05-28 17:37:34] [INFO ] Deduced a trap composed of 167 places in 242 ms of which 2 ms to minimize.
[2024-05-28 17:37:35] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 2 ms to minimize.
[2024-05-28 17:37:35] [INFO ] Deduced a trap composed of 157 places in 179 ms of which 2 ms to minimize.
[2024-05-28 17:37:35] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 3 ms to minimize.
SMT process timed out in 41233ms, After SMT, problems are : Problem set: 0 solved, 874 unsolved
Search for dead transitions found 0 dead transitions in 41246ms
[2024-05-28 17:37:35] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2024-05-28 17:37:35] [INFO ] Invariant cache hit.
[2024-05-28 17:37:36] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-28 17:37:36] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2024-05-28 17:37:36] [INFO ] Invariant cache hit.
[2024-05-28 17:37:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:37:42] [INFO ] Implicit Places using invariants and state equation in 6437 ms returned []
Implicit Place search using SMT with State Equation took 6849 ms to find 0 implicit places.
[2024-05-28 17:37:42] [INFO ] Redundant transitions in 23 ms returned []
Running 874 sub problems to find dead transitions.
[2024-05-28 17:37:42] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2024-05-28 17:37:42] [INFO ] Invariant cache hit.
[2024-05-28 17:37:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 17:37:47] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:37:47] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:37:47] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2024-05-28 17:37:48] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:37:48] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:37:48] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:37:48] [INFO ] Deduced a trap composed of 179 places in 240 ms of which 3 ms to minimize.
[2024-05-28 17:37:48] [INFO ] Deduced a trap composed of 187 places in 206 ms of which 2 ms to minimize.
[2024-05-28 17:37:49] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 7 ms to minimize.
[2024-05-28 17:37:49] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 3 ms to minimize.
[2024-05-28 17:37:49] [INFO ] Deduced a trap composed of 142 places in 252 ms of which 3 ms to minimize.
[2024-05-28 17:37:49] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 2 ms to minimize.
[2024-05-28 17:37:50] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 3 ms to minimize.
[2024-05-28 17:37:50] [INFO ] Deduced a trap composed of 143 places in 194 ms of which 3 ms to minimize.
[2024-05-28 17:37:50] [INFO ] Deduced a trap composed of 63 places in 198 ms of which 3 ms to minimize.
[2024-05-28 17:37:51] [INFO ] Deduced a trap composed of 116 places in 227 ms of which 3 ms to minimize.
[2024-05-28 17:37:51] [INFO ] Deduced a trap composed of 190 places in 186 ms of which 2 ms to minimize.
[2024-05-28 17:37:51] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 3 ms to minimize.
[2024-05-28 17:37:52] [INFO ] Deduced a trap composed of 153 places in 228 ms of which 3 ms to minimize.
[2024-05-28 17:37:52] [INFO ] Deduced a trap composed of 195 places in 205 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 17:37:53] [INFO ] Deduced a trap composed of 184 places in 246 ms of which 3 ms to minimize.
[2024-05-28 17:37:53] [INFO ] Deduced a trap composed of 155 places in 236 ms of which 3 ms to minimize.
[2024-05-28 17:37:53] [INFO ] Deduced a trap composed of 196 places in 188 ms of which 2 ms to minimize.
[2024-05-28 17:37:53] [INFO ] Deduced a trap composed of 206 places in 219 ms of which 3 ms to minimize.
[2024-05-28 17:37:54] [INFO ] Deduced a trap composed of 183 places in 218 ms of which 3 ms to minimize.
[2024-05-28 17:37:54] [INFO ] Deduced a trap composed of 177 places in 176 ms of which 2 ms to minimize.
[2024-05-28 17:37:54] [INFO ] Deduced a trap composed of 201 places in 160 ms of which 2 ms to minimize.
[2024-05-28 17:37:54] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 2 ms to minimize.
[2024-05-28 17:37:54] [INFO ] Deduced a trap composed of 190 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:37:54] [INFO ] Deduced a trap composed of 204 places in 160 ms of which 2 ms to minimize.
[2024-05-28 17:37:55] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 2 ms to minimize.
[2024-05-28 17:37:55] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 2 ms to minimize.
[2024-05-28 17:37:55] [INFO ] Deduced a trap composed of 177 places in 171 ms of which 3 ms to minimize.
[2024-05-28 17:37:55] [INFO ] Deduced a trap composed of 195 places in 224 ms of which 4 ms to minimize.
[2024-05-28 17:37:56] [INFO ] Deduced a trap composed of 188 places in 257 ms of which 6 ms to minimize.
[2024-05-28 17:37:56] [INFO ] Deduced a trap composed of 168 places in 175 ms of which 2 ms to minimize.
[2024-05-28 17:37:56] [INFO ] Deduced a trap composed of 128 places in 245 ms of which 2 ms to minimize.
[2024-05-28 17:37:57] [INFO ] Deduced a trap composed of 142 places in 229 ms of which 2 ms to minimize.
[2024-05-28 17:37:57] [INFO ] Deduced a trap composed of 216 places in 213 ms of which 3 ms to minimize.
[2024-05-28 17:37:58] [INFO ] Deduced a trap composed of 159 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 17:38:05] [INFO ] Deduced a trap composed of 195 places in 211 ms of which 3 ms to minimize.
[2024-05-28 17:38:05] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 2 ms to minimize.
[2024-05-28 17:38:06] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 3 ms to minimize.
[2024-05-28 17:38:06] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 2 ms to minimize.
[2024-05-28 17:38:06] [INFO ] Deduced a trap composed of 148 places in 191 ms of which 3 ms to minimize.
[2024-05-28 17:38:07] [INFO ] Deduced a trap composed of 194 places in 228 ms of which 2 ms to minimize.
[2024-05-28 17:38:07] [INFO ] Deduced a trap composed of 237 places in 157 ms of which 5 ms to minimize.
[2024-05-28 17:38:08] [INFO ] Deduced a trap composed of 217 places in 226 ms of which 3 ms to minimize.
[2024-05-28 17:38:08] [INFO ] Deduced a trap composed of 218 places in 194 ms of which 3 ms to minimize.
[2024-05-28 17:38:09] [INFO ] Deduced a trap composed of 138 places in 238 ms of which 3 ms to minimize.
[2024-05-28 17:38:10] [INFO ] Deduced a trap composed of 163 places in 231 ms of which 3 ms to minimize.
[2024-05-28 17:38:10] [INFO ] Deduced a trap composed of 181 places in 248 ms of which 3 ms to minimize.
[2024-05-28 17:38:10] [INFO ] Deduced a trap composed of 190 places in 241 ms of which 3 ms to minimize.
[2024-05-28 17:38:11] [INFO ] Deduced a trap composed of 190 places in 239 ms of which 3 ms to minimize.
[2024-05-28 17:38:11] [INFO ] Deduced a trap composed of 184 places in 217 ms of which 3 ms to minimize.
[2024-05-28 17:38:11] [INFO ] Deduced a trap composed of 190 places in 243 ms of which 3 ms to minimize.
[2024-05-28 17:38:12] [INFO ] Deduced a trap composed of 185 places in 194 ms of which 2 ms to minimize.
[2024-05-28 17:38:12] [INFO ] Deduced a trap composed of 195 places in 235 ms of which 3 ms to minimize.
[2024-05-28 17:38:12] [INFO ] Deduced a trap composed of 202 places in 217 ms of which 3 ms to minimize.
[2024-05-28 17:38:12] [INFO ] Deduced a trap composed of 185 places in 194 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 874 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1228 variables, and 96 constraints, problems are : Problem set: 0 solved, 874 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 874/874 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 874 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 17:38:21] [INFO ] Deduced a trap composed of 168 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:38:22] [INFO ] Deduced a trap composed of 187 places in 216 ms of which 2 ms to minimize.
[2024-05-28 17:38:22] [INFO ] Deduced a trap composed of 185 places in 220 ms of which 3 ms to minimize.
[2024-05-28 17:38:22] [INFO ] Deduced a trap composed of 182 places in 224 ms of which 3 ms to minimize.
[2024-05-28 17:38:22] [INFO ] Deduced a trap composed of 191 places in 242 ms of which 2 ms to minimize.
[2024-05-28 17:38:23] [INFO ] Deduced a trap composed of 179 places in 249 ms of which 3 ms to minimize.
[2024-05-28 17:38:23] [INFO ] Deduced a trap composed of 212 places in 240 ms of which 3 ms to minimize.
[2024-05-28 17:38:23] [INFO ] Deduced a trap composed of 199 places in 249 ms of which 3 ms to minimize.
[2024-05-28 17:38:24] [INFO ] Deduced a trap composed of 190 places in 255 ms of which 2 ms to minimize.
[2024-05-28 17:38:24] [INFO ] Deduced a trap composed of 180 places in 217 ms of which 3 ms to minimize.
[2024-05-28 17:38:24] [INFO ] Deduced a trap composed of 203 places in 224 ms of which 7 ms to minimize.
[2024-05-28 17:38:25] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 3 ms to minimize.
[2024-05-28 17:38:25] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 3 ms to minimize.
[2024-05-28 17:38:25] [INFO ] Deduced a trap composed of 179 places in 260 ms of which 2 ms to minimize.
[2024-05-28 17:38:26] [INFO ] Deduced a trap composed of 201 places in 247 ms of which 3 ms to minimize.
[2024-05-28 17:38:26] [INFO ] Deduced a trap composed of 171 places in 204 ms of which 3 ms to minimize.
[2024-05-28 17:38:26] [INFO ] Deduced a trap composed of 163 places in 254 ms of which 2 ms to minimize.
[2024-05-28 17:38:27] [INFO ] Deduced a trap composed of 179 places in 235 ms of which 3 ms to minimize.
[2024-05-28 17:38:27] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
[2024-05-28 17:38:27] [INFO ] Deduced a trap composed of 204 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 874 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1228 variables, and 116 constraints, problems are : Problem set: 0 solved, 874 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/874 constraints, Known Traps: 80/80 constraints]
After SMT, in 61086ms problems are : Problem set: 0 solved, 874 unsolved
Search for dead transitions found 0 dead transitions in 61102ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109261 ms. Remains : 374/374 places, 878/878 transitions.
Built C files in :
/tmp/ltsmin11175223927472137133
[2024-05-28 17:38:43] [INFO ] Computing symmetric may disable matrix : 878 transitions.
[2024-05-28 17:38:43] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:38:43] [INFO ] Computing symmetric may enable matrix : 878 transitions.
[2024-05-28 17:38:43] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:38:43] [INFO ] Computing Do-Not-Accords matrix : 878 transitions.
[2024-05-28 17:38:43] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:38:43] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11175223927472137133
Running compilation step : cd /tmp/ltsmin11175223927472137133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11175223927472137133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11175223927472137133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 17:38:47] [INFO ] Flatten gal took : 69 ms
[2024-05-28 17:38:47] [INFO ] Flatten gal took : 55 ms
[2024-05-28 17:38:47] [INFO ] Time to serialize gal into /tmp/LTL8579862791427205593.gal : 14 ms
[2024-05-28 17:38:47] [INFO ] Time to serialize properties into /tmp/LTL94662159190555220.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8579862791427205593.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3269056883696448677.hoa' '-atoms' '/tmp/LTL94662159190555220.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL94662159190555220.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3269056883696448677.hoa
Detected timeout of ITS tools.
[2024-05-28 17:39:02] [INFO ] Flatten gal took : 52 ms
[2024-05-28 17:39:02] [INFO ] Flatten gal took : 49 ms
[2024-05-28 17:39:02] [INFO ] Time to serialize gal into /tmp/LTL14910913663665153768.gal : 9 ms
[2024-05-28 17:39:02] [INFO ] Time to serialize properties into /tmp/LTL8125911197092063054.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14910913663665153768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8125911197092063054.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(F("((TryAllocateOneTaskB_1>P_1712_4)||(ScheduleTaskB_3>NotifyEventEndOfCheckSourcesB_2))")))||("((AwakeTasks_5>Try_Check_Sourc...207
Formula 0 simplified : F(!"((AwakeTasks_5>Try_Check_Sources_E_2)&&(NotifyEventJobQueuedB_3_3<=P_1159_6))" & XG!"((TryAllocateOneTaskB_1>P_1712_4)||(Schedul...199
Detected timeout of ITS tools.
[2024-05-28 17:39:17] [INFO ] Flatten gal took : 68 ms
[2024-05-28 17:39:17] [INFO ] Applying decomposition
[2024-05-28 17:39:17] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8250669809146919739.txt' '-o' '/tmp/graph8250669809146919739.bin' '-w' '/tmp/graph8250669809146919739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8250669809146919739.bin' '-l' '-1' '-v' '-w' '/tmp/graph8250669809146919739.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:39:17] [INFO ] Decomposing Gal with order
[2024-05-28 17:39:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:39:18] [INFO ] Removed a total of 515 redundant transitions.
[2024-05-28 17:39:18] [INFO ] Flatten gal took : 299 ms
[2024-05-28 17:39:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 406 labels/synchronizations in 39 ms.
[2024-05-28 17:39:18] [INFO ] Time to serialize gal into /tmp/LTL8162019877201754609.gal : 12 ms
[2024-05-28 17:39:18] [INFO ] Time to serialize properties into /tmp/LTL2962452246644870964.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8162019877201754609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2962452246644870964.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X(F("((gu10.TryAllocateOneTaskB_1>gu10.P_1712_4)||(gu6.ScheduleTaskB_3>gu6.NotifyEventEndOfCheckSourcesB_2))")))||("((gu7.AwakeT...241
Formula 0 simplified : F(!"((gu7.AwakeTasks_5>gu7.Try_Check_Sources_E_2)&&(gu8.NotifyEventJobQueuedB_3_3<=gu8.P_1159_6))" & XG!"((gu10.TryAllocateOneTaskB_...233
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-13 finished in 422114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 537 transition count 1320
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 492 transition count 1319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 491 transition count 1319
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 92 place count 491 transition count 1260
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 210 place count 432 transition count 1260
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 332 place count 371 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 370 transition count 1198
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 370 transition count 1198
Applied a total of 334 rules in 104 ms. Remains 370 /537 variables (removed 167) and now considering 1198/1365 (removed 167) transitions.
Running 1194 sub problems to find dead transitions.
[2024-05-28 17:39:33] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
// Phase 1: matrix 1174 rows 370 cols
[2024-05-28 17:39:33] [INFO ] Computed 40 invariants in 25 ms
[2024-05-28 17:39:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 17:39:44] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:39:44] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:39:44] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:39:45] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2024-05-28 17:39:45] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2024-05-28 17:39:45] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:39:45] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:39:45] [INFO ] Deduced a trap composed of 57 places in 283 ms of which 3 ms to minimize.
[2024-05-28 17:39:46] [INFO ] Deduced a trap composed of 45 places in 281 ms of which 3 ms to minimize.
[2024-05-28 17:39:46] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 2 ms to minimize.
[2024-05-28 17:39:47] [INFO ] Deduced a trap composed of 139 places in 273 ms of which 3 ms to minimize.
[2024-05-28 17:39:47] [INFO ] Deduced a trap composed of 120 places in 273 ms of which 3 ms to minimize.
[2024-05-28 17:39:49] [INFO ] Deduced a trap composed of 200 places in 194 ms of which 2 ms to minimize.
[2024-05-28 17:39:50] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2024-05-28 17:39:51] [INFO ] Deduced a trap composed of 169 places in 300 ms of which 4 ms to minimize.
[2024-05-28 17:39:56] [INFO ] Deduced a trap composed of 162 places in 308 ms of which 3 ms to minimize.
[2024-05-28 17:39:56] [INFO ] Deduced a trap composed of 194 places in 277 ms of which 3 ms to minimize.
[2024-05-28 17:39:57] [INFO ] Deduced a trap composed of 187 places in 250 ms of which 3 ms to minimize.
[2024-05-28 17:39:57] [INFO ] Deduced a trap composed of 149 places in 251 ms of which 3 ms to minimize.
[2024-05-28 17:39:58] [INFO ] Deduced a trap composed of 140 places in 286 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 56 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 17:40:04] [INFO ] Deduced a trap composed of 193 places in 264 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 57 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 21/21 constraints]
After SMT, in 45194ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 45211ms
[2024-05-28 17:40:18] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 17:40:18] [INFO ] Invariant cache hit.
[2024-05-28 17:40:19] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-28 17:40:19] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 17:40:19] [INFO ] Invariant cache hit.
[2024-05-28 17:40:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:40:26] [INFO ] Implicit Places using invariants and state equation in 7223 ms returned []
Implicit Place search using SMT with State Equation took 7677 ms to find 0 implicit places.
[2024-05-28 17:40:26] [INFO ] Redundant transitions in 50 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-05-28 17:40:26] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 17:40:26] [INFO ] Invariant cache hit.
[2024-05-28 17:40:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 17:40:37] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:40:37] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-05-28 17:40:37] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:40:37] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2024-05-28 17:40:37] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 0 ms to minimize.
[2024-05-28 17:40:37] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:40:38] [INFO ] Deduced a trap composed of 59 places in 246 ms of which 3 ms to minimize.
[2024-05-28 17:40:38] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 2 ms to minimize.
[2024-05-28 17:40:39] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 2 ms to minimize.
[2024-05-28 17:40:39] [INFO ] Deduced a trap composed of 139 places in 263 ms of which 3 ms to minimize.
[2024-05-28 17:40:39] [INFO ] Deduced a trap composed of 125 places in 267 ms of which 3 ms to minimize.
[2024-05-28 17:40:40] [INFO ] Deduced a trap composed of 189 places in 260 ms of which 3 ms to minimize.
[2024-05-28 17:40:40] [INFO ] Deduced a trap composed of 120 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:40:44] [INFO ] Deduced a trap composed of 174 places in 312 ms of which 3 ms to minimize.
[2024-05-28 17:40:45] [INFO ] Deduced a trap composed of 160 places in 304 ms of which 3 ms to minimize.
[2024-05-28 17:40:45] [INFO ] Deduced a trap composed of 137 places in 279 ms of which 3 ms to minimize.
[2024-05-28 17:40:49] [INFO ] Deduced a trap composed of 181 places in 263 ms of which 2 ms to minimize.
[2024-05-28 17:40:49] [INFO ] Deduced a trap composed of 188 places in 230 ms of which 3 ms to minimize.
[2024-05-28 17:40:49] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 2 ms to minimize.
[2024-05-28 17:40:50] [INFO ] Deduced a trap composed of 149 places in 287 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 17:40:58] [INFO ] Deduced a trap composed of 183 places in 245 ms of which 3 ms to minimize.
[2024-05-28 17:40:59] [INFO ] Deduced a trap composed of 178 places in 274 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 58 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 17:41:17] [INFO ] Deduced a trap composed of 140 places in 268 ms of which 3 ms to minimize.
[2024-05-28 17:41:19] [INFO ] Deduced a trap composed of 174 places in 304 ms of which 2 ms to minimize.
[2024-05-28 17:41:20] [INFO ] Deduced a trap composed of 174 places in 295 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 61 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 25/25 constraints]
After SMT, in 64407ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 64424ms
Starting structural reductions in SI_LTL mode, iteration 1 : 370/537 places, 1198/1365 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117486 ms. Remains : 370/537 places, 1198/1365 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-15
Stuttering criterion allowed to conclude after 8460 steps with 52 reset in 49 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-15 finished in 117620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
[2024-05-28 17:41:31] [INFO ] Flatten gal took : 116 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3941659378849265347
[2024-05-28 17:41:31] [INFO ] Computing symmetric may disable matrix : 1365 transitions.
[2024-05-28 17:41:31] [INFO ] Applying decomposition
[2024-05-28 17:41:31] [INFO ] Computation of Complete disable matrix. took 63 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:41:31] [INFO ] Flatten gal took : 80 ms
[2024-05-28 17:41:31] [INFO ] Computing symmetric may enable matrix : 1365 transitions.
[2024-05-28 17:41:31] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph230507931788849055.txt' '-o' '/tmp/graph230507931788849055.bin' '-w' '/tmp/graph230507931788849055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph230507931788849055.bin' '-l' '-1' '-v' '-w' '/tmp/graph230507931788849055.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:41:31] [INFO ] Decomposing Gal with order
[2024-05-28 17:41:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:41:32] [INFO ] Removed a total of 935 redundant transitions.
[2024-05-28 17:41:32] [INFO ] Flatten gal took : 140 ms
[2024-05-28 17:41:32] [INFO ] Computing Do-Not-Accords matrix : 1365 transitions.
[2024-05-28 17:41:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 29 ms.
[2024-05-28 17:41:32] [INFO ] Computation of Completed DNA matrix. took 103 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:41:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality10667332764624991191.gal : 9 ms
[2024-05-28 17:41:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality14364240102421833115.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10667332764624991191.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14364240102421833115.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
[2024-05-28 17:41:32] [INFO ] Built C files in 707ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3941659378849265347
Running compilation step : cd /tmp/ltsmin3941659378849265347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((G(("((gu101.AwakeTasks_5>gu101.Try_Check_Sources_E_2)&&(gu70.NotifyEventJobQueuedB_3_3<=gu70.P_1159_6))")||(X(F("((gu75.TryAllocate...249
Formula 0 simplified : F(!"((gu101.AwakeTasks_5>gu101.Try_Check_Sources_E_2)&&(gu70.NotifyEventJobQueuedB_3_3<=gu70.P_1159_6))" & XG!"((gu75.TryAllocateOne...241
Compilation finished in 5356 ms.
Running link step : cd /tmp/ltsmin3941659378849265347;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin3941659378849265347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 1334 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1149591 ms.

BK_STOP 1716918099144

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

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