About the Execution of LTSMin+red for DLCshifumi-PT-3a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
587.731 | 479012.00 | 648831.00 | 7515.50 | FTFTFFFTFTFTTFFF | normal |
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.r484-smll-171624275700307.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 ltsminxred
Input is DLCshifumi-PT-3a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275700307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 13 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 13 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 778K 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 DLCshifumi-PT-3a-LTLCardinality-00
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-01
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-02
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-03
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-04
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-05
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-06
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-07
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-08
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-09
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-10
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-11
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-12
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-13
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-14
FORMULA_NAME DLCshifumi-PT-3a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717240744164
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-3a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:19:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:19:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:19:08] [INFO ] Load time of PNML (sax parser for PT used): 544 ms
[2024-06-01 11:19:08] [INFO ] Transformed 544 places.
[2024-06-01 11:19:08] [INFO ] Transformed 3097 transitions.
[2024-06-01 11:19:08] [INFO ] Found NUPN structural information;
[2024-06-01 11:19:08] [INFO ] Parsed PT model containing 544 places and 3097 transitions and 11545 arcs in 823 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 405 transitions
Reduce redundant transitions removed 405 transitions.
FORMULA DLCshifumi-PT-3a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 2692/2692 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 468 transition count 2154
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 468 transition count 2154
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 184 place count 468 transition count 2122
Drop transitions (Redundant composition of simpler transitions.) removed 603 transitions
Redundant transition composition rules discarded 603 transitions
Iterating global reduction 1 with 603 rules applied. Total rules applied 787 place count 468 transition count 1519
Applied a total of 787 rules in 323 ms. Remains 468 /544 variables (removed 76) and now considering 1519/2692 (removed 1173) transitions.
[2024-06-01 11:19:09] [INFO ] Flow matrix only has 332 transitions (discarded 1187 similar events)
// Phase 1: matrix 332 rows 468 cols
[2024-06-01 11:19:09] [INFO ] Computed 282 invariants in 38 ms
[2024-06-01 11:19:12] [INFO ] Implicit Places using invariants in 3067 ms returned [228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 240, 241, 242, 243, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 268, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 387, 388, 389, 390, 391, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467]
Discarding 231 places :
Ensure Unique test removed 1049 transitions
Reduce isomorphic transitions removed 1049 transitions.
Implicit Place search using SMT only with invariants took 3146 ms to find 231 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/544 places, 470/2692 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 41 place count 237 transition count 429
Applied a total of 41 rules in 20 ms. Remains 237 /237 variables (removed 0) and now considering 429/470 (removed 41) transitions.
[2024-06-01 11:19:12] [INFO ] Flow matrix only has 332 transitions (discarded 97 similar events)
// Phase 1: matrix 332 rows 237 cols
[2024-06-01 11:19:12] [INFO ] Computed 51 invariants in 4 ms
[2024-06-01 11:19:12] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 11:19:12] [INFO ] Flow matrix only has 332 transitions (discarded 97 similar events)
[2024-06-01 11:19:12] [INFO ] Invariant cache hit.
[2024-06-01 11:19:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:19:12] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/544 places, 429/2692 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3994 ms. Remains : 237/544 places, 429/2692 transitions.
Support contains 26 out of 237 places after structural reductions.
[2024-06-01 11:19:13] [INFO ] Flatten gal took : 75 ms
[2024-06-01 11:19:13] [INFO ] Flatten gal took : 29 ms
[2024-06-01 11:19:13] [INFO ] Input system was already deterministic with 429 transitions.
RANDOM walk for 40000 steps (8 resets) in 2923 ms. (13 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
[2024-06-01 11:19:14] [INFO ] Flow matrix only has 332 transitions (discarded 97 similar events)
[2024-06-01 11:19:14] [INFO ] Invariant cache hit.
[2024-06-01 11:19:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 230/237 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/568 variables, 237/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/569 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/569 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 237/237 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Int declared 7/569 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/51 constraints, State Equation: 0/237 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 492ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 10 stabilizing places and 1 stable transitions
Graph (complete) has 479 edges and 237 vertex of which 228 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.12 ms
FORMULA DLCshifumi-PT-3a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 429/429 transitions.
Graph (trivial) has 425 edges and 237 vertex of which 226 / 237 are part of one of the 42 SCC in 6 ms
Free SCC test removed 184 places
Ensure Unique test removed 383 transitions
Reduce isomorphic transitions removed 383 transitions.
Graph (complete) has 96 edges and 53 vertex of which 45 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 42 place count 5 transition count 6
Iterating global reduction 0 with 40 rules applied. Total rules applied 82 place count 5 transition count 6
Applied a total of 82 rules in 28 ms. Remains 5 /237 variables (removed 232) and now considering 6/429 (removed 423) transitions.
[2024-06-01 11:19:15] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
// Phase 1: matrix 4 rows 5 cols
[2024-06-01 11:19:15] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 11:19:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 11:19:15] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-06-01 11:19:15] [INFO ] Invariant cache hit.
[2024-06-01 11:19:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:19:15] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 11:19:15] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 11:19:15] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-06-01 11:19:15] [INFO ] Invariant cache hit.
[2024-06-01 11:19:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 246ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/237 places, 6/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 5/237 places, 6/429 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA DLCshifumi-PT-3a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLCardinality-00 finished in 769 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)))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 429/429 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 229 transition count 429
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 222 transition count 415
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 222 transition count 415
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 29 place count 222 transition count 408
Applied a total of 29 rules in 22 ms. Remains 222 /237 variables (removed 15) and now considering 408/429 (removed 21) transitions.
[2024-06-01 11:19:15] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
// Phase 1: matrix 318 rows 222 cols
[2024-06-01 11:19:15] [INFO ] Computed 43 invariants in 3 ms
[2024-06-01 11:19:15] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 11:19:15] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
[2024-06-01 11:19:15] [INFO ] Invariant cache hit.
[2024-06-01 11:19:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:19:16] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2024-06-01 11:19:16] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
[2024-06-01 11:19:16] [INFO ] Invariant cache hit.
[2024-06-01 11:19:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 1/222 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (OVERLAPS) 317/539 variables, 222/265 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (OVERLAPS) 1/540 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/540 variables, and 266 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 222/222 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 1/222 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (OVERLAPS) 317/539 variables, 222/265 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 407/672 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (OVERLAPS) 1/540 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 673 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 222/222 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60299ms
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 408/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60742 ms. Remains : 222/237 places, 408/429 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 1251 ms.
Product exploration explored 100000 steps with 50000 reset in 738 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 450 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-3a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-3a-LTLCardinality-03 finished in 62903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 429/429 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 229 transition count 429
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 222 transition count 415
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 222 transition count 415
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 28 place count 222 transition count 409
Applied a total of 28 rules in 9 ms. Remains 222 /237 variables (removed 15) and now considering 409/429 (removed 20) transitions.
[2024-06-01 11:20:18] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
// Phase 1: matrix 319 rows 222 cols
[2024-06-01 11:20:18] [INFO ] Computed 43 invariants in 6 ms
[2024-06-01 11:20:18] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 11:20:18] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
[2024-06-01 11:20:18] [INFO ] Invariant cache hit.
[2024-06-01 11:20:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:20:19] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 408 sub problems to find dead transitions.
[2024-06-01 11:20:19] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
[2024-06-01 11:20:19] [INFO ] Invariant cache hit.
[2024-06-01 11:20:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 1/222 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 318/540 variables, 222/265 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (OVERLAPS) 1/541 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 266 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 222/222 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 1/222 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 318/540 variables, 222/265 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 408/673 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (OVERLAPS) 1/541 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 674 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 222/222 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 409/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60555 ms. Remains : 222/237 places, 409/429 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLCardinality-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLCardinality-04 finished in 60855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U X(X(G(p0))))))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 429/429 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 229 transition count 429
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 222 transition count 415
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 222 transition count 415
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 28 place count 222 transition count 409
Applied a total of 28 rules in 15 ms. Remains 222 /237 variables (removed 15) and now considering 409/429 (removed 20) transitions.
[2024-06-01 11:21:19] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
// Phase 1: matrix 319 rows 222 cols
[2024-06-01 11:21:19] [INFO ] Computed 43 invariants in 4 ms
[2024-06-01 11:21:19] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 11:21:19] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
[2024-06-01 11:21:19] [INFO ] Invariant cache hit.
[2024-06-01 11:21:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:21:19] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 408 sub problems to find dead transitions.
[2024-06-01 11:21:19] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
[2024-06-01 11:21:19] [INFO ] Invariant cache hit.
[2024-06-01 11:21:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 1/222 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 318/540 variables, 222/265 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (OVERLAPS) 1/541 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 266 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 222/222 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 1/222 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 318/540 variables, 222/265 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 408/673 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (OVERLAPS) 1/541 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 674 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 222/222 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 409/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60595 ms. Remains : 222/237 places, 409/429 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-3a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLCardinality-05 finished in 60842 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((G(p0) U (p1&&G(F(p1)))))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 429/429 transitions.
Graph (trivial) has 420 edges and 237 vertex of which 223 / 237 are part of one of the 42 SCC in 1 ms
Free SCC test removed 181 places
Ensure Unique test removed 377 transitions
Reduce isomorphic transitions removed 377 transitions.
Graph (complete) has 102 edges and 56 vertex of which 48 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 40 place count 10 transition count 14
Iterating global reduction 0 with 38 rules applied. Total rules applied 78 place count 10 transition count 14
Applied a total of 78 rules in 14 ms. Remains 10 /237 variables (removed 227) and now considering 14/429 (removed 415) transitions.
[2024-06-01 11:22:20] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
// Phase 1: matrix 9 rows 10 cols
[2024-06-01 11:22:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 11:22:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 11:22:20] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
[2024-06-01 11:22:20] [INFO ] Invariant cache hit.
[2024-06-01 11:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:22:20] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-01 11:22:20] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 11:22:20] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
[2024-06-01 11:22:20] [INFO ] Invariant cache hit.
[2024-06-01 11:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 8/18 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 13 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 8/18 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/19 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/19 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 29 constraints, problems are : Problem set: 0 solved, 13 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 426ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/237 places, 14/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 10/237 places, 14/429 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLCardinality-06 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||G(p1))))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 429/429 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 229 transition count 429
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 16 place count 221 transition count 413
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 221 transition count 413
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 31 place count 221 transition count 406
Applied a total of 31 rules in 10 ms. Remains 221 /237 variables (removed 16) and now considering 406/429 (removed 23) transitions.
[2024-06-01 11:22:21] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
// Phase 1: matrix 317 rows 221 cols
[2024-06-01 11:22:21] [INFO ] Computed 43 invariants in 2 ms
[2024-06-01 11:22:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 11:22:21] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-06-01 11:22:21] [INFO ] Invariant cache hit.
[2024-06-01 11:22:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:22:21] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2024-06-01 11:22:21] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-06-01 11:22:21] [INFO ] Invariant cache hit.
[2024-06-01 11:22:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 316/537 variables, 221/264 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (OVERLAPS) 1/538 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/538 variables, and 265 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 316/537 variables, 221/264 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 405/669 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 8 (OVERLAPS) 1/538 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 10 (OVERLAPS) 0/538 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 405 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 670 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 221/237 places, 406/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60441 ms. Remains : 221/237 places, 406/429 transitions.
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLCardinality-11
Product exploration explored 100000 steps with 19984 reset in 1270 ms.
Product exploration explored 100000 steps with 20042 reset in 898 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 448 edges and 221 vertex of which 220 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/221 stabilizing places and 1/406 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (8 resets) in 762 ms. (52 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
[2024-06-01 11:23:24] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-06-01 11:23:24] [INFO ] Invariant cache hit.
[2024-06-01 11:23:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 7/538 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 2/43 constraints, State Equation: 0/221 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 394 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:23:25] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-06-01 11:23:25] [INFO ] Invariant cache hit.
[2024-06-01 11:23:26] [INFO ] [Real]Absence check using 43 positive place invariants in 20 ms returned sat
[2024-06-01 11:23:26] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-06-01 11:23:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:23:26] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-06-01 11:23:26] [INFO ] Computed and/alt/rep : 315/642/315 causal constraints (skipped 1 transitions) in 42 ms.
[2024-06-01 11:23:26] [INFO ] Added : 0 causal constraints over 0 iterations in 95 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 221 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 406/406 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-06-01 11:23:26] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-06-01 11:23:26] [INFO ] Invariant cache hit.
[2024-06-01 11:23:26] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 11:23:26] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-06-01 11:23:26] [INFO ] Invariant cache hit.
[2024-06-01 11:23:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:23:26] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2024-06-01 11:23:26] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-06-01 11:23:26] [INFO ] Invariant cache hit.
[2024-06-01 11:23:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 316/537 variables, 221/264 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (OVERLAPS) 1/538 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/538 variables, and 265 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 316/537 variables, 221/264 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 405/669 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 8 (OVERLAPS) 1/538 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 10 (OVERLAPS) 0/538 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 405 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 670 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in LTL mode , in 1 iterations and 60533 ms. Remains : 221/221 places, 406/406 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 448 edges and 221 vertex of which 220 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/221 stabilizing places and 1/406 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:24:28] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-06-01 11:24:28] [INFO ] Invariant cache hit.
[2024-06-01 11:24:28] [INFO ] [Real]Absence check using 43 positive place invariants in 15 ms returned sat
[2024-06-01 11:24:28] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-06-01 11:24:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:24:28] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-06-01 11:24:28] [INFO ] Computed and/alt/rep : 315/642/315 causal constraints (skipped 1 transitions) in 36 ms.
[2024-06-01 11:24:28] [INFO ] Added : 0 causal constraints over 0 iterations in 80 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 749 ms.
Product exploration explored 100000 steps with 0 reset in 744 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 406/406 transitions.
Graph (trivial) has 405 edges and 221 vertex of which 219 / 221 are part of one of the 42 SCC in 2 ms
Free SCC test removed 177 places
Ensure Unique test removed 363 transitions
Reduce isomorphic transitions removed 363 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 3 transition count 2
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 3 transition count 2
Applied a total of 83 rules in 8 ms. Remains 3 /221 variables (removed 218) and now considering 2/406 (removed 404) transitions.
[2024-06-01 11:24:30] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
// Phase 1: matrix 2 rows 3 cols
[2024-06-01 11:24:30] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 11:24:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/221 places, 2/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 3/221 places, 2/406 transitions.
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 406/406 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-06-01 11:24:30] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
// Phase 1: matrix 317 rows 221 cols
[2024-06-01 11:24:30] [INFO ] Computed 43 invariants in 3 ms
[2024-06-01 11:24:31] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 11:24:31] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-06-01 11:24:31] [INFO ] Invariant cache hit.
[2024-06-01 11:24:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:24:31] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2024-06-01 11:24:31] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-06-01 11:24:31] [INFO ] Invariant cache hit.
[2024-06-01 11:24:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 316/537 variables, 221/264 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (OVERLAPS) 1/538 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/538 variables, and 265 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 316/537 variables, 221/264 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 405/669 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 8 (OVERLAPS) 1/538 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/538 variables, and 670 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in LTL mode , in 1 iterations and 60526 ms. Remains : 221/221 places, 406/406 transitions.
Treatment of property DLCshifumi-PT-3a-LTLCardinality-11 finished in 190494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 429/429 transitions.
Graph (trivial) has 426 edges and 237 vertex of which 225 / 237 are part of one of the 42 SCC in 2 ms
Free SCC test removed 183 places
Ensure Unique test removed 383 transitions
Reduce isomorphic transitions removed 383 transitions.
Graph (complete) has 96 edges and 54 vertex of which 45 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 3 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 84 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 2 transition count 3
Applied a total of 86 rules in 14 ms. Remains 2 /237 variables (removed 235) and now considering 3/429 (removed 426) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 11:25:31] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 11:25:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 11:25:31] [INFO ] Invariant cache hit.
[2024-06-01 11:25:31] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-06-01 11:25:31] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 11:25:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/237 places, 3/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 2/237 places, 3/429 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-3a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLCardinality-13 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X(p2))))))'
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 429/429 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 229 transition count 429
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 223 transition count 417
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 223 transition count 417
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 25 place count 223 transition count 412
Applied a total of 25 rules in 21 ms. Remains 223 /237 variables (removed 14) and now considering 412/429 (removed 17) transitions.
[2024-06-01 11:25:31] [INFO ] Flow matrix only has 321 transitions (discarded 91 similar events)
// Phase 1: matrix 321 rows 223 cols
[2024-06-01 11:25:31] [INFO ] Computed 43 invariants in 3 ms
[2024-06-01 11:25:31] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 11:25:31] [INFO ] Flow matrix only has 321 transitions (discarded 91 similar events)
[2024-06-01 11:25:31] [INFO ] Invariant cache hit.
[2024-06-01 11:25:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:25:32] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2024-06-01 11:25:32] [INFO ] Flow matrix only has 321 transitions (discarded 91 similar events)
[2024-06-01 11:25:32] [INFO ] Invariant cache hit.
[2024-06-01 11:25:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (OVERLAPS) 320/543 variables, 223/266 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (OVERLAPS) 1/544 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 544/544 variables, and 267 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 223/223 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (OVERLAPS) 320/543 variables, 223/266 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 411/677 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (OVERLAPS) 1/544 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/544 variables, and 678 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 223/223 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 223/237 places, 412/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60543 ms. Remains : 223/237 places, 412/429 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DLCshifumi-PT-3a-LTLCardinality-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLCardinality-14 finished in 60711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 429/429 transitions.
Graph (trivial) has 426 edges and 237 vertex of which 226 / 237 are part of one of the 42 SCC in 2 ms
Free SCC test removed 184 places
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Graph (complete) has 95 edges and 53 vertex of which 44 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 2 transition count 3
Applied a total of 84 rules in 6 ms. Remains 2 /237 variables (removed 235) and now considering 3/429 (removed 426) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 11:26:32] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 11:26:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 11:26:32] [INFO ] Invariant cache hit.
[2024-06-01 11:26:32] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 11:26:32] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 11:26:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/237 places, 3/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 2/237 places, 3/429 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLCardinality-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-3a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLCardinality-15 finished in 272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||G(p1))))'
[2024-06-01 11:26:33] [INFO ] Flatten gal took : 34 ms
[2024-06-01 11:26:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 11:26:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 429 transitions and 908 arcs took 12 ms.
Total runtime 445430 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DLCshifumi-PT-3a-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717241223176
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name DLCshifumi-PT-3a-LTLCardinality-11
ltl formula formula --ltl=/tmp/1075/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 237 places, 429 transitions and 908 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1075/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1075/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1075/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1075/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 230 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 238, there are 475 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~846176 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~1598860 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~3122432 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~6237420 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~12420020 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~24825644 transitions
pnml2lts-mc( 3/ 4): ~160000 levels ~640000 states ~49437732 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 684420
pnml2lts-mc( 0/ 4): unique transitions count: 55515744
pnml2lts-mc( 0/ 4): - self-loop count: 14176925
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 3627907
pnml2lts-mc( 0/ 4): - claim success count: 684428
pnml2lts-mc( 0/ 4): - cum. max stack depth: 684428
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 684428 states 55516517 transitions, fanout: 81.114
pnml2lts-mc( 0/ 4): Total exploration time 29.300 sec (28.690 sec minimum, 28.965 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23359, Transitions per second: 1894762
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 268.5MB, 8.4 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/19.0%
pnml2lts-mc( 0/ 4): Stored 432 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 268.5MB (~256.0MB paged-in)
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="DLCshifumi-PT-3a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DLCshifumi-PT-3a, 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 r484-smll-171624275700307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-3a.tgz
mv DLCshifumi-PT-3a 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 '
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 ;