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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 20K Apr 11 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K Apr 11 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 17:18 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.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 374K Apr 11 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.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-S06J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716920883945

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 18:28:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 18:28:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:28:05] [INFO ] Load time of PNML (sax parser for PT used): 511 ms
[2024-05-28 18:28:05] [INFO ] Transformed 700 places.
[2024-05-28 18:28:05] [INFO ] Transformed 10740 transitions.
[2024-05-28 18:28:05] [INFO ] Parsed PT model containing 700 places and 10740 transitions and 89778 arcs in 747 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 204 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Applied a total of 6 rules in 155 ms. Remains 694 /700 variables (removed 6) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-05-28 18:28:06] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 694 cols
[2024-05-28 18:28:06] [INFO ] Computed 52 invariants in 155 ms
[2024-05-28 18:28:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 38669ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 38740ms
[2024-05-28 18:28:45] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 18:28:45] [INFO ] Invariant cache hit.
[2024-05-28 18:28:45] [INFO ] Implicit Places using invariants in 794 ms returned [64, 183, 469, 533, 669, 674]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 812 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 688/700 places, 2670/2670 transitions.
Applied a total of 0 rules in 28 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39812 ms. Remains : 688/700 places, 2670/2670 transitions.
Support contains 204 out of 688 places after structural reductions.
[2024-05-28 18:28:46] [INFO ] Flatten gal took : 234 ms
[2024-05-28 18:28:46] [INFO ] Flatten gal took : 146 ms
[2024-05-28 18:28:46] [INFO ] Input system was already deterministic with 2670 transitions.
RANDOM walk for 40001 steps (224 resets) in 1729 ms. (23 steps per ms) remains 7/26 properties
BEST_FIRST walk for 40001 steps (87 resets) in 428 ms. (93 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (100 resets) in 322 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (93 resets) in 274 ms. (145 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (90 resets) in 236 ms. (168 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (90 resets) in 254 ms. (156 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (14 resets) in 244 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (109 resets) in 255 ms. (156 steps per ms) remains 7/7 properties
[2024-05-28 18:28:48] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 688 cols
[2024-05-28 18:28:48] [INFO ] Computed 46 invariants in 78 ms
[2024-05-28 18:28:48] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 87/145 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/175 variables, 6/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 108/283 variables, 4/16 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 7 (OVERLAPS) 392/675 variables, 21/37 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/677 variables, 2/39 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/677 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 9/686 variables, 6/45 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-28 18:28:49] [INFO ] Deduced a trap composed of 94 places in 494 ms of which 34 ms to minimize.
[2024-05-28 18:28:49] [INFO ] Deduced a trap composed of 94 places in 585 ms of which 4 ms to minimize.
[2024-05-28 18:28:50] [INFO ] Deduced a trap composed of 94 places in 607 ms of which 4 ms to minimize.
[2024-05-28 18:28:50] [INFO ] Deduced a trap composed of 122 places in 564 ms of which 5 ms to minimize.
[2024-05-28 18:28:51] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 2 ms to minimize.
[2024-05-28 18:28:51] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 6/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 0/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3320/3322 variables, and 737 constraints, problems are : Problem set: 4 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 686/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 601/635 variables, 13/17 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/659 variables, 14/31 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 9 (OVERLAPS) 27/686 variables, 14/45 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 6/51 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-28 18:28:54] [INFO ] Deduced a trap composed of 94 places in 628 ms of which 4 ms to minimize.
[2024-05-28 18:28:54] [INFO ] Deduced a trap composed of 389 places in 616 ms of which 4 ms to minimize.
[2024-05-28 18:28:55] [INFO ] Deduced a trap composed of 395 places in 556 ms of which 3 ms to minimize.
[2024-05-28 18:28:56] [INFO ] Deduced a trap composed of 411 places in 680 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 4/55 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/55 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3320/3322 variables, and 741 constraints, problems are : Problem set: 5 solved, 2 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 686/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 10/10 constraints]
After SMT, in 10152ms problems are : Problem set: 5 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 688 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 688 transition count 2619
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 637 transition count 2618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 636 transition count 2618
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 104 place count 636 transition count 2533
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 274 place count 551 transition count 2533
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 277 place count 548 transition count 2530
Iterating global reduction 3 with 3 rules applied. Total rules applied 280 place count 548 transition count 2530
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 422 place count 477 transition count 2459
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 434 place count 477 transition count 2447
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 446 place count 465 transition count 2447
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 447 place count 465 transition count 2447
Applied a total of 447 rules in 449 ms. Remains 465 /688 variables (removed 223) and now considering 2447/2670 (removed 223) transitions.
Running 2441 sub problems to find dead transitions.
[2024-05-28 18:28:58] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
// Phase 1: matrix 2411 rows 465 cols
[2024-05-28 18:28:58] [INFO ] Computed 46 invariants in 91 ms
[2024-05-28 18:28:58] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-05-28 18:29:33] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-05-28 18:29:35] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/2876 variables, and 37 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2441/1100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-05-28 18:29:40] [INFO ] Deduced a trap composed of 29 places in 581 ms of which 3 ms to minimize.
[2024-05-28 18:29:41] [INFO ] Deduced a trap composed of 56 places in 482 ms of which 3 ms to minimize.
[2024-05-28 18:29:41] [INFO ] Deduced a trap composed of 64 places in 543 ms of which 3 ms to minimize.
[2024-05-28 18:29:42] [INFO ] Deduced a trap composed of 52 places in 460 ms of which 3 ms to minimize.
[2024-05-28 18:29:42] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:29:42] [INFO ] Deduced a trap composed of 56 places in 476 ms of which 3 ms to minimize.
[2024-05-28 18:29:43] [INFO ] Deduced a trap composed of 29 places in 463 ms of which 2 ms to minimize.
[2024-05-28 18:29:43] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-28 18:29:43] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 0 ms to minimize.
[2024-05-28 18:29:45] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:29:49] [INFO ] Deduced a trap composed of 51 places in 510 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/2876 variables, and 48 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1100 constraints, Known Traps: 13/13 constraints]
After SMT, in 59454ms problems are : Problem set: 0 solved, 2441 unsolved
Search for dead transitions found 0 dead transitions in 59481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59937 ms. Remains : 465/688 places, 2447/2670 transitions.
RANDOM walk for 40001 steps (449 resets) in 1115 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (135 resets) in 326 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (84 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 77390 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 2
Probabilistic random walk after 77390 steps, saw 37461 distinct states, run finished after 3005 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-28 18:30:01] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-05-28 18:30:01] [INFO ] Invariant cache hit.
[2024-05-28 18:30:01] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 360/376 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/432 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/462 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 18:30:02] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 2 ms to minimize.
[2024-05-28 18:30:02] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 2 ms to minimize.
[2024-05-28 18:30:02] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2024-05-28 18:30:02] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/463 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2411/2874 variables, 463/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2874 variables, 168/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 18:30:08] [INFO ] Deduced a trap composed of 37 places in 379 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2874 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2874 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/2876 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2876 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2876 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2876 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2876/2876 variables, and 684 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7037 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 465/465 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 360/376 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/432 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 18:30:09] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2024-05-28 18:30:09] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:30:09] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/462 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 18:30:09] [INFO ] Deduced a trap composed of 248 places in 559 ms of which 2 ms to minimize.
[2024-05-28 18:30:10] [INFO ] Deduced a trap composed of 235 places in 599 ms of which 4 ms to minimize.
[2024-05-28 18:30:11] [INFO ] Deduced a trap composed of 221 places in 598 ms of which 3 ms to minimize.
[2024-05-28 18:30:11] [INFO ] Deduced a trap composed of 243 places in 531 ms of which 5 ms to minimize.
[2024-05-28 18:30:12] [INFO ] Deduced a trap composed of 210 places in 457 ms of which 3 ms to minimize.
[2024-05-28 18:30:12] [INFO ] Deduced a trap composed of 224 places in 525 ms of which 4 ms to minimize.
[2024-05-28 18:30:13] [INFO ] Deduced a trap composed of 242 places in 586 ms of which 3 ms to minimize.
[2024-05-28 18:30:13] [INFO ] Deduced a trap composed of 229 places in 562 ms of which 3 ms to minimize.
[2024-05-28 18:30:14] [INFO ] Deduced a trap composed of 205 places in 559 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2411/2874 variables, 463/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2874 variables, 168/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2874 variables, 2/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2874 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/2876 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2876 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2876 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2876 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2876/2876 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16935 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 465/465 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 24010ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 8102 ms.
Support contains 9 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 2447/2447 transitions.
Applied a total of 0 rules in 48 ms. Remains 465 /465 variables (removed 0) and now considering 2447/2447 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 465/465 places, 2447/2447 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 2447/2447 transitions.
Applied a total of 0 rules in 56 ms. Remains 465 /465 variables (removed 0) and now considering 2447/2447 (removed 0) transitions.
[2024-05-28 18:30:33] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-05-28 18:30:33] [INFO ] Invariant cache hit.
[2024-05-28 18:30:34] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-05-28 18:30:34] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-05-28 18:30:34] [INFO ] Invariant cache hit.
[2024-05-28 18:30:36] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:30:51] [INFO ] Implicit Places using invariants and state equation in 16531 ms returned []
Implicit Place search using SMT with State Equation took 17485 ms to find 0 implicit places.
[2024-05-28 18:30:51] [INFO ] Redundant transitions in 145 ms returned []
Running 2441 sub problems to find dead transitions.
[2024-05-28 18:30:51] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-05-28 18:30:51] [INFO ] Invariant cache hit.
[2024-05-28 18:30:51] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-05-28 18:31:26] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-28 18:31:27] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/2876 variables, and 37 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2441/1100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-05-28 18:31:43] [INFO ] Deduced a trap composed of 29 places in 589 ms of which 3 ms to minimize.
[2024-05-28 18:31:44] [INFO ] Deduced a trap composed of 57 places in 675 ms of which 4 ms to minimize.
[2024-05-28 18:31:45] [INFO ] Deduced a trap composed of 57 places in 611 ms of which 2 ms to minimize.
[2024-05-28 18:31:45] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/2876 variables, and 41 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1100 constraints, Known Traps: 6/6 constraints]
After SMT, in 79127ms problems are : Problem set: 0 solved, 2441 unsolved
Search for dead transitions found 0 dead transitions in 79148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96849 ms. Remains : 465/465 places, 2447/2447 transitions.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 279 place count 547 transition count 2529
Iterating global reduction 2 with 3 rules applied. Total rules applied 282 place count 547 transition count 2529
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 426 place count 475 transition count 2457
Applied a total of 426 rules in 288 ms. Remains 475 /688 variables (removed 213) and now considering 2457/2670 (removed 213) transitions.
Running 2451 sub problems to find dead transitions.
[2024-05-28 18:32:11] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
// Phase 1: matrix 2421 rows 475 cols
[2024-05-28 18:32:11] [INFO ] Computed 46 invariants in 89 ms
[2024-05-28 18:32:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:32:45] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-28 18:32:45] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-28 18:32:47] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 38 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:32:58] [INFO ] Deduced a trap composed of 59 places in 601 ms of which 3 ms to minimize.
[2024-05-28 18:32:58] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 3 ms to minimize.
[2024-05-28 18:32:58] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 57759ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 57783ms
[2024-05-28 18:33:09] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:33:09] [INFO ] Invariant cache hit.
[2024-05-28 18:33:09] [INFO ] Implicit Places using invariants in 800 ms returned []
[2024-05-28 18:33:09] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:33:09] [INFO ] Invariant cache hit.
[2024-05-28 18:33:11] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:33:29] [INFO ] Implicit Places using invariants and state equation in 19072 ms returned []
Implicit Place search using SMT with State Equation took 19874 ms to find 0 implicit places.
[2024-05-28 18:33:29] [INFO ] Redundant transitions in 156 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-05-28 18:33:29] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:33:29] [INFO ] Invariant cache hit.
[2024-05-28 18:33:29] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:34:01] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-28 18:34:03] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:34:19] [INFO ] Deduced a trap composed of 29 places in 504 ms of which 3 ms to minimize.
[2024-05-28 18:34:19] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 1 ms to minimize.
[2024-05-28 18:34:19] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 3 ms to minimize.
[2024-05-28 18:34:20] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:34:40] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:34:40] [INFO ] Deduced a trap composed of 35 places in 474 ms of which 2 ms to minimize.
[2024-05-28 18:34:44] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-28 18:34:44] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(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 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s90 1)
(s91 0)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 1)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 4)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 10)
(s131 1)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 1)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 1)
(s157 0)
(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 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 6)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 45 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 10/10 constraints]
After SMT, in 77675ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 77694ms
Starting structural reductions in SI_LTL mode, iteration 1 : 475/688 places, 2457/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155818 ms. Remains : 475/688 places, 2457/2670 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-00
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-00 finished in 156134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0))) U p1))'
Support contains 56 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Applied a total of 12 rules in 79 ms. Remains 682 /688 variables (removed 6) and now considering 2664/2670 (removed 6) transitions.
Running 2658 sub problems to find dead transitions.
[2024-05-28 18:34:47] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 682 cols
[2024-05-28 18:34:47] [INFO ] Computed 46 invariants in 119 ms
[2024-05-28 18:34:47] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 37657ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 37686ms
[2024-05-28 18:35:24] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 18:35:24] [INFO ] Invariant cache hit.
[2024-05-28 18:35:25] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-05-28 18:35:25] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 18:35:25] [INFO ] Invariant cache hit.
[2024-05-28 18:35:29] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:35:56] [INFO ] Implicit Places using invariants and state equation in 31105 ms returned []
Implicit Place search using SMT with State Equation took 31803 ms to find 0 implicit places.
Running 2658 sub problems to find dead transitions.
[2024-05-28 18:35:56] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 18:35:56] [INFO ] Invariant cache hit.
[2024-05-28 18:35:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-05-28 18:36:35] [INFO ] Deduced a trap composed of 161 places in 387 ms of which 4 ms to minimize.
[2024-05-28 18:36:36] [INFO ] Deduced a trap composed of 123 places in 453 ms of which 5 ms to minimize.
[2024-05-28 18:36:36] [INFO ] Deduced a trap composed of 151 places in 399 ms of which 5 ms to minimize.
[2024-05-28 18:36:38] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 2 ms to minimize.
[2024-05-28 18:36:38] [INFO ] Deduced a trap composed of 319 places in 486 ms of which 5 ms to minimize.
[2024-05-28 18:36:40] [INFO ] Deduced a trap composed of 337 places in 456 ms of which 4 ms to minimize.
[2024-05-28 18:36:40] [INFO ] Deduced a trap composed of 343 places in 416 ms of which 3 ms to minimize.
[2024-05-28 18:36:41] [INFO ] Deduced a trap composed of 319 places in 369 ms of which 3 ms to minimize.
[2024-05-28 18:36:42] [INFO ] Deduced a trap composed of 41 places in 344 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/3310 variables, and 48 constraints, problems are : Problem set: 0 solved, 2658 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 22/23 constraints, Generalized P Invariants (flows): 17/23 constraints, State Equation: 0/682 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2658/1404 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-05-28 18:37:00] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 1 ms to minimize.
[2024-05-28 18:37:03] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-28 18:37:03] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 1 ms to minimize.
[2024-05-28 18:37:03] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:37:12] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/3310 variables, and 53 constraints, problems are : Problem set: 0 solved, 2658 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 22/23 constraints, Generalized P Invariants (flows): 17/23 constraints, State Equation: 0/682 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1404 constraints, Known Traps: 14/14 constraints]
After SMT, in 77380ms problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 77403ms
Starting structural reductions in LTL mode, iteration 1 : 682/688 places, 2664/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146985 ms. Remains : 682/688 places, 2664/2670 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 361 steps with 9 reset in 10 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-01 finished in 147200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 20 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 89 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 18:37:14] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-05-28 18:37:14] [INFO ] Computed 46 invariants in 111 ms
[2024-05-28 18:37:14] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 43494ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 43520ms
[2024-05-28 18:37:58] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 18:37:58] [INFO ] Invariant cache hit.
[2024-05-28 18:37:58] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-28 18:37:58] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 18:37:58] [INFO ] Invariant cache hit.
[2024-05-28 18:37:59] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:38:30] [INFO ] Performed 663/676 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 18:38:30] [INFO ] Implicit Places using invariants and state equation in 31551 ms returned []
Implicit Place search using SMT with State Equation took 32184 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-05-28 18:38:30] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 18:38:30] [INFO ] Invariant cache hit.
[2024-05-28 18:38:30] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 18:39:16] [INFO ] Deduced a trap composed of 182 places in 416 ms of which 4 ms to minimize.
[2024-05-28 18:39:17] [INFO ] Deduced a trap composed of 146 places in 360 ms of which 4 ms to minimize.
[2024-05-28 18:39:17] [INFO ] Deduced a trap composed of 145 places in 380 ms of which 6 ms to minimize.
[2024-05-28 18:39:18] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 2 ms to minimize.
[2024-05-28 18:39:19] [INFO ] Deduced a trap composed of 324 places in 477 ms of which 4 ms to minimize.
[2024-05-28 18:39:20] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 3 ms to minimize.
[2024-05-28 18:39:22] [INFO ] Deduced a trap composed of 319 places in 420 ms of which 4 ms to minimize.
[2024-05-28 18:39:22] [INFO ] Deduced a trap composed of 318 places in 397 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/3298 variables, and 47 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2652/1398 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 18:39:44] [INFO ] Deduced a trap composed of 145 places in 359 ms of which 3 ms to minimize.
[2024-05-28 18:39:50] [INFO ] Deduced a trap composed of 41 places in 334 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 9)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s132 1)
(s133 0)
(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 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 2)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 3)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 5)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 1)
(s216 0)
(s217 0)
(s218 1)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 2)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 1)
(s272 0)
(s273 0)
(s274 1)
(s275 6)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 2)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 1)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 1)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 1)
(s372 1)
(s373 1)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 2)
(s381 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/3298 variables, and 49 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1398 constraints, Known Traps: 10/10 constraints]
After SMT, in 82804ms problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 82823ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158629 ms. Remains : 676/688 places, 2658/2670 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-03 finished in 158789 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(p0)))))'
Support contains 43 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Applied a total of 0 rules in 28 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-05-28 18:39:53] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 688 cols
[2024-05-28 18:39:53] [INFO ] Computed 46 invariants in 74 ms
[2024-05-28 18:39:53] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 42158ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 42190ms
[2024-05-28 18:40:35] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 18:40:35] [INFO ] Invariant cache hit.
[2024-05-28 18:40:35] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-28 18:40:35] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 18:40:35] [INFO ] Invariant cache hit.
[2024-05-28 18:40:37] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:41:08] [INFO ] Performed 574/688 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 18:41:10] [INFO ] Implicit Places using invariants and state equation in 34727 ms returned []
Implicit Place search using SMT with State Equation took 35315 ms to find 0 implicit places.
Running 2664 sub problems to find dead transitions.
[2024-05-28 18:41:10] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 18:41:10] [INFO ] Invariant cache hit.
[2024-05-28 18:41:10] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-05-28 18:41:57] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-05-28 18:41:58] [INFO ] Deduced a trap composed of 122 places in 186 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 682/3322 variables, and 37 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2664/1410 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-05-28 18:42:16] [INFO ] Deduced a trap composed of 94 places in 716 ms of which 4 ms to minimize.
[2024-05-28 18:42:16] [INFO ] Deduced a trap composed of 94 places in 581 ms of which 4 ms to minimize.
[2024-05-28 18:42:17] [INFO ] Deduced a trap composed of 35 places in 550 ms of which 3 ms to minimize.
[2024-05-28 18:42:18] [INFO ] Deduced a trap composed of 47 places in 582 ms of which 3 ms to minimize.
[2024-05-28 18:42:18] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 1 ms to minimize.
[2024-05-28 18:42:18] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 1 ms to minimize.
[2024-05-28 18:42:19] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/3322 variables, and 44 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1410 constraints, Known Traps: 9/9 constraints]
After SMT, in 82249ms problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 82276ms
Finished structural reductions in LTL mode , in 1 iterations and 159825 ms. Remains : 688/688 places, 2670/2670 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-05
Stuttering criterion allowed to conclude after 220 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-05 finished in 160036 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((p1&&F(p2)))))'
Support contains 15 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 688 transition count 2622
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 640 transition count 2622
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 96 place count 640 transition count 2538
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 264 place count 556 transition count 2538
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 553 transition count 2535
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 553 transition count 2535
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 2 with 132 rules applied. Total rules applied 402 place count 487 transition count 2469
Applied a total of 402 rules in 263 ms. Remains 487 /688 variables (removed 201) and now considering 2469/2670 (removed 201) transitions.
Running 2463 sub problems to find dead transitions.
[2024-05-28 18:42:33] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
// Phase 1: matrix 2433 rows 487 cols
[2024-05-28 18:42:33] [INFO ] Computed 46 invariants in 56 ms
[2024-05-28 18:42:33] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-05-28 18:43:10] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 2 ms to minimize.
[2024-05-28 18:43:11] [INFO ] Deduced a trap composed of 67 places in 363 ms of which 3 ms to minimize.
[2024-05-28 18:43:13] [INFO ] Deduced a trap composed of 41 places in 273 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 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 2.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 (/ 20.0 3.0))
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 10.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.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 1.0)
(s162 0.0)
(s163 2.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 (/ 2.0 3.0))
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 (/ 5.0 3.0))
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 (/ 2.0 3.0))
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 2.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 timeout
0.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/2920 variables, and 42 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2463/1209 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-05-28 18:43:27] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 1 ms to minimize.
[2024-05-28 18:43:27] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 1 ms to minimize.
[2024-05-28 18:43:27] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-28 18:43:30] [INFO ] Deduced a trap composed of 156 places in 370 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/2920 variables, and 46 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1209 constraints, Known Traps: 7/7 constraints]
After SMT, in 60932ms problems are : Problem set: 0 solved, 2463 unsolved
Search for dead transitions found 0 dead transitions in 60963ms
[2024-05-28 18:43:34] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
[2024-05-28 18:43:34] [INFO ] Invariant cache hit.
[2024-05-28 18:43:35] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-28 18:43:35] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
[2024-05-28 18:43:35] [INFO ] Invariant cache hit.
[2024-05-28 18:43:37] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:44:06] [INFO ] Implicit Places using invariants and state equation in 31165 ms returned []
Implicit Place search using SMT with State Equation took 31891 ms to find 0 implicit places.
[2024-05-28 18:44:06] [INFO ] Redundant transitions in 71 ms returned []
Running 2463 sub problems to find dead transitions.
[2024-05-28 18:44:06] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
[2024-05-28 18:44:06] [INFO ] Invariant cache hit.
[2024-05-28 18:44:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-05-28 18:44:40] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 1 ms to minimize.
[2024-05-28 18:44:41] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 2 ms to minimize.
[2024-05-28 18:44:41] [INFO ] Deduced a trap composed of 41 places in 295 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/2920 variables, and 42 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2463/1209 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-05-28 18:44:59] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 2 ms to minimize.
[2024-05-28 18:44:59] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 1 ms to minimize.
[2024-05-28 18:44:59] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:44:59] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-05-28 18:45:00] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:45:10] [INFO ] Deduced a trap composed of 157 places in 243 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/2920 variables, and 48 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1209 constraints, Known Traps: 9/9 constraints]
After SMT, in 78891ms problems are : Problem set: 0 solved, 2463 unsolved
Search for dead transitions found 0 dead transitions in 78910ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/688 places, 2469/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172123 ms. Remains : 487/688 places, 2469/2670 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-06
Stuttering criterion allowed to conclude after 175 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-06 finished in 172257 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 1 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 279 place count 547 transition count 2529
Iterating global reduction 2 with 3 rules applied. Total rules applied 282 place count 547 transition count 2529
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 426 place count 475 transition count 2457
Applied a total of 426 rules in 155 ms. Remains 475 /688 variables (removed 213) and now considering 2457/2670 (removed 213) transitions.
Running 2451 sub problems to find dead transitions.
[2024-05-28 18:45:25] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
// Phase 1: matrix 2421 rows 475 cols
[2024-05-28 18:45:25] [INFO ] Computed 46 invariants in 98 ms
[2024-05-28 18:45:25] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:45:59] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:45:59] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-28 18:46:01] [INFO ] Deduced a trap composed of 26 places in 335 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 38 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:46:13] [INFO ] Deduced a trap composed of 59 places in 562 ms of which 3 ms to minimize.
[2024-05-28 18:46:13] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2024-05-28 18:46:13] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 58213ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 58233ms
[2024-05-28 18:46:23] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:46:23] [INFO ] Invariant cache hit.
[2024-05-28 18:46:24] [INFO ] Implicit Places using invariants in 834 ms returned []
[2024-05-28 18:46:24] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:46:24] [INFO ] Invariant cache hit.
[2024-05-28 18:46:26] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:46:53] [INFO ] Implicit Places using invariants and state equation in 28852 ms returned []
Implicit Place search using SMT with State Equation took 29687 ms to find 0 implicit places.
[2024-05-28 18:46:53] [INFO ] Redundant transitions in 150 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-05-28 18:46:53] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:46:53] [INFO ] Invariant cache hit.
[2024-05-28 18:46:53] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:47:27] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-28 18:47:29] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:47:45] [INFO ] Deduced a trap composed of 29 places in 443 ms of which 2 ms to minimize.
[2024-05-28 18:47:45] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-28 18:47:45] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-28 18:47:46] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:48:11] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-28 18:48:12] [INFO ] Deduced a trap composed of 35 places in 460 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 43 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 8/8 constraints]
After SMT, in 78707ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 78731ms
Starting structural reductions in SI_LTL mode, iteration 1 : 475/688 places, 2457/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166982 ms. Remains : 475/688 places, 2457/2670 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-08
Product exploration explored 100000 steps with 1107 reset in 984 ms.
Product exploration explored 100000 steps with 1141 reset in 758 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 p0), (NOT p0)]
RANDOM walk for 2186 steps (18 resets) in 20 ms. (104 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 2457/2457 transitions.
Applied a total of 0 rules in 45 ms. Remains 475 /475 variables (removed 0) and now considering 2457/2457 (removed 0) transitions.
Running 2451 sub problems to find dead transitions.
[2024-05-28 18:48:14] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:48:14] [INFO ] Invariant cache hit.
[2024-05-28 18:48:14] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:48:46] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-28 18:48:49] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:48:55] [INFO ] Deduced a trap composed of 29 places in 561 ms of which 3 ms to minimize.
[2024-05-28 18:48:55] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-05-28 18:48:55] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 0 ms to minimize.
[2024-05-28 18:48:56] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 57865ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 57885ms
[2024-05-28 18:49:12] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:49:12] [INFO ] Invariant cache hit.
[2024-05-28 18:49:13] [INFO ] Implicit Places using invariants in 784 ms returned []
[2024-05-28 18:49:13] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:49:13] [INFO ] Invariant cache hit.
[2024-05-28 18:49:14] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:49:43] [INFO ] Implicit Places using invariants and state equation in 29591 ms returned []
Implicit Place search using SMT with State Equation took 30377 ms to find 0 implicit places.
[2024-05-28 18:49:43] [INFO ] Redundant transitions in 106 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-05-28 18:49:43] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:49:43] [INFO ] Invariant cache hit.
[2024-05-28 18:49:43] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:50:15] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-28 18:50:18] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:50:34] [INFO ] Deduced a trap composed of 29 places in 523 ms of which 3 ms to minimize.
[2024-05-28 18:50:34] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 1 ms to minimize.
[2024-05-28 18:50:34] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:50:35] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:51:01] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-28 18:51:01] [INFO ] Deduced a trap composed of 35 places in 421 ms of which 2 ms to minimize.
SMT process timed out in 78509ms, After SMT, problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 78534ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 166966 ms. Remains : 475/475 places, 2457/2457 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1386 steps (10 resets) in 22 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1106 reset in 773 ms.
Product exploration explored 100000 steps with 1127 reset in 795 ms.
Built C files in :
/tmp/ltsmin13247597601576182529
[2024-05-28 18:51:03] [INFO ] Too many transitions (2457) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:51:03] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13247597601576182529
Running compilation step : cd /tmp/ltsmin13247597601576182529;'/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/ltsmin13247597601576182529;'/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/ltsmin13247597601576182529;'/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 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 2457/2457 transitions.
Applied a total of 0 rules in 86 ms. Remains 475 /475 variables (removed 0) and now considering 2457/2457 (removed 0) transitions.
Running 2451 sub problems to find dead transitions.
[2024-05-28 18:51:07] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:51:07] [INFO ] Invariant cache hit.
[2024-05-28 18:51:07] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:51:41] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-28 18:51:43] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:51:48] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 2 ms to minimize.
[2024-05-28 18:51:48] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 3 ms to minimize.
[2024-05-28 18:51:48] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:51:48] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
(s135 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 1)
(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 1)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s90 1)
(s91 0)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 4)
(s121 1)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 10)
(s131 1)
(s132 1)
(s133 0)
(s134 0)
(s135 0timeout
)
(s136 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 58030ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 58058ms
[2024-05-28 18:52:05] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:52:05] [INFO ] Invariant cache hit.
[2024-05-28 18:52:05] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-28 18:52:05] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:52:05] [INFO ] Invariant cache hit.
[2024-05-28 18:52:07] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:52:36] [INFO ] Implicit Places using invariants and state equation in 30808 ms returned []
Implicit Place search using SMT with State Equation took 31578 ms to find 0 implicit places.
[2024-05-28 18:52:36] [INFO ] Redundant transitions in 148 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-05-28 18:52:36] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 18:52:36] [INFO ] Invariant cache hit.
[2024-05-28 18:52:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:53:08] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-28 18:53:11] [INFO ] Deduced a trap composed of 26 places in 176 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 0.0)
(s5 9.0)
(s6 timeout
0.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:53:27] [INFO ] Deduced a trap composed of 29 places in 516 ms of which 3 ms to minimize.
[2024-05-28 18:53:28] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-28 18:53:28] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:53:28] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 18:53:51] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-28 18:53:52] [INFO ] Deduced a trap composed of 35 places in 476 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 43 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 8/8 constraints]
After SMT, in 78066ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 78101ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 167998 ms. Remains : 475/475 places, 2457/2457 transitions.
Built C files in :
/tmp/ltsmin13742802339626167973
[2024-05-28 18:53:54] [INFO ] Too many transitions (2457) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:53:55] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13742802339626167973
Running compilation step : cd /tmp/ltsmin13742802339626167973;'/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/ltsmin13742802339626167973;'/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/ltsmin13742802339626167973;'/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:53:58] [INFO ] Flatten gal took : 177 ms
[2024-05-28 18:53:58] [INFO ] Flatten gal took : 224 ms
[2024-05-28 18:53:58] [INFO ] Time to serialize gal into /tmp/LTL8272173641367227473.gal : 57 ms
[2024-05-28 18:53:58] [INFO ] Time to serialize properties into /tmp/LTL586434914008273287.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/LTL8272173641367227473.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14571833683099564000.hoa' '-atoms' '/tmp/LTL586434914008273287.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...317
Loading property file /tmp/LTL586434914008273287.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14571833683099564000.hoa
Detected timeout of ITS tools.
[2024-05-28 18:54:13] [INFO ] Flatten gal took : 109 ms
[2024-05-28 18:54:14] [INFO ] Flatten gal took : 114 ms
[2024-05-28 18:54:14] [INFO ] Time to serialize gal into /tmp/LTL14916415981846847048.gal : 20 ms
[2024-05-28 18:54:14] [INFO ] Time to serialize properties into /tmp/LTL3971207756817012629.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14916415981846847048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3971207756817012629.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(Check_Sources_E_4<1)"))))
Formula 0 simplified : FG!"(Check_Sources_E_4<1)"
Detected timeout of ITS tools.
[2024-05-28 18:54:29] [INFO ] Flatten gal took : 102 ms
[2024-05-28 18:54:29] [INFO ] Applying decomposition
[2024-05-28 18:54:29] [INFO ] Flatten gal took : 103 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/graph15048304522683566978.txt' '-o' '/tmp/graph15048304522683566978.bin' '-w' '/tmp/graph15048304522683566978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15048304522683566978.bin' '-l' '-1' '-v' '-w' '/tmp/graph15048304522683566978.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:54:29] [INFO ] Decomposing Gal with order
[2024-05-28 18:54:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:54:30] [INFO ] Removed a total of 1003 redundant transitions.
[2024-05-28 18:54:30] [INFO ] Flatten gal took : 363 ms
[2024-05-28 18:54:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 33 ms.
[2024-05-28 18:54:30] [INFO ] Time to serialize gal into /tmp/LTL6401668477588332793.gal : 32 ms
[2024-05-28 18:54:30] [INFO ] Time to serialize properties into /tmp/LTL861056318561007155.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/LTL6401668477588332793.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL861056318561007155.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...253
Read 1 LTL properties
Checking formula 0 : !((G(F("(i5.u26.Check_Sources_E_4<1)"))))
Formula 0 simplified : FG!"(i5.u26.Check_Sources_E_4<1)"
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-08 finished in 559800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 688 transition count 2617
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 635 transition count 2617
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 106 place count 635 transition count 2533
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 274 place count 551 transition count 2533
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 277 place count 548 transition count 2530
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 548 transition count 2530
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 420 place count 478 transition count 2460
Applied a total of 420 rules in 237 ms. Remains 478 /688 variables (removed 210) and now considering 2460/2670 (removed 210) transitions.
Running 2454 sub problems to find dead transitions.
[2024-05-28 18:54:45] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
// Phase 1: matrix 2424 rows 478 cols
[2024-05-28 18:54:45] [INFO ] Computed 46 invariants in 78 ms
[2024-05-28 18:54:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 18:55:19] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 5 ms to minimize.
[2024-05-28 18:55:20] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 4.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 4.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 3.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s91 1.0)
(s92 2.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 3.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 2.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 4.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 4.0)
(s131 9.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 18:55:28] [INFO ] Deduced a trap composed of 58 places in 435 ms of which 3 ms to minimize.
[2024-05-28 18:55:28] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2024-05-28 18:55:31] [INFO ] Deduced a trap composed of 30 places in 458 ms of which 2 ms to minimize.
[2024-05-28 18:55:31] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-28 18:55:31] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 42 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 7/7 constraints]
After SMT, in 58916ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 58940ms
[2024-05-28 18:55:44] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 18:55:44] [INFO ] Invariant cache hit.
[2024-05-28 18:55:45] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-28 18:55:45] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 18:55:45] [INFO ] Invariant cache hit.
[2024-05-28 18:55:46] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:56:13] [INFO ] Implicit Places using invariants and state equation in 28370 ms returned []
Implicit Place search using SMT with State Equation took 29181 ms to find 0 implicit places.
[2024-05-28 18:56:13] [INFO ] Redundant transitions in 90 ms returned []
Running 2454 sub problems to find dead transitions.
[2024-05-28 18:56:13] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 18:56:13] [INFO ] Invariant cache hit.
[2024-05-28 18:56:13] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 18:56:46] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-28 18:56:47] [INFO ] Deduced a trap composed of 26 places in 158 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 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 18:57:04] [INFO ] Deduced a trap composed of 38 places in 458 ms of which 3 ms to minimize.
[2024-05-28 18:57:04] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-28 18:57:04] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-28 18:57:14] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:57:15] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:57:15] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 18:57:26] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-28 18:57:31] [INFO ] Deduced a trap composed of 30 places in 402 ms of which 2 ms to minimize.
SMT process timed out in 78201ms, After SMT, problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 78221ms
Starting structural reductions in SI_LTL mode, iteration 1 : 478/688 places, 2460/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166693 ms. Remains : 478/688 places, 2460/2670 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-09
Product exploration explored 100000 steps with 1074 reset in 901 ms.
Product exploration explored 100000 steps with 1088 reset in 936 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 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 37 ms :[(NOT p0)]
RANDOM walk for 5564 steps (67 resets) in 98 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 2460/2460 transitions.
Applied a total of 0 rules in 63 ms. Remains 478 /478 variables (removed 0) and now considering 2460/2460 (removed 0) transitions.
Running 2454 sub problems to find dead transitions.
[2024-05-28 18:57:34] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 18:57:34] [INFO ] Invariant cache hit.
[2024-05-28 18:57:34] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 18:58:07] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-05-28 18:58:08] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 18:58:14] [INFO ] Deduced a trap composed of 38 places in 398 ms of which 2 ms to minimize.
[2024-05-28 18:58:14] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 1 ms to minimize.
[2024-05-28 18:58:14] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-28 18:58:24] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:58:24] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 0 ms to minimize.
[2024-05-28 18:58:25] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 43 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 8/8 constraints]
After SMT, in 57261ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 57284ms
[2024-05-28 18:58:31] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 18:58:31] [INFO ] Invariant cache hit.
[2024-05-28 18:58:32] [INFO ] Implicit Places using invariants in 630 ms returned []
[2024-05-28 18:58:32] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 18:58:32] [INFO ] Invariant cache hit.
[2024-05-28 18:58:33] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 18:58:58] [INFO ] Implicit Places using invariants and state equation in 26210 ms returned []
Implicit Place search using SMT with State Equation took 26841 ms to find 0 implicit places.
[2024-05-28 18:58:58] [INFO ] Redundant transitions in 82 ms returned []
Running 2454 sub problems to find dead transitions.
[2024-05-28 18:58:58] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 18:58:58] [INFO ] Invariant cache hit.
[2024-05-28 18:58:58] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 18:59:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-05-28 18:59:33] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 18:59:49] [INFO ] Deduced a trap composed of 38 places in 453 ms of which 2 ms to minimize.
[2024-05-28 18:59:49] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-28 18:59:49] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-28 19:00:02] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:00:02] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-28 19:00:02] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 19:00:16] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 44 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 9/9 constraints]
After SMT, in 78135ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 78157ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 162448 ms. Remains : 478/478 places, 2460/2460 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 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 31 ms :[(NOT p0)]
RANDOM walk for 3430 steps (35 resets) in 39 ms. (85 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1044 reset in 847 ms.
Product exploration explored 100000 steps with 1033 reset in 678 ms.
Built C files in :
/tmp/ltsmin9807749454584762124
[2024-05-28 19:00:18] [INFO ] Too many transitions (2460) to apply POR reductions. Disabling POR matrices.
[2024-05-28 19:00:18] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9807749454584762124
Running compilation step : cd /tmp/ltsmin9807749454584762124;'/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/ltsmin9807749454584762124;'/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/ltsmin9807749454584762124;'/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 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 2460/2460 transitions.
Applied a total of 0 rules in 96 ms. Remains 478 /478 variables (removed 0) and now considering 2460/2460 (removed 0) transitions.
Running 2454 sub problems to find dead transitions.
[2024-05-28 19:00:21] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 19:00:21] [INFO ] Invariant cache hit.
[2024-05-28 19:00:21] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 19:00:57] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:00:57] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 19:01:02] [INFO ] Deduced a trap composed of 38 places in 449 ms of which 3 ms to minimize.
[2024-05-28 19:01:02] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 1 ms to minimize.
[2024-05-28 19:01:02] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:01:13] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-05-28 19:01:13] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-05-28 19:01:13] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 43 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 8/8 constraints]
After SMT, in 57698ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 57726ms
[2024-05-28 19:01:19] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 19:01:19] [INFO ] Invariant cache hit.
[2024-05-28 19:01:20] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-28 19:01:20] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 19:01:20] [INFO ] Invariant cache hit.
[2024-05-28 19:01:21] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 19:01:47] [INFO ] Implicit Places using invariants and state equation in 26896 ms returned []
Implicit Place search using SMT with State Equation took 27552 ms to find 0 implicit places.
[2024-05-28 19:01:47] [INFO ] Redundant transitions in 82 ms returned []
Running 2454 sub problems to find dead transitions.
[2024-05-28 19:01:47] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 19:01:47] [INFO ] Invariant cache hit.
[2024-05-28 19:01:47] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 19:02:19] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:02:20] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 19:02:36] [INFO ] Deduced a trap composed of 38 places in 356 ms of which 2 ms to minimize.
[2024-05-28 19:02:36] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-28 19:02:36] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 0 ms to minimize.
[2024-05-28 19:02:46] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-05-28 19:02:46] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-28 19:02:46] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 19:02:59] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 44 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 9/9 constraints]
After SMT, in 77021ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 77040ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 162519 ms. Remains : 478/478 places, 2460/2460 transitions.
Built C files in :
/tmp/ltsmin5931870114382211054
[2024-05-28 19:03:04] [INFO ] Too many transitions (2460) to apply POR reductions. Disabling POR matrices.
[2024-05-28 19:03:04] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5931870114382211054
Running compilation step : cd /tmp/ltsmin5931870114382211054;'/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/ltsmin5931870114382211054;'/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/ltsmin5931870114382211054;'/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:03:07] [INFO ] Flatten gal took : 132 ms
[2024-05-28 19:03:07] [INFO ] Flatten gal took : 134 ms
[2024-05-28 19:03:07] [INFO ] Time to serialize gal into /tmp/LTL10461460500605849717.gal : 20 ms
[2024-05-28 19:03:07] [INFO ] Time to serialize properties into /tmp/LTL1597746491627343201.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/LTL10461460500605849717.gal' '-t' 'CGAL' '-hoa' '/tmp/aut233722782330321567.hoa' '-atoms' '/tmp/LTL1597746491627343201.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...317
Loading property file /tmp/LTL1597746491627343201.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut233722782330321567.hoa
Detected timeout of ITS tools.
[2024-05-28 19:03:22] [INFO ] Flatten gal took : 130 ms
[2024-05-28 19:03:23] [INFO ] Flatten gal took : 133 ms
[2024-05-28 19:03:23] [INFO ] Time to serialize gal into /tmp/LTL12203928811585254792.gal : 21 ms
[2024-05-28 19:03:23] [INFO ] Time to serialize properties into /tmp/LTL17377348452598890272.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12203928811585254792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17377348452598890272.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(P_1155_4<=NotifyEventEndOfCheckSourcesB_1)"))))
Formula 0 simplified : GF!"(P_1155_4<=NotifyEventEndOfCheckSourcesB_1)"
Detected timeout of ITS tools.
[2024-05-28 19:03:38] [INFO ] Flatten gal took : 89 ms
[2024-05-28 19:03:38] [INFO ] Applying decomposition
[2024-05-28 19:03:38] [INFO ] Flatten gal took : 90 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/graph5494990501411329720.txt' '-o' '/tmp/graph5494990501411329720.bin' '-w' '/tmp/graph5494990501411329720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5494990501411329720.bin' '-l' '-1' '-v' '-w' '/tmp/graph5494990501411329720.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:03:38] [INFO ] Decomposing Gal with order
[2024-05-28 19:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:03:38] [INFO ] Removed a total of 966 redundant transitions.
[2024-05-28 19:03:38] [INFO ] Flatten gal took : 237 ms
[2024-05-28 19:03:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 324 labels/synchronizations in 37 ms.
[2024-05-28 19:03:39] [INFO ] Time to serialize gal into /tmp/LTL315304601593339438.gal : 32 ms
[2024-05-28 19:03:39] [INFO ] Time to serialize properties into /tmp/LTL17299322394375909058.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL315304601593339438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17299322394375909058.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("(gu5.P_1155_4<=gu5.NotifyEventEndOfCheckSourcesB_1)"))))
Formula 0 simplified : GF!"(gu5.P_1155_4<=gu5.NotifyEventEndOfCheckSourcesB_1)"
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-09 finished in 549223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 688 transition count 2623
Reduce places removed 47 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 100 place count 641 transition count 2617
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 635 transition count 2617
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 106 place count 635 transition count 2533
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 274 place count 551 transition count 2533
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 278 place count 547 transition count 2529
Iterating global reduction 3 with 4 rules applied. Total rules applied 282 place count 547 transition count 2529
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 424 place count 476 transition count 2458
Applied a total of 424 rules in 264 ms. Remains 476 /688 variables (removed 212) and now considering 2458/2670 (removed 212) transitions.
Running 2452 sub problems to find dead transitions.
[2024-05-28 19:03:54] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
// Phase 1: matrix 2422 rows 476 cols
[2024-05-28 19:03:54] [INFO ] Computed 46 invariants in 88 ms
[2024-05-28 19:03:54] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
[2024-05-28 19:04:28] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-28 19:04:28] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-28 19:04:28] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-28 19:04:29] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:04:29] [INFO ] Deduced a trap composed of 28 places in 137 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 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 4.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 4.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/2898 variables, and 40 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2452/1198 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/2898 variables, and 40 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1198 constraints, Known Traps: 5/5 constraints]
After SMT, in 57821ms problems are : Problem set: 0 solved, 2452 unsolved
Search for dead transitions found 0 dead transitions in 57845ms
[2024-05-28 19:04:52] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
[2024-05-28 19:04:52] [INFO ] Invariant cache hit.
[2024-05-28 19:04:53] [INFO ] Implicit Places using invariants in 636 ms returned []
[2024-05-28 19:04:53] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
[2024-05-28 19:04:53] [INFO ] Invariant cache hit.
[2024-05-28 19:04:54] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 19:05:13] [INFO ] Implicit Places using invariants and state equation in 20422 ms returned []
Implicit Place search using SMT with State Equation took 21059 ms to find 0 implicit places.
[2024-05-28 19:05:13] [INFO ] Redundant transitions in 77 ms returned []
Running 2452 sub problems to find dead transitions.
[2024-05-28 19:05:13] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
[2024-05-28 19:05:13] [INFO ] Invariant cache hit.
[2024-05-28 19:05:13] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
[2024-05-28 19:05:46] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-28 19:05:46] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-28 19:05:47] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/2898 variables, and 38 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2452/1198 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
[2024-05-28 19:06:07] [INFO ] Deduced a trap composed of 59 places in 543 ms of which 3 ms to minimize.
[2024-05-28 19:06:07] [INFO ] Deduced a trap composed of 42 places in 606 ms of which 3 ms to minimize.
[2024-05-28 19:06:07] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-05-28 19:06:08] [INFO ] Deduced a trap composed of 35 places in 579 ms of which 6 ms to minimize.
[2024-05-28 19:06:09] [INFO ] Deduced a trap composed of 29 places in 566 ms of which 3 ms to minimize.
[2024-05-28 19:06:09] [INFO ] Deduced a trap composed of 29 places in 549 ms of which 3 ms to minimize.
[2024-05-28 19:06:09] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:06:09] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/2898 variables, and 46 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1198 constraints, Known Traps: 11/11 constraints]
After SMT, in 77354ms problems are : Problem set: 0 solved, 2452 unsolved
Search for dead transitions found 0 dead transitions in 77375ms
Starting structural reductions in SI_LTL mode, iteration 1 : 476/688 places, 2458/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156639 ms. Remains : 476/688 places, 2458/2670 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-10
Stuttering criterion allowed to conclude after 368 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-10 finished in 156769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||(p1&&F(p0))))'
Support contains 4 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 688 transition count 2621
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 639 transition count 2620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 638 transition count 2620
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 100 place count 638 transition count 2534
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 272 place count 552 transition count 2534
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 275 place count 549 transition count 2531
Iterating global reduction 3 with 3 rules applied. Total rules applied 278 place count 549 transition count 2531
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 406 place count 485 transition count 2467
Applied a total of 406 rules in 157 ms. Remains 485 /688 variables (removed 203) and now considering 2467/2670 (removed 203) transitions.
Running 2461 sub problems to find dead transitions.
[2024-05-28 19:06:31] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
// Phase 1: matrix 2431 rows 485 cols
[2024-05-28 19:06:31] [INFO ] Computed 46 invariants in 55 ms
[2024-05-28 19:06:31] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:07:11] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-05-28 19:07:12] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 37 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:07:16] [INFO ] Deduced a trap composed of 29 places in 447 ms of which 3 ms to minimize.
[2024-05-28 19:07:16] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:07:16] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2024-05-28 19:07:16] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2024-05-28 19:07:16] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:07:20] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2024-05-28 19:07:21] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 0 ms to minimize.
[2024-05-28 19:07:23] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 3)
(s124 1)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 8)
(s134 1)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(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 1)
(s180 0)
(s181 1)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 6)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 3)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 1)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 9)
(s324 1)
(s325 0)
(s326 0)
(s327 2)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 1)
(s333 1)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 4)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s423 0)
(s424 0)
(s425 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 45 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 10/10 constraints]
After SMT, in 62128ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 62147ms
[2024-05-28 19:07:33] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:07:33] [INFO ] Invariant cache hit.
[2024-05-28 19:07:34] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-05-28 19:07:34] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:07:34] [INFO ] Invariant cache hit.
[2024-05-28 19:07:36] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 19:08:06] [INFO ] Performed 482/485 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 19:08:06] [INFO ] Implicit Places using invariants and state equation in 32431 ms returned []
Implicit Place search using SMT with State Equation took 33071 ms to find 0 implicit places.
[2024-05-28 19:08:06] [INFO ] Redundant transitions in 72 ms returned []
Running 2461 sub problems to find dead transitions.
[2024-05-28 19:08:06] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:08:06] [INFO ] Invariant cache hit.
[2024-05-28 19:08:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:08:40] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-28 19:08:40] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-28 19:08:40] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-28 19:08:41] [INFO ] Deduced a trap composed of 35 places in 151 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 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 4.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 4.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 3.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s91 1.0)
(s92 2.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 3.0)
(s101 (/ 1.0 2.0))
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 39 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:08:58] [INFO ] Deduced a trap composed of 60 places in 592 ms of which 3 ms to minimize.
[2024-05-28 19:08:59] [INFO ] Deduced a trap composed of 58 places in 542 ms of which 2 ms to minimize.
[2024-05-28 19:08:59] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:08:59] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-05-28 19:09:00] [INFO ] Deduced a trap composed of 29 places in 462 ms of which 2 ms to minimize.
[2024-05-28 19:09:00] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-28 19:09:12] [INFO ] Deduced a trap composed of 35 places in 477 ms of which 3 ms to minimize.
[2024-05-28 19:09:12] [INFO ] Deduced a trap composed of 54 places in 401 ms of which 3 ms to minimize.
[2024-05-28 19:09:12] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 48 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 13/13 constraints]
After SMT, in 77519ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 77539ms
Starting structural reductions in SI_LTL mode, iteration 1 : 485/688 places, 2467/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173002 ms. Remains : 485/688 places, 2467/2670 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-11
Product exploration explored 100000 steps with 1946 reset in 809 ms.
Product exploration explored 100000 steps with 1928 reset in 789 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 (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (396 resets) in 573 ms. (69 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (39 resets) in 826 ms. (48 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (59 resets) in 575 ms. (69 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (50 resets) in 535 ms. (74 steps per ms) remains 3/3 properties
[2024-05-28 19:09:27] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:09:27] [INFO ] Invariant cache hit.
[2024-05-28 19:09:27] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 19:09:27] [INFO ] Deduced a trap composed of 35 places in 375 ms of which 3 ms to minimize.
[2024-05-28 19:09:27] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 1 ms to minimize.
[2024-05-28 19:09:27] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-05-28 19:09:28] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-28 19:09:28] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/2916 variables, and 533 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3993 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 19:09:31] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 1/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/2916 variables, and 534 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3969 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 7981ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 485 transition count 2455
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 473 transition count 2455
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 473 transition count 2455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 472 transition count 2454
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 472 transition count 2454
Applied a total of 28 rules in 222 ms. Remains 472 /485 variables (removed 13) and now considering 2454/2467 (removed 13) transitions.
Running 2448 sub problems to find dead transitions.
[2024-05-28 19:09:35] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-05-28 19:09:35] [INFO ] Computed 46 invariants in 49 ms
[2024-05-28 19:09:35] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 19:10:12] [INFO ] Deduced a trap composed of 147 places in 369 ms of which 3 ms to minimize.
[2024-05-28 19:10:12] [INFO ] Deduced a trap composed of 139 places in 330 ms of which 2 ms to minimize.
[2024-05-28 19:10:13] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 1 ms to minimize.
[2024-05-28 19:10:13] [INFO ] Deduced a trap composed of 57 places in 387 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 43 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1107 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 19:10:17] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:10:17] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 2 ms to minimize.
[2024-05-28 19:10:19] [INFO ] Deduced a trap composed of 158 places in 372 ms of which 2 ms to minimize.
[2024-05-28 19:10:19] [INFO ] Deduced a trap composed of 157 places in 310 ms of which 2 ms to minimize.
[2024-05-28 19:10:20] [INFO ] Deduced a trap composed of 142 places in 296 ms of which 2 ms to minimize.
[2024-05-28 19:10:21] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:10:21] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2024-05-28 19:10:21] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:10:23] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-05-28 19:10:26] [INFO ] Deduced a trap composed of 41 places in 354 ms of which 3 ms to minimize.
[2024-05-28 19:10:27] [INFO ] Deduced a trap composed of 35 places in 348 ms of which 2 ms to minimize.
[2024-05-28 19:10:27] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 2 ms to minimize.
[2024-05-28 19:10:30] [INFO ] Deduced a trap composed of 167 places in 333 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 56 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1107 constraints, Known Traps: 17/17 constraints]
After SMT, in 59017ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 59040ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59267 ms. Remains : 472/485 places, 2454/2467 transitions.
RANDOM walk for 40000 steps (379 resets) in 1858 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (50 resets) in 574 ms. (69 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (67 resets) in 493 ms. (80 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 87922 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 2
Probabilistic random walk after 87922 steps, saw 41456 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-28 19:10:38] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 19:10:38] [INFO ] Invariant cache hit.
[2024-05-28 19:10:38] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:10:38] [INFO ] Deduced a trap composed of 34 places in 465 ms of which 4 ms to minimize.
[2024-05-28 19:10:39] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 2 ms to minimize.
[2024-05-28 19:10:39] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 1 ms to minimize.
[2024-05-28 19:10:39] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2024-05-28 19:10:39] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/470 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2418/2888 variables, 470/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2888 variables, 168/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2888 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/2890 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2890 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2890/2890 variables, and 691 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8119 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 472/472 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:10:46] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/470 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2418/2888 variables, 470/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2888 variables, 168/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2888 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2888 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/2890 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2890 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2890 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2890 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2890/2890 variables, and 694 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9528 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 472/472 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 17661ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 367 ms.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 72 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 472/472 places, 2454/2454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 59 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
[2024-05-28 19:10:56] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 19:10:56] [INFO ] Invariant cache hit.
[2024-05-28 19:10:57] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-28 19:10:57] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 19:10:57] [INFO ] Invariant cache hit.
[2024-05-28 19:10:59] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 19:11:18] [INFO ] Implicit Places using invariants and state equation in 21245 ms returned []
Implicit Place search using SMT with State Equation took 22039 ms to find 0 implicit places.
[2024-05-28 19:11:18] [INFO ] Redundant transitions in 127 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-05-28 19:11:18] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 19:11:18] [INFO ] Invariant cache hit.
[2024-05-28 19:11:18] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 19:11:54] [INFO ] Deduced a trap composed of 147 places in 345 ms of which 2 ms to minimize.
[2024-05-28 19:11:54] [INFO ] Deduced a trap composed of 139 places in 325 ms of which 2 ms to minimize.
[2024-05-28 19:11:55] [INFO ] Deduced a trap composed of 39 places in 259 ms of which 1 ms to minimize.
[2024-05-28 19:11:55] [INFO ] Deduced a trap composed of 57 places in 411 ms of which 2 ms to minimize.
[2024-05-28 19:11:57] [INFO ] Deduced a trap composed of 149 places in 382 ms of which 3 ms to minimize.
[2024-05-28 19:11:57] [INFO ] Deduced a trap composed of 161 places in 360 ms of which 2 ms to minimize.
[2024-05-28 19:11:58] [INFO ] Deduced a trap composed of 158 places in 347 ms of which 2 ms to minimize.
[2024-05-28 19:11:58] [INFO ] Deduced a trap composed of 148 places in 293 ms of which 3 ms to minimize.
[2024-05-28 19:11:59] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2024-05-28 19:12:02] [INFO ] Deduced a trap composed of 56 places in 232 ms of which 2 ms to minimize.
[2024-05-28 19:12:07] [INFO ] Deduced a trap composed of 161 places in 260 ms of which 3 ms to minimize.
[2024-05-28 19:12:07] [INFO ] Deduced a trap composed of 152 places in 264 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 51 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1107 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 19:12:11] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:12:11] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:12:12] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 2 ms to minimize.
[2024-05-28 19:12:13] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 2 ms to minimize.
[2024-05-28 19:12:13] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 1 ms to minimize.
[2024-05-28 19:12:14] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 0 ms to minimize.
[2024-05-28 19:12:14] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:12:16] [INFO ] Deduced a trap composed of 159 places in 289 ms of which 3 ms to minimize.
[2024-05-28 19:12:16] [INFO ] Deduced a trap composed of 155 places in 280 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 60 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1107 constraints, Known Traps: 21/21 constraints]
After SMT, in 79519ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 79543ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101780 ms. Remains : 472/472 places, 2454/2454 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 179 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Applied a total of 0 rules in 55 ms. Remains 485 /485 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
Running 2461 sub problems to find dead transitions.
[2024-05-28 19:12:39] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
// Phase 1: matrix 2431 rows 485 cols
[2024-05-28 19:12:39] [INFO ] Computed 46 invariants in 55 ms
[2024-05-28 19:12:39] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:13:14] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 37 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:13:19] [INFO ] Deduced a trap composed of 29 places in 439 ms of which 3 ms to minimize.
[2024-05-28 19:13:19] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:13:19] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2024-05-28 19:13:19] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:13:20] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-28 19:13:24] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-28 19:13:24] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 45 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 10/10 constraints]
After SMT, in 58109ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 58132ms
[2024-05-28 19:13:37] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:13:37] [INFO ] Invariant cache hit.
[2024-05-28 19:13:37] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-28 19:13:37] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:13:37] [INFO ] Invariant cache hit.
[2024-05-28 19:13:39] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 19:14:09] [INFO ] Performed 461/485 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 19:14:10] [INFO ] Implicit Places using invariants and state equation in 33020 ms returned []
Implicit Place search using SMT with State Equation took 33574 ms to find 0 implicit places.
[2024-05-28 19:14:10] [INFO ] Redundant transitions in 145 ms returned []
Running 2461 sub problems to find dead transitions.
[2024-05-28 19:14:10] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:14:10] [INFO ] Invariant cache hit.
[2024-05-28 19:14:10] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:14:45] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:14:45] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:14:45] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:14:46] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 4.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 39 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:15:02] [INFO ] Deduced a trap composed of 60 places in 420 ms of which 2 ms to minimize.
[2024-05-28 19:15:03] [INFO ] Deduced a trap composed of 58 places in 417 ms of which 2 ms to minimize.
[2024-05-28 19:15:03] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-28 19:15:03] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:15:04] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 2 ms to minimize.
[2024-05-28 19:15:04] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:15:13] [INFO ] Deduced a trap composed of 35 places in 321 ms of which 2 ms to minimize.
[2024-05-28 19:15:14] [INFO ] Deduced a trap composed of 54 places in 313 ms of which 2 ms to minimize.
[2024-05-28 19:15:14] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 48 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 13/13 constraints]
After SMT, in 78095ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 78118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 170046 ms. Remains : 485/485 places, 2467/2467 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 101 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (391 resets) in 1068 ms. (37 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (39 resets) in 295 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (49 resets) in 431 ms. (92 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (38 resets) in 437 ms. (91 steps per ms) remains 3/3 properties
[2024-05-28 19:15:29] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:15:29] [INFO ] Invariant cache hit.
[2024-05-28 19:15:29] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 19:15:30] [INFO ] Deduced a trap composed of 35 places in 386 ms of which 3 ms to minimize.
[2024-05-28 19:15:30] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 1 ms to minimize.
[2024-05-28 19:15:30] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 1 ms to minimize.
[2024-05-28 19:15:30] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-28 19:15:30] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/2916 variables, and 533 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4082 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 19:15:34] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 1/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/2916 variables, and 534 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3906 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 8004ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 93 ms.
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 485 transition count 2455
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 473 transition count 2455
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 473 transition count 2455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 472 transition count 2454
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 472 transition count 2454
Applied a total of 28 rules in 205 ms. Remains 472 /485 variables (removed 13) and now considering 2454/2467 (removed 13) transitions.
Running 2448 sub problems to find dead transitions.
[2024-05-28 19:15:38] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-05-28 19:15:38] [INFO ] Computed 46 invariants in 68 ms
[2024-05-28 19:15:38] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 19:16:14] [INFO ] Deduced a trap composed of 147 places in 313 ms of which 2 ms to minimize.
[2024-05-28 19:16:15] [INFO ] Deduced a trap composed of 139 places in 335 ms of which 2 ms to minimize.
[2024-05-28 19:16:15] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 1 ms to minimize.
[2024-05-28 19:16:16] [INFO ] Deduced a trap composed of 57 places in 346 ms of which 2 ms to minimize.
[2024-05-28 19:16:17] [INFO ] Deduced a trap composed of 148 places in 311 ms of which 2 ms to minimize.
[2024-05-28 19:16:17] [INFO ] Deduced a trap composed of 157 places in 266 ms of which 2 ms to minimize.
[2024-05-28 19:16:18] [INFO ] Deduced a trap composed of 159 places in 280 ms of which 2 ms to minimize.
[2024-05-28 19:16:18] [INFO ] Deduced a trap composed of 153 places in 265 ms of which 2 ms to minimize.
SMT process timed out in 40297ms, After SMT, problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 40320ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40529 ms. Remains : 472/485 places, 2454/2467 transitions.
RANDOM walk for 40000 steps (411 resets) in 1186 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (55 resets) in 397 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (46 resets) in 369 ms. (108 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 93347 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 2
Probabilistic random walk after 93347 steps, saw 44103 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-28 19:16:22] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 19:16:22] [INFO ] Invariant cache hit.
[2024-05-28 19:16:22] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:16:22] [INFO ] Deduced a trap composed of 34 places in 534 ms of which 4 ms to minimize.
[2024-05-28 19:16:23] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 1 ms to minimize.
[2024-05-28 19:16:23] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 1 ms to minimize.
[2024-05-28 19:16:23] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-28 19:16:23] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/470 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2418/2888 variables, 470/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2888 variables, 168/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2888 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/2890 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2890 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2890/2890 variables, and 691 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7952 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 472/472 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:16:30] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/470 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2418/2888 variables, 470/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2888 variables, 168/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2888 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2888 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/2890 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2890 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2890 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2890 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2890/2890 variables, and 694 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8928 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 472/472 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 16909ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 198 ms.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 44 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 472/472 places, 2454/2454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 44 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
[2024-05-28 19:16:39] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 19:16:39] [INFO ] Invariant cache hit.
[2024-05-28 19:16:40] [INFO ] Implicit Places using invariants in 808 ms returned []
[2024-05-28 19:16:40] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 19:16:40] [INFO ] Invariant cache hit.
[2024-05-28 19:16:42] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 19:17:02] [INFO ] Implicit Places using invariants and state equation in 22134 ms returned []
Implicit Place search using SMT with State Equation took 22943 ms to find 0 implicit places.
[2024-05-28 19:17:02] [INFO ] Redundant transitions in 66 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-05-28 19:17:02] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 19:17:02] [INFO ] Invariant cache hit.
[2024-05-28 19:17:02] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 19:17:36] [INFO ] Deduced a trap composed of 147 places in 453 ms of which 3 ms to minimize.
[2024-05-28 19:17:37] [INFO ] Deduced a trap composed of 139 places in 323 ms of which 3 ms to minimize.
[2024-05-28 19:17:37] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 1 ms to minimize.
[2024-05-28 19:17:38] [INFO ] Deduced a trap composed of 57 places in 390 ms of which 2 ms to minimize.
[2024-05-28 19:17:39] [INFO ] Deduced a trap composed of 149 places in 254 ms of which 2 ms to minimize.
[2024-05-28 19:17:39] [INFO ] Deduced a trap composed of 161 places in 264 ms of which 2 ms to minimize.
[2024-05-28 19:17:40] [INFO ] Deduced a trap composed of 158 places in 314 ms of which 2 ms to minimize.
[2024-05-28 19:17:41] [INFO ] Deduced a trap composed of 148 places in 257 ms of which 2 ms to minimize.
[2024-05-28 19:17:41] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 2 ms to minimize.
[2024-05-28 19:17:49] [INFO ] Deduced a trap composed of 161 places in 313 ms of which 3 ms to minimize.
[2024-05-28 19:17:50] [INFO ] Deduced a trap composed of 152 places in 258 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 466/2890 variables, and 51 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1107 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 19:17:55] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:17:55] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 0 ms to minimize.
[2024-05-28 19:17:56] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 2 ms to minimize.
[2024-05-28 19:17:56] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 2 ms to minimize.
[2024-05-28 19:17:57] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
[2024-05-28 19:17:57] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:17:57] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 0 ms to minimize.
[2024-05-28 19:17:59] [INFO ] Deduced a trap composed of 159 places in 300 ms of which 3 ms to minimize.
[2024-05-28 19:18:00] [INFO ] Deduced a trap composed of 155 places in 289 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 60 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1107 constraints, Known Traps: 21/21 constraints]
After SMT, in 79603ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 79630ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102694 ms. Remains : 472/472 places, 2454/2454 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 259 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1903 reset in 780 ms.
Product exploration explored 100000 steps with 1962 reset in 855 ms.
Built C files in :
/tmp/ltsmin17771167733827704720
[2024-05-28 19:18:24] [INFO ] Too many transitions (2467) to apply POR reductions. Disabling POR matrices.
[2024-05-28 19:18:24] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17771167733827704720
Running compilation step : cd /tmp/ltsmin17771167733827704720;'/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/ltsmin17771167733827704720;'/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/ltsmin17771167733827704720;'/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 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Applied a total of 0 rules in 80 ms. Remains 485 /485 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
Running 2461 sub problems to find dead transitions.
[2024-05-28 19:18:27] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
// Phase 1: matrix 2431 rows 485 cols
[2024-05-28 19:18:27] [INFO ] Computed 46 invariants in 72 ms
[2024-05-28 19:18:27] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:19:05] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:19:07] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 37 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:19:10] [INFO ] Deduced a trap composed of 29 places in 419 ms of which 2 ms to minimize.
[2024-05-28 19:19:10] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:19:10] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2024-05-28 19:19:10] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 0 ms to minimize.
[2024-05-28 19:19:10] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:19:15] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 0 ms to minimize.
[2024-05-28 19:19:15] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 0 ms to minimize.
[2024-05-28 19:19:18] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 45 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 10/10 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
[2024-05-28 19:19:27] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:19:27] [INFO ] Invariant cache hit.
[2024-05-28 19:19:28] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-05-28 19:19:28] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:19:28] [INFO ] Invariant cache hit.
[2024-05-28 19:19:30] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 19:20:00] [INFO ] Performed 455/485 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 19:20:01] [INFO ] Implicit Places using invariants and state equation in 33079 ms returned []
Implicit Place search using SMT with State Equation took 33705 ms to find 0 implicit places.
[2024-05-28 19:20:01] [INFO ] Redundant transitions in 146 ms returned []
Running 2461 sub problems to find dead transitions.
[2024-05-28 19:20:01] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 19:20:01] [INFO ] Invariant cache hit.
[2024-05-28 19:20:01] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:20:39] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-05-28 19:20:39] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-28 19:20:39] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-28 19:20:40] [INFO ] Deduced a trap composed of 35 places in 160 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 479/2916 variables, and 39 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 19:20:54] [INFO ] Deduced a trap composed of 60 places in 505 ms of which 3 ms to minimize.
[2024-05-28 19:20:55] [INFO ] Deduced a trap composed of 58 places in 403 ms of which 2 ms to minimize.
[2024-05-28 19:20:55] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 1 ms to minimize.
[2024-05-28 19:20:55] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:20:56] [INFO ] Deduced a trap composed of 29 places in 376 ms of which 2 ms to minimize.
[2024-05-28 19:20:56] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:21:08] [INFO ] Deduced a trap composed of 35 places in 444 ms of which 3 ms to minimize.
[2024-05-28 19:21:09] [INFO ] Deduced a trap composed of 54 places in 345 ms of which 2 ms to minimize.
[2024-05-28 19:21:09] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 3)
(s39 0)
(s40 1)
(s41 0)
(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 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 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 48 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 13/13 constraints]
After SMT, in 79063ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 79087ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 173150 ms. Remains : 485/485 places, 2467/2467 transitions.
Built C files in :
/tmp/ltsmin995927895617752391
[2024-05-28 19:21:20] [INFO ] Too many transitions (2467) to apply POR reductions. Disabling POR matrices.
[2024-05-28 19:21:20] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin995927895617752391
Running compilation step : cd /tmp/ltsmin995927895617752391;'/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/ltsmin995927895617752391;'/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/ltsmin995927895617752391;'/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:21:24] [INFO ] Flatten gal took : 158 ms
[2024-05-28 19:21:24] [INFO ] Flatten gal took : 160 ms
[2024-05-28 19:21:24] [INFO ] Time to serialize gal into /tmp/LTL12435267405502704017.gal : 16 ms
[2024-05-28 19:21:24] [INFO ] Time to serialize properties into /tmp/LTL4930841026898443952.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/LTL12435267405502704017.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1663380321613130898.hoa' '-atoms' '/tmp/LTL4930841026898443952.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/LTL4930841026898443952.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1663380321613130898.hoa
Detected timeout of ITS tools.
[2024-05-28 19:21:39] [INFO ] Flatten gal took : 136 ms
[2024-05-28 19:21:39] [INFO ] Flatten gal took : 143 ms
[2024-05-28 19:21:39] [INFO ] Time to serialize gal into /tmp/LTL12682314504874606378.gal : 22 ms
[2024-05-28 19:21:39] [INFO ] Time to serialize properties into /tmp/LTL1910527101040136871.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/LTL12682314504874606378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1910527101040136871.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G("(ScheduleTaskB_4>EnablePollingB_2)"))||(G("(cIdleTasks>NotifyEventSourceAddedE_1)")))||(F("(ScheduleTaskB_4>EnablePollingB_2)"...159
Formula 0 simplified : F!"(cIdleTasks>NotifyEventSourceAddedE_1)" & G!"(ScheduleTaskB_4>EnablePollingB_2)"
Detected timeout of ITS tools.
[2024-05-28 19:21:54] [INFO ] Flatten gal took : 164 ms
[2024-05-28 19:21:54] [INFO ] Applying decomposition
[2024-05-28 19:21:55] [INFO ] Flatten gal took : 165 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/graph3235029818180023646.txt' '-o' '/tmp/graph3235029818180023646.bin' '-w' '/tmp/graph3235029818180023646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3235029818180023646.bin' '-l' '-1' '-v' '-w' '/tmp/graph3235029818180023646.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:21:55] [INFO ] Decomposing Gal with order
[2024-05-28 19:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:21:55] [INFO ] Removed a total of 1040 redundant transitions.
[2024-05-28 19:21:55] [INFO ] Flatten gal took : 174 ms
[2024-05-28 19:21:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 16 ms.
[2024-05-28 19:21:55] [INFO ] Time to serialize gal into /tmp/LTL15213712993839608711.gal : 19 ms
[2024-05-28 19:21:55] [INFO ] Time to serialize properties into /tmp/LTL161953460394476319.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15213712993839608711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL161953460394476319.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((G("(gu24.ScheduleTaskB_4>gu24.EnablePollingB_2)"))||(G("(gu10.cIdleTasks>gu10.NotifyEventSourceAddedE_1)")))||(F("(gu24.ScheduleT...189
Formula 0 simplified : F!"(gu10.cIdleTasks>gu10.NotifyEventSourceAddedE_1)" & G!"(gu24.ScheduleTaskB_4>gu24.EnablePollingB_2)"
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-11 finished in 939546 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(G((p0&&X(p1)))))))'
Support contains 4 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 100 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 19:22:10] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-05-28 19:22:11] [INFO ] Computed 46 invariants in 108 ms
[2024-05-28 19:22:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40297ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 40322ms
[2024-05-28 19:22:51] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 19:22:51] [INFO ] Invariant cache hit.
[2024-05-28 19:22:51] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-28 19:22:51] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 19:22:51] [INFO ] Invariant cache hit.
[2024-05-28 19:22:53] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 19:23:15] [INFO ] Implicit Places using invariants and state equation in 23285 ms returned []
Implicit Place search using SMT with State Equation took 23999 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-05-28 19:23:15] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 19:23:15] [INFO ] Invariant cache hit.
[2024-05-28 19:23:15] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 19:24:00] [INFO ] Deduced a trap composed of 182 places in 268 ms of which 3 ms to minimize.
[2024-05-28 19:24:01] [INFO ] Deduced a trap composed of 146 places in 278 ms of which 3 ms to minimize.
[2024-05-28 19:24:01] [INFO ] Deduced a trap composed of 145 places in 285 ms of which 2 ms to minimize.
[2024-05-28 19:24:02] [INFO ] Deduced a trap composed of 15 places in 319 ms of which 2 ms to minimize.
[2024-05-28 19:24:03] [INFO ] Deduced a trap composed of 324 places in 489 ms of which 4 ms to minimize.
[2024-05-28 19:24:04] [INFO ] Deduced a trap composed of 3 places in 537 ms of which 4 ms to minimize.
SMT process timed out in 48965ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 48987ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113417 ms. Remains : 676/688 places, 2658/2670 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 83 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-12 finished in 113634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||(p1&&F(p0))))'
[2024-05-28 19:24:05] [INFO ] Flatten gal took : 153 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5354326952095387637
[2024-05-28 19:24:05] [INFO ] Too many transitions (2670) to apply POR reductions. Disabling POR matrices.
[2024-05-28 19:24:05] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5354326952095387637
Running compilation step : cd /tmp/ltsmin5354326952095387637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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:24:05] [INFO ] Applying decomposition
[2024-05-28 19:24:05] [INFO ] Flatten gal took : 139 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/graph17076471327300068019.txt' '-o' '/tmp/graph17076471327300068019.bin' '-w' '/tmp/graph17076471327300068019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17076471327300068019.bin' '-l' '-1' '-v' '-w' '/tmp/graph17076471327300068019.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:24:05] [INFO ] Decomposing Gal with order
[2024-05-28 19:24:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:24:05] [INFO ] Removed a total of 1165 redundant transitions.
[2024-05-28 19:24:05] [INFO ] Flatten gal took : 201 ms
[2024-05-28 19:24:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 17 ms.
[2024-05-28 19:24:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality13325417800038036222.gal : 18 ms
[2024-05-28 19:24:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality1480576394242095022.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13325417800038036222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1480576394242095022.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...298
Read 3 LTL properties
Checking formula 0 : !((G(F("(gi2.gi1.gu81.Check_Sources_E_4<1)"))))
Formula 0 simplified : FG!"(gi2.gi1.gu81.Check_Sources_E_4<1)"
Compilation finished in 7850 ms.
Running link step : cd /tmp/ltsmin5354326952095387637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin5354326952095387637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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