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.r549-tall-171734897900155.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 CO4-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897900155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 336K Jun 2 16:33 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 CO4-PT-20-LTLCardinality-00
FORMULA_NAME CO4-PT-20-LTLCardinality-01
FORMULA_NAME CO4-PT-20-LTLCardinality-02
FORMULA_NAME CO4-PT-20-LTLCardinality-03
FORMULA_NAME CO4-PT-20-LTLCardinality-04
FORMULA_NAME CO4-PT-20-LTLCardinality-05
FORMULA_NAME CO4-PT-20-LTLCardinality-06
FORMULA_NAME CO4-PT-20-LTLCardinality-07
FORMULA_NAME CO4-PT-20-LTLCardinality-08
FORMULA_NAME CO4-PT-20-LTLCardinality-09
FORMULA_NAME CO4-PT-20-LTLCardinality-10
FORMULA_NAME CO4-PT-20-LTLCardinality-11
FORMULA_NAME CO4-PT-20-LTLCardinality-12
FORMULA_NAME CO4-PT-20-LTLCardinality-13
FORMULA_NAME CO4-PT-20-LTLCardinality-14
FORMULA_NAME CO4-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717362211035

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:03:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:03:32] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-02 21:03:32] [INFO ] Transformed 1178 places.
[2024-06-02 21:03:32] [INFO ] Transformed 1463 transitions.
[2024-06-02 21:03:32] [INFO ] Found NUPN structural information;
[2024-06-02 21:03:32] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 187 places in 20 ms
Reduce places removed 187 places and 251 transitions.
FORMULA CO4-PT-20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 969 transition count 1207
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 196 place count 800 transition count 1036
Iterating global reduction 1 with 169 rules applied. Total rules applied 365 place count 800 transition count 1036
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 511 place count 654 transition count 877
Iterating global reduction 1 with 146 rules applied. Total rules applied 657 place count 654 transition count 877
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 665 place count 654 transition count 869
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 736 place count 583 transition count 792
Iterating global reduction 2 with 71 rules applied. Total rules applied 807 place count 583 transition count 792
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 810 place count 583 transition count 789
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 855 place count 538 transition count 744
Iterating global reduction 3 with 45 rules applied. Total rules applied 900 place count 538 transition count 744
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 907 place count 538 transition count 737
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 925 place count 520 transition count 719
Iterating global reduction 4 with 18 rules applied. Total rules applied 943 place count 520 transition count 719
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 945 place count 520 transition count 717
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 950 place count 515 transition count 712
Iterating global reduction 5 with 5 rules applied. Total rules applied 955 place count 515 transition count 712
Applied a total of 955 rules in 261 ms. Remains 515 /991 variables (removed 476) and now considering 712/1212 (removed 500) transitions.
// Phase 1: matrix 712 rows 515 cols
[2024-06-02 21:03:32] [INFO ] Computed 7 invariants in 31 ms
[2024-06-02 21:03:33] [INFO ] Implicit Places using invariants in 369 ms returned [6, 441]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 399 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/991 places, 712/1212 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 686 ms. Remains : 513/991 places, 712/1212 transitions.
Support contains 18 out of 513 places after structural reductions.
[2024-06-02 21:03:33] [INFO ] Flatten gal took : 76 ms
[2024-06-02 21:03:33] [INFO ] Flatten gal took : 36 ms
[2024-06-02 21:03:33] [INFO ] Input system was already deterministic with 712 transitions.
RANDOM walk for 40000 steps (835 resets) in 1868 ms. (21 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (142 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (144 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (178 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (140 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (140 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
// Phase 1: matrix 712 rows 513 cols
[2024-06-02 21:03:34] [INFO ] Computed 5 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 228/254 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18/272 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 20/292 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 423/715 variables, 195/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/715 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 336/1051 variables, 174/414 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1051 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 123/1174 variables, 72/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1174 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 37/1211 variables, 22/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1211 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 13/1224 variables, 9/517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1224 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 1/1225 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1225 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1225 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1225/1225 variables, and 518 constraints, problems are : Problem set: 0 solved, 5 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 513/513 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 228/254 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 18/272 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 20/292 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 423/715 variables, 195/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/715 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 336/1051 variables, 174/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1051 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 123/1174 variables, 72/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1174 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 37/1211 variables, 22/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1211 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 13/1224 variables, 9/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1224 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1/1225 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1225 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/1225 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1225/1225 variables, and 523 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2167ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 187 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=187 )
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 )
Parikh walk visited 5 properties in 247 ms.
FORMULA CO4-PT-20-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 22 stabilizing places and 37 stable transitions
Graph (complete) has 1029 edges and 513 vertex of which 508 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.13 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))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 712/712 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 503 transition count 702
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 503 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 503 transition count 701
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 496 transition count 694
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 496 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 496 transition count 693
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 493 transition count 690
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 493 transition count 690
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 493 transition count 689
Applied a total of 43 rules in 32 ms. Remains 493 /513 variables (removed 20) and now considering 689/712 (removed 23) transitions.
// Phase 1: matrix 689 rows 493 cols
[2024-06-02 21:03:37] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 21:03:37] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 21:03:37] [INFO ] Invariant cache hit.
[2024-06-02 21:03:37] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 688 sub problems to find dead transitions.
[2024-06-02 21:03:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 21:03:51] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 9 ms to minimize.
[2024-06-02 21:03:51] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1182 variables, 493/500 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 21:04:03] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 4 ms to minimize.
[2024-06-02 21:04:03] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-06-02 21:04:04] [INFO ] Deduced a trap composed of 187 places in 99 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 503 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1182 variables, 493/503 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1182 variables, 688/1191 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 21:04:23] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1182/1182 variables, and 1192 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 6/6 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 688 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Starting structural reductions in LTL mode, iteration 1 : 493/513 places, 689/712 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60902 ms. Remains : 493/513 places, 689/712 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-20-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CO4-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-02 finished in 61186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 712/712 transitions.
Graph (trivial) has 549 edges and 513 vertex of which 3 / 513 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1027 edges and 511 vertex of which 506 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 215 place count 505 transition count 490
Reduce places removed 213 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 215 rules applied. Total rules applied 430 place count 292 transition count 488
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 432 place count 291 transition count 487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 433 place count 290 transition count 487
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 433 place count 290 transition count 439
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 529 place count 242 transition count 439
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 532 place count 239 transition count 436
Iterating global reduction 4 with 3 rules applied. Total rules applied 535 place count 239 transition count 436
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 535 place count 239 transition count 434
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 539 place count 237 transition count 434
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 540 place count 236 transition count 432
Iterating global reduction 4 with 1 rules applied. Total rules applied 541 place count 236 transition count 432
Performed 82 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 705 place count 154 transition count 327
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 721 place count 154 transition count 311
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 728 place count 147 transition count 301
Iterating global reduction 5 with 7 rules applied. Total rules applied 735 place count 147 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 737 place count 146 transition count 300
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 738 place count 145 transition count 298
Iterating global reduction 5 with 1 rules applied. Total rules applied 739 place count 145 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 740 place count 145 transition count 297
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 822 place count 104 transition count 346
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 842 place count 104 transition count 326
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 869 place count 77 transition count 218
Iterating global reduction 7 with 27 rules applied. Total rules applied 896 place count 77 transition count 218
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 913 place count 77 transition count 201
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 918 place count 72 transition count 175
Iterating global reduction 8 with 5 rules applied. Total rules applied 923 place count 72 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 926 place count 72 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 930 place count 70 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 9 with 32 rules applied. Total rules applied 962 place count 70 transition count 165
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 971 place count 70 transition count 165
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 973 place count 68 transition count 163
Applied a total of 973 rules in 146 ms. Remains 68 /513 variables (removed 445) and now considering 163/712 (removed 549) transitions.
[2024-06-02 21:04:38] [INFO ] Flow matrix only has 152 transitions (discarded 11 similar events)
// Phase 1: matrix 152 rows 68 cols
[2024-06-02 21:04:38] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:04:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 21:04:38] [INFO ] Flow matrix only has 152 transitions (discarded 11 similar events)
[2024-06-02 21:04:38] [INFO ] Invariant cache hit.
[2024-06-02 21:04:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:04:38] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-06-02 21:04:38] [INFO ] Redundant transitions in 5 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-02 21:04:38] [INFO ] Flow matrix only has 152 transitions (discarded 11 similar events)
[2024-06-02 21:04:38] [INFO ] Invariant cache hit.
[2024-06-02 21:04:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 151/219 variables, 68/73 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 1/220 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 77 constraints, problems are : Problem set: 0 solved, 140 unsolved in 2582 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 151/219 variables, 68/73 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 140/216 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 1/220 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 217 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3655 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 6317ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 6318ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/513 places, 163/712 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6596 ms. Remains : 68/513 places, 163/712 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-03
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-03 finished in 6730 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((X(p1)||p0))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 712/712 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 506 transition count 705
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 506 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 506 transition count 704
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 502 transition count 700
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 502 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 502 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 501 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 501 transition count 698
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 501 transition count 697
Applied a total of 27 rules in 31 ms. Remains 501 /513 variables (removed 12) and now considering 697/712 (removed 15) transitions.
// Phase 1: matrix 697 rows 501 cols
[2024-06-02 21:04:44] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 21:04:45] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 21:04:45] [INFO ] Invariant cache hit.
[2024-06-02 21:04:45] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2024-06-02 21:04:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (OVERLAPS) 1/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (OVERLAPS) 697/1198 variables, 501/506 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-06-02 21:05:11] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:05:11] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-06-02 21:05:12] [INFO ] Deduced a trap composed of 191 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1198/1198 variables, and 509 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (OVERLAPS) 1/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-06-02 21:05:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:05:25] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (OVERLAPS) 697/1198 variables, 501/511 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1198 variables, 696/1207 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-06-02 21:05:36] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1198/1198 variables, and 1208 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 6/6 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in LTL mode, iteration 1 : 501/513 places, 697/712 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60708 ms. Remains : 501/513 places, 697/712 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-20-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 274 ms.
Product exploration explored 100000 steps with 33333 reset in 212 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1014 edges and 501 vertex of which 496 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-20-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-20-LTLCardinality-10 finished in 61455 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 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 712/712 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 504 transition count 703
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 504 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 504 transition count 702
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 498 transition count 696
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 498 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 498 transition count 695
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 495 transition count 692
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 495 transition count 692
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 495 transition count 691
Applied a total of 39 rules in 24 ms. Remains 495 /513 variables (removed 18) and now considering 691/712 (removed 21) transitions.
// Phase 1: matrix 691 rows 495 cols
[2024-06-02 21:05:46] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 21:05:46] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 21:05:46] [INFO ] Invariant cache hit.
[2024-06-02 21:05:46] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2024-06-02 21:05:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 21:06:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:06:01] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (OVERLAPS) 691/1186 variables, 495/502 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 21:06:12] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-06-02 21:06:12] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-06-02 21:06:13] [INFO ] Deduced a trap composed of 189 places in 81 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 505 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (OVERLAPS) 691/1186 variables, 495/505 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1186 variables, 690/1195 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1195 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 5/5 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 495/513 places, 691/712 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60678 ms. Remains : 495/513 places, 691/712 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-14
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-14 finished in 60775 ms.
All properties solved by simple procedures.
Total runtime 194983 ms.
ITS solved all properties within timeout

BK_STOP 1717362407217

--------------------
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

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="CO4-PT-20"
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 CO4-PT-20, 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 r549-tall-171734897900155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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