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.r179-tall-171640600700043.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 greatspnxred
Input is FlexibleBarrier-PT-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600700043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K 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 49K 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.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 241K 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 FlexibleBarrier-PT-08b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716417139063

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:32:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 22:32:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:32:20] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-22 22:32:20] [INFO ] Transformed 920 places.
[2024-05-22 22:32:20] [INFO ] Transformed 1057 transitions.
[2024-05-22 22:32:20] [INFO ] Found NUPN structural information;
[2024-05-22 22:32:20] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 323 places :
Symmetric choice reduction at 0 with 323 rule applications. Total rules 323 place count 597 transition count 734
Iterating global reduction 0 with 323 rules applied. Total rules applied 646 place count 597 transition count 734
Discarding 142 places :
Symmetric choice reduction at 0 with 142 rule applications. Total rules 788 place count 455 transition count 592
Iterating global reduction 0 with 142 rules applied. Total rules applied 930 place count 455 transition count 592
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 1011 place count 374 transition count 511
Iterating global reduction 0 with 81 rules applied. Total rules applied 1092 place count 374 transition count 511
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 1128 place count 374 transition count 475
Applied a total of 1128 rules in 152 ms. Remains 374 /920 variables (removed 546) and now considering 475/1057 (removed 582) transitions.
// Phase 1: matrix 475 rows 374 cols
[2024-05-22 22:32:20] [INFO ] Computed 10 invariants in 24 ms
[2024-05-22 22:32:21] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-22 22:32:21] [INFO ] Invariant cache hit.
[2024-05-22 22:32:21] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2024-05-22 22:32:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/374 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 22:32:27] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 23 ms to minimize.
[2024-05-22 22:32:27] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-22 22:32:27] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 22:32:32] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (OVERLAPS) 475/849 variables, 374/388 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 474 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 849/849 variables, and 388 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/374 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 475/849 variables, 374/388 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 474/862 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 22:32:59] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 3 ms to minimize.
[2024-05-22 22:32:59] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 22:33:00] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 3 ms to minimize.
[2024-05-22 22:33:00] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-22 22:33:00] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:33:01] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 3 ms to minimize.
[2024-05-22 22:33:02] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-05-22 22:33:03] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-05-22 22:33:03] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-22 22:33:05] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:33:06] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:33:07] [INFO ] Deduced a trap composed of 264 places in 107 ms of which 2 ms to minimize.
[2024-05-22 22:33:07] [INFO ] Deduced a trap composed of 260 places in 109 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 13/875 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 22:33:14] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-22 22:33:15] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 849/849 variables, and 877 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 19/19 constraints]
After SMT, in 60273ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in LTL mode, iteration 1 : 374/920 places, 475/1057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61115 ms. Remains : 374/920 places, 475/1057 transitions.
Support contains 30 out of 374 places after structural reductions.
[2024-05-22 22:33:21] [INFO ] Flatten gal took : 58 ms
[2024-05-22 22:33:21] [INFO ] Flatten gal took : 28 ms
[2024-05-22 22:33:22] [INFO ] Input system was already deterministic with 475 transitions.
Support contains 28 out of 374 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (617 resets) in 1718 ms. (23 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40004 steps (80 resets) in 266 ms. (149 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (79 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (81 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (79 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (80 resets) in 95 ms. (416 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (97 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
[2024-05-22 22:33:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 318/331 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 43/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 475/849 variables, 374/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/849 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 384 constraints, problems are : Problem set: 0 solved, 6 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 318/331 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 22:33:23] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 43/374 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 475/849 variables, 374/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/849 variables, 6/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/849 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 391 constraints, problems are : Problem set: 0 solved, 6 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1087ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 10270 steps, including 138 resets, run visited all 6 properties in 108 ms. (steps per millisecond=95 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 115 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 12 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(!p0) U p1))))'
Support contains 3 out of 374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 374/374 places, 475/475 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 354 transition count 455
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 354 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 354 transition count 454
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 340 transition count 440
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 340 transition count 440
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 340 transition count 433
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 335 transition count 428
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 335 transition count 428
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 335 transition count 426
Applied a total of 88 rules in 43 ms. Remains 335 /374 variables (removed 39) and now considering 426/475 (removed 49) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-22 22:33:24] [INFO ] Computed 10 invariants in 9 ms
[2024-05-22 22:33:24] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 22:33:24] [INFO ] Invariant cache hit.
[2024-05-22 22:33:24] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-22 22:33:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/761 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 0/761 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 761/761 variables, and 345 constraints, problems are : Problem set: 0 solved, 425 unsolved in 19450 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/761 variables, 425/770 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:33:51] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-05-22 22:33:52] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-22 22:33:52] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:33:53] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:33:53] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-22 22:33:54] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:33:55] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:33:55] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-05-22 22:33:56] [INFO ] Deduced a trap composed of 251 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:33:56] [INFO ] Deduced a trap composed of 254 places in 100 ms of which 3 ms to minimize.
[2024-05-22 22:33:57] [INFO ] Deduced a trap composed of 278 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/761 variables, 11/781 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 781 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 11/11 constraints]
After SMT, in 49608ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 49615ms
Starting structural reductions in LTL mode, iteration 1 : 335/374 places, 426/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50129 ms. Remains : 335/374 places, 426/475 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p1), (NOT p1), p0]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-01
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-01 finished in 50490 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(p1)&&p0)))||F((p2||G(p3))))))'
Support contains 6 out of 374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 374/374 places, 475/475 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 356 transition count 457
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 356 transition count 457
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 356 transition count 456
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 343 transition count 443
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 343 transition count 443
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 343 transition count 435
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 340 transition count 432
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 340 transition count 432
Applied a total of 77 rules in 44 ms. Remains 340 /374 variables (removed 34) and now considering 432/475 (removed 43) transitions.
// Phase 1: matrix 432 rows 340 cols
[2024-05-22 22:34:14] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 22:34:15] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 22:34:15] [INFO ] Invariant cache hit.
[2024-05-22 22:34:15] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-22 22:34:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (OVERLAPS) 432/772 variables, 340/350 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/772 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (OVERLAPS) 0/772 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 431 unsolved
No progress, stopping.
After SMT solving in domain Real declared 772/772 variables, and 350 constraints, problems are : Problem set: 0 solved, 431 unsolved in 20129 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (OVERLAPS) 432/772 variables, 340/350 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/772 variables, 431/781 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-22 22:34:42] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:34:42] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-05-22 22:34:43] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-05-22 22:34:44] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:34:44] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-05-22 22:34:45] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:34:46] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:34:47] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-05-22 22:34:48] [INFO ] Deduced a trap composed of 254 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:34:48] [INFO ] Deduced a trap composed of 255 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 10/791 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-22 22:35:00] [INFO ] Deduced a trap composed of 256 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/772 variables, and 792 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 11/11 constraints]
After SMT, in 50306ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 50310ms
Starting structural reductions in LTL mode, iteration 1 : 340/374 places, 432/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50784 ms. Remains : 340/374 places, 432/475 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-02
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-02 finished in 51056 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 374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 374/374 places, 475/475 transitions.
Graph (trivial) has 347 edges and 374 vertex of which 50 / 374 are part of one of the 8 SCC in 3 ms
Free SCC test removed 42 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 331 transition count 380
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 280 transition count 380
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 103 place count 280 transition count 362
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 139 place count 262 transition count 362
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 172 place count 229 transition count 329
Iterating global reduction 2 with 33 rules applied. Total rules applied 205 place count 229 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 229 transition count 328
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 206 place count 229 transition count 327
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 228 transition count 327
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 212 place count 224 transition count 323
Iterating global reduction 3 with 4 rules applied. Total rules applied 216 place count 224 transition count 323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 220 place count 224 transition count 319
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 318 place count 175 transition count 270
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 325 place count 168 transition count 263
Iterating global reduction 4 with 7 rules applied. Total rules applied 332 place count 168 transition count 263
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 339 place count 168 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 347 place count 168 transition count 248
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 349 place count 166 transition count 246
Applied a total of 349 rules in 174 ms. Remains 166 /374 variables (removed 208) and now considering 246/475 (removed 229) transitions.
[2024-05-22 22:35:06] [INFO ] Flow matrix only has 231 transitions (discarded 15 similar events)
// Phase 1: matrix 231 rows 166 cols
[2024-05-22 22:35:06] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:35:06] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-22 22:35:06] [INFO ] Flow matrix only has 231 transitions (discarded 15 similar events)
[2024-05-22 22:35:06] [INFO ] Invariant cache hit.
[2024-05-22 22:35:06] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-22 22:35:06] [INFO ] Redundant transitions in 10 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-22 22:35:06] [INFO ] Flow matrix only has 231 transitions (discarded 15 similar events)
[2024-05-22 22:35:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 8/166 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 230/396 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/397 variables, and 176 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3223 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 8/166 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 230/396 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 123/299 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/397 variables, and 299 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3676 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 6951ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 6952ms
Starting structural reductions in SI_LTL mode, iteration 1 : 166/374 places, 246/475 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7436 ms. Remains : 166/374 places, 246/475 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-05
Product exploration explored 100000 steps with 6830 reset in 417 ms.
Stuttering criterion allowed to conclude after 6448 steps with 437 reset in 22 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-05 finished in 7928 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(G(p0))) U p1)&&X(p2)))'
Support contains 4 out of 374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 374/374 places, 475/475 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 353 transition count 454
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 353 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 353 transition count 453
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 59 place count 337 transition count 437
Iterating global reduction 1 with 16 rules applied. Total rules applied 75 place count 337 transition count 437
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 84 place count 337 transition count 428
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 332 transition count 423
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 332 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 332 transition count 421
Applied a total of 96 rules in 24 ms. Remains 332 /374 variables (removed 42) and now considering 421/475 (removed 54) transitions.
// Phase 1: matrix 421 rows 332 cols
[2024-05-22 22:35:13] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:35:14] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-22 22:35:14] [INFO ] Invariant cache hit.
[2024-05-22 22:35:14] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-22 22:35:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 421/753 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 0/753 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/753 variables, and 342 constraints, problems are : Problem set: 0 solved, 420 unsolved in 18674 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 421/753 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 420/762 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 22:35:39] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-22 22:35:40] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:35:41] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:35:41] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:35:42] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:35:43] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:35:43] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:35:44] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:35:45] [INFO ] Deduced a trap composed of 249 places in 97 ms of which 3 ms to minimize.
[2024-05-22 22:35:45] [INFO ] Deduced a trap composed of 249 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:35:45] [INFO ] Deduced a trap composed of 249 places in 92 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 11/773 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 22:35:55] [INFO ] Deduced a trap composed of 249 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 1/774 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 22:36:00] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/753 variables, and 775 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 13/13 constraints]
After SMT, in 48804ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 48808ms
Starting structural reductions in LTL mode, iteration 1 : 332/374 places, 421/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49414 ms. Remains : 332/374 places, 421/475 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p2), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 27 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-06 finished in 50054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 374/374 places, 475/475 transitions.
Graph (trivial) has 346 edges and 374 vertex of which 50 / 374 are part of one of the 8 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 331 transition count 380
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 280 transition count 380
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 103 place count 280 transition count 362
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 139 place count 262 transition count 362
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 172 place count 229 transition count 329
Iterating global reduction 2 with 33 rules applied. Total rules applied 205 place count 229 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 229 transition count 328
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 206 place count 229 transition count 327
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 228 transition count 327
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 213 place count 223 transition count 322
Iterating global reduction 3 with 5 rules applied. Total rules applied 218 place count 223 transition count 322
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 223 place count 223 transition count 317
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 321 place count 174 transition count 268
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 326 place count 169 transition count 263
Iterating global reduction 4 with 5 rules applied. Total rules applied 331 place count 169 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 336 place count 169 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 344 place count 169 transition count 250
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 346 place count 167 transition count 248
Applied a total of 346 rules in 80 ms. Remains 167 /374 variables (removed 207) and now considering 248/475 (removed 227) transitions.
[2024-05-22 22:36:03] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
// Phase 1: matrix 233 rows 167 cols
[2024-05-22 22:36:03] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:36:03] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-22 22:36:03] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
[2024-05-22 22:36:03] [INFO ] Invariant cache hit.
[2024-05-22 22:36:04] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-22 22:36:04] [INFO ] Redundant transitions in 3 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-22 22:36:04] [INFO ] Flow matrix only has 233 transitions (discarded 15 similar events)
[2024-05-22 22:36:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 8/167 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 232/399 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/399 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/400 variables, and 177 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3144 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 8/167 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 232/399 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 124/301 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/399 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/400 variables, and 301 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3607 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 6818ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6820ms
Starting structural reductions in SI_LTL mode, iteration 1 : 167/374 places, 248/475 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7175 ms. Remains : 167/374 places, 248/475 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-09 finished in 7241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 374/374 places, 475/475 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 352 transition count 453
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 352 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 352 transition count 452
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 337 transition count 437
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 337 transition count 437
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 84 place count 337 transition count 428
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 332 transition count 423
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 332 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 332 transition count 421
Applied a total of 96 rules in 22 ms. Remains 332 /374 variables (removed 42) and now considering 421/475 (removed 54) transitions.
// Phase 1: matrix 421 rows 332 cols
[2024-05-22 22:36:11] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 22:36:11] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 22:36:11] [INFO ] Invariant cache hit.
[2024-05-22 22:36:11] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-22 22:36:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 22:36:15] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:36:15] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/753 variables, 332/344 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (OVERLAPS) 0/753 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/753 variables, and 344 constraints, problems are : Problem set: 0 solved, 420 unsolved in 23296 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/753 variables, 332/344 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 420/764 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 22:36:41] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:36:43] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-05-22 22:36:44] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2024-05-22 22:36:44] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:36:45] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-05-22 22:36:46] [INFO ] Deduced a trap composed of 249 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:36:46] [INFO ] Deduced a trap composed of 249 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 7/771 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 22:36:51] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:36:52] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 2/773 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/753 variables, and 773 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 11/11 constraints]
After SMT, in 53416ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 53422ms
Starting structural reductions in LTL mode, iteration 1 : 332/374 places, 421/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53851 ms. Remains : 332/374 places, 421/475 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-14
Product exploration explored 100000 steps with 3333 reset in 131 ms.
Stack based approach found an accepted trace after 32796 steps with 1101 reset with depth 36 and stack size 36 in 46 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-14 finished in 54150 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 2 out of 374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 374/374 places, 475/475 transitions.
Graph (trivial) has 346 edges and 374 vertex of which 44 / 374 are part of one of the 7 SCC in 1 ms
Free SCC test removed 37 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 336 transition count 385
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 285 transition count 385
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 103 place count 285 transition count 366
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 141 place count 266 transition count 366
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 173 place count 234 transition count 334
Iterating global reduction 2 with 32 rules applied. Total rules applied 205 place count 234 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 234 transition count 333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 206 place count 234 transition count 332
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 233 transition count 332
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 213 place count 228 transition count 327
Iterating global reduction 3 with 5 rules applied. Total rules applied 218 place count 228 transition count 327
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 223 place count 228 transition count 322
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 327 place count 176 transition count 270
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 334 place count 169 transition count 263
Iterating global reduction 4 with 7 rules applied. Total rules applied 341 place count 169 transition count 263
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 348 place count 169 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 350 place count 168 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 359 place count 168 transition count 247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 361 place count 166 transition count 245
Applied a total of 361 rules in 61 ms. Remains 166 /374 variables (removed 208) and now considering 245/475 (removed 230) transitions.
[2024-05-22 22:37:05] [INFO ] Flow matrix only has 231 transitions (discarded 14 similar events)
// Phase 1: matrix 231 rows 166 cols
[2024-05-22 22:37:05] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:37:05] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 22:37:05] [INFO ] Flow matrix only has 231 transitions (discarded 14 similar events)
[2024-05-22 22:37:05] [INFO ] Invariant cache hit.
[2024-05-22 22:37:05] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-22 22:37:05] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-22 22:37:05] [INFO ] Flow matrix only has 231 transitions (discarded 14 similar events)
[2024-05-22 22:37:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 8/166 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 230/396 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/397 variables, and 176 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3387 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 8/166 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 230/396 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 130/306 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/397 variables, and 306 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3870 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 7309ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 7310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 166/374 places, 245/475 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7630 ms. Remains : 166/374 places, 245/475 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLCardinality-15
Stuttering criterion allowed to conclude after 61 steps with 4 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLCardinality-15 finished in 7727 ms.
All properties solved by simple procedures.
Total runtime 292746 ms.
ITS solved all properties within timeout

BK_STOP 1716417432965

--------------------
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:
++ 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
++ sed s/.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

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="FlexibleBarrier-PT-08b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FlexibleBarrier-PT-08b, 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 r179-tall-171640600700043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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