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.r268-smll-171654407100203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Peterson-COL-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407100203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.1K Apr 12 02:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 02:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K 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 Peterson-COL-2-LTLCardinality-00
FORMULA_NAME Peterson-COL-2-LTLCardinality-01
FORMULA_NAME Peterson-COL-2-LTLCardinality-02
FORMULA_NAME Peterson-COL-2-LTLCardinality-03
FORMULA_NAME Peterson-COL-2-LTLCardinality-04
FORMULA_NAME Peterson-COL-2-LTLCardinality-05
FORMULA_NAME Peterson-COL-2-LTLCardinality-06
FORMULA_NAME Peterson-COL-2-LTLCardinality-07
FORMULA_NAME Peterson-COL-2-LTLCardinality-08
FORMULA_NAME Peterson-COL-2-LTLCardinality-09
FORMULA_NAME Peterson-COL-2-LTLCardinality-10
FORMULA_NAME Peterson-COL-2-LTLCardinality-11
FORMULA_NAME Peterson-COL-2-LTLCardinality-12
FORMULA_NAME Peterson-COL-2-LTLCardinality-13
FORMULA_NAME Peterson-COL-2-LTLCardinality-14
FORMULA_NAME Peterson-COL-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716730624068

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-26 13:37:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 13:37:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 13:37:06] [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-26 13:37:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 13:37:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1248 ms
[2024-05-26 13:37:08] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 13:37:08] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-05-26 13:37:08] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Peterson-COL-2-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
FORMULA Peterson-COL-2-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 295 steps (0 resets) in 44 ms. (6 steps per ms) remains 0/13 properties
[2024-05-26 13:37:08] [INFO ] Flatten gal took : 27 ms
[2024-05-26 13:37:08] [INFO ] Flatten gal took : 6 ms
Domain [Process(3), Tour(2), Process(3)] of place BeginLoop breaks symmetries in sort Process
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [2:1*[$i, (MOD (ADD $j 1) 2)]] contains successor/predecessor on variables of sort Tour
[2024-05-26 13:37:08] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 59 ms.
[2024-05-26 13:37:08] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 12 transitions.
Support contains 90 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 15 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:37:08] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 13:37:08] [INFO ] Computed 11 invariants in 27 ms
[2024-05-26 13:37:09] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-26 13:37:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:37:09] [INFO ] Invariant cache hit.
[2024-05-26 13:37:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 13:37:09] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 13:37:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:37:09] [INFO ] Invariant cache hit.
[2024-05-26 13:37:09] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:37:10] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 43 ms to minimize.
[2024-05-26 13:37:10] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-26 13:37:10] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-26 13:37:11] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-26 13:37:11] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-26 13:37:11] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2024-05-26 13:37:11] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-26 13:37:11] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-26 13:37:11] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:37:11] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:37:11] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-26 13:37:11] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-26 13:37:11] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-26 13:37:12] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 2 ms to minimize.
[2024-05-26 13:37:12] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-05-26 13:37:12] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:37:12] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:37:12] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 3 ms to minimize.
[2024-05-26 13:37:13] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:37:13] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:37:14] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11506 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7197 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 18849ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 18889ms
Finished structural reductions in LTL mode , in 1 iterations and 19609 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 90 out of 102 places after structural reductions.
[2024-05-26 13:37:28] [INFO ] Flatten gal took : 32 ms
[2024-05-26 13:37:28] [INFO ] Flatten gal took : 27 ms
[2024-05-26 13:37:28] [INFO ] Input system was already deterministic with 126 transitions.
RANDOM walk for 40000 steps (8 resets) in 1717 ms. (23 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 1/1 properties
[2024-05-26 13:37:29] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:37:29] [INFO ] Invariant cache hit.
[2024-05-26 13:37:29] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/96 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/216 variables, 96/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 22/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/222 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 13:37:29] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/96 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/216 variables, 96/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 22/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/222 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 13:37:29] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-26 13:37:29] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-26 13:37:29] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 222/222 variables, and 140 constraints, problems are : Problem set: 1 solved, 0 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 653ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Peterson-COL-2-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(F(p0))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 124
Reduce places removed 2 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 20 rules applied. Total rules applied 22 place count 100 transition count 106
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 40 place count 82 transition count 106
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 82 transition count 100
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 76 transition count 100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 60 place count 72 transition count 96
Applied a total of 60 rules in 36 ms. Remains 72 /102 variables (removed 30) and now considering 96/126 (removed 30) transitions.
[2024-05-26 13:37:30] [INFO ] Flow matrix only has 90 transitions (discarded 6 similar events)
// Phase 1: matrix 90 rows 72 cols
[2024-05-26 13:37:30] [INFO ] Computed 11 invariants in 7 ms
[2024-05-26 13:37:30] [INFO ] Implicit Places using invariants in 73 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 76 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/102 places, 96/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 69 /69 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 69/102 places, 96/126 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-2-LTLCardinality-02
Product exploration explored 100000 steps with 6365 reset in 432 ms.
Stack based approach found an accepted trace after 71 steps with 5 reset with depth 14 and stack size 14 in 1 ms.
FORMULA Peterson-COL-2-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLCardinality-02 finished in 815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 39 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 124
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 8 rules applied. Total rules applied 10 place count 100 transition count 118
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 16 place count 94 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 90 transition count 114
Applied a total of 24 rules in 23 ms. Remains 90 /102 variables (removed 12) and now considering 114/126 (removed 12) transitions.
[2024-05-26 13:37:30] [INFO ] Flow matrix only has 108 transitions (discarded 6 similar events)
// Phase 1: matrix 108 rows 90 cols
[2024-05-26 13:37:30] [INFO ] Computed 11 invariants in 2 ms
[2024-05-26 13:37:30] [INFO ] Implicit Places using invariants in 91 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 93 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/102 places, 114/126 transitions.
Applied a total of 0 rules in 7 ms. Remains 87 /87 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 87/102 places, 114/126 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-2-LTLCardinality-03
Product exploration explored 100000 steps with 331 reset in 664 ms.
Stack based approach found an accepted trace after 105 steps with 1 reset with depth 39 and stack size 39 in 1 ms.
FORMULA Peterson-COL-2-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLCardinality-03 finished in 996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1&&F(!p1)))))'
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:37:31] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 13:37:31] [INFO ] Computed 11 invariants in 2 ms
[2024-05-26 13:37:31] [INFO ] Implicit Places using invariants in 83 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Running random walk in product with property : Peterson-COL-2-LTLCardinality-04
Product exploration explored 100000 steps with 33315 reset in 131 ms.
Product exploration explored 100000 steps with 33374 reset in 196 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 p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
RANDOM walk for 135 steps (0 resets) in 7 ms. (16 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 293 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:37:33] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2024-05-26 13:37:33] [INFO ] Computed 8 invariants in 3 ms
[2024-05-26 13:37:33] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-26 13:37:33] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:37:33] [INFO ] Invariant cache hit.
[2024-05-26 13:37:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 13:37:33] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 13:37:33] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:37:33] [INFO ] Invariant cache hit.
[2024-05-26 13:37:33] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:37:34] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-26 13:37:34] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-05-26 13:37:34] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-26 13:37:34] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:37:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:37:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-26 13:37:35] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-26 13:37:35] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-26 13:37:35] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
[2024-05-26 13:37:35] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
[2024-05-26 13:37:35] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:37:35] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:37:35] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 2 ms to minimize.
[2024-05-26 13:37:35] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:37:35] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-26 13:37:35] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:37:36] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-26 13:37:36] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
[2024-05-26 13:37:36] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:37:36] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-26 13:37:36] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-26 13:37:37] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:37:37] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 120/219 variables, 99/130 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 22/152 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 152 constraints, problems are : Problem set: 0 solved, 123 unsolved in 8975 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 120/219 variables, 99/130 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 22/152 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 123/275 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 275 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 23/23 constraints]
After SMT, in 14163ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 14169ms
Finished structural reductions in LTL mode , in 1 iterations and 14492 ms. Remains : 99/99 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
RANDOM walk for 165 steps (0 resets) in 8 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 285 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Product exploration explored 100000 steps with 33311 reset in 214 ms.
Product exploration explored 100000 steps with 33379 reset in 233 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 99 transition count 126
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 22 place count 99 transition count 126
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 36 place count 99 transition count 126
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 58 place count 77 transition count 104
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 80 place count 77 transition count 104
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 98 place count 77 transition count 104
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 112 place count 63 transition count 90
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 126 place count 63 transition count 90
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 126 rules in 36 ms. Remains 63 /99 variables (removed 36) and now considering 90/126 (removed 36) transitions.
[2024-05-26 13:37:50] [INFO ] Redundant transitions in 3 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-26 13:37:50] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
// Phase 1: matrix 84 rows 63 cols
[2024-05-26 13:37:50] [INFO ] Computed 8 invariants in 1 ms
[2024-05-26 13:37:50] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-26 13:37:50] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-26 13:37:50] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
[2024-05-26 13:37:50] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 2 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 19/27 constraints. Problems are: Problem set: 18 solved, 69 unsolved
[2024-05-26 13:37:51] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-26 13:37:52] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/29 constraints. Problems are: Problem set: 18 solved, 69 unsolved
[2024-05-26 13:37:52] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/30 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/30 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 84/147 variables, 63/93 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 22/115 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/115 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/115 constraints. Problems are: Problem set: 18 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 115 constraints, problems are : Problem set: 18 solved, 69 unsolved in 3918 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 18 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 22/27 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/27 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 18/63 variables, 3/30 constraints. Problems are: Problem set: 18 solved, 69 unsolved
[2024-05-26 13:37:55] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/31 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/31 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 84/147 variables, 63/94 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 22/116 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 69/185 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/185 constraints. Problems are: Problem set: 18 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/185 constraints. Problems are: Problem set: 18 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 185 constraints, problems are : Problem set: 18 solved, 69 unsolved in 2435 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 69/87 constraints, Known Traps: 23/23 constraints]
After SMT, in 6383ms problems are : Problem set: 18 solved, 69 unsolved
Search for dead transitions found 18 dead transitions in 6386ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 63/99 places, 72/126 transitions.
Graph (complete) has 192 edges and 63 vertex of which 45 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 45 /63 variables (removed 18) and now considering 72/72 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/99 places, 72/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6439 ms. Remains : 45/99 places, 72/126 transitions.
Built C files in :
/tmp/ltsmin658201583192796348
[2024-05-26 13:37:56] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin658201583192796348
Running compilation step : cd /tmp/ltsmin658201583192796348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 634 ms.
Running link step : cd /tmp/ltsmin658201583192796348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin658201583192796348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17069921040727267278.hoa' '--buchi-type=spotba'
LTSmin run took 276 ms.
FORMULA Peterson-COL-2-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-2-LTLCardinality-04 finished in 26060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:37:57] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 13:37:57] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 13:37:57] [INFO ] Implicit Places using invariants in 111 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 113 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Peterson-COL-2-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-2-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-LTLCardinality-05 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:37:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:37:58] [INFO ] Invariant cache hit.
[2024-05-26 13:37:58] [INFO ] Implicit Places using invariants in 96 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-2-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-2-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-LTLCardinality-06 finished in 242 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 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:37:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:37:58] [INFO ] Invariant cache hit.
[2024-05-26 13:37:58] [INFO ] Implicit Places using invariants in 103 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 104 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-2-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 177 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-2-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-2-LTLCardinality-07 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:37:59] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:37:59] [INFO ] Invariant cache hit.
[2024-05-26 13:37:59] [INFO ] Implicit Places using invariants in 115 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 117 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-2-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 175 ms.
Product exploration explored 100000 steps with 33333 reset in 205 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-2-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-2-LTLCardinality-08 finished in 743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 42 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 102 transition count 120
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 96 transition count 120
Applied a total of 12 rules in 10 ms. Remains 96 /102 variables (removed 6) and now considering 120/126 (removed 6) transitions.
[2024-05-26 13:37:59] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
// Phase 1: matrix 114 rows 96 cols
[2024-05-26 13:37:59] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 13:37:59] [INFO ] Implicit Places using invariants in 112 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 114 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/102 places, 120/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 132 ms. Remains : 93/102 places, 120/126 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-2-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 448 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 1 ms.
FORMULA Peterson-COL-2-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLCardinality-10 finished in 650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 124
Reduce places removed 2 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 20 rules applied. Total rules applied 22 place count 100 transition count 106
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 40 place count 82 transition count 106
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 40 place count 82 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 79 transition count 103
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 54 place count 75 transition count 99
Applied a total of 54 rules in 14 ms. Remains 75 /102 variables (removed 27) and now considering 99/126 (removed 27) transitions.
[2024-05-26 13:38:00] [INFO ] Flow matrix only has 93 transitions (discarded 6 similar events)
// Phase 1: matrix 93 rows 75 cols
[2024-05-26 13:38:00] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 13:38:00] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-26 13:38:00] [INFO ] Flow matrix only has 93 transitions (discarded 6 similar events)
[2024-05-26 13:38:00] [INFO ] Invariant cache hit.
[2024-05-26 13:38:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 13:38:00] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-26 13:38:00] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-26 13:38:00] [INFO ] Flow matrix only has 93 transitions (discarded 6 similar events)
[2024-05-26 13:38:00] [INFO ] Invariant cache hit.
[2024-05-26 13:38:00] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-26 13:38:01] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-26 13:38:02] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:38:02] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-26 13:38:02] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 3/75 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 93/168 variables, 75/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 123 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5816 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 3/75 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 93/168 variables, 75/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 96/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 219 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3927 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 15/15 constraints]
After SMT, in 9771ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/102 places, 99/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10086 ms. Remains : 75/102 places, 99/126 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Peterson-COL-2-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-2-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-LTLCardinality-15 finished in 10272 ms.
All properties solved by simple procedures.
Total runtime 64184 ms.

BK_STOP 1716730690764

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Peterson-COL-2, 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 r268-smll-171654407100203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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