Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r004-smll-171620117700059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ASLink-PT-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117700059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Jun 12 13:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 12 13:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 436K May 18 16:42 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 ASLink-PT-04a-LTLCardinality-00
FORMULA_NAME ASLink-PT-04a-LTLCardinality-01
FORMULA_NAME ASLink-PT-04a-LTLCardinality-02
FORMULA_NAME ASLink-PT-04a-LTLCardinality-03
FORMULA_NAME ASLink-PT-04a-LTLCardinality-04
FORMULA_NAME ASLink-PT-04a-LTLCardinality-05
FORMULA_NAME ASLink-PT-04a-LTLCardinality-06
FORMULA_NAME ASLink-PT-04a-LTLCardinality-07
FORMULA_NAME ASLink-PT-04a-LTLCardinality-08
FORMULA_NAME ASLink-PT-04a-LTLCardinality-09
FORMULA_NAME ASLink-PT-04a-LTLCardinality-10
FORMULA_NAME ASLink-PT-04a-LTLCardinality-11
FORMULA_NAME ASLink-PT-04a-LTLCardinality-12
FORMULA_NAME ASLink-PT-04a-LTLCardinality-13

=== Now, execution of the tool begins

BK_START 1718215432517

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-12 18:03:55] [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-06-12 18:03:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-12 18:03:56] [INFO ] Load time of PNML (sax parser for PT used): 385 ms
[2024-06-12 18:03:56] [INFO ] Transformed 1016 places.
[2024-06-12 18:03:56] [INFO ] Transformed 1554 transitions.
[2024-06-12 18:03:56] [INFO ] Found NUPN structural information;
[2024-06-12 18:03:56] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 682 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA ASLink-PT-04a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 992 transition count 1538
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 983 transition count 1501
Ensure Unique test removed 1 places
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 982 transition count 1501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 982 transition count 1499
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 981 transition count 1491
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 981 transition count 1491
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 980 transition count 1483
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 980 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 979 transition count 1475
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 979 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 978 transition count 1467
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 978 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 977 transition count 1459
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 977 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 976 transition count 1451
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 976 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 975 transition count 1443
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 975 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 974 transition count 1435
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 974 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 973 transition count 1427
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 973 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 972 transition count 1419
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 972 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 971 transition count 1411
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 971 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 970 transition count 1403
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 970 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 969 transition count 1395
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 969 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 968 transition count 1387
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 968 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 967 transition count 1379
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 967 transition count 1379
Applied a total of 75 rules in 1212 ms. Remains 967 /1016 variables (removed 49) and now considering 1379/1538 (removed 159) transitions.
// Phase 1: matrix 1379 rows 967 cols
[2024-06-12 18:03:58] [INFO ] Computed 169 invariants in 134 ms
[2024-06-12 18:04:00] [INFO ] Implicit Places using invariants in 2208 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 445, 574, 590, 595, 596, 597, 615, 633, 762, 767, 779, 784, 785, 786, 805, 807, 810, 828, 829, 830, 831, 848, 856, 864, 870, 876, 882, 888, 896, 902, 908, 916]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 2280 ms to find 51 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 916/1016 places, 1379/1538 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 903 transition count 1366
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 903 transition count 1366
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 894 transition count 1357
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 894 transition count 1357
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 889 transition count 1352
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 889 transition count 1352
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 887 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 887 transition count 1350
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 885 transition count 1348
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 885 transition count 1348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 884 transition count 1347
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 884 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 883 transition count 1346
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 883 transition count 1346
Applied a total of 66 rules in 181 ms. Remains 883 /916 variables (removed 33) and now considering 1346/1379 (removed 33) transitions.
// Phase 1: matrix 1346 rows 883 cols
[2024-06-12 18:04:00] [INFO ] Computed 118 invariants in 50 ms
[2024-06-12 18:04:01] [INFO ] Implicit Places using invariants in 937 ms returned []
[2024-06-12 18:04:01] [INFO ] Invariant cache hit.
[2024-06-12 18:04:04] [INFO ] Implicit Places using invariants and state equation in 3309 ms returned []
Implicit Place search using SMT with State Equation took 4249 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 883/1016 places, 1346/1538 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7956 ms. Remains : 883/1016 places, 1346/1538 transitions.
Support contains 26 out of 883 places after structural reductions.
[2024-06-12 18:04:05] [INFO ] Flatten gal took : 294 ms
[2024-06-12 18:04:05] [INFO ] Flatten gal took : 117 ms
[2024-06-12 18:04:05] [INFO ] Input system was already deterministic with 1346 transitions.
RANDOM walk for 40000 steps (269 resets) in 1759 ms. (22 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40004 steps (48 resets) in 342 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (50 resets) in 225 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (47 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (51 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
[2024-06-12 18:04:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 113/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 266/386 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 497/883 variables, 92/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1346/2229 variables, 883/1001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2229 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2229 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2229/2229 variables, and 1001 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1755 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 883/883 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 113/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 266/386 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 497/883 variables, 92/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1346/2229 variables, 883/1001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2229 variables, 4/1005 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2229 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2229 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2229/2229 variables, and 1005 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3706 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 883/883 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 5509ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 4740 ms.
Support contains 5 out of 883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 883 transition count 1189
Reduce places removed 157 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 158 rules applied. Total rules applied 315 place count 726 transition count 1188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 316 place count 725 transition count 1188
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 316 place count 725 transition count 1073
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 267 rules applied. Total rules applied 583 place count 573 transition count 1073
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 17 rules applied. Total rules applied 600 place count 565 transition count 1064
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 609 place count 556 transition count 1064
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 609 place count 556 transition count 1049
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 639 place count 541 transition count 1049
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 646 place count 534 transition count 1035
Iterating global reduction 5 with 7 rules applied. Total rules applied 653 place count 534 transition count 1035
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 657 place count 534 transition count 1031
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 658 place count 533 transition count 1031
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 658 place count 533 transition count 1030
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 660 place count 532 transition count 1030
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 764 place count 480 transition count 978
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 768 place count 480 transition count 974
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 772 place count 476 transition count 974
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 789 place count 476 transition count 957
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 807 place count 458 transition count 957
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 810 place count 458 transition count 954
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 819 place count 458 transition count 954
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 821 place count 458 transition count 954
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 822 place count 457 transition count 953
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 826 place count 453 transition count 953
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 8 Pre rules applied. Total rules applied 826 place count 453 transition count 945
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 846 place count 441 transition count 945
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 850 place count 437 transition count 941
Iterating global reduction 10 with 4 rules applied. Total rules applied 854 place count 437 transition count 941
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 858 place count 437 transition count 937
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 859 place count 437 transition count 936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 860 place count 436 transition count 936
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 861 place count 436 transition count 935
Applied a total of 861 rules in 695 ms. Remains 436 /883 variables (removed 447) and now considering 935/1346 (removed 411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 695 ms. Remains : 436/883 places, 935/1346 transitions.
RANDOM walk for 40000 steps (723 resets) in 367 ms. (108 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (173 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (181 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
// Phase 1: matrix 935 rows 436 cols
[2024-06-12 18:04:17] [INFO ] Computed 64 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 79/99 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/122 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/202 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/220 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 57/277 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 18/295 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 106/401 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 22/423 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 13/436 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 935/1371 variables, 436/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1371 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1371 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1371/1371 variables, and 500 constraints, problems are : Problem set: 0 solved, 2 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 79/99 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/122 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/202 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/220 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 57/277 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 18/295 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 106/401 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 22/423 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 13/436 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 935/1371 variables, 436/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1371 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1371 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1371 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1371/1371 variables, and 502 constraints, problems are : Problem set: 0 solved, 2 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1994ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1030 ms.
Support contains 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 935/935 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 436 transition count 934
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 934
Applied a total of 2 rules in 42 ms. Remains 435 /436 variables (removed 1) and now considering 934/935 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 435/436 places, 934/935 transitions.
RANDOM walk for 40000 steps (688 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (183 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (192 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4626 steps, run visited all 2 properties in 70 ms. (steps per millisecond=66 )
Probabilistic random walk after 4626 steps, saw 4070 distinct states, run finished after 76 ms. (steps per millisecond=60 ) properties seen :2
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(F(p1))))))'
Support contains 4 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 881 transition count 1337
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 881 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 880 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 880 transition count 1336
Applied a total of 6 rules in 121 ms. Remains 880 /883 variables (removed 3) and now considering 1336/1346 (removed 10) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2024-06-12 18:04:21] [INFO ] Computed 118 invariants in 21 ms
[2024-06-12 18:04:22] [INFO ] Implicit Places using invariants in 1045 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1048 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/883 places, 1336/1346 transitions.
Applied a total of 0 rules in 39 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1210 ms. Remains : 879/883 places, 1336/1346 transitions.
Stuttering acceptance computed with spot in 578 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-04
Product exploration explored 100000 steps with 804 reset in 706 ms.
Product exploration explored 100000 steps with 845 reset in 452 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1528 steps (9 resets) in 8 ms. (169 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 112 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 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 879 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1336/1336 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 167 place count 878 transition count 1168
Reduce places removed 171 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 175 rules applied. Total rules applied 342 place count 707 transition count 1164
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 347 place count 703 transition count 1163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 348 place count 702 transition count 1163
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 348 place count 702 transition count 1041
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 628 place count 544 transition count 1041
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 30 rules applied. Total rules applied 658 place count 531 transition count 1024
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 675 place count 514 transition count 1024
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 675 place count 514 transition count 1009
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 705 place count 499 transition count 1009
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 714 place count 490 transition count 1000
Iterating global reduction 6 with 9 rules applied. Total rules applied 723 place count 490 transition count 1000
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 731 place count 490 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 732 place count 489 transition count 992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 732 place count 489 transition count 991
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 734 place count 488 transition count 991
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 8 with 96 rules applied. Total rules applied 830 place count 440 transition count 943
Applied a total of 830 rules in 133 ms. Remains 440 /879 variables (removed 439) and now considering 943/1336 (removed 393) transitions.
// Phase 1: matrix 943 rows 440 cols
[2024-06-12 18:04:25] [INFO ] Computed 64 invariants in 11 ms
[2024-06-12 18:04:25] [INFO ] Implicit Places using invariants in 659 ms returned [72, 89, 95, 100, 159, 177, 183, 191, 251, 268, 274, 279, 281, 341, 358, 367, 372, 374, 437]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 661 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 421/879 places, 943/1336 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 421 transition count 942
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 420 transition count 942
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 414 transition count 936
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 414 transition count 936
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 408 transition count 930
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 408 transition count 930
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 406 transition count 928
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 406 transition count 928
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 46 place count 398 transition count 920
Applied a total of 46 rules in 58 ms. Remains 398 /421 variables (removed 23) and now considering 920/943 (removed 23) transitions.
// Phase 1: matrix 920 rows 398 cols
[2024-06-12 18:04:25] [INFO ] Computed 45 invariants in 15 ms
[2024-06-12 18:04:26] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-06-12 18:04:26] [INFO ] Invariant cache hit.
[2024-06-12 18:04:27] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 398/879 places, 920/1336 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2416 ms. Remains : 398/879 places, 920/1336 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 111 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 73 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1010 steps (13 resets) in 8 ms. (112 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 149 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 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1846 reset in 218 ms.
Product exploration explored 100000 steps with 1775 reset in 248 ms.
Built C files in :
/tmp/ltsmin14067762223644185804
[2024-06-12 18:04:28] [INFO ] Computing symmetric may disable matrix : 920 transitions.
[2024-06-12 18:04:28] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:04:28] [INFO ] Computing symmetric may enable matrix : 920 transitions.
[2024-06-12 18:04:28] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:04:28] [INFO ] Computing Do-Not-Accords matrix : 920 transitions.
[2024-06-12 18:04:28] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:04:28] [INFO ] Built C files in 411ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14067762223644185804
Running compilation step : cd /tmp/ltsmin14067762223644185804;'/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/ltsmin14067762223644185804;'/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/ltsmin14067762223644185804;'/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 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 920/920 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 398 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 397 transition count 919
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 397 transition count 918
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 396 transition count 918
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 395 transition count 917
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 395 transition count 917
Applied a total of 6 rules in 34 ms. Remains 395 /398 variables (removed 3) and now considering 917/920 (removed 3) transitions.
// Phase 1: matrix 917 rows 395 cols
[2024-06-12 18:04:31] [INFO ] Computed 45 invariants in 9 ms
[2024-06-12 18:04:32] [INFO ] Implicit Places using invariants in 567 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 569 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/398 places, 917/920 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 393 transition count 916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 392 transition count 915
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 392 transition count 915
Applied a total of 4 rules in 28 ms. Remains 392 /394 variables (removed 2) and now considering 915/917 (removed 2) transitions.
// Phase 1: matrix 915 rows 392 cols
[2024-06-12 18:04:32] [INFO ] Computed 44 invariants in 12 ms
[2024-06-12 18:04:32] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-06-12 18:04:32] [INFO ] Invariant cache hit.
[2024-06-12 18:04:33] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 392/398 places, 915/920 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1985 ms. Remains : 392/398 places, 915/920 transitions.
Built C files in :
/tmp/ltsmin16634482030558358797
[2024-06-12 18:04:34] [INFO ] Computing symmetric may disable matrix : 915 transitions.
[2024-06-12 18:04:34] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:04:34] [INFO ] Computing symmetric may enable matrix : 915 transitions.
[2024-06-12 18:04:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:04:34] [INFO ] Computing Do-Not-Accords matrix : 915 transitions.
[2024-06-12 18:04:34] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:04:34] [INFO ] Built C files in 172ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16634482030558358797
Running compilation step : cd /tmp/ltsmin16634482030558358797;'/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/ltsmin16634482030558358797;'/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/ltsmin16634482030558358797;'/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-06-12 18:04:37] [INFO ] Flatten gal took : 60 ms
[2024-06-12 18:04:37] [INFO ] Flatten gal took : 62 ms
[2024-06-12 18:04:37] [INFO ] Time to serialize gal into /tmp/LTL14089193447320855676.gal : 13 ms
[2024-06-12 18:04:37] [INFO ] Time to serialize properties into /tmp/LTL8717408093743446684.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/LTL14089193447320855676.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5407705834660304172.hoa' '-atoms' '/tmp/LTL8717408093743446684.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/LTL8717408093743446684.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5407705834660304172.hoa
Detected timeout of ITS tools.
[2024-06-12 18:04:52] [INFO ] Flatten gal took : 46 ms
[2024-06-12 18:04:52] [INFO ] Flatten gal took : 44 ms
[2024-06-12 18:04:52] [INFO ] Time to serialize gal into /tmp/LTL5692573731576924643.gal : 12 ms
[2024-06-12 18:04:52] [INFO ] Time to serialize properties into /tmp/LTL12558779122878739166.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5692573731576924643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12558779122878739166.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((p321==0)||(p372==1))"))&&(G(F("((p746==0)||(p45==1))")))))))
Formula 0 simplified : XX(G!"((p321==0)||(p372==1))" | FG!"((p746==0)||(p45==1))")
Detected timeout of ITS tools.
[2024-06-12 18:05:07] [INFO ] Flatten gal took : 37 ms
[2024-06-12 18:05:07] [INFO ] Applying decomposition
[2024-06-12 18:05:07] [INFO ] Flatten gal took : 38 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/graph956871370113422329.txt' '-o' '/tmp/graph956871370113422329.bin' '-w' '/tmp/graph956871370113422329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph956871370113422329.bin' '-l' '-1' '-v' '-w' '/tmp/graph956871370113422329.weights' '-q' '0' '-e' '0.001'
[2024-06-12 18:05:08] [INFO ] Decomposing Gal with order
[2024-06-12 18:05:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-12 18:05:08] [INFO ] Removed a total of 1845 redundant transitions.
[2024-06-12 18:05:08] [INFO ] Flatten gal took : 159 ms
[2024-06-12 18:05:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 42 ms.
[2024-06-12 18:05:08] [INFO ] Time to serialize gal into /tmp/LTL12384003596596533473.gal : 17 ms
[2024-06-12 18:05:08] [INFO ] Time to serialize properties into /tmp/LTL1582171234000849058.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/LTL12384003596596533473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1582171234000849058.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((i3.u35.p321==0)||(i3.u46.p372==1))"))&&(G(F("((i8.i0.u83.p746==0)||(i1.u12.p45==1))")))))))
Formula 0 simplified : XX(G!"((i3.u35.p321==0)||(i3.u46.p372==1))" | FG!"((i8.i0.u83.p746==0)||(i1.u12.p45==1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-04a-LTLCardinality-04 finished in 62187 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((p0&&F(G(p1))))))'
Support contains 3 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 882 transition count 1345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 882 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 881 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 881 transition count 1344
Applied a total of 4 rules in 56 ms. Remains 881 /883 variables (removed 2) and now considering 1344/1346 (removed 2) transitions.
// Phase 1: matrix 1344 rows 881 cols
[2024-06-12 18:05:23] [INFO ] Computed 118 invariants in 14 ms
[2024-06-12 18:05:24] [INFO ] Implicit Places using invariants in 849 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 852 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 880/883 places, 1344/1346 transitions.
Applied a total of 0 rules in 18 ms. Remains 880 /880 variables (removed 0) and now considering 1344/1344 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 927 ms. Remains : 880/883 places, 1344/1346 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-08
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 6 ms.
FORMULA ASLink-PT-04a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-08 finished in 1100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 3 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 881 transition count 1337
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 881 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 880 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 880 transition count 1336
Applied a total of 6 rules in 55 ms. Remains 880 /883 variables (removed 3) and now considering 1336/1346 (removed 10) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2024-06-12 18:05:24] [INFO ] Computed 118 invariants in 14 ms
[2024-06-12 18:05:25] [INFO ] Implicit Places using invariants in 622 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 624 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/883 places, 1336/1346 transitions.
Applied a total of 0 rules in 23 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 703 ms. Remains : 879/883 places, 1336/1346 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-04a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-09 finished in 930 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||F(p1))))'
Support contains 4 out of 883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 882 transition count 1187
Reduce places removed 162 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 166 rules applied. Total rules applied 324 place count 720 transition count 1183
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 329 place count 716 transition count 1182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 330 place count 715 transition count 1182
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 123 Pre rules applied. Total rules applied 330 place count 715 transition count 1059
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 4 with 283 rules applied. Total rules applied 613 place count 555 transition count 1059
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 30 rules applied. Total rules applied 643 place count 542 transition count 1042
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 660 place count 525 transition count 1042
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 660 place count 525 transition count 1025
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 694 place count 508 transition count 1025
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 705 place count 497 transition count 1007
Iterating global reduction 6 with 11 rules applied. Total rules applied 716 place count 497 transition count 1007
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 724 place count 497 transition count 999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 725 place count 496 transition count 999
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 725 place count 496 transition count 998
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 727 place count 495 transition count 998
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 825 place count 446 transition count 949
Applied a total of 825 rules in 91 ms. Remains 446 /883 variables (removed 437) and now considering 949/1346 (removed 397) transitions.
// Phase 1: matrix 949 rows 446 cols
[2024-06-12 18:05:25] [INFO ] Computed 64 invariants in 8 ms
[2024-06-12 18:05:26] [INFO ] Implicit Places using invariants in 588 ms returned [72, 90, 97, 102, 161, 178, 184, 189, 192, 218, 253, 274, 282, 288, 290, 350, 367, 373, 378, 380, 443]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 590 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/883 places, 949/1346 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 425 transition count 944
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 420 transition count 944
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 18 place count 412 transition count 936
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 412 transition count 936
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 33 place count 405 transition count 929
Iterating global reduction 2 with 7 rules applied. Total rules applied 40 place count 405 transition count 929
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 402 transition count 926
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 402 transition count 926
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 391 transition count 915
Applied a total of 68 rules in 48 ms. Remains 391 /425 variables (removed 34) and now considering 915/949 (removed 34) transitions.
// Phase 1: matrix 915 rows 391 cols
[2024-06-12 18:05:26] [INFO ] Computed 43 invariants in 7 ms
[2024-06-12 18:05:26] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-12 18:05:26] [INFO ] Invariant cache hit.
[2024-06-12 18:05:27] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 391/883 places, 915/1346 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2293 ms. Remains : 391/883 places, 915/1346 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-11
Product exploration explored 100000 steps with 2171 reset in 327 ms.
Product exploration explored 100000 steps with 2263 reset in 364 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 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (621 resets) in 248 ms. (160 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (190 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
[2024-06-12 18:05:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/111 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/260 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/297 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/357 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/375 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:05:29] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 30 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/391 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 915/1306 variables, 391/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1306 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1306 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/111 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/260 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/297 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/357 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/375 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/391 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 915/1306 variables, 391/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1306 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1306 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1306 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 436 constraints, problems are : Problem set: 0 solved, 1 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1549ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 915/915 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 391 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 390 transition count 914
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 390 transition count 898
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 38 place count 374 transition count 894
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 49 place count 374 transition count 883
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 60 place count 363 transition count 883
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 61 place count 363 transition count 883
Applied a total of 61 rules in 59 ms. Remains 363 /391 variables (removed 28) and now considering 883/915 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 363/391 places, 883/915 transitions.
RANDOM walk for 40000 steps (798 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (237 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 414345 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 414345 steps, saw 224454 distinct states, run finished after 3007 ms. (steps per millisecond=137 ) properties seen :0
// Phase 1: matrix 883 rows 363 cols
[2024-06-12 18:05:33] [INFO ] Computed 43 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/94 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/249 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/275 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/329 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/347 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:05:33] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/363 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 883/1246 variables, 363/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1246 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1246 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/94 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/249 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/275 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/329 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/347 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/363 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 883/1246 variables, 363/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1246 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1246 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1246 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1141ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 2 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 883/883 transitions.
Applied a total of 0 rules in 16 ms. Remains 363 /363 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 363/363 places, 883/883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 883/883 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2024-06-12 18:05:35] [INFO ] Invariant cache hit.
[2024-06-12 18:05:35] [INFO ] Implicit Places using invariants in 441 ms returned [92, 93, 163, 164, 234, 235]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 442 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/363 places, 883/883 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 465 ms. Remains : 357/363 places, 883/883 transitions.
RANDOM walk for 40000 steps (814 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (227 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 433240 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 433240 steps, saw 236249 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
// Phase 1: matrix 883 rows 357 cols
[2024-06-12 18:05:38] [INFO ] Computed 37 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/118 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/274 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/308 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:05:38] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/357 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 883/1240 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1240 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1240/1240 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/118 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/274 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/308 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/357 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 883/1240 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1240 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1240 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1240/1240 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1040ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 883/883 transitions.
Applied a total of 0 rules in 11 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 357/357 places, 883/883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 883/883 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2024-06-12 18:05:39] [INFO ] Invariant cache hit.
[2024-06-12 18:05:40] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-06-12 18:05:40] [INFO ] Invariant cache hit.
[2024-06-12 18:05:41] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
[2024-06-12 18:05:41] [INFO ] Redundant transitions in 57 ms returned []
Running 861 sub problems to find dead transitions.
[2024-06-12 18:05:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 861 unsolved
SMT process timed out in 30764ms, After SMT, problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 30782ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32618 ms. Remains : 357/357 places, 883/883 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 17 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:06:12] [INFO ] Invariant cache hit.
[2024-06-12 18:06:12] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-12 18:06:12] [INFO ] [Real]Absence check using 9 positive and 28 generalized place invariants in 28 ms returned sat
[2024-06-12 18:06:12] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:06:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-12 18:06:13] [INFO ] [Nat]Absence check using 9 positive and 28 generalized place invariants in 23 ms returned sat
[2024-06-12 18:06:13] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:06:13] [INFO ] After 596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:06:13] [INFO ] After 775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1495 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 915/915 transitions.
Applied a total of 0 rules in 18 ms. Remains 391 /391 variables (removed 0) and now considering 915/915 (removed 0) transitions.
// Phase 1: matrix 915 rows 391 cols
[2024-06-12 18:06:14] [INFO ] Computed 43 invariants in 12 ms
[2024-06-12 18:06:14] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-06-12 18:06:14] [INFO ] Invariant cache hit.
[2024-06-12 18:06:16] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1845 ms to find 0 implicit places.
[2024-06-12 18:06:16] [INFO ] Redundant transitions in 276 ms returned []
Running 889 sub problems to find dead transitions.
[2024-06-12 18:06:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (OVERLAPS) 1/391 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 889 unsolved
[2024-06-12 18:06:44] [INFO ] Deduced a trap composed of 98 places in 348 ms of which 7 ms to minimize.
[2024-06-12 18:06:44] [INFO ] Deduced a trap composed of 83 places in 337 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/1306 variables, and 45 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/391 constraints, PredecessorRefiner: 889/889 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 889 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (OVERLAPS) 1/391 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/1306 variables, and 45 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/391 constraints, PredecessorRefiner: 0/889 constraints, Known Traps: 2/2 constraints]
After SMT, in 60773ms problems are : Problem set: 0 solved, 889 unsolved
Search for dead transitions found 0 dead transitions in 60793ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62945 ms. Remains : 391/391 places, 915/915 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 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (625 resets) in 196 ms. (203 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (190 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2024-06-12 18:07:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/111 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/260 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/297 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/357 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/375 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:07:18] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/391 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 915/1306 variables, 391/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1306 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1306 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1392 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/111 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/260 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/297 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/357 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/375 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/391 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 915/1306 variables, 391/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1306 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1306 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1306 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 436 constraints, problems are : Problem set: 0 solved, 1 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2219ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 915/915 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 391 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 390 transition count 914
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 390 transition count 898
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 38 place count 374 transition count 894
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 49 place count 374 transition count 883
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 60 place count 363 transition count 883
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 61 place count 363 transition count 883
Applied a total of 61 rules in 76 ms. Remains 363 /391 variables (removed 28) and now considering 883/915 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 363/391 places, 883/915 transitions.
RANDOM walk for 40000 steps (797 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (237 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 390541 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 390541 steps, saw 207882 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
// Phase 1: matrix 883 rows 363 cols
[2024-06-12 18:07:22] [INFO ] Computed 43 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/94 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/249 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/275 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/329 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/347 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:07:23] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/363 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 883/1246 variables, 363/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1246 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1246 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 886 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/94 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/249 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/275 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/329 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/347 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/363 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 883/1246 variables, 363/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1246 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1246 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1246 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1707ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 131 ms.
Support contains 2 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 883/883 transitions.
Applied a total of 0 rules in 18 ms. Remains 363 /363 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 363/363 places, 883/883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 883/883 transitions.
Applied a total of 0 rules in 17 ms. Remains 363 /363 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2024-06-12 18:07:24] [INFO ] Invariant cache hit.
[2024-06-12 18:07:25] [INFO ] Implicit Places using invariants in 780 ms returned [92, 93, 163, 164, 234, 235]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 782 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/363 places, 883/883 transitions.
Applied a total of 0 rules in 19 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 820 ms. Remains : 357/363 places, 883/883 transitions.
RANDOM walk for 40000 steps (729 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (233 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 400474 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 400474 steps, saw 214708 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
// Phase 1: matrix 883 rows 357 cols
[2024-06-12 18:07:28] [INFO ] Computed 37 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/118 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/274 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/308 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:07:28] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/357 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 883/1240 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1240 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1240/1240 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/118 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/274 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/308 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/357 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 883/1240 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1240 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1240 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1240/1240 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1247ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 883/883 transitions.
Applied a total of 0 rules in 16 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 357/357 places, 883/883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 883/883 transitions.
Applied a total of 0 rules in 17 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2024-06-12 18:07:30] [INFO ] Invariant cache hit.
[2024-06-12 18:07:30] [INFO ] Implicit Places using invariants in 720 ms returned []
[2024-06-12 18:07:30] [INFO ] Invariant cache hit.
[2024-06-12 18:07:32] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
[2024-06-12 18:07:32] [INFO ] Redundant transitions in 15 ms returned []
Running 861 sub problems to find dead transitions.
[2024-06-12 18:07:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 861 unsolved
SMT process timed out in 30886ms, After SMT, problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 30904ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33190 ms. Remains : 357/357 places, 883/883 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:08:03] [INFO ] Invariant cache hit.
[2024-06-12 18:08:03] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-12 18:08:03] [INFO ] [Real]Absence check using 9 positive and 28 generalized place invariants in 24 ms returned sat
[2024-06-12 18:08:03] [INFO ] After 710ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:08:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-12 18:08:04] [INFO ] [Nat]Absence check using 9 positive and 28 generalized place invariants in 27 ms returned sat
[2024-06-12 18:08:04] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:08:04] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:08:04] [INFO ] After 851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1594 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2229 reset in 370 ms.
Product exploration explored 100000 steps with 2245 reset in 419 ms.
Built C files in :
/tmp/ltsmin16889646706631217130
[2024-06-12 18:08:06] [INFO ] Computing symmetric may disable matrix : 915 transitions.
[2024-06-12 18:08:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:08:06] [INFO ] Computing symmetric may enable matrix : 915 transitions.
[2024-06-12 18:08:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:08:06] [INFO ] Computing Do-Not-Accords matrix : 915 transitions.
[2024-06-12 18:08:06] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:08:06] [INFO ] Built C files in 263ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16889646706631217130
Running compilation step : cd /tmp/ltsmin16889646706631217130;'/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/ltsmin16889646706631217130;'/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/ltsmin16889646706631217130;'/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 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 915/915 transitions.
Applied a total of 0 rules in 16 ms. Remains 391 /391 variables (removed 0) and now considering 915/915 (removed 0) transitions.
// Phase 1: matrix 915 rows 391 cols
[2024-06-12 18:08:09] [INFO ] Computed 43 invariants in 12 ms
[2024-06-12 18:08:10] [INFO ] Implicit Places using invariants in 794 ms returned []
[2024-06-12 18:08:10] [INFO ] Invariant cache hit.
[2024-06-12 18:08:12] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 2606 ms to find 0 implicit places.
[2024-06-12 18:08:12] [INFO ] Redundant transitions in 21 ms returned []
Running 889 sub problems to find dead transitions.
[2024-06-12 18:08:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 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 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/391 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 889 unsolved
SMT process timed out in 30879ms, After SMT, problems are : Problem set: 0 solved, 889 unsolved
Search for dead transitions found 0 dead transitions in 30898ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33553 ms. Remains : 391/391 places, 915/915 transitions.
Built C files in :
/tmp/ltsmin3960979393345376540
[2024-06-12 18:08:43] [INFO ] Computing symmetric may disable matrix : 915 transitions.
[2024-06-12 18:08:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:08:43] [INFO ] Computing symmetric may enable matrix : 915 transitions.
[2024-06-12 18:08:43] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:08:43] [INFO ] Computing Do-Not-Accords matrix : 915 transitions.
[2024-06-12 18:08:43] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:08:43] [INFO ] Built C files in 259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3960979393345376540
Running compilation step : cd /tmp/ltsmin3960979393345376540;'/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/ltsmin3960979393345376540;'/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/ltsmin3960979393345376540;'/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-06-12 18:08:46] [INFO ] Flatten gal took : 46 ms
[2024-06-12 18:08:46] [INFO ] Flatten gal took : 63 ms
[2024-06-12 18:08:46] [INFO ] Time to serialize gal into /tmp/LTL495127183427219388.gal : 12 ms
[2024-06-12 18:08:46] [INFO ] Time to serialize properties into /tmp/LTL14039693595117209915.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/LTL495127183427219388.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8352436994927359559.hoa' '-atoms' '/tmp/LTL14039693595117209915.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/LTL14039693595117209915.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8352436994927359559.hoa
Detected timeout of ITS tools.
[2024-06-12 18:09:01] [INFO ] Flatten gal took : 32 ms
[2024-06-12 18:09:01] [INFO ] Flatten gal took : 40 ms
[2024-06-12 18:09:01] [INFO ] Time to serialize gal into /tmp/LTL5852165655753757888.gal : 7 ms
[2024-06-12 18:09:01] [INFO ] Time to serialize properties into /tmp/LTL15761032776729485453.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/LTL5852165655753757888.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15761032776729485453.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("((p628==0)||(p391==1))"))||("((p150==0)&&(p105==1))"))))
Formula 0 simplified : F(!"((p150==0)&&(p105==1))" & G!"((p628==0)||(p391==1))")
Detected timeout of ITS tools.
[2024-06-12 18:09:16] [INFO ] Flatten gal took : 35 ms
[2024-06-12 18:09:16] [INFO ] Applying decomposition
[2024-06-12 18:09:16] [INFO ] Flatten gal took : 35 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/graph17960095188616650257.txt' '-o' '/tmp/graph17960095188616650257.bin' '-w' '/tmp/graph17960095188616650257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17960095188616650257.bin' '-l' '-1' '-v' '-w' '/tmp/graph17960095188616650257.weights' '-q' '0' '-e' '0.001'
[2024-06-12 18:09:16] [INFO ] Decomposing Gal with order
[2024-06-12 18:09:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-12 18:09:16] [INFO ] Removed a total of 1825 redundant transitions.
[2024-06-12 18:09:17] [INFO ] Flatten gal took : 81 ms
[2024-06-12 18:09:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 21 ms.
[2024-06-12 18:09:17] [INFO ] Time to serialize gal into /tmp/LTL11262273653889453887.gal : 8 ms
[2024-06-12 18:09:17] [INFO ] Time to serialize properties into /tmp/LTL5019181096376079469.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/LTL11262273653889453887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5019181096376079469.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i7.u67.p628==0)||(i3.u43.p391==1))"))||("((i2.u17.p150==0)&&(i1.u25.p105==1))"))))
Formula 0 simplified : F(!"((i2.u17.p150==0)&&(i1.u25.p105==1))" & G!"((i7.u67.p628==0)||(i3.u43.p391==1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-04a-LTLCardinality-11 finished in 246512 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((X(X(X(F(p1))))||p0))))'
Support contains 4 out of 883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 882 transition count 1188
Reduce places removed 161 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 165 rules applied. Total rules applied 322 place count 721 transition count 1184
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 328 place count 717 transition count 1182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 330 place count 715 transition count 1182
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 330 place count 715 transition count 1060
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 4 with 281 rules applied. Total rules applied 611 place count 556 transition count 1060
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 29 rules applied. Total rules applied 640 place count 543 transition count 1044
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 656 place count 527 transition count 1044
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 656 place count 527 transition count 1027
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 690 place count 510 transition count 1027
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 701 place count 499 transition count 1009
Iterating global reduction 6 with 11 rules applied. Total rules applied 712 place count 499 transition count 1009
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 7 rules applied. Total rules applied 719 place count 499 transition count 1002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 720 place count 498 transition count 1002
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 720 place count 498 transition count 1001
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 722 place count 497 transition count 1001
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 8 with 96 rules applied. Total rules applied 818 place count 449 transition count 953
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 820 place count 449 transition count 953
Applied a total of 820 rules in 82 ms. Remains 449 /883 variables (removed 434) and now considering 953/1346 (removed 393) transitions.
// Phase 1: matrix 953 rows 449 cols
[2024-06-12 18:09:32] [INFO ] Computed 64 invariants in 8 ms
[2024-06-12 18:09:32] [INFO ] Implicit Places using invariants in 650 ms returned [72, 90, 96, 101, 160, 177, 183, 188, 190, 216, 251, 272, 280, 286, 288, 348, 366, 372, 377, 381, 445]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 652 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/883 places, 953/1346 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 428 transition count 948
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 423 transition count 948
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 18 place count 415 transition count 940
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 415 transition count 940
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 34 place count 407 transition count 932
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 407 transition count 932
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 403 transition count 928
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 403 transition count 928
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 72 place count 392 transition count 917
Applied a total of 72 rules in 80 ms. Remains 392 /428 variables (removed 36) and now considering 917/953 (removed 36) transitions.
// Phase 1: matrix 917 rows 392 cols
[2024-06-12 18:09:32] [INFO ] Computed 43 invariants in 13 ms
[2024-06-12 18:09:33] [INFO ] Implicit Places using invariants in 733 ms returned []
[2024-06-12 18:09:33] [INFO ] Invariant cache hit.
[2024-06-12 18:09:35] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 392/883 places, 917/1346 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3056 ms. Remains : 392/883 places, 917/1346 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-12
Product exploration explored 100000 steps with 1610 reset in 330 ms.
Product exploration explored 100000 steps with 1680 reset in 359 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 341 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2629 steps (41 resets) in 28 ms. (90 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 485 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 917/917 transitions.
Applied a total of 0 rules in 18 ms. Remains 392 /392 variables (removed 0) and now considering 917/917 (removed 0) transitions.
[2024-06-12 18:09:37] [INFO ] Invariant cache hit.
[2024-06-12 18:09:37] [INFO ] Implicit Places using invariants in 746 ms returned []
[2024-06-12 18:09:37] [INFO ] Invariant cache hit.
[2024-06-12 18:09:39] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
[2024-06-12 18:09:39] [INFO ] Redundant transitions in 52 ms returned []
Running 890 sub problems to find dead transitions.
[2024-06-12 18:09:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/391 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 3 (OVERLAPS) 1/392 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 890 unsolved
SMT process timed out in 30701ms, After SMT, problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 30718ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33236 ms. Remains : 392/392 places, 917/917 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3301 steps (51 resets) in 29 ms. (110 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 482 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1598 reset in 322 ms.
Product exploration explored 100000 steps with 1666 reset in 357 ms.
Built C files in :
/tmp/ltsmin1217725784839589424
[2024-06-12 18:10:12] [INFO ] Computing symmetric may disable matrix : 917 transitions.
[2024-06-12 18:10:12] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:10:12] [INFO ] Computing symmetric may enable matrix : 917 transitions.
[2024-06-12 18:10:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:10:12] [INFO ] Computing Do-Not-Accords matrix : 917 transitions.
[2024-06-12 18:10:12] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:10:12] [INFO ] Built C files in 238ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1217725784839589424
Running compilation step : cd /tmp/ltsmin1217725784839589424;'/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/ltsmin1217725784839589424;'/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/ltsmin1217725784839589424;'/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 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 917/917 transitions.
Applied a total of 0 rules in 17 ms. Remains 392 /392 variables (removed 0) and now considering 917/917 (removed 0) transitions.
[2024-06-12 18:10:15] [INFO ] Invariant cache hit.
[2024-06-12 18:10:16] [INFO ] Implicit Places using invariants in 761 ms returned []
[2024-06-12 18:10:16] [INFO ] Invariant cache hit.
[2024-06-12 18:10:18] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
[2024-06-12 18:10:18] [INFO ] Redundant transitions in 24 ms returned []
Running 890 sub problems to find dead transitions.
[2024-06-12 18:10:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/391 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 890 unsolved
SMT process timed out in 30742ms, After SMT, problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 30759ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33213 ms. Remains : 392/392 places, 917/917 transitions.
Built C files in :
/tmp/ltsmin7243030072512288818
[2024-06-12 18:10:48] [INFO ] Computing symmetric may disable matrix : 917 transitions.
[2024-06-12 18:10:48] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:10:48] [INFO ] Computing symmetric may enable matrix : 917 transitions.
[2024-06-12 18:10:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:10:49] [INFO ] Computing Do-Not-Accords matrix : 917 transitions.
[2024-06-12 18:10:49] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:10:49] [INFO ] Built C files in 271ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7243030072512288818
Running compilation step : cd /tmp/ltsmin7243030072512288818;'/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/ltsmin7243030072512288818;'/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/ltsmin7243030072512288818;'/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-06-12 18:10:52] [INFO ] Flatten gal took : 28 ms
[2024-06-12 18:10:52] [INFO ] Flatten gal took : 28 ms
[2024-06-12 18:10:52] [INFO ] Time to serialize gal into /tmp/LTL6394016607496185201.gal : 6 ms
[2024-06-12 18:10:52] [INFO ] Time to serialize properties into /tmp/LTL1666734025045893065.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/LTL6394016607496185201.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6961826922668431976.hoa' '-atoms' '/tmp/LTL1666734025045893065.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/LTL1666734025045893065.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6961826922668431976.hoa
Detected timeout of ITS tools.
[2024-06-12 18:11:07] [INFO ] Flatten gal took : 26 ms
[2024-06-12 18:11:07] [INFO ] Flatten gal took : 26 ms
[2024-06-12 18:11:07] [INFO ] Time to serialize gal into /tmp/LTL17336694515663977266.gal : 9 ms
[2024-06-12 18:11:07] [INFO ] Time to serialize properties into /tmp/LTL2407796126728058227.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/LTL17336694515663977266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2407796126728058227.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 : !((F(G(("((p987==0)||(p780==1))")||(X(X(X(F("((p99!=0)&&(p715!=1))")))))))))
Formula 0 simplified : G(F!"((p987==0)||(p780==1))" & FG!"((p99!=0)&&(p715!=1))")
Detected timeout of ITS tools.
[2024-06-12 18:11:22] [INFO ] Flatten gal took : 28 ms
[2024-06-12 18:11:22] [INFO ] Applying decomposition
[2024-06-12 18:11:22] [INFO ] Flatten gal took : 28 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/graph18366489721442848359.txt' '-o' '/tmp/graph18366489721442848359.bin' '-w' '/tmp/graph18366489721442848359.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18366489721442848359.bin' '-l' '-1' '-v' '-w' '/tmp/graph18366489721442848359.weights' '-q' '0' '-e' '0.001'
[2024-06-12 18:11:22] [INFO ] Decomposing Gal with order
[2024-06-12 18:11:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-12 18:11:22] [INFO ] Removed a total of 1832 redundant transitions.
[2024-06-12 18:11:22] [INFO ] Flatten gal took : 61 ms
[2024-06-12 18:11:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 22 ms.
[2024-06-12 18:11:22] [INFO ] Time to serialize gal into /tmp/LTL16897708733042544122.gal : 10 ms
[2024-06-12 18:11:22] [INFO ] Time to serialize properties into /tmp/LTL106919351217784757.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/LTL16897708733042544122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL106919351217784757.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i7.u104.p987==0)||(i7.u82.p780==1))")||(X(X(X(F("((i2.u26.p99!=0)&&(i7.u81.p715!=1))")))))))))
Formula 0 simplified : G(F!"((i7.u104.p987==0)||(i7.u82.p780==1))" & FG!"((i2.u26.p99!=0)&&(i7.u81.p715!=1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-04a-LTLCardinality-12 finished in 125659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&X(X(G(p2))))))'
Support contains 6 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 882 transition count 1338
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 882 transition count 1338
Applied a total of 2 rules in 37 ms. Remains 882 /883 variables (removed 1) and now considering 1338/1346 (removed 8) transitions.
// Phase 1: matrix 1338 rows 882 cols
[2024-06-12 18:11:37] [INFO ] Computed 118 invariants in 18 ms
[2024-06-12 18:11:38] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2024-06-12 18:11:38] [INFO ] Invariant cache hit.
[2024-06-12 18:11:42] [INFO ] Implicit Places using invariants and state equation in 3973 ms returned []
Implicit Place search using SMT with State Equation took 5012 ms to find 0 implicit places.
Running 1337 sub problems to find dead transitions.
[2024-06-12 18:11:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 881/2220 variables, and 85 constraints, problems are : Problem set: 0 solved, 1337 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 85/91 constraints, State Equation: 0/882 constraints, PredecessorRefiner: 1337/1337 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 16)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 11)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 7)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 8)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 12)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 2)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 3)
(s201 1)
(s202 1)
(s203 1)
(s204 2)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 1)
(s232 0)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 16)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 8)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 18)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 7)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 5)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 2)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 3)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 3)
(s382 1)
(s383 2)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 0)
(s411 0)
(s412 1)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 16)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 11)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 7)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 881/2220 variables, and 85 constraints, problems are : Problem set: 0 solved, 1337 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 85/91 constraints, State Equation: 0/882 constraints, PredecessorRefiner: 0/1337 constraints, Known Traps: 0/0 constraints]
After SMT, in 60736ms problems are : Problem set: 0 solved, 1337 unsolved
Search for dead transitions found 0 dead transitions in 60752ms
Starting structural reductions in LTL mode, iteration 1 : 882/883 places, 1338/1346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65804 ms. Remains : 882/883 places, 1338/1346 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-13 finished in 66097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 3 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 881 transition count 1337
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 881 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 880 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 880 transition count 1336
Applied a total of 6 rules in 98 ms. Remains 880 /883 variables (removed 3) and now considering 1336/1346 (removed 10) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2024-06-12 18:12:44] [INFO ] Computed 118 invariants in 17 ms
[2024-06-12 18:12:45] [INFO ] Implicit Places using invariants in 1209 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1212 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/883 places, 1336/1346 transitions.
Applied a total of 0 rules in 30 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1341 ms. Remains : 879/883 places, 1336/1346 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-15
Stuttering criterion allowed to conclude after 402 steps with 2 reset in 2 ms.
FORMULA ASLink-PT-04a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-15 finished in 1547 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((F(p0)&&G(F(p1))))))'
Found a Shortening insensitive property : ASLink-PT-04a-LTLCardinality-04
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 883 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 882 transition count 1186
Reduce places removed 163 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 167 rules applied. Total rules applied 326 place count 719 transition count 1182
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 331 place count 715 transition count 1181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 332 place count 714 transition count 1181
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 332 place count 714 transition count 1059
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 612 place count 556 transition count 1059
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 30 rules applied. Total rules applied 642 place count 543 transition count 1042
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 659 place count 526 transition count 1042
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 659 place count 526 transition count 1027
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 689 place count 511 transition count 1027
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 700 place count 500 transition count 1009
Iterating global reduction 6 with 11 rules applied. Total rules applied 711 place count 500 transition count 1009
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 719 place count 500 transition count 1001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 720 place count 499 transition count 1001
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 720 place count 499 transition count 1000
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 722 place count 498 transition count 1000
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 8 with 100 rules applied. Total rules applied 822 place count 448 transition count 950
Applied a total of 822 rules in 132 ms. Remains 448 /883 variables (removed 435) and now considering 950/1346 (removed 396) transitions.
// Phase 1: matrix 950 rows 448 cols
[2024-06-12 18:12:46] [INFO ] Computed 65 invariants in 13 ms
[2024-06-12 18:12:47] [INFO ] Implicit Places using invariants in 795 ms returned [72, 89, 95, 100, 159, 177, 183, 191, 217, 252, 273, 281, 287, 289, 349, 366, 375, 380, 382, 445]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 799 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 428/883 places, 950/1346 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 428 transition count 945
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 423 transition count 945
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 16 place count 417 transition count 939
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 417 transition count 939
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 411 transition count 933
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 411 transition count 933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 409 transition count 931
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 409 transition count 931
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 60 place count 398 transition count 920
Applied a total of 60 rules in 72 ms. Remains 398 /428 variables (removed 30) and now considering 920/950 (removed 30) transitions.
// Phase 1: matrix 920 rows 398 cols
[2024-06-12 18:12:47] [INFO ] Computed 45 invariants in 16 ms
[2024-06-12 18:12:47] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-06-12 18:12:47] [INFO ] Invariant cache hit.
[2024-06-12 18:12:49] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 2388 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 398/883 places, 920/1346 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3391 ms. Remains : 398/883 places, 920/1346 transitions.
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-04
Product exploration explored 100000 steps with 1791 reset in 345 ms.
Product exploration explored 100000 steps with 1803 reset in 340 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 520 steps (9 resets) in 5 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 196 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 93 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 398 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 920/920 transitions.
Applied a total of 0 rules in 19 ms. Remains 398 /398 variables (removed 0) and now considering 920/920 (removed 0) transitions.
[2024-06-12 18:12:50] [INFO ] Invariant cache hit.
[2024-06-12 18:12:51] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-06-12 18:12:51] [INFO ] Invariant cache hit.
[2024-06-12 18:12:53] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2587 ms to find 0 implicit places.
[2024-06-12 18:12:53] [INFO ] Redundant transitions in 25 ms returned []
Running 894 sub problems to find dead transitions.
[2024-06-12 18:12:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 397/1318 variables, and 39 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/9 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 894/894 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 894 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 3 (OVERLAPS) 1/398 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 894 unsolved
[2024-06-12 18:13:45] [INFO ] Deduced a trap composed of 95 places in 349 ms of which 8 ms to minimize.
[2024-06-12 18:13:46] [INFO ] Deduced a trap composed of 83 places in 521 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/1318 variables, and 47 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 0/894 constraints, Known Traps: 2/2 constraints]
After SMT, in 60807ms problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 60823ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63465 ms. Remains : 398/398 places, 920/920 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 167 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 200 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 589 steps (7 resets) in 6 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 155 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1834 reset in 322 ms.
Product exploration explored 100000 steps with 1766 reset in 368 ms.
Built C files in :
/tmp/ltsmin3850480987116086362
[2024-06-12 18:13:55] [INFO ] Computing symmetric may disable matrix : 920 transitions.
[2024-06-12 18:13:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:13:55] [INFO ] Computing symmetric may enable matrix : 920 transitions.
[2024-06-12 18:13:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:13:56] [INFO ] Computing Do-Not-Accords matrix : 920 transitions.
[2024-06-12 18:13:56] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:13:56] [INFO ] Built C files in 256ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3850480987116086362
Running compilation step : cd /tmp/ltsmin3850480987116086362;'/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/ltsmin3850480987116086362;'/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/ltsmin3850480987116086362;'/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 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 920/920 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 398 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 397 transition count 919
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 397 transition count 918
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 396 transition count 918
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 395 transition count 917
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 395 transition count 917
Applied a total of 6 rules in 23 ms. Remains 395 /398 variables (removed 3) and now considering 917/920 (removed 3) transitions.
// Phase 1: matrix 917 rows 395 cols
[2024-06-12 18:13:59] [INFO ] Computed 45 invariants in 13 ms
[2024-06-12 18:13:59] [INFO ] Implicit Places using invariants in 760 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 763 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/398 places, 917/920 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 393 transition count 916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 392 transition count 915
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 392 transition count 915
Applied a total of 4 rules in 41 ms. Remains 392 /394 variables (removed 2) and now considering 915/917 (removed 2) transitions.
// Phase 1: matrix 915 rows 392 cols
[2024-06-12 18:14:00] [INFO ] Computed 44 invariants in 11 ms
[2024-06-12 18:14:00] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-06-12 18:14:00] [INFO ] Invariant cache hit.
[2024-06-12 18:14:02] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 2610 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 392/398 places, 915/920 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3441 ms. Remains : 392/398 places, 915/920 transitions.
Built C files in :
/tmp/ltsmin14148833457061969097
[2024-06-12 18:14:02] [INFO ] Computing symmetric may disable matrix : 915 transitions.
[2024-06-12 18:14:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:14:02] [INFO ] Computing symmetric may enable matrix : 915 transitions.
[2024-06-12 18:14:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:14:02] [INFO ] Computing Do-Not-Accords matrix : 915 transitions.
[2024-06-12 18:14:02] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:14:02] [INFO ] Built C files in 255ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14148833457061969097
Running compilation step : cd /tmp/ltsmin14148833457061969097;'/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/ltsmin14148833457061969097;'/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/ltsmin14148833457061969097;'/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-06-12 18:14:05] [INFO ] Flatten gal took : 29 ms
[2024-06-12 18:14:06] [INFO ] Flatten gal took : 50 ms
[2024-06-12 18:14:06] [INFO ] Time to serialize gal into /tmp/LTL14933272899537476085.gal : 8 ms
[2024-06-12 18:14:06] [INFO ] Time to serialize properties into /tmp/LTL13683541907196683159.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/LTL14933272899537476085.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11182209712864205712.hoa' '-atoms' '/tmp/LTL13683541907196683159.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...320
Loading property file /tmp/LTL13683541907196683159.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11182209712864205712.hoa
Detected timeout of ITS tools.
[2024-06-12 18:14:21] [INFO ] Flatten gal took : 31 ms
[2024-06-12 18:14:21] [INFO ] Flatten gal took : 26 ms
[2024-06-12 18:14:21] [INFO ] Time to serialize gal into /tmp/LTL17561462192392788418.gal : 4 ms
[2024-06-12 18:14:21] [INFO ] Time to serialize properties into /tmp/LTL13619501982880624551.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/LTL17561462192392788418.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13619501982880624551.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 : !((X(X((F("((p321==0)||(p372==1))"))&&(G(F("((p746==0)||(p45==1))")))))))
Formula 0 simplified : XX(G!"((p321==0)||(p372==1))" | FG!"((p746==0)||(p45==1))")
Detected timeout of ITS tools.
[2024-06-12 18:14:36] [INFO ] Flatten gal took : 26 ms
[2024-06-12 18:14:36] [INFO ] Applying decomposition
[2024-06-12 18:14:36] [INFO ] Flatten gal took : 27 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/graph18418594543967341333.txt' '-o' '/tmp/graph18418594543967341333.bin' '-w' '/tmp/graph18418594543967341333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18418594543967341333.bin' '-l' '-1' '-v' '-w' '/tmp/graph18418594543967341333.weights' '-q' '0' '-e' '0.001'
[2024-06-12 18:14:36] [INFO ] Decomposing Gal with order
[2024-06-12 18:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-12 18:14:36] [INFO ] Removed a total of 1829 redundant transitions.
[2024-06-12 18:14:36] [INFO ] Flatten gal took : 55 ms
[2024-06-12 18:14:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 8 ms.
[2024-06-12 18:14:36] [INFO ] Time to serialize gal into /tmp/LTL9959898147499489389.gal : 6 ms
[2024-06-12 18:14:36] [INFO ] Time to serialize properties into /tmp/LTL1221964943779030400.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/LTL9959898147499489389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1221964943779030400.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...254
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((i4.u44.p321==0)||(i4.u45.p372==1))"))&&(G(F("((i7.u83.p746==0)||(i2.u12.p45==1))")))))))
Formula 0 simplified : XX(G!"((i4.u44.p321==0)||(i4.u45.p372==1))" | FG!"((i7.u83.p746==0)||(i2.u12.p45==1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-04a-LTLCardinality-04 finished in 126040 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||F(p1))))'
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((X(X(X(F(p1))))||p0))))'
[2024-06-12 18:14:51] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17310751224162861520
[2024-06-12 18:14:51] [INFO ] Computing symmetric may disable matrix : 1346 transitions.
[2024-06-12 18:14:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:14:51] [INFO ] Computing symmetric may enable matrix : 1346 transitions.
[2024-06-12 18:14:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:14:51] [INFO ] Applying decomposition
[2024-06-12 18:14:51] [INFO ] Flatten gal took : 43 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/graph15024443990451310299.txt' '-o' '/tmp/graph15024443990451310299.bin' '-w' '/tmp/graph15024443990451310299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15024443990451310299.bin' '-l' '-1' '-v' '-w' '/tmp/graph15024443990451310299.weights' '-q' '0' '-e' '0.001'
[2024-06-12 18:14:51] [INFO ] Decomposing Gal with order
[2024-06-12 18:14:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-12 18:14:52] [INFO ] Removed a total of 1850 redundant transitions.
[2024-06-12 18:14:52] [INFO ] Computing Do-Not-Accords matrix : 1346 transitions.
[2024-06-12 18:14:52] [INFO ] Flatten gal took : 119 ms
[2024-06-12 18:14:52] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-12 18:14:52] [INFO ] Built C files in 454ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17310751224162861520
Running compilation step : cd /tmp/ltsmin17310751224162861520;'/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-06-12 18:14:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 30 ms.
[2024-06-12 18:14:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality2764774730640236807.gal : 13 ms
[2024-06-12 18:14:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality5613067262161815256.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2764774730640236807.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5613067262161815256.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...276
Read 3 LTL properties
Checking formula 0 : !((X(X((F("((i6.i0.u91.p321==0)||(i7.i0.u79.p372==1))"))&&(G(F("((i13.i0.u208.p746==0)||(i1.u15.p45==1))")))))))
Formula 0 simplified : XX(G!"((i6.i0.u91.p321==0)||(i7.i0.u79.p372==1))" | FG!"((i13.i0.u208.p746==0)||(i1.u15.p45==1))")
Compilation finished in 9292 ms.
Running link step : cd /tmp/ltsmin17310751224162861520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 106 ms.
Running LTSmin : cd /tmp/ltsmin17310751224162861520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp0==true))&&[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17310751224162861520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp0==true))&&[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17310751224162861520;'/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' '[](((LTLAPp2==true)||<>((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17310751224162861520;'/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' '[](((LTLAPp2==true)||<>((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17310751224162861520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(X(X(<>((LTLAPp5==true)))))||(LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17310751224162861520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(X(X(<>((LTLAPp5==true)))))||(LTLAPp4==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin17310751224162861520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp0==true))&&[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 9146 ms.
FORMULA ASLink-PT-04a-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin17310751224162861520;'/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' '[](((LTLAPp2==true)||<>((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-06-12 18:38:30] [INFO ] Applying decomposition
[2024-06-12 18:38:30] [INFO ] Flatten gal took : 95 ms
[2024-06-12 18:38:30] [INFO ] Decomposing Gal with order
[2024-06-12 18:38:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-12 18:38:31] [INFO ] Removed a total of 1533 redundant transitions.
[2024-06-12 18:38:31] [INFO ] Flatten gal took : 262 ms
[2024-06-12 18:38:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 562 labels/synchronizations in 74 ms.
[2024-06-12 18:38:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality12469062831376790159.gal : 23 ms
[2024-06-12 18:38:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality2910454569643938984.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/LTLCardinality12469062831376790159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2910454569643938984.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(("((i5.u18.p150==0)&&(i5.i1.u199.p105==1))")||(F("((u109.p628==0)||(i13.u64.p391==1))")))))
Formula 0 simplified : F(!"((i5.u18.p150==0)&&(i5.i1.u199.p105==1))" & G!"((u109.p628==0)||(i13.u64.p391==1))")
Reverse transition relation is NOT exact ! Due to transitions t798, t948, t1003, t1008, t1009, t1012, t1017, t1029, t1038, t1091, t1114, t1167, t1190, t124...729
Computing Next relation with stutter on 1.48321e+11 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
38568 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,385.787,2682240,1,0,6.00037e+06,13663,2101,6.55581e+06,470,56326,2952674
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ASLink-PT-04a-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(("((i36.u177.p987==0)||(i29.u134.p780==1))")||(X(X(X(F("((i5.u8.p99!=0)&&(i29.u118.p715!=1))")))))))))
Formula 1 simplified : G(F!"((i36.u177.p987==0)||(i29.u134.p780==1))" & FG!"((i5.u8.p99!=0)&&(i29.u118.p715!=1))")
Computing Next relation with stutter on 1.48321e+11 deadlock states
Detected timeout of ITS tools.
[2024-06-12 19:02:10] [INFO ] Flatten gal took : 132 ms
[2024-06-12 19:02:10] [INFO ] Input system was already deterministic with 1346 transitions.
[2024-06-12 19:02:10] [INFO ] Transformed 883 places.
[2024-06-12 19:02:10] [INFO ] Transformed 1346 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-12 19:02:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality8364126757649677245.gal : 32 ms
[2024-06-12 19:02:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality4377453125506906954.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/LTLCardinality8364126757649677245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4377453125506906954.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("((p987==0)||(p780==1))")||(X(X(X(F("((p99!=0)&&(p715!=1))")))))))))
Formula 0 simplified : G(F!"((p987==0)||(p780==1))" & FG!"((p99!=0)&&(p715!=1))")

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="ASLink-PT-04a"
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 ASLink-PT-04a, 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 r004-smll-171620117700059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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