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-171654446900324.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-S06J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446900324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 25K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 329K Apr 11 16:52 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 9.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 160K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 538K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 11 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M 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-S06J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716919885176

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 18:11:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 18:11:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:11:27] [INFO ] Load time of PNML (sax parser for PT used): 812 ms
[2024-05-28 18:11:27] [INFO ] Transformed 632 places.
[2024-05-28 18:11:27] [INFO ] Transformed 10500 transitions.
[2024-05-28 18:11:27] [INFO ] Parsed PT model containing 632 places and 10500 transitions and 88770 arcs in 1031 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-28 18:11:27] [INFO ] Reduced 7020 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 219 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 627 transition count 2425
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 627 transition count 2425
Applied a total of 10 rules in 210 ms. Remains 627 /632 variables (removed 5) and now considering 2425/2430 (removed 5) transitions.
Running 2419 sub problems to find dead transitions.
[2024-05-28 18:11:28] [INFO ] Flow matrix only has 2389 transitions (discarded 36 similar events)
// Phase 1: matrix 2389 rows 627 cols
[2024-05-28 18:11:28] [INFO ] Computed 54 invariants in 143 ms
[2024-05-28 18:11:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2419 unsolved
SMT process timed out in 40425ms, After SMT, problems are : Problem set: 0 solved, 2419 unsolved
Search for dead transitions found 0 dead transitions in 40508ms
[2024-05-28 18:12:08] [INFO ] Flow matrix only has 2389 transitions (discarded 36 similar events)
[2024-05-28 18:12:08] [INFO ] Invariant cache hit.
[2024-05-28 18:12:09] [INFO ] Implicit Places using invariants in 446 ms returned [87, 225, 353, 430, 517, 591]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 464 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 621/632 places, 2425/2430 transitions.
Applied a total of 0 rules in 26 ms. Remains 621 /621 variables (removed 0) and now considering 2425/2425 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41272 ms. Remains : 621/632 places, 2425/2430 transitions.
Support contains 219 out of 621 places after structural reductions.
[2024-05-28 18:12:09] [INFO ] Flatten gal took : 291 ms
[2024-05-28 18:12:10] [INFO ] Flatten gal took : 201 ms
[2024-05-28 18:12:10] [INFO ] Input system was already deterministic with 2425 transitions.
RANDOM walk for 40000 steps (245 resets) in 1218 ms. (32 steps per ms) remains 2/27 properties
BEST_FIRST walk for 40004 steps (25 resets) in 330 ms. (120 steps per ms) remains 1/2 properties
[2024-05-28 18:12:11] [INFO ] Flow matrix only has 2389 transitions (discarded 36 similar events)
// Phase 1: matrix 2389 rows 621 cols
[2024-05-28 18:12:11] [INFO ] Computed 48 invariants in 77 ms
[2024-05-28 18:12:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 535/540 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/582 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 619/3010 variables, and 47 constraints, problems are : Problem set: 1 solved, 0 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/621 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 18 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 615 transition count 2382
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 572 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 571 transition count 2381
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 88 place count 571 transition count 2309
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 232 place count 499 transition count 2309
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 233 place count 498 transition count 2308
Iterating global reduction 3 with 1 rules applied. Total rules applied 234 place count 498 transition count 2308
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 376 place count 427 transition count 2237
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 379 place count 424 transition count 2234
Iterating global reduction 3 with 3 rules applied. Total rules applied 382 place count 424 transition count 2234
Applied a total of 382 rules in 279 ms. Remains 424 /621 variables (removed 197) and now considering 2234/2425 (removed 191) transitions.
Running 2228 sub problems to find dead transitions.
[2024-05-28 18:12:12] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
// Phase 1: matrix 2198 rows 424 cols
[2024-05-28 18:12:12] [INFO ] Computed 42 invariants in 77 ms
[2024-05-28 18:12:12] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 18:12:48] [INFO ] Deduced a trap composed of 118 places in 304 ms of which 19 ms to minimize.
[2024-05-28 18:12:48] [INFO ] Deduced a trap composed of 149 places in 412 ms of which 3 ms to minimize.
[2024-05-28 18:12:49] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 2 ms to minimize.
[2024-05-28 18:12:51] [INFO ] Deduced a trap composed of 59 places in 284 ms of which 1 ms to minimize.
[2024-05-28 18:12:55] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 1 ms to minimize.
SMT process timed out in 43206ms, After SMT, problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 43237ms
[2024-05-28 18:12:55] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 18:12:55] [INFO ] Invariant cache hit.
[2024-05-28 18:12:55] [INFO ] Implicit Places using invariants in 591 ms returned []
[2024-05-28 18:12:55] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 18:12:55] [INFO ] Invariant cache hit.
[2024-05-28 18:12:57] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:13:12] [INFO ] Implicit Places using invariants and state equation in 17055 ms returned []
Implicit Place search using SMT with State Equation took 17649 ms to find 0 implicit places.
[2024-05-28 18:13:13] [INFO ] Redundant transitions in 164 ms returned []
Running 2228 sub problems to find dead transitions.
[2024-05-28 18:13:13] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 18:13:13] [INFO ] Invariant cache hit.
[2024-05-28 18:13:13] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 18:13:48] [INFO ] Deduced a trap composed of 112 places in 328 ms of which 3 ms to minimize.
[2024-05-28 18:13:48] [INFO ] Deduced a trap composed of 144 places in 305 ms of which 2 ms to minimize.
[2024-05-28 18:13:48] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 1 ms to minimize.
[2024-05-28 18:13:51] [INFO ] Deduced a trap composed of 59 places in 299 ms of which 2 ms to minimize.
[2024-05-28 18:14:04] [INFO ] Deduced a trap composed of 144 places in 332 ms of which 3 ms to minimize.
SMT process timed out in 51802ms, After SMT, problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 51828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 424/621 places, 2234/2425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113182 ms. Remains : 424/621 places, 2234/2425 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-00
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 3 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-00 finished in 113451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 50 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
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 615 transition count 2387
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 577 transition count 2387
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 76 place count 577 transition count 2351
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 148 place count 541 transition count 2351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 540 transition count 2350
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 540 transition count 2350
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 304 place count 463 transition count 2273
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 307 place count 460 transition count 2270
Iterating global reduction 2 with 3 rules applied. Total rules applied 310 place count 460 transition count 2270
Applied a total of 310 rules in 192 ms. Remains 460 /621 variables (removed 161) and now considering 2270/2425 (removed 155) transitions.
Running 2264 sub problems to find dead transitions.
[2024-05-28 18:14:05] [INFO ] Flow matrix only has 2234 transitions (discarded 36 similar events)
// Phase 1: matrix 2234 rows 460 cols
[2024-05-28 18:14:05] [INFO ] Computed 42 invariants in 65 ms
[2024-05-28 18:14:05] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
[2024-05-28 18:14:42] [INFO ] Deduced a trap composed of 188 places in 413 ms of which 3 ms to minimize.
[2024-05-28 18:14:42] [INFO ] Deduced a trap composed of 188 places in 419 ms of which 3 ms to minimize.
[2024-05-28 18:14:43] [INFO ] Deduced a trap composed of 197 places in 452 ms of which 3 ms to minimize.
[2024-05-28 18:14:43] [INFO ] Deduced a trap composed of 142 places in 416 ms of which 3 ms to minimize.
[2024-05-28 18:14:44] [INFO ] Deduced a trap composed of 192 places in 387 ms of which 2 ms to minimize.
[2024-05-28 18:14:44] [INFO ] Deduced a trap composed of 191 places in 362 ms of which 2 ms to minimize.
[2024-05-28 18:14:44] [INFO ] Deduced a trap composed of 185 places in 413 ms of which 3 ms to minimize.
[2024-05-28 18:14:45] [INFO ] Deduced a trap composed of 184 places in 406 ms of which 2 ms to minimize.
[2024-05-28 18:14:45] [INFO ] Deduced a trap composed of 192 places in 400 ms of which 3 ms to minimize.
[2024-05-28 18:14:46] [INFO ] Deduced a trap composed of 171 places in 346 ms of which 3 ms to minimize.
[2024-05-28 18:14:46] [INFO ] Deduced a trap composed of 178 places in 378 ms of which 2 ms to minimize.
[2024-05-28 18:14:46] [INFO ] Deduced a trap composed of 15 places in 345 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/2694 variables, and 47 constraints, problems are : Problem set: 0 solved, 2264 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2264/1010 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
[2024-05-28 18:14:54] [INFO ] Deduced a trap composed of 61 places in 365 ms of which 4 ms to minimize.
[2024-05-28 18:15:02] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 1 ms to minimize.
[2024-05-28 18:15:02] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-28 18:15:02] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:15:02] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 6)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(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 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s89 0)
(s90 0)
(s91 1)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 8)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 2)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 2)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/2694 variables, and 52 constraints, problems are : Problem set: 0 solved, 2264 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1010 constraints, Known Traps: 17/17 constraints]
After SMT, in 63186ms problems are : Problem set: 0 solved, 2264 unsolved
Search for dead transitions found 0 dead transitions in 63210ms
[2024-05-28 18:15:08] [INFO ] Flow matrix only has 2234 transitions (discarded 36 similar events)
[2024-05-28 18:15:08] [INFO ] Invariant cache hit.
[2024-05-28 18:15:08] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-28 18:15:08] [INFO ] Flow matrix only has 2234 transitions (discarded 36 similar events)
[2024-05-28 18:15:09] [INFO ] Invariant cache hit.
[2024-05-28 18:15:10] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:15:24] [INFO ] Implicit Places using invariants and state equation in 15596 ms returned []
Implicit Place search using SMT with State Equation took 16049 ms to find 0 implicit places.
[2024-05-28 18:15:24] [INFO ] Redundant transitions in 197 ms returned []
Running 2264 sub problems to find dead transitions.
[2024-05-28 18:15:24] [INFO ] Flow matrix only has 2234 transitions (discarded 36 similar events)
[2024-05-28 18:15:24] [INFO ] Invariant cache hit.
[2024-05-28 18:15:24] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
[2024-05-28 18:16:01] [INFO ] Deduced a trap composed of 177 places in 366 ms of which 3 ms to minimize.
[2024-05-28 18:16:02] [INFO ] Deduced a trap composed of 191 places in 376 ms of which 3 ms to minimize.
[2024-05-28 18:16:02] [INFO ] Deduced a trap composed of 185 places in 335 ms of which 2 ms to minimize.
[2024-05-28 18:16:02] [INFO ] Deduced a trap composed of 182 places in 367 ms of which 2 ms to minimize.
[2024-05-28 18:16:03] [INFO ] Deduced a trap composed of 174 places in 504 ms of which 3 ms to minimize.
[2024-05-28 18:16:03] [INFO ] Deduced a trap composed of 191 places in 283 ms of which 2 ms to minimize.
[2024-05-28 18:16:03] [INFO ] Deduced a trap composed of 176 places in 327 ms of which 3 ms to minimize.
[2024-05-28 18:16:04] [INFO ] Deduced a trap composed of 187 places in 327 ms of which 5 ms to minimize.
[2024-05-28 18:16:04] [INFO ] Deduced a trap composed of 180 places in 277 ms of which 2 ms to minimize.
[2024-05-28 18:16:04] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 1 ms to minimize.
[2024-05-28 18:16:04] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/2694 variables, and 46 constraints, problems are : Problem set: 0 solved, 2264 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2264/1010 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 2264 unsolved
[2024-05-28 18:16:23] [INFO ] Deduced a trap composed of 61 places in 288 ms of which 2 ms to minimize.
[2024-05-28 18:16:27] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 2 ms to minimize.
[2024-05-28 18:16:27] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-05-28 18:16:27] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:16:27] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 2 ms to minimize.
[2024-05-28 18:16:31] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:16:31] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:16:47] [INFO ] Deduced a trap composed of 174 places in 272 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/2694 variables, and 54 constraints, problems are : Problem set: 0 solved, 2264 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/460 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1010 constraints, Known Traps: 19/19 constraints]
After SMT, in 83030ms problems are : Problem set: 0 solved, 2264 unsolved
Search for dead transitions found 0 dead transitions in 83065ms
Starting structural reductions in SI_LTL mode, iteration 1 : 460/621 places, 2270/2425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162735 ms. Remains : 460/621 places, 2270/2425 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-01
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 11 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-01 finished in 162881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X((G(p1) U (!p0&&G(p1))))) U p2))'
Support contains 56 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 96 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:16:48] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 18:16:48] [INFO ] Computed 42 invariants in 98 ms
[2024-05-28 18:16:48] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:17:27] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 2 ms to minimize.
[2024-05-28 18:17:28] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:17:38] [INFO ] Deduced a trap composed of 84 places in 499 ms of which 3 ms to minimize.
[2024-05-28 18:17:38] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-05-28 18:17:38] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 1 ms to minimize.
[2024-05-28 18:17:42] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 1 ms to minimize.
[2024-05-28 18:17:42] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-05-28 18:17:42] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 2 ms to minimize.
[2024-05-28 18:17:44] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 40 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 60734ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60761ms
[2024-05-28 18:17:48] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:17:48] [INFO ] Invariant cache hit.
[2024-05-28 18:17:49] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-28 18:17:49] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:17:49] [INFO ] Invariant cache hit.
[2024-05-28 18:17:51] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:18:09] [INFO ] Implicit Places using invariants and state equation in 19620 ms returned []
Implicit Place search using SMT with State Equation took 20329 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:18:09] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:18:09] [INFO ] Invariant cache hit.
[2024-05-28 18:18:09] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:18:48] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 3 ms to minimize.
[2024-05-28 18:18:52] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:19:05] [INFO ] Deduced a trap composed of 47 places in 509 ms of which 4 ms to minimize.
[2024-05-28 18:19:05] [INFO ] Deduced a trap composed of 84 places in 175 ms of which 3 ms to minimize.
[2024-05-28 18:19:06] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 2 ms to minimize.
[2024-05-28 18:19:06] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 2 ms to minimize.
[2024-05-28 18:19:06] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-05-28 18:19:07] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 6 ms to minimize.
[2024-05-28 18:19:14] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 4 ms to minimize.
[2024-05-28 18:19:24] [INFO ] Deduced a trap composed of 110 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 79204ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 79225ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160426 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-02
Stuttering criterion allowed to conclude after 243 steps with 2 reset in 6 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-02 finished in 160617 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))&&F(p1)))'
Support contains 20 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 2425/2425 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 621 transition count 2387
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 583 transition count 2387
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 76 place count 583 transition count 2315
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 220 place count 511 transition count 2315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 221 place count 510 transition count 2314
Iterating global reduction 2 with 1 rules applied. Total rules applied 222 place count 510 transition count 2314
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 292 place count 475 transition count 2279
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 295 place count 472 transition count 2276
Iterating global reduction 2 with 3 rules applied. Total rules applied 298 place count 472 transition count 2276
Applied a total of 298 rules in 210 ms. Remains 472 /621 variables (removed 149) and now considering 2276/2425 (removed 149) transitions.
Running 2270 sub problems to find dead transitions.
[2024-05-28 18:19:28] [INFO ] Flow matrix only has 2240 transitions (discarded 36 similar events)
// Phase 1: matrix 2240 rows 472 cols
[2024-05-28 18:19:28] [INFO ] Computed 48 invariants in 90 ms
[2024-05-28 18:19:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
[2024-05-28 18:20:07] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-28 18:20:14] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/2712 variables, and 33 constraints, problems are : Problem set: 0 solved, 2270 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 17/30 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2270/1016 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
[2024-05-28 18:20:19] [INFO ] Deduced a trap composed of 15 places in 483 ms of which 2 ms to minimize.
[2024-05-28 18:20:19] [INFO ] Deduced a trap composed of 60 places in 349 ms of which 2 ms to minimize.
[2024-05-28 18:20:19] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 1 ms to minimize.
[2024-05-28 18:20:32] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/2712 variables, and 37 constraints, problems are : Problem set: 0 solved, 2270 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 17/30 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1016 constraints, Known Traps: 6/6 constraints]
After SMT, in 65814ms problems are : Problem set: 0 solved, 2270 unsolved
Search for dead transitions found 0 dead transitions in 65845ms
[2024-05-28 18:20:34] [INFO ] Flow matrix only has 2240 transitions (discarded 36 similar events)
[2024-05-28 18:20:34] [INFO ] Invariant cache hit.
[2024-05-28 18:20:35] [INFO ] Implicit Places using invariants in 734 ms returned []
[2024-05-28 18:20:35] [INFO ] Flow matrix only has 2240 transitions (discarded 36 similar events)
[2024-05-28 18:20:35] [INFO ] Invariant cache hit.
[2024-05-28 18:20:37] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:20:51] [INFO ] Implicit Places using invariants and state equation in 15930 ms returned []
Implicit Place search using SMT with State Equation took 16666 ms to find 0 implicit places.
[2024-05-28 18:20:51] [INFO ] Redundant transitions in 74 ms returned []
Running 2270 sub problems to find dead transitions.
[2024-05-28 18:20:51] [INFO ] Flow matrix only has 2240 transitions (discarded 36 similar events)
[2024-05-28 18:20:51] [INFO ] Invariant cache hit.
[2024-05-28 18:20:51] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
[2024-05-28 18:21:27] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-05-28 18:21:33] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 2 ms to minimize.
[2024-05-28 18:21:39] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/2712 variables, and 34 constraints, problems are : Problem set: 0 solved, 2270 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 17/30 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2270/1016 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2270 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1861 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/464 variables, 4/38 constraints. Problems are: Problem set: 486 solved, 1784 unsolved
[2024-05-28 18:22:08] [INFO ] Deduced a trap composed of 35 places in 374 ms of which 2 ms to minimize.
[2024-05-28 18:22:08] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-28 18:22:10] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-28 18:22:10] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-05-28 18:22:10] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
[2024-05-28 18:22:11] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2712 variables, and 44 constraints, problems are : Problem set: 486 solved, 1784 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 17/30 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1016 constraints, Known Traps: 9/9 constraints]
After SMT, in 82616ms problems are : Problem set: 486 solved, 1784 unsolved
Search for dead transitions found 486 dead transitions in 82640ms
Found 486 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 486 transitions
Dead transitions reduction (with SMT) removed 486 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 472/621 places, 1790/2425 transitions.
Applied a total of 0 rules in 46 ms. Remains 472 /472 variables (removed 0) and now considering 1790/1790 (removed 0) transitions.
[2024-05-28 18:22:14] [INFO ] Redundant transitions in 66 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 165579 ms. Remains : 472/621 places, 1790/2425 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-05
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-05 finished in 165768 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 U G(p1))))'
Support contains 20 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 116 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:22:14] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 18:22:14] [INFO ] Computed 42 invariants in 95 ms
[2024-05-28 18:22:14] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:22:54] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 3 ms to minimize.
[2024-05-28 18:22:55] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:23:06] [INFO ] Deduced a trap composed of 84 places in 573 ms of which 3 ms to minimize.
[2024-05-28 18:23:06] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:23:06] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-28 18:23:09] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-28 18:23:09] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 1 ms to minimize.
[2024-05-28 18:23:10] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2024-05-28 18:23:12] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-05-28 18:23:17] [INFO ] Deduced a trap composed of 110 places in 228 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 62751ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 62779ms
[2024-05-28 18:23:17] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:23:17] [INFO ] Invariant cache hit.
[2024-05-28 18:23:17] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-05-28 18:23:17] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:23:17] [INFO ] Invariant cache hit.
[2024-05-28 18:23:20] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:23:45] [INFO ] Implicit Places using invariants and state equation in 27592 ms returned []
Implicit Place search using SMT with State Equation took 28206 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:23:45] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:23:45] [INFO ] Invariant cache hit.
[2024-05-28 18:23:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:24:24] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 3 ms to minimize.
[2024-05-28 18:24:28] [INFO ] Deduced a trap composed of 112 places in 169 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:24:45] [INFO ] Deduced a trap composed of 47 places in 674 ms of which 4 ms to minimize.
[2024-05-28 18:24:45] [INFO ] Deduced a trap composed of 84 places in 212 ms of which 2 ms to minimize.
[2024-05-28 18:24:45] [INFO ] Deduced a trap composed of 84 places in 178 ms of which 2 ms to minimize.
[2024-05-28 18:24:45] [INFO ] Deduced a trap composed of 84 places in 176 ms of which 2 ms to minimize.
[2024-05-28 18:24:45] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 1 ms to minimize.
[2024-05-28 18:24:46] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 3 ms to minimize.
[2024-05-28 18:24:53] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-05-28 18:25:03] [INFO ] Deduced a trap composed of 110 places in 188 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 81849ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 81875ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172989 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-06 finished in 173137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 12 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 91 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:25:07] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:25:07] [INFO ] Invariant cache hit.
[2024-05-28 18:25:07] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:25:46] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 32 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:25:50] [INFO ] Deduced a trap composed of 119 places in 612 ms of which 5 ms to minimize.
[2024-05-28 18:25:50] [INFO ] Deduced a trap composed of 119 places in 336 ms of which 3 ms to minimize.
[2024-05-28 18:25:51] [INFO ] Deduced a trap composed of 110 places in 359 ms of which 4 ms to minimize.
[2024-05-28 18:25:51] [INFO ] Deduced a trap composed of 84 places in 598 ms of which 3 ms to minimize.
[2024-05-28 18:25:52] [INFO ] Deduced a trap composed of 53 places in 551 ms of which 3 ms to minimize.
[2024-05-28 18:25:52] [INFO ] Deduced a trap composed of 66 places in 518 ms of which 3 ms to minimize.
[2024-05-28 18:25:53] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-28 18:25:53] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2024-05-28 18:25:53] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 9)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 3)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 4)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 3)
(s142 1)
(s143 2)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 4)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 10)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 4)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 1)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 2)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 3)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 6)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 2)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 1)
(s276 1)
(s277 1)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 4)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 2)
(s308 1)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 1)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 1)
(s336 1)
(s337 0)
(s338 1)
(s339 1)
(s340 0)
(s341 2)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 1)
(s347 0)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 4)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 2)
(s358 1)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 3)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 1)
(s404 1)
(s405 1)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 2)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 1)
(s459 1)
(s460 0)
(s461 0)
(s462 1)
(s463 1)
(s464 2)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 1)
(s478 0)
(s479 0)
(s480 0)
(s481 1)
(s482 1)
(s483 3)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s495 1)
(s496 1)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 4)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 0)
(s510 0)
(s511 1)
(s512 1)
(s513 0)
(s514 1)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 4)
(s526 0)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 1)
(s533 1)
(s534 0)
(s535 0)
(s536 0)
(s537 1)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 60277ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
[2024-05-28 18:26:07] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:26:07] [INFO ] Invariant cache hit.
[2024-05-28 18:26:08] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-28 18:26:08] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:26:08] [INFO ] Invariant cache hit.
[2024-05-28 18:26:10] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:26:34] [INFO ] Implicit Places using invariants and state equation in 26177 ms returned []
Implicit Place search using SMT with State Equation took 27000 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:26:34] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:26:34] [INFO ] Invariant cache hit.
[2024-05-28 18:26:34] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:27:12] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-05-28 18:27:16] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:27:32] [INFO ] Deduced a trap composed of 47 places in 495 ms of which 4 ms to minimize.
[2024-05-28 18:27:32] [INFO ] Deduced a trap composed of 84 places in 203 ms of which 3 ms to minimize.
[2024-05-28 18:27:32] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 2 ms to minimize.
[2024-05-28 18:27:32] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2024-05-28 18:27:32] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 0 ms to minimize.
[2024-05-28 18:27:33] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-05-28 18:27:40] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-28 18:27:49] [INFO ] Deduced a trap composed of 110 places in 174 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 79192ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 79215ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166625 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-07
Product exploration explored 100000 steps with 1575 reset in 788 ms.
Product exploration explored 100000 steps with 1637 reset in 978 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 470 steps (2 resets) in 18 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Support contains 6 out of 608 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 608 transition count 2388
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 578 transition count 2382
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 572 transition count 2382
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 72 place count 572 transition count 2316
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 204 place count 506 transition count 2316
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 336 place count 440 transition count 2250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 340 place count 436 transition count 2246
Iterating global reduction 3 with 4 rules applied. Total rules applied 344 place count 436 transition count 2246
Applied a total of 344 rules in 258 ms. Remains 436 /608 variables (removed 172) and now considering 2246/2418 (removed 172) transitions.
Running 2240 sub problems to find dead transitions.
[2024-05-28 18:27:56] [INFO ] Flow matrix only has 2210 transitions (discarded 36 similar events)
// Phase 1: matrix 2210 rows 436 cols
[2024-05-28 18:27:56] [INFO ] Computed 42 invariants in 55 ms
[2024-05-28 18:27:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-05-28 18:28:28] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2024-05-28 18:28:33] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2646 variables, and 33 constraints, problems are : Problem set: 0 solved, 2240 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/436 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2240/986 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-05-28 18:28:39] [INFO ] Deduced a trap composed of 30 places in 518 ms of which 3 ms to minimize.
[2024-05-28 18:28:39] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 2 ms to minimize.
[2024-05-28 18:28:40] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2024-05-28 18:28:40] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-28 18:28:40] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:28:45] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-05-28 18:28:49] [INFO ] Deduced a trap composed of 56 places in 441 ms of which 3 ms to minimize.
[2024-05-28 18:28:50] [INFO ] Deduced a trap composed of 69 places in 447 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2646 variables, and 41 constraints, problems are : Problem set: 0 solved, 2240 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/436 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/986 constraints, Known Traps: 10/10 constraints]
After SMT, in 59654ms problems are : Problem set: 0 solved, 2240 unsolved
Search for dead transitions found 0 dead transitions in 59677ms
[2024-05-28 18:28:56] [INFO ] Flow matrix only has 2210 transitions (discarded 36 similar events)
[2024-05-28 18:28:56] [INFO ] Invariant cache hit.
[2024-05-28 18:28:57] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-28 18:28:57] [INFO ] Flow matrix only has 2210 transitions (discarded 36 similar events)
[2024-05-28 18:28:57] [INFO ] Invariant cache hit.
[2024-05-28 18:28:58] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:29:16] [INFO ] Implicit Places using invariants and state equation in 19302 ms returned []
Implicit Place search using SMT with State Equation took 19815 ms to find 0 implicit places.
[2024-05-28 18:29:16] [INFO ] Redundant transitions in 71 ms returned []
Running 2240 sub problems to find dead transitions.
[2024-05-28 18:29:16] [INFO ] Flow matrix only has 2210 transitions (discarded 36 similar events)
[2024-05-28 18:29:16] [INFO ] Invariant cache hit.
[2024-05-28 18:29:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-05-28 18:29:49] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:29:50] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 2 ms to minimize.
[2024-05-28 18:29:57] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2646 variables, and 34 constraints, problems are : Problem set: 0 solved, 2240 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/436 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2240/986 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-05-28 18:30:11] [INFO ] Deduced a trap composed of 93 places in 623 ms of which 3 ms to minimize.
[2024-05-28 18:30:11] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 2 ms to minimize.
[2024-05-28 18:30:11] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-28 18:30:11] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 0 ms to minimize.
[2024-05-28 18:30:14] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 2240 unsolved
[2024-05-28 18:30:34] [INFO ] Deduced a trap composed of 55 places in 522 ms of which 4 ms to minimize.
[2024-05-28 18:30:34] [INFO ] Deduced a trap composed of 90 places in 436 ms of which 3 ms to minimize.
[2024-05-28 18:30:35] [INFO ] Deduced a trap composed of 55 places in 508 ms of which 3 ms to minimize.
[2024-05-28 18:30:35] [INFO ] Deduced a trap composed of 61 places in 527 ms of which 3 ms to minimize.
[2024-05-28 18:30:36] [INFO ] Deduced a trap composed of 29 places in 551 ms of which 5 ms to minimize.
[2024-05-28 18:30:37] [INFO ] Deduced a trap composed of 87 places in 423 ms of which 3 ms to minimize.
SMT process timed out in 80608ms, After SMT, problems are : Problem set: 0 solved, 2240 unsolved
Search for dead transitions found 0 dead transitions in 80629ms
Starting structural reductions in SI_LTL mode, iteration 1 : 436/608 places, 2246/2418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160464 ms. Remains : 436/608 places, 2246/2418 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 323 steps (1 resets) in 10 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2087 reset in 1063 ms.
Product exploration explored 100000 steps with 2093 reset in 741 ms.
Built C files in :
/tmp/ltsmin4396258171463513782
[2024-05-28 18:30:39] [INFO ] Too many transitions (2246) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:30:39] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4396258171463513782
Running compilation step : cd /tmp/ltsmin4396258171463513782;'/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/ltsmin4396258171463513782;'/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/ltsmin4396258171463513782;'/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 6 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 2246/2246 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 436 transition count 2240
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 430 transition count 2240
Applied a total of 12 rules in 115 ms. Remains 430 /436 variables (removed 6) and now considering 2240/2246 (removed 6) transitions.
Running 2234 sub problems to find dead transitions.
[2024-05-28 18:30:42] [INFO ] Flow matrix only has 2204 transitions (discarded 36 similar events)
// Phase 1: matrix 2204 rows 430 cols
[2024-05-28 18:30:42] [INFO ] Computed 42 invariants in 75 ms
[2024-05-28 18:30:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
[2024-05-28 18:31:13] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:31:16] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 2 ms to minimize.
[2024-05-28 18:31:19] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/2634 variables, and 34 constraints, problems are : Problem set: 0 solved, 2234 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/430 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2234/980 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
[2024-05-28 18:31:25] [INFO ] Deduced a trap composed of 35 places in 496 ms of which 2 ms to minimize.
[2024-05-28 18:31:25] [INFO ] Deduced a trap composed of 54 places in 491 ms of which 2 ms to minimize.
[2024-05-28 18:31:26] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2024-05-28 18:31:26] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/2634 variables, and 38 constraints, problems are : Problem set: 0 solved, 2234 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/430 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/980 constraints, Known Traps: 7/7 constraints]
After SMT, in 58944ms problems are : Problem set: 0 solved, 2234 unsolved
Search for dead transitions found 0 dead transitions in 58970ms
[2024-05-28 18:31:41] [INFO ] Flow matrix only has 2204 transitions (discarded 36 similar events)
[2024-05-28 18:31:41] [INFO ] Invariant cache hit.
[2024-05-28 18:31:42] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-28 18:31:42] [INFO ] Flow matrix only has 2204 transitions (discarded 36 similar events)
[2024-05-28 18:31:42] [INFO ] Invariant cache hit.
[2024-05-28 18:31:43] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:31:56] [INFO ] Implicit Places using invariants and state equation in 14247 ms returned []
Implicit Place search using SMT with State Equation took 14744 ms to find 0 implicit places.
[2024-05-28 18:31:56] [INFO ] Redundant transitions in 107 ms returned []
Running 2234 sub problems to find dead transitions.
[2024-05-28 18:31:56] [INFO ] Flow matrix only has 2204 transitions (discarded 36 similar events)
[2024-05-28 18:31:56] [INFO ] Invariant cache hit.
[2024-05-28 18:31:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
[2024-05-28 18:32:28] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:32:33] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/2634 variables, and 33 constraints, problems are : Problem set: 0 solved, 2234 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/430 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2234/980 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
[2024-05-28 18:32:49] [INFO ] Deduced a trap composed of 55 places in 482 ms of which 2 ms to minimize.
[2024-05-28 18:32:49] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 2 ms to minimize.
[2024-05-28 18:32:49] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2024-05-28 18:32:49] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-28 18:32:54] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 2234 unsolved
[2024-05-28 18:33:09] [INFO ] Deduced a trap composed of 29 places in 490 ms of which 3 ms to minimize.
[2024-05-28 18:33:09] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 0 ms to minimize.
[2024-05-28 18:33:11] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 9)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(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 1)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 4)
(s80 0)
(s81 1)
(s83 0)
(s84 0)
(s85 1)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 2)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 1)
(s123 0)
(s124 0)
(s125 10)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 4)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 6)
(s170 0)
(s171 0)
(s172 0)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 4)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 1)
(s235 1)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 4)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 1)
(s249 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/2634 variables, and 41 constraints, problems are : Problem set: 0 solved, 2234 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/430 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/980 constraints, Known Traps: 10/10 constraints]
After SMT, in 79136ms problems are : Problem set: 0 solved, 2234 unsolved
Search for dead transitions found 0 dead transitions in 79162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 430/436 places, 2240/2246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153117 ms. Remains : 430/436 places, 2240/2246 transitions.
Built C files in :
/tmp/ltsmin954284049384343777
[2024-05-28 18:33:15] [INFO ] Too many transitions (2240) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:33:15] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin954284049384343777
Running compilation step : cd /tmp/ltsmin954284049384343777;'/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/ltsmin954284049384343777;'/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/ltsmin954284049384343777;'/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 18:33:18] [INFO ] Flatten gal took : 146 ms
[2024-05-28 18:33:19] [INFO ] Flatten gal took : 132 ms
[2024-05-28 18:33:19] [INFO ] Time to serialize gal into /tmp/LTL11282039741963606420.gal : 31 ms
[2024-05-28 18:33:19] [INFO ] Time to serialize properties into /tmp/LTL7437152115732264119.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/LTL11282039741963606420.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15669978856199926516.hoa' '-atoms' '/tmp/LTL7437152115732264119.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7437152115732264119.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15669978856199926516.hoa
Detected timeout of ITS tools.
[2024-05-28 18:33:34] [INFO ] Flatten gal took : 155 ms
[2024-05-28 18:33:34] [INFO ] Flatten gal took : 162 ms
[2024-05-28 18:33:34] [INFO ] Time to serialize gal into /tmp/LTL7890273310239436115.gal : 30 ms
[2024-05-28 18:33:34] [INFO ] Time to serialize properties into /tmp/LTL14667583694332536846.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7890273310239436115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14667583694332536846.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(((EnablePollingE_4>=1)||(EnablePollingE_3>=1))||((EnablePollingE_1>=1)||(EnablePollingE_6>=1)))")||(("((EnablePollingE_2>=1)||...275
Formula 0 simplified : X(!"(((EnablePollingE_4>=1)||(EnablePollingE_3>=1))||((EnablePollingE_1>=1)||(EnablePollingE_6>=1)))" & !"((EnablePollingE_2>=1)||(E...265
Detected timeout of ITS tools.
[2024-05-28 18:33:49] [INFO ] Flatten gal took : 149 ms
[2024-05-28 18:33:49] [INFO ] Applying decomposition
[2024-05-28 18:33:50] [INFO ] Flatten gal took : 122 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/graph14584035376402019890.txt' '-o' '/tmp/graph14584035376402019890.bin' '-w' '/tmp/graph14584035376402019890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14584035376402019890.bin' '-l' '-1' '-v' '-w' '/tmp/graph14584035376402019890.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:33:50] [INFO ] Decomposing Gal with order
[2024-05-28 18:33:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:33:50] [INFO ] Removed a total of 894 redundant transitions.
[2024-05-28 18:33:51] [INFO ] Flatten gal took : 539 ms
[2024-05-28 18:33:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 40 ms.
[2024-05-28 18:33:51] [INFO ] Time to serialize gal into /tmp/LTL18249984124943613121.gal : 24 ms
[2024-05-28 18:33:51] [INFO ] Time to serialize properties into /tmp/LTL16238026757256612241.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/LTL18249984124943613121.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16238026757256612241.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(("(((i2.u1.EnablePollingE_4>=1)||(i2.u26.EnablePollingE_3>=1))||((i2.u7.EnablePollingE_1>=1)||(i2.u15.EnablePollingE_6>=1)))")||(...356
Formula 0 simplified : X(!"(((i2.u1.EnablePollingE_4>=1)||(i2.u26.EnablePollingE_3>=1))||((i2.u7.EnablePollingE_1>=1)||(i2.u15.EnablePollingE_6>=1)))" & !"...346
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-07 finished in 538708 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(((X(!p0)&&G(p1))||G(!p0))))'
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 133 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:34:06] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 18:34:06] [INFO ] Computed 42 invariants in 41 ms
[2024-05-28 18:34:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:34:51] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 3 ms to minimize.
[2024-05-28 18:34:53] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:35:03] [INFO ] Deduced a trap composed of 84 places in 463 ms of which 3 ms to minimize.
[2024-05-28 18:35:03] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:35:03] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-28 18:35:06] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 1 ms to minimize.
[2024-05-28 18:35:06] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 1 ms to minimize.
[2024-05-28 18:35:07] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 2 ms to minimize.
[2024-05-28 18:35:09] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 40 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 67382ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 67419ms
[2024-05-28 18:35:13] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:35:13] [INFO ] Invariant cache hit.
[2024-05-28 18:35:14] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-05-28 18:35:14] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:35:14] [INFO ] Invariant cache hit.
[2024-05-28 18:35:16] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:35:37] [INFO ] Implicit Places using invariants and state equation in 23099 ms returned []
Implicit Place search using SMT with State Equation took 23674 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:35:37] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:35:37] [INFO ] Invariant cache hit.
[2024-05-28 18:35:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:36:15] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 3 ms to minimize.
[2024-05-28 18:36:18] [INFO ] Deduced a trap composed of 112 places in 201 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:36:34] [INFO ] Deduced a trap composed of 47 places in 506 ms of which 3 ms to minimize.
[2024-05-28 18:36:34] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 2 ms to minimize.
[2024-05-28 18:36:35] [INFO ] Deduced a trap composed of 84 places in 174 ms of which 2 ms to minimize.
[2024-05-28 18:36:35] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-28 18:36:35] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:36:35] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-28 18:36:42] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:36:51] [INFO ] Deduced a trap composed of 110 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 79837ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 79864ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171107 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 171 ms :[p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-10
Product exploration explored 100000 steps with 715 reset in 879 ms.
Product exploration explored 100000 steps with 714 reset in 676 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 163 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[p0, p0, (AND p0 (NOT p1))]
RANDOM walk for 40001 steps (227 resets) in 657 ms. (60 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (129 resets) in 225 ms. (177 steps per ms) remains 1/1 properties
[2024-05-28 18:36:59] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:36:59] [INFO ] Invariant cache hit.
[2024-05-28 18:36:59] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/73 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:36:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 122/195 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 593/2990 variables, and 32 constraints, problems are : Problem set: 1 solved, 0 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 210ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 321 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Support contains 2 out of 608 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 608 transition count 2388
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 578 transition count 2382
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 572 transition count 2382
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 72 place count 572 transition count 2305
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 226 place count 495 transition count 2305
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 334 place count 441 transition count 2251
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 338 place count 437 transition count 2247
Iterating global reduction 3 with 4 rules applied. Total rules applied 342 place count 437 transition count 2247
Applied a total of 342 rules in 247 ms. Remains 437 /608 variables (removed 171) and now considering 2247/2418 (removed 171) transitions.
Running 2241 sub problems to find dead transitions.
[2024-05-28 18:37:00] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
// Phase 1: matrix 2211 rows 437 cols
[2024-05-28 18:37:00] [INFO ] Computed 42 invariants in 70 ms
[2024-05-28 18:37:00] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-05-28 18:37:34] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-28 18:37:35] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2648 variables, and 33 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2241/987 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1753 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/433 variables, 2/35 constraints. Problems are: Problem set: 330 solved, 1911 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 5/40 constraints. Problems are: Problem set: 330 solved, 1911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/2648 variables, and 40 constraints, problems are : Problem set: 330 solved, 1911 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/987 constraints, Known Traps: 2/2 constraints]
After SMT, in 59783ms problems are : Problem set: 330 solved, 1911 unsolved
Search for dead transitions found 330 dead transitions in 59812ms
Found 330 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 330 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 330 transitions.
[2024-05-28 18:38:00] [INFO ] Flow matrix only has 1881 transitions (discarded 36 similar events)
// Phase 1: matrix 1881 rows 437 cols
[2024-05-28 18:38:00] [INFO ] Computed 42 invariants in 30 ms
[2024-05-28 18:38:00] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-28 18:38:00] [INFO ] Flow matrix only has 1881 transitions (discarded 36 similar events)
[2024-05-28 18:38:00] [INFO ] Invariant cache hit.
[2024-05-28 18:38:02] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:38:16] [INFO ] Implicit Places using invariants and state equation in 15829 ms returned []
Implicit Place search using SMT with State Equation took 16321 ms to find 0 implicit places.
[2024-05-28 18:38:16] [INFO ] Redundant transitions in 120 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 437/608 places, 1917/2418 transitions.
Applied a total of 0 rules in 43 ms. Remains 437 /437 variables (removed 0) and now considering 1917/1917 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76557 ms. Remains : 437/608 places, 1917/2418 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[p0]
RANDOM walk for 11291 steps (111 resets) in 125 ms. (89 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Product exploration explored 100000 steps with 1023 reset in 843 ms.
Product exploration explored 100000 steps with 1037 reset in 810 ms.
Built C files in :
/tmp/ltsmin13011311537823609063
[2024-05-28 18:38:19] [INFO ] Too many transitions (1917) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:38:19] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13011311537823609063
Running compilation step : cd /tmp/ltsmin13011311537823609063;'/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/ltsmin13011311537823609063;'/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/ltsmin13011311537823609063;'/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 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 437/437 places, 1917/1917 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 419 transition count 1899
Applied a total of 36 rules in 41 ms. Remains 419 /437 variables (removed 18) and now considering 1899/1917 (removed 18) transitions.
Running 1893 sub problems to find dead transitions.
[2024-05-28 18:38:22] [INFO ] Flow matrix only has 1863 transitions (discarded 36 similar events)
// Phase 1: matrix 1863 rows 419 cols
[2024-05-28 18:38:22] [INFO ] Computed 42 invariants in 63 ms
[2024-05-28 18:38:22] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
[2024-05-28 18:38:51] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-05-28 18:38:55] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-05-28 18:38:57] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-05-28 18:38:57] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
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 0.0)
(s10 3.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 9.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 4.0)
(s44 0.0)
(s45 4.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 3.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 4.0)
(s79 0.0)
(s80 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 3.0)
(s103 2.0)
(s104 2.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 4.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 10.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 4.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 2.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 3.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 2.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s169 0.0)
(s170 2.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 4.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s206 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2282 variables, and 35 constraints, problems are : Problem set: 0 solved, 1893 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1893/1893 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1893 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
[2024-05-28 18:39:05] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 1 ms to minimize.
[2024-05-28 18:39:05] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 2 ms to minimize.
[2024-05-28 18:39:06] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 1 ms to minimize.
[2024-05-28 18:39:06] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-28 18:39:06] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
[2024-05-28 18:39:17] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2282 variables, and 41 constraints, problems are : Problem set: 0 solved, 1893 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/1893 constraints, Known Traps: 10/10 constraints]
After SMT, in 59094ms problems are : Problem set: 0 solved, 1893 unsolved
Search for dead transitions found 0 dead transitions in 59110ms
[2024-05-28 18:39:21] [INFO ] Flow matrix only has 1863 transitions (discarded 36 similar events)
[2024-05-28 18:39:21] [INFO ] Invariant cache hit.
[2024-05-28 18:39:21] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-05-28 18:39:21] [INFO ] Flow matrix only has 1863 transitions (discarded 36 similar events)
[2024-05-28 18:39:21] [INFO ] Invariant cache hit.
[2024-05-28 18:39:22] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:39:44] [INFO ] Implicit Places using invariants and state equation in 22752 ms returned []
Implicit Place search using SMT with State Equation took 23387 ms to find 0 implicit places.
[2024-05-28 18:39:44] [INFO ] Redundant transitions in 105 ms returned []
Running 1893 sub problems to find dead transitions.
[2024-05-28 18:39:44] [INFO ] Flow matrix only has 1863 transitions (discarded 36 similar events)
[2024-05-28 18:39:44] [INFO ] Invariant cache hit.
[2024-05-28 18:39:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
[2024-05-28 18:40:13] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:40:16] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-28 18:40:19] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2282 variables, and 34 constraints, problems are : Problem set: 0 solved, 1893 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1893/1893 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1893 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
[2024-05-28 18:40:39] [INFO ] Deduced a trap composed of 29 places in 375 ms of which 3 ms to minimize.
[2024-05-28 18:40:39] [INFO ] Deduced a trap composed of 35 places in 354 ms of which 4 ms to minimize.
[2024-05-28 18:40:39] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 1 ms to minimize.
[2024-05-28 18:40:39] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 1 ms to minimize.
[2024-05-28 18:40:39] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1893 unsolved
[2024-05-28 18:40:51] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:40:57] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2282 variables, and 41 constraints, problems are : Problem set: 0 solved, 1893 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/1893 constraints, Known Traps: 10/10 constraints]
After SMT, in 78574ms problems are : Problem set: 0 solved, 1893 unsolved
Search for dead transitions found 0 dead transitions in 78593ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/437 places, 1899/1917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161257 ms. Remains : 419/437 places, 1899/1917 transitions.
Built C files in :
/tmp/ltsmin9633359824008342748
[2024-05-28 18:41:03] [INFO ] Too many transitions (1899) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:41:03] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9633359824008342748
Running compilation step : cd /tmp/ltsmin9633359824008342748;'/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/ltsmin9633359824008342748;'/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/ltsmin9633359824008342748;'/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 18:41:06] [INFO ] Flatten gal took : 119 ms
[2024-05-28 18:41:06] [INFO ] Flatten gal took : 119 ms
[2024-05-28 18:41:06] [INFO ] Time to serialize gal into /tmp/LTL3673336465170366387.gal : 16 ms
[2024-05-28 18:41:06] [INFO ] Time to serialize properties into /tmp/LTL4924552107432591547.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3673336465170366387.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18354986429443935530.hoa' '-atoms' '/tmp/LTL4924552107432591547.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4924552107432591547.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18354986429443935530.hoa
Detected timeout of ITS tools.
[2024-05-28 18:41:22] [INFO ] Flatten gal took : 117 ms
[2024-05-28 18:41:22] [INFO ] Flatten gal took : 120 ms
[2024-05-28 18:41:22] [INFO ] Time to serialize gal into /tmp/LTL6570890969797975604.gal : 18 ms
[2024-05-28 18:41:22] [INFO ] Time to serialize properties into /tmp/LTL982052897663441291.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/LTL6570890969797975604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL982052897663441291.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F((G("((cBlockedTasks<10)||(DisablePollingB_5_2<1))"))||((X("((cBlockedTasks<10)||(DisablePollingB_5_2<1))"))&&(G("((Check_Sources_...185
Formula 0 simplified : G(F!"((cBlockedTasks<10)||(DisablePollingB_5_2<1))" & (X!"((cBlockedTasks<10)||(DisablePollingB_5_2<1))" | F!"((Check_Sources_E_5>=1...175
Detected timeout of ITS tools.
[2024-05-28 18:41:37] [INFO ] Flatten gal took : 161 ms
[2024-05-28 18:41:37] [INFO ] Applying decomposition
[2024-05-28 18:41:37] [INFO ] Flatten gal took : 108 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/graph11667785429990002457.txt' '-o' '/tmp/graph11667785429990002457.bin' '-w' '/tmp/graph11667785429990002457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11667785429990002457.bin' '-l' '-1' '-v' '-w' '/tmp/graph11667785429990002457.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:41:37] [INFO ] Decomposing Gal with order
[2024-05-28 18:41:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:41:37] [INFO ] Removed a total of 838 redundant transitions.
[2024-05-28 18:41:38] [INFO ] Flatten gal took : 181 ms
[2024-05-28 18:41:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 25 ms.
[2024-05-28 18:41:38] [INFO ] Time to serialize gal into /tmp/LTL10959074437929289251.gal : 20 ms
[2024-05-28 18:41:38] [INFO ] Time to serialize properties into /tmp/LTL7500535494671230599.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/LTL10959074437929289251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7500535494671230599.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i3.u7.cBlockedTasks<10)||(i0.u28.DisablePollingB_5_2<1))"))||((X("((i3.u7.cBlockedTasks<10)||(i0.u28.DisablePollingB_5_2<1)...224
Formula 0 simplified : G(F!"((i3.u7.cBlockedTasks<10)||(i0.u28.DisablePollingB_5_2<1))" & (X!"((i3.u7.cBlockedTasks<10)||(i0.u28.DisablePollingB_5_2<1))" |...214
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-10 finished in 466920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1 U p2)))))'
Support contains 5 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
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 615 transition count 2387
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 577 transition count 2385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 575 transition count 2385
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 80 place count 575 transition count 2313
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 224 place count 503 transition count 2313
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 378 place count 426 transition count 2236
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 381 place count 423 transition count 2233
Iterating global reduction 3 with 3 rules applied. Total rules applied 384 place count 423 transition count 2233
Applied a total of 384 rules in 219 ms. Remains 423 /621 variables (removed 198) and now considering 2233/2425 (removed 192) transitions.
Running 2227 sub problems to find dead transitions.
[2024-05-28 18:41:53] [INFO ] Flow matrix only has 2197 transitions (discarded 36 similar events)
// Phase 1: matrix 2197 rows 423 cols
[2024-05-28 18:41:53] [INFO ] Computed 42 invariants in 32 ms
[2024-05-28 18:41:53] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-05-28 18:42:26] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-05-28 18:42:31] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/2620 variables, and 33 constraints, problems are : Problem set: 0 solved, 2227 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 15/22 constraints, State Equation: 0/423 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2227/973 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-05-28 18:42:40] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 2 ms to minimize.
[2024-05-28 18:42:42] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-05-28 18:42:53] [INFO ] Deduced a trap composed of 55 places in 406 ms of which 2 ms to minimize.
[2024-05-28 18:42:53] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 2 ms to minimize.
SMT process timed out in 60432ms, After SMT, problems are : Problem set: 0 solved, 2227 unsolved
Search for dead transitions found 0 dead transitions in 60457ms
[2024-05-28 18:42:53] [INFO ] Flow matrix only has 2197 transitions (discarded 36 similar events)
[2024-05-28 18:42:53] [INFO ] Invariant cache hit.
[2024-05-28 18:42:54] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-28 18:42:54] [INFO ] Flow matrix only has 2197 transitions (discarded 36 similar events)
[2024-05-28 18:42:54] [INFO ] Invariant cache hit.
[2024-05-28 18:42:55] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:43:13] [INFO ] Implicit Places using invariants and state equation in 18754 ms returned []
Implicit Place search using SMT with State Equation took 19371 ms to find 0 implicit places.
[2024-05-28 18:43:13] [INFO ] Redundant transitions in 92 ms returned []
Running 2227 sub problems to find dead transitions.
[2024-05-28 18:43:13] [INFO ] Flow matrix only has 2197 transitions (discarded 36 similar events)
[2024-05-28 18:43:13] [INFO ] Invariant cache hit.
[2024-05-28 18:43:13] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-05-28 18:43:46] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:43:50] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2024-05-28 18:43:53] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/2620 variables, and 34 constraints, problems are : Problem set: 0 solved, 2227 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 15/22 constraints, State Equation: 0/423 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2227/973 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-05-28 18:44:04] [INFO ] Deduced a trap composed of 29 places in 364 ms of which 2 ms to minimize.
[2024-05-28 18:44:04] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 2 ms to minimize.
[2024-05-28 18:44:05] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-05-28 18:44:05] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-28 18:44:07] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-28 18:44:07] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2024-05-28 18:44:07] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 2227 unsolved
[2024-05-28 18:44:25] [INFO ] Deduced a trap composed of 29 places in 428 ms of which 2 ms to minimize.
[2024-05-28 18:44:27] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/2620 variables, and 43 constraints, problems are : Problem set: 0 solved, 2227 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 15/22 constraints, State Equation: 0/423 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/973 constraints, Known Traps: 12/12 constraints]
After SMT, in 79500ms problems are : Problem set: 0 solved, 2227 unsolved
Search for dead transitions found 0 dead transitions in 79520ms
Starting structural reductions in SI_LTL mode, iteration 1 : 423/621 places, 2233/2425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159679 ms. Remains : 423/621 places, 2233/2425 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-11
Stuttering criterion allowed to conclude after 191 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-11 finished in 159797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
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 615 transition count 2381
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 571 transition count 2381
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 88 place count 571 transition count 2309
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 232 place count 499 transition count 2309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 233 place count 498 transition count 2308
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 498 transition count 2308
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 386 place count 422 transition count 2232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 389 place count 419 transition count 2229
Iterating global reduction 2 with 3 rules applied. Total rules applied 392 place count 419 transition count 2229
Applied a total of 392 rules in 297 ms. Remains 419 /621 variables (removed 202) and now considering 2229/2425 (removed 196) transitions.
Running 2223 sub problems to find dead transitions.
[2024-05-28 18:44:33] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
// Phase 1: matrix 2193 rows 419 cols
[2024-05-28 18:44:33] [INFO ] Computed 42 invariants in 47 ms
[2024-05-28 18:44:33] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 18:45:03] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-05-28 18:45:08] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-05-28 18:45:11] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2024-05-28 18:45:11] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 35 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 18:45:15] [INFO ] Deduced a trap composed of 30 places in 478 ms of which 3 ms to minimize.
[2024-05-28 18:45:15] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2024-05-28 18:45:15] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:45:15] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-05-28 18:45:16] [INFO ] Deduced a trap composed of 36 places in 340 ms of which 2 ms to minimize.
[2024-05-28 18:45:16] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 41 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 10/10 constraints]
After SMT, in 58833ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 58862ms
[2024-05-28 18:45:32] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-05-28 18:45:32] [INFO ] Invariant cache hit.
[2024-05-28 18:45:32] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-28 18:45:32] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-05-28 18:45:32] [INFO ] Invariant cache hit.
[2024-05-28 18:45:33] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:45:47] [INFO ] Implicit Places using invariants and state equation in 14922 ms returned []
Implicit Place search using SMT with State Equation took 15417 ms to find 0 implicit places.
[2024-05-28 18:45:47] [INFO ] Redundant transitions in 69 ms returned []
Running 2223 sub problems to find dead transitions.
[2024-05-28 18:45:47] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-05-28 18:45:47] [INFO ] Invariant cache hit.
[2024-05-28 18:45:47] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 18:46:18] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-05-28 18:46:19] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-28 18:46:23] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2024-05-28 18:46:26] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 35 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 18:46:38] [INFO ] Deduced a trap composed of 50 places in 342 ms of which 2 ms to minimize.
[2024-05-28 18:46:39] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 1 ms to minimize.
[2024-05-28 18:46:39] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:46:39] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
[2024-05-28 18:46:39] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 0 ms to minimize.
[2024-05-28 18:46:43] [INFO ] Deduced a trap composed of 44 places in 330 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
(s130 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 3)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 9)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 1)
(s43 4)
(s44 0)
(s45 4)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 3)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 4)
(s79 0)
(s80 1)
(s82 0)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 3)
(s103 2)
(s104 2)
(s105 0)
(s106 1)
(s107 0)
(s108 4)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 1)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 10)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 4)
(s128 0)
(s129 1)
(s130 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 41 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 10/10 constraints]
After SMT, in 78199ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 78218ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/621 places, 2229/2425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152884 ms. Remains : 419/621 places, 2229/2425 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-12
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-12 finished in 152991 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 U !p1)&&X(p0))))'
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 114 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:47:06] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 18:47:06] [INFO ] Computed 42 invariants in 82 ms
[2024-05-28 18:47:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 31 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:47:47] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-28 18:47:50] [INFO ] Deduced a trap composed of 110 places in 179 ms of which 4 ms to minimize.
[2024-05-28 18:47:51] [INFO ] Deduced a trap composed of 84 places in 388 ms of which 3 ms to minimize.
[2024-05-28 18:47:51] [INFO ] Deduced a trap composed of 41 places in 334 ms of which 2 ms to minimize.
[2024-05-28 18:47:52] [INFO ] Deduced a trap composed of 47 places in 318 ms of which 1 ms to minimize.
[2024-05-28 18:47:52] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 2 ms to minimize.
[2024-05-28 18:47:52] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:47:52] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 39 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 8/8 constraints]
After SMT, in 58980ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59024ms
[2024-05-28 18:48:05] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:48:05] [INFO ] Invariant cache hit.
[2024-05-28 18:48:05] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-28 18:48:05] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:48:05] [INFO ] Invariant cache hit.
[2024-05-28 18:48:07] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:48:30] [INFO ] Implicit Places using invariants and state equation in 25212 ms returned []
Implicit Place search using SMT with State Equation took 25777 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:48:30] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:48:30] [INFO ] Invariant cache hit.
[2024-05-28 18:48:30] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:49:10] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-28 18:49:13] [INFO ] Deduced a trap composed of 112 places in 94 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:49:27] [INFO ] Deduced a trap composed of 47 places in 520 ms of which 3 ms to minimize.
[2024-05-28 18:49:28] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 3 ms to minimize.
[2024-05-28 18:49:28] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 2 ms to minimize.
[2024-05-28 18:49:28] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-28 18:49:28] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 4 ms to minimize.
[2024-05-28 18:49:29] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-28 18:49:36] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-05-28 18:49:47] [INFO ] Deduced a trap composed of 110 places in 175 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 79401ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 79422ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164358 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-14 finished in 164528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((F(p1)&&p0))))))'
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 615 transition count 2425
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 609 transition count 2419
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 609 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 2418
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 2418
Applied a total of 20 rules in 73 ms. Remains 608 /621 variables (removed 13) and now considering 2418/2425 (removed 7) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:49:50] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:49:50] [INFO ] Invariant cache hit.
[2024-05-28 18:49:50] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 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 602/2990 variables, and 31 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:50:31] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 18:50:31] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-28 18:50:31] [INFO ] Deduced a trap composed of 35 places in 410 ms of which 2 ms to minimize.
[2024-05-28 18:50:31] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 1 ms to minimize.
[2024-05-28 18:50:31] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-05-28 18:50:32] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 2 ms to minimize.
[2024-05-28 18:50:35] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 7/7 constraints]
After SMT, in 59073ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59095ms
[2024-05-28 18:50:49] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:50:49] [INFO ] Invariant cache hit.
[2024-05-28 18:50:50] [INFO ] Implicit Places using invariants in 796 ms returned []
[2024-05-28 18:50:50] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:50:50] [INFO ] Invariant cache hit.
[2024-05-28 18:50:52] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:51:17] [INFO ] Implicit Places using invariants and state equation in 27075 ms returned []
Implicit Place search using SMT with State Equation took 27872 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 18:51:17] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 18:51:17] [INFO ] Invariant cache hit.
[2024-05-28 18:51:17] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:51:56] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-28 18:51:59] [INFO ] Deduced a trap composed of 112 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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 18:52:14] [INFO ] Deduced a trap composed of 47 places in 494 ms of which 4 ms to minimize.
[2024-05-28 18:52:14] [INFO ] Deduced a trap composed of 84 places in 199 ms of which 3 ms to minimize.
[2024-05-28 18:52:14] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 1 ms to minimize.
[2024-05-28 18:52:14] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2024-05-28 18:52:14] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2024-05-28 18:52:15] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-05-28 18:52:22] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:52:32] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 78906ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 78926ms
Starting structural reductions in LTL mode, iteration 1 : 608/621 places, 2418/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165974 ms. Remains : 608/621 places, 2418/2425 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-15
Stuttering criterion allowed to conclude after 224 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-15 finished in 166168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
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(((X(!p0)&&G(p1))||G(!p0))))'
Found a Shortening insensitive property : PolyORBLF-PT-S06J04T06-LTLFireability-10
Stuttering acceptance computed with spot in 79 ms :[p0, p0, (AND (NOT p1) p0)]
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 621/621 places, 2425/2425 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 615 transition count 2393
Reduce places removed 32 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 583 transition count 2387
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 76 place count 577 transition count 2387
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 76 place count 577 transition count 2310
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 230 place count 500 transition count 2310
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 231 place count 499 transition count 2309
Iterating global reduction 3 with 1 rules applied. Total rules applied 232 place count 499 transition count 2309
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
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 350 place count 440 transition count 2250
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 353 place count 437 transition count 2247
Iterating global reduction 3 with 3 rules applied. Total rules applied 356 place count 437 transition count 2247
Applied a total of 356 rules in 219 ms. Remains 437 /621 variables (removed 184) and now considering 2247/2425 (removed 178) transitions.
Running 2241 sub problems to find dead transitions.
[2024-05-28 18:52:37] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
// Phase 1: matrix 2211 rows 437 cols
[2024-05-28 18:52:37] [INFO ] Computed 42 invariants in 64 ms
[2024-05-28 18:52:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-05-28 18:53:07] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 4 ms to minimize.
[2024-05-28 18:53:13] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 2 ms to minimize.
[2024-05-28 18:53:14] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 2 ms to minimize.
[2024-05-28 18:53:14] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-05-28 18:53:14] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-28 18:53:14] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-28 18:53:14] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 2 ms to minimize.
[2024-05-28 18:53:14] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2648 variables, and 39 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2241/987 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-05-28 18:53:17] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 1 ms to minimize.
[2024-05-28 18:53:17] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:53:20] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
[2024-05-28 18:53:22] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 1 ms to minimize.
[2024-05-28 18:53:26] [INFO ] Deduced a trap composed of 56 places in 363 ms of which 1 ms to minimize.
[2024-05-28 18:53:27] [INFO ] Deduced a trap composed of 29 places in 325 ms of which 1 ms to minimize.
[2024-05-28 18:53:30] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/2648 variables, and 46 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/987 constraints, Known Traps: 15/15 constraints]
After SMT, in 58397ms problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 58421ms
[2024-05-28 18:53:35] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-05-28 18:53:35] [INFO ] Invariant cache hit.
[2024-05-28 18:53:36] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-28 18:53:36] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-05-28 18:53:36] [INFO ] Invariant cache hit.
[2024-05-28 18:53:37] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:53:58] [INFO ] Implicit Places using invariants and state equation in 22495 ms returned []
Implicit Place search using SMT with State Equation took 23073 ms to find 0 implicit places.
Running 2241 sub problems to find dead transitions.
[2024-05-28 18:53:58] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-05-28 18:53:58] [INFO ] Invariant cache hit.
[2024-05-28 18:53:58] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-05-28 18:54:29] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-28 18:54:34] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-28 18:54:35] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-05-28 18:54:35] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-28 18:54:35] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-28 18:54:35] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-28 18:54:35] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2648 variables, and 38 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2241/987 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-05-28 18:54:50] [INFO ] Deduced a trap composed of 56 places in 305 ms of which 1 ms to minimize.
[2024-05-28 18:54:50] [INFO ] Deduced a trap composed of 113 places in 321 ms of which 2 ms to minimize.
[2024-05-28 18:54:50] [INFO ] Deduced a trap composed of 50 places in 353 ms of which 1 ms to minimize.
[2024-05-28 18:54:51] [INFO ] Deduced a trap composed of 35 places in 294 ms of which 1 ms to minimize.
[2024-05-28 18:54:51] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-28 18:54:51] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-05-28 18:54:51] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 0 ms to minimize.
[2024-05-28 18:54:52] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 1 ms to minimize.
[2024-05-28 18:54:52] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-28 18:54:53] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/2648 variables, and 48 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/987 constraints, Known Traps: 17/17 constraints]
After SMT, in 79106ms problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 79127ms
Starting structural reductions in LI_LTL mode, iteration 1 : 437/621 places, 2247/2425 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 160848 ms. Remains : 437/621 places, 2247/2425 transitions.
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-10
Product exploration explored 100000 steps with 1128 reset in 652 ms.
Product exploration explored 100000 steps with 1105 reset in 686 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 99 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[p0, p0, (AND p0 (NOT p1))]
RANDOM walk for 40001 steps (405 resets) in 342 ms. (116 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40001 steps (138 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
[2024-05-28 18:55:19] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-05-28 18:55:19] [INFO ] Invariant cache hit.
[2024-05-28 18:55:19] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 329/341 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:55:19] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 52/393 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 435/2648 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 173ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 219 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[p0]
Stuttering acceptance computed with spot in 23 ms :[p0]
Support contains 2 out of 437 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 437/437 places, 2247/2247 transitions.
Applied a total of 0 rules in 38 ms. Remains 437 /437 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
Running 2241 sub problems to find dead transitions.
[2024-05-28 18:55:20] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-05-28 18:55:20] [INFO ] Invariant cache hit.
[2024-05-28 18:55:20] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-05-28 18:55:52] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:55:57] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 2 ms to minimize.
[2024-05-28 18:55:58] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-28 18:55:59] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-28 18:55:59] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2024-05-28 18:55:59] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-28 18:55:59] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2648 variables, and 38 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2241/987 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-05-28 18:56:01] [INFO ] Deduced a trap composed of 56 places in 377 ms of which 2 ms to minimize.
[2024-05-28 18:56:02] [INFO ] Deduced a trap composed of 113 places in 340 ms of which 2 ms to minimize.
[2024-05-28 18:56:02] [INFO ] Deduced a trap composed of 50 places in 395 ms of which 2 ms to minimize.
[2024-05-28 18:56:03] [INFO ] Deduced a trap composed of 35 places in 374 ms of which 2 ms to minimize.
[2024-05-28 18:56:03] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:56:03] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 0 ms to minimize.
[2024-05-28 18:56:04] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-28 18:56:04] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 2 ms to minimize.
[2024-05-28 18:56:04] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 0 ms to minimize.
[2024-05-28 18:56:05] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/2648 variables, and 48 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/987 constraints, Known Traps: 17/17 constraints]
After SMT, in 59478ms problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 59499ms
[2024-05-28 18:56:19] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-05-28 18:56:19] [INFO ] Invariant cache hit.
[2024-05-28 18:56:20] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-05-28 18:56:20] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-05-28 18:56:20] [INFO ] Invariant cache hit.
[2024-05-28 18:56:21] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:56:43] [INFO ] Implicit Places using invariants and state equation in 23413 ms returned []
Implicit Place search using SMT with State Equation took 24144 ms to find 0 implicit places.
[2024-05-28 18:56:43] [INFO ] Redundant transitions in 71 ms returned []
Running 2241 sub problems to find dead transitions.
[2024-05-28 18:56:43] [INFO ] Flow matrix only has 2211 transitions (discarded 36 similar events)
[2024-05-28 18:56:43] [INFO ] Invariant cache hit.
[2024-05-28 18:56:43] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-05-28 18:57:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:57:24] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-28 18:57:25] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-28 18:57:25] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2024-05-28 18:57:25] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-28 18:57:25] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-28 18:57:25] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2648 variables, and 38 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2241/987 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-05-28 18:57:35] [INFO ] Deduced a trap composed of 56 places in 384 ms of which 1 ms to minimize.
[2024-05-28 18:57:36] [INFO ] Deduced a trap composed of 113 places in 460 ms of which 3 ms to minimize.
[2024-05-28 18:57:36] [INFO ] Deduced a trap composed of 50 places in 380 ms of which 2 ms to minimize.
[2024-05-28 18:57:37] [INFO ] Deduced a trap composed of 35 places in 388 ms of which 2 ms to minimize.
[2024-05-28 18:57:37] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 0 ms to minimize.
[2024-05-28 18:57:38] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-05-28 18:57:38] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 0 ms to minimize.
[2024-05-28 18:57:38] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 1 ms to minimize.
[2024-05-28 18:57:38] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
[2024-05-28 18:57:39] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 0)
(s8 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/2648 variables, and 48 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/437 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/987 constraints, Known Traps: 17/17 constraints]
After SMT, in 79345ms problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 79365ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 163133 ms. Remains : 437/437 places, 2247/2247 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
RANDOM walk for 6548 steps (71 resets) in 82 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Stuttering acceptance computed with spot in 41 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
Product exploration explored 100000 steps with 1043 reset in 878 ms.
Product exploration explored 100000 steps with 1029 reset in 760 ms.
Built C files in :
/tmp/ltsmin1560819155307403264
[2024-05-28 18:58:05] [INFO ] Too many transitions (2247) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:58:05] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1560819155307403264
Running compilation step : cd /tmp/ltsmin1560819155307403264;'/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/ltsmin1560819155307403264;'/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/ltsmin1560819155307403264;'/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 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 437/437 places, 2247/2247 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 419 transition count 2229
Applied a total of 36 rules in 112 ms. Remains 419 /437 variables (removed 18) and now considering 2229/2247 (removed 18) transitions.
Running 2223 sub problems to find dead transitions.
[2024-05-28 18:58:08] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
// Phase 1: matrix 2193 rows 419 cols
[2024-05-28 18:58:08] [INFO ] Computed 42 invariants in 73 ms
[2024-05-28 18:58:08] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 18:58:40] [INFO ] Deduced a trap composed of 148 places in 241 ms of which 3 ms to minimize.
[2024-05-28 18:58:40] [INFO ] Deduced a trap composed of 144 places in 260 ms of which 2 ms to minimize.
[2024-05-28 18:58:41] [INFO ] Deduced a trap composed of 139 places in 313 ms of which 2 ms to minimize.
[2024-05-28 18:58:41] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 1 ms to minimize.
[2024-05-28 18:58:47] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 1 ms to minimize.
SMT process timed out in 38887ms, After SMT, problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 38912ms
[2024-05-28 18:58:47] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-05-28 18:58:47] [INFO ] Invariant cache hit.
[2024-05-28 18:58:47] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-28 18:58:47] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-05-28 18:58:47] [INFO ] Invariant cache hit.
[2024-05-28 18:58:50] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:59:09] [INFO ] Implicit Places using invariants and state equation in 21762 ms returned []
Implicit Place search using SMT with State Equation took 22324 ms to find 0 implicit places.
[2024-05-28 18:59:09] [INFO ] Redundant transitions in 106 ms returned []
Running 2223 sub problems to find dead transitions.
[2024-05-28 18:59:09] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-05-28 18:59:09] [INFO ] Invariant cache hit.
[2024-05-28 18:59:09] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 18:59:41] [INFO ] Deduced a trap composed of 118 places in 327 ms of which 3 ms to minimize.
[2024-05-28 18:59:42] [INFO ] Deduced a trap composed of 151 places in 318 ms of which 2 ms to minimize.
[2024-05-28 18:59:42] [INFO ] Deduced a trap composed of 144 places in 293 ms of which 3 ms to minimize.
[2024-05-28 18:59:42] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 39 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 19:00:02] [INFO ] Deduced a trap composed of 58 places in 212 ms of which 1 ms to minimize.
[2024-05-28 19:00:02] [INFO ] Deduced a trap composed of 58 places in 192 ms of which 1 ms to minimize.
[2024-05-28 19:00:02] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 1 ms to minimize.
[2024-05-28 19:00:12] [INFO ] Deduced a trap composed of 136 places in 353 ms of which 2 ms to minimize.
[2024-05-28 19:00:17] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2024-05-28 19:00:17] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2024-05-28 19:00:17] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:00:17] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 0 ms to minimize.
[2024-05-28 19:00:18] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 48 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 13/13 constraints]
After SMT, in 79270ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 79294ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/437 places, 2229/2247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140763 ms. Remains : 419/437 places, 2229/2247 transitions.
Built C files in :
/tmp/ltsmin15820789739906063114
[2024-05-28 19:00:29] [INFO ] Too many transitions (2229) to apply POR reductions. Disabling POR matrices.
[2024-05-28 19:00:29] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15820789739906063114
Running compilation step : cd /tmp/ltsmin15820789739906063114;'/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/ltsmin15820789739906063114;'/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/ltsmin15820789739906063114;'/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 19:00:32] [INFO ] Flatten gal took : 123 ms
[2024-05-28 19:00:32] [INFO ] Flatten gal took : 119 ms
[2024-05-28 19:00:32] [INFO ] Time to serialize gal into /tmp/LTL15226679326459780857.gal : 18 ms
[2024-05-28 19:00:32] [INFO ] Time to serialize properties into /tmp/LTL16593543198150019880.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15226679326459780857.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1719623365498278832.hoa' '-atoms' '/tmp/LTL16593543198150019880.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16593543198150019880.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1719623365498278832.hoa
Detected timeout of ITS tools.
[2024-05-28 19:00:47] [INFO ] Flatten gal took : 120 ms
[2024-05-28 19:00:48] [INFO ] Flatten gal took : 117 ms
[2024-05-28 19:00:48] [INFO ] Time to serialize gal into /tmp/LTL557952132567638228.gal : 17 ms
[2024-05-28 19:00:48] [INFO ] Time to serialize properties into /tmp/LTL14981817960098249773.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/LTL557952132567638228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14981817960098249773.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 : !((F((G("((cBlockedTasks<10)||(DisablePollingB_5_2<1))"))||((X("((cBlockedTasks<10)||(DisablePollingB_5_2<1))"))&&(G("((Check_Sources_...185
Formula 0 simplified : G(F!"((cBlockedTasks<10)||(DisablePollingB_5_2<1))" & (X!"((cBlockedTasks<10)||(DisablePollingB_5_2<1))" | F!"((Check_Sources_E_5>=1...175
Detected timeout of ITS tools.
[2024-05-28 19:01:03] [INFO ] Flatten gal took : 81 ms
[2024-05-28 19:01:03] [INFO ] Applying decomposition
[2024-05-28 19:01:03] [INFO ] Flatten gal took : 84 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/graph7742019831362845078.txt' '-o' '/tmp/graph7742019831362845078.bin' '-w' '/tmp/graph7742019831362845078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7742019831362845078.bin' '-l' '-1' '-v' '-w' '/tmp/graph7742019831362845078.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:01:03] [INFO ] Decomposing Gal with order
[2024-05-28 19:01:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:01:03] [INFO ] Removed a total of 820 redundant transitions.
[2024-05-28 19:01:03] [INFO ] Flatten gal took : 208 ms
[2024-05-28 19:01:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 33 ms.
[2024-05-28 19:01:03] [INFO ] Time to serialize gal into /tmp/LTL17904955780399817979.gal : 23 ms
[2024-05-28 19:01:03] [INFO ] Time to serialize properties into /tmp/LTL8825895574727387859.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/LTL17904955780399817979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8825895574727387859.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i0.u0.cBlockedTasks<10)||(i0.u23.DisablePollingB_5_2<1))"))||((X("((i0.u0.cBlockedTasks<10)||(i0.u23.DisablePollingB_5_2<1)...225
Formula 0 simplified : G(F!"((i0.u0.cBlockedTasks<10)||(i0.u23.DisablePollingB_5_2<1))" & (X!"((i0.u0.cBlockedTasks<10)||(i0.u23.DisablePollingB_5_2<1))" |...215
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-10 finished in 522009 ms.
[2024-05-28 19:01:18] [INFO ] Flatten gal took : 127 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3359011419145788656
[2024-05-28 19:01:19] [INFO ] Too many transitions (2425) to apply POR reductions. Disabling POR matrices.
[2024-05-28 19:01:19] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3359011419145788656
Running compilation step : cd /tmp/ltsmin3359011419145788656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 19:01:19] [INFO ] Applying decomposition
[2024-05-28 19:01:19] [INFO ] Flatten gal took : 115 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/graph10997687231892188854.txt' '-o' '/tmp/graph10997687231892188854.bin' '-w' '/tmp/graph10997687231892188854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10997687231892188854.bin' '-l' '-1' '-v' '-w' '/tmp/graph10997687231892188854.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:01:19] [INFO ] Decomposing Gal with order
[2024-05-28 19:01:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:01:19] [INFO ] Removed a total of 1025 redundant transitions.
[2024-05-28 19:01:19] [INFO ] Flatten gal took : 136 ms
[2024-05-28 19:01:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 21 ms.
[2024-05-28 19:01:19] [INFO ] Time to serialize gal into /tmp/LTLFireability10762853510464357101.gal : 59 ms
[2024-05-28 19:01:19] [INFO ] Time to serialize properties into /tmp/LTLFireability14271607054183934597.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/LTLFireability10762853510464357101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14271607054183934597.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(("(((i6.u49.EnablePollingE_4>=1)||(i2.i1.i0.u87.EnablePollingE_3>=1))||((i6.u72.EnablePollingE_1>=1)||(i6.u25.EnablePollingE_6>=1...384
Formula 0 simplified : X(!"(((i6.u49.EnablePollingE_4>=1)||(i2.i1.i0.u87.EnablePollingE_3>=1))||((i6.u72.EnablePollingE_1>=1)||(i6.u25.EnablePollingE_6>=1)...374
Compilation finished in 6649 ms.
Running link step : cd /tmp/ltsmin3359011419145788656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3359011419145788656;'/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' 'X(([](<>((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S06J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446900324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T06.tgz
mv PolyORBLF-PT-S06J04T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;