Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445300171.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445300171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716854902057

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:08:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 00:08:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:08:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 00:08:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 00:08:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 812 ms
[2024-05-28 00:08:24] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 00:08:24] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 00:08:24] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 6 formulas.
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40006 steps (3874 resets) in 1813 ms. (22 steps per ms) remains 14/21 properties
BEST_FIRST walk for 40001 steps (141 resets) in 664 ms. (60 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40002 steps (252 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (2104 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (2104 resets) in 265 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (125 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (134 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
[2024-05-28 00:08:25] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:08:25] [INFO ] Computed 26 invariants in 12 ms
[2024-05-28 00:08:25] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/52 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 7 (OVERLAPS) 21/81 variables, 15/26 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 4 solved, 2 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/49 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/56 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/57 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 24/81 variables, 15/26 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-28 00:08:26] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 17 ms to minimize.
[2024-05-28 00:08:26] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 16 ms to minimize.
[2024-05-28 00:08:26] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 81/145 variables, and 29 constraints, problems are : Problem set: 6 solved, 0 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 728ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 00:08:26] [INFO ] Flatten gal took : 62 ms
[2024-05-28 00:08:26] [INFO ] Flatten gal took : 8 ms
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-28 00:08:27] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 181 ms.
[2024-05-28 00:08:27] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 118 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Applied a total of 6 rules in 67 ms. Remains 448 /454 variables (removed 6) and now considering 1614/1614 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-28 00:08:27] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 448 cols
[2024-05-28 00:08:27] [INFO ] Computed 44 invariants in 97 ms
[2024-05-28 00:08:27] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 00:08:56] [INFO ] Deduced a trap composed of 85 places in 283 ms of which 15 ms to minimize.
[2024-05-28 00:08:56] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 1 ms to minimize.
[2024-05-28 00:08:56] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 1 ms to minimize.
[2024-05-28 00:08:57] [INFO ] Deduced a trap composed of 262 places in 539 ms of which 7 ms to minimize.
[2024-05-28 00:08:57] [INFO ] Deduced a trap composed of 101 places in 424 ms of which 6 ms to minimize.
[2024-05-28 00:08:58] [INFO ] Deduced a trap composed of 112 places in 341 ms of which 3 ms to minimize.
[2024-05-28 00:08:58] [INFO ] Deduced a trap composed of 131 places in 340 ms of which 3 ms to minimize.
[2024-05-28 00:08:58] [INFO ] Deduced a trap composed of 91 places in 370 ms of which 3 ms to minimize.
[2024-05-28 00:08:59] [INFO ] Deduced a trap composed of 129 places in 249 ms of which 3 ms to minimize.
[2024-05-28 00:08:59] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:08:59] [INFO ] Deduced a trap composed of 213 places in 277 ms of which 3 ms to minimize.
[2024-05-28 00:09:00] [INFO ] Deduced a trap composed of 225 places in 342 ms of which 4 ms to minimize.
[2024-05-28 00:09:00] [INFO ] Deduced a trap composed of 238 places in 340 ms of which 4 ms to minimize.
[2024-05-28 00:09:01] [INFO ] Deduced a trap composed of 247 places in 332 ms of which 3 ms to minimize.
[2024-05-28 00:09:02] [INFO ] Deduced a trap composed of 231 places in 338 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2038 variables, and 53 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 00:09:12] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2038 variables, and 54 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20114 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 16/16 constraints]
After SMT, in 57548ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 57579ms
[2024-05-28 00:09:24] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-28 00:09:24] [INFO ] Invariant cache hit.
[2024-05-28 00:09:25] [INFO ] Implicit Places using invariants in 524 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 554 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/454 places, 1614/1614 transitions.
Applied a total of 0 rules in 21 ms. Remains 444 /444 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58246 ms. Remains : 444/454 places, 1614/1614 transitions.
Support contains 118 out of 444 places after structural reductions.
[2024-05-28 00:09:25] [INFO ] Flatten gal took : 340 ms
[2024-05-28 00:09:25] [INFO ] Flatten gal took : 170 ms
[2024-05-28 00:09:26] [INFO ] Input system was already deterministic with 1614 transitions.
RANDOM walk for 40000 steps (206 resets) in 572 ms. (69 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (80 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
[2024-05-28 00:09:26] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 444 cols
[2024-05-28 00:09:26] [INFO ] Computed 40 invariants in 92 ms
[2024-05-28 00:09:26] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 121/136 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/249 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/254 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 7 (OVERLAPS) 184/438 variables, 23/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/440 variables, 2/37 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/442 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1590/2032 variables, 442/481 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2032 variables, 112/593 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2032 variables, 0/593 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2034 variables, 2/595 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2034 variables, 1/596 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2034 variables, 0/596 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2034 variables, 0/596 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2034/2034 variables, and 596 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1649 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 444/444 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/132 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/245 variables, 8/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/250 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/438 variables, 23/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 00:09:30] [INFO ] Deduced a trap composed of 91 places in 1459 ms of which 3 ms to minimize.
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 438/2034 variables, and 36 constraints, problems are : Problem set: 3 solved, 0 unsolved in 1930 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/444 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3712ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 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' '!(G(F(p0)))'
Support contains 8 out of 444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 444/444 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 444 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 408 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 72 place count 408 transition count 1530
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 168 place count 360 transition count 1530
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 356 transition count 1526
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 356 transition count 1526
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 272 place count 308 transition count 1478
Applied a total of 272 rules in 349 ms. Remains 308 /444 variables (removed 136) and now considering 1478/1614 (removed 136) transitions.
Running 1472 sub problems to find dead transitions.
[2024-05-28 00:09:31] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
// Phase 1: matrix 1454 rows 308 cols
[2024-05-28 00:09:31] [INFO ] Computed 40 invariants in 79 ms
[2024-05-28 00:09:31] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:09:56] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-05-28 00:09:56] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-28 00:09:56] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-28 00:09:56] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-28 00:09:56] [INFO ] Deduced a trap composed of 134 places in 292 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 39 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:10:10] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-05-28 00:10:25] [INFO ] Deduced a trap composed of 87 places in 253 ms of which 2 ms to minimize.
[2024-05-28 00:10:26] [INFO ] Deduced a trap composed of 90 places in 271 ms of which 2 ms to minimize.
[2024-05-28 00:10:26] [INFO ] Deduced a trap composed of 101 places in 280 ms of which 2 ms to minimize.
[2024-05-28 00:10:26] [INFO ] Deduced a trap composed of 83 places in 246 ms of which 2 ms to minimize.
[2024-05-28 00:10:27] [INFO ] Deduced a trap composed of 91 places in 360 ms of which 2 ms to minimize.
[2024-05-28 00:10:27] [INFO ] Deduced a trap composed of 90 places in 266 ms of which 1 ms to minimize.
[2024-05-28 00:10:27] [INFO ] Deduced a trap composed of 77 places in 241 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 1)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 1)
(s58 0)
(s59 0)
(s60 1)
(s61 1)
(s62 0)
(s63 0)
(s64 2)
(s65 2)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 9)
(s71 0)
(s72 1)
(s73 1)
(s74 0)
(s75 0)
(s76 1)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 4)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1762 variables, and 47 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 13/13 constraints]
After SMT, in 58296ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 58327ms
[2024-05-28 00:10:29] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 00:10:29] [INFO ] Invariant cache hit.
[2024-05-28 00:10:29] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 00:10:29] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 00:10:29] [INFO ] Invariant cache hit.
[2024-05-28 00:10:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 00:10:33] [INFO ] Implicit Places using invariants and state equation in 3829 ms returned []
Implicit Place search using SMT with State Equation took 4263 ms to find 0 implicit places.
[2024-05-28 00:10:33] [INFO ] Redundant transitions in 88 ms returned []
Running 1472 sub problems to find dead transitions.
[2024-05-28 00:10:33] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 00:10:33] [INFO ] Invariant cache hit.
[2024-05-28 00:10:33] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:10:59] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2024-05-28 00:10:59] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 4 ms to minimize.
[2024-05-28 00:10:59] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 7 ms to minimize.
[2024-05-28 00:11:00] [INFO ] Deduced a trap composed of 130 places in 347 ms of which 2 ms to minimize.
[2024-05-28 00:11:00] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-28 00:11:13] [INFO ] Deduced a trap composed of 90 places in 263 ms of which 2 ms to minimize.
[2024-05-28 00:11:13] [INFO ] Deduced a trap composed of 77 places in 243 ms of which 15 ms to minimize.
[2024-05-28 00:11:14] [INFO ] Deduced a trap composed of 122 places in 234 ms of which 2 ms to minimize.
[2024-05-28 00:11:15] [INFO ] Deduced a trap composed of 133 places in 292 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 43 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:11:25] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:11:40] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 1 ms to minimize.
[2024-05-28 00:11:40] [INFO ] Deduced a trap composed of 52 places in 289 ms of which 1 ms to minimize.
[2024-05-28 00:11:41] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 2 ms to minimize.
[2024-05-28 00:11:51] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1762 variables, and 48 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 14/14 constraints]
After SMT, in 78479ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 78495ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/444 places, 1478/1614 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141537 ms. Remains : 308/444 places, 1478/1614 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLCardinality-03
Stuttering criterion allowed to conclude after 1312 steps with 37 reset in 28 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T04-LTLCardinality-03 finished in 141875 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)&&F(G(p1))))'
Support contains 5 out of 444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 444/444 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 444 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 408 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 72 place count 408 transition count 1530
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 168 place count 360 transition count 1530
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 356 transition count 1526
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 356 transition count 1526
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 272 place count 308 transition count 1478
Applied a total of 272 rules in 135 ms. Remains 308 /444 variables (removed 136) and now considering 1478/1614 (removed 136) transitions.
Running 1472 sub problems to find dead transitions.
[2024-05-28 00:11:52] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 00:11:52] [INFO ] Invariant cache hit.
[2024-05-28 00:11:52] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:12:19] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2024-05-28 00:12:19] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:12:19] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2024-05-28 00:12:20] [INFO ] Deduced a trap composed of 130 places in 342 ms of which 6 ms to minimize.
[2024-05-28 00:12:20] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 39 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:12:34] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-28 00:12:35] [INFO ] Deduced a trap composed of 142 places in 272 ms of which 2 ms to minimize.
[2024-05-28 00:12:49] [INFO ] Deduced a trap composed of 90 places in 312 ms of which 3 ms to minimize.
[2024-05-28 00:12:50] [INFO ] Deduced a trap composed of 92 places in 323 ms of which 6 ms to minimize.
[2024-05-28 00:12:50] [INFO ] Deduced a trap composed of 87 places in 300 ms of which 3 ms to minimize.
[2024-05-28 00:12:50] [INFO ] Deduced a trap composed of 80 places in 312 ms of which 2 ms to minimize.
[2024-05-28 00:12:51] [INFO ] Deduced a trap composed of 70 places in 299 ms of which 2 ms to minimize.
[2024-05-28 00:12:52] [INFO ] Deduced a trap composed of 124 places in 316 ms of which 3 ms to minimize.
SMT process timed out in 59854ms, After SMT, problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 59878ms
[2024-05-28 00:12:52] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 00:12:52] [INFO ] Invariant cache hit.
[2024-05-28 00:12:52] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-28 00:12:52] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 00:12:52] [INFO ] Invariant cache hit.
[2024-05-28 00:12:53] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 00:12:56] [INFO ] Implicit Places using invariants and state equation in 3494 ms returned []
Implicit Place search using SMT with State Equation took 3834 ms to find 0 implicit places.
[2024-05-28 00:12:56] [INFO ] Redundant transitions in 114 ms returned []
Running 1472 sub problems to find dead transitions.
[2024-05-28 00:12:56] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 00:12:56] [INFO ] Invariant cache hit.
[2024-05-28 00:12:56] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:13:23] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 1 ms to minimize.
[2024-05-28 00:13:23] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:13:23] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-28 00:13:23] [INFO ] Deduced a trap composed of 130 places in 381 ms of which 3 ms to minimize.
[2024-05-28 00:13:24] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:13:37] [INFO ] Deduced a trap composed of 90 places in 286 ms of which 3 ms to minimize.
[2024-05-28 00:13:37] [INFO ] Deduced a trap composed of 77 places in 290 ms of which 2 ms to minimize.
[2024-05-28 00:13:37] [INFO ] Deduced a trap composed of 122 places in 278 ms of which 2 ms to minimize.
[2024-05-28 00:13:39] [INFO ] Deduced a trap composed of 133 places in 265 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 43 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:13:49] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:14:05] [INFO ] Deduced a trap composed of 37 places in 314 ms of which 2 ms to minimize.
[2024-05-28 00:14:06] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 2 ms to minimize.
[2024-05-28 00:14:06] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 1 ms to minimize.
[2024-05-28 00:14:16] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1762 variables, and 48 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 14/14 constraints]
After SMT, in 79838ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 79863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/444 places, 1478/1614 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143847 ms. Remains : 308/444 places, 1478/1614 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLCardinality-06
Stuttering criterion allowed to conclude after 57 steps with 1 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T04-LTLCardinality-06 finished in 143988 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)&&(G(p1)||X((p2||F(p3))))))'
Support contains 18 out of 444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 444/444 places, 1614/1614 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 440 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 440 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 436 transition count 1606
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 436 transition count 1606
Applied a total of 16 rules in 41 ms. Remains 436 /444 variables (removed 8) and now considering 1606/1614 (removed 8) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 00:14:16] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 436 cols
[2024-05-28 00:14:16] [INFO ] Computed 40 invariants in 30 ms
[2024-05-28 00:14:16] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 00:14:44] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:14:44] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-05-28 00:14:44] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-28 00:14:45] [INFO ] Deduced a trap composed of 233 places in 277 ms of which 2 ms to minimize.
[2024-05-28 00:14:45] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 3 ms to minimize.
[2024-05-28 00:14:45] [INFO ] Deduced a trap composed of 107 places in 258 ms of which 2 ms to minimize.
[2024-05-28 00:14:45] [INFO ] Deduced a trap composed of 127 places in 278 ms of which 2 ms to minimize.
[2024-05-28 00:14:46] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:14:46] [INFO ] Deduced a trap composed of 192 places in 305 ms of which 3 ms to minimize.
[2024-05-28 00:14:46] [INFO ] Deduced a trap composed of 235 places in 261 ms of which 2 ms to minimize.
[2024-05-28 00:14:48] [INFO ] Deduced a trap composed of 285 places in 384 ms of which 3 ms to minimize.
[2024-05-28 00:14:48] [INFO ] Deduced a trap composed of 269 places in 326 ms of which 3 ms to minimize.
[2024-05-28 00:14:48] [INFO ] Deduced a trap composed of 271 places in 313 ms of which 3 ms to minimize.
[2024-05-28 00:14:49] [INFO ] Deduced a trap composed of 286 places in 311 ms of which 3 ms to minimize.
[2024-05-28 00:14:49] [INFO ] Deduced a trap composed of 294 places in 368 ms of which 3 ms to minimize.
[2024-05-28 00:14:49] [INFO ] Deduced a trap composed of 248 places in 322 ms of which 3 ms to minimize.
[2024-05-28 00:14:50] [INFO ] Deduced a trap composed of 244 places in 300 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 51 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 00:14:57] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 1 ms to minimize.
[2024-05-28 00:14:59] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 2 ms to minimize.
[2024-05-28 00:15:00] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-28 00:15:00] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-28 00:15:00] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-05-28 00:15:01] [INFO ] Deduced a trap composed of 219 places in 409 ms of which 3 ms to minimize.
[2024-05-28 00:15:01] [INFO ] Deduced a trap composed of 218 places in 298 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 58 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 24/24 constraints]
After SMT, in 58089ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 58115ms
[2024-05-28 00:15:14] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 00:15:14] [INFO ] Invariant cache hit.
[2024-05-28 00:15:15] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-28 00:15:15] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 00:15:15] [INFO ] Invariant cache hit.
[2024-05-28 00:15:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 00:15:21] [INFO ] Implicit Places using invariants and state equation in 6111 ms returned []
Implicit Place search using SMT with State Equation took 6461 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-05-28 00:15:21] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 00:15:21] [INFO ] Invariant cache hit.
[2024-05-28 00:15:21] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 00:15:48] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 2 ms to minimize.
[2024-05-28 00:15:48] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 1 ms to minimize.
[2024-05-28 00:15:49] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:15:49] [INFO ] Deduced a trap composed of 224 places in 460 ms of which 4 ms to minimize.
[2024-05-28 00:15:49] [INFO ] Deduced a trap composed of 98 places in 260 ms of which 2 ms to minimize.
[2024-05-28 00:15:50] [INFO ] Deduced a trap composed of 122 places in 417 ms of which 4 ms to minimize.
[2024-05-28 00:15:50] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:15:51] [INFO ] Deduced a trap composed of 210 places in 400 ms of which 3 ms to minimize.
[2024-05-28 00:15:52] [INFO ] Deduced a trap composed of 239 places in 324 ms of which 3 ms to minimize.
[2024-05-28 00:15:53] [INFO ] Deduced a trap composed of 268 places in 387 ms of which 2 ms to minimize.
[2024-05-28 00:15:54] [INFO ] Deduced a trap composed of 246 places in 427 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 45 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 00:16:14] [INFO ] Deduced a trap composed of 219 places in 294 ms of which 3 ms to minimize.
[2024-05-28 00:16:14] [INFO ] Deduced a trap composed of 195 places in 353 ms of which 3 ms to minimize.
[2024-05-28 00:16:15] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 2 ms to minimize.
[2024-05-28 00:16:15] [INFO ] Deduced a trap composed of 53 places in 288 ms of which 2 ms to minimize.
[2024-05-28 00:16:17] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-05-28 00:16:30] [INFO ] Deduced a trap composed of 240 places in 279 ms of which 2 ms to minimize.
[2024-05-28 00:16:31] [INFO ] Deduced a trap composed of 199 places in 342 ms of which 4 ms to minimize.
[2024-05-28 00:16:31] [INFO ] Deduced a trap composed of 220 places in 310 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 19/19 constraints]
After SMT, in 77765ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 77794ms
Starting structural reductions in LTL mode, iteration 1 : 436/444 places, 1606/1614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142427 ms. Remains : 436/444 places, 1606/1614 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 766 ms.
Product exploration explored 100000 steps with 50000 reset in 798 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 43 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S06J04T04-LTLCardinality-07 finished in 144408 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 U (G(!p0)||(!p0&&G(p1)&&F(p2)))))))'
Support contains 37 out of 444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 444/444 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 444 transition count 1594
Reduce places removed 20 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 24 rules applied. Total rules applied 44 place count 424 transition count 1590
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 420 transition count 1590
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 48 place count 420 transition count 1546
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 136 place count 376 transition count 1546
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 224 place count 332 transition count 1502
Applied a total of 224 rules in 83 ms. Remains 332 /444 variables (removed 112) and now considering 1502/1614 (removed 112) transitions.
Running 1496 sub problems to find dead transitions.
[2024-05-28 00:16:41] [INFO ] Flow matrix only has 1478 transitions (discarded 24 similar events)
// Phase 1: matrix 1478 rows 332 cols
[2024-05-28 00:16:41] [INFO ] Computed 40 invariants in 30 ms
[2024-05-28 00:16:41] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
[2024-05-28 00:17:06] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 13 ms to minimize.
[2024-05-28 00:17:06] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-05-28 00:17:06] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:17:06] [INFO ] Deduced a trap composed of 144 places in 277 ms of which 3 ms to minimize.
[2024-05-28 00:17:06] [INFO ] Deduced a trap composed of 139 places in 307 ms of which 2 ms to minimize.
[2024-05-28 00:17:07] [INFO ] Deduced a trap composed of 148 places in 416 ms of which 2 ms to minimize.
[2024-05-28 00:17:07] [INFO ] Deduced a trap composed of 130 places in 566 ms of which 2 ms to minimize.
[2024-05-28 00:17:08] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 326/1810 variables, and 42 constraints, problems are : Problem set: 0 solved, 1496 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/332 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1496/1496 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
[2024-05-28 00:17:22] [INFO ] Deduced a trap composed of 145 places in 433 ms of which 2 ms to minimize.
[2024-05-28 00:17:23] [INFO ] Deduced a trap composed of 132 places in 435 ms of which 2 ms to minimize.
[2024-05-28 00:17:36] [INFO ] Deduced a trap composed of 105 places in 426 ms of which 2 ms to minimize.
[2024-05-28 00:17:37] [INFO ] Deduced a trap composed of 38 places in 287 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/1810 variables, and 46 constraints, problems are : Problem set: 0 solved, 1496 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/332 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1496 constraints, Known Traps: 12/12 constraints]
After SMT, in 56905ms problems are : Problem set: 0 solved, 1496 unsolved
Search for dead transitions found 0 dead transitions in 56922ms
[2024-05-28 00:17:37] [INFO ] Flow matrix only has 1478 transitions (discarded 24 similar events)
[2024-05-28 00:17:38] [INFO ] Invariant cache hit.
[2024-05-28 00:17:38] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-28 00:17:38] [INFO ] Flow matrix only has 1478 transitions (discarded 24 similar events)
[2024-05-28 00:17:38] [INFO ] Invariant cache hit.
[2024-05-28 00:17:38] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 00:17:41] [INFO ] Implicit Places using invariants and state equation in 3602 ms returned []
Implicit Place search using SMT with State Equation took 3910 ms to find 0 implicit places.
[2024-05-28 00:17:41] [INFO ] Redundant transitions in 42 ms returned []
Running 1496 sub problems to find dead transitions.
[2024-05-28 00:17:41] [INFO ] Flow matrix only has 1478 transitions (discarded 24 similar events)
[2024-05-28 00:17:41] [INFO ] Invariant cache hit.
[2024-05-28 00:17:41] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
[2024-05-28 00:18:10] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2024-05-28 00:18:10] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:18:10] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 5 ms to minimize.
[2024-05-28 00:18:10] [INFO ] Deduced a trap composed of 138 places in 352 ms of which 3 ms to minimize.
[2024-05-28 00:18:10] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:18:11] [INFO ] Deduced a trap composed of 135 places in 325 ms of which 2 ms to minimize.
[2024-05-28 00:18:11] [INFO ] Deduced a trap composed of 154 places in 384 ms of which 2 ms to minimize.
[2024-05-28 00:18:12] [INFO ] Deduced a trap composed of 23 places in 437 ms of which 1 ms to minimize.
[2024-05-28 00:18:25] [INFO ] Deduced a trap composed of 141 places in 297 ms of which 6 ms to minimize.
[2024-05-28 00:18:25] [INFO ] Deduced a trap composed of 68 places in 220 ms of which 2 ms to minimize.
[2024-05-28 00:18:28] [INFO ] Deduced a trap composed of 130 places in 234 ms of which 2 ms to minimize.
[2024-05-28 00:18:28] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 2 ms to minimize.
[2024-05-28 00:18:29] [INFO ] Deduced a trap composed of 106 places in 275 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 326/1810 variables, and 47 constraints, problems are : Problem set: 0 solved, 1496 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/332 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1496/1496 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 1496 unsolved
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S06J04T04

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 81
TRANSITIONS: 65
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 6
COLOR VARS: 25
ARCS: 254
LOADING TIME: 0.425

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 454
TRANSITIONS: 6994
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 59152
UNFOLDING TIME: 1.33

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.416
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 2.573
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1258
MODEL NAME: /home/mcc/execution/model
454 places, 6994 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PolyORBLF-COL-S06J04T04"
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 PolyORBLF-COL-S06J04T04, 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 r289-tajo-171654445300171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 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 ;