Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.8K Apr 13 01:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 13 01:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 13 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 01:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 13 01:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717217821123

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V10P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:02] [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-06-01 04:57:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:57:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 724 ms
[2024-06-01 04:57:03] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 48 PT places and 5438.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
[2024-06-01 04:57:03] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-06-01 04:57:03] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
RANDOM walk for 40000 steps (8 resets) in 2707 ms. (14 steps per ms) remains 40/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 04:57:05] [INFO ] Computed 4 invariants in 2 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
After SMT solving in domain Real declared 12/22 variables, and 4 constraints, problems are : Problem set: 39 solved, 0 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 219ms problems are : Problem set: 39 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 39 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:05] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 04:57:05] [INFO ] Flatten gal took : 21 ms
[2024-06-01 04:57:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:05] [INFO ] Flatten gal took : 3 ms
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 11)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 11) 11) 11)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 04:57:05] [INFO ] Unfolded HLPN to a Petri net with 48 places and 288 transitions 2090 arcs in 29 ms.
[2024-06-01 04:57:05] [INFO ] Unfolded 5 HLPN properties in 1 ms.
Support contains 14 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 13 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running 285 sub problems to find dead transitions.
[2024-06-01 04:57:05] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2024-06-01 04:57:05] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 04:57:05] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-01 04:57:06] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 9 ms to minimize.
[2024-06-01 04:57:07] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD267 is UNSAT
[2024-06-01 04:57:07] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
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
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/8 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/10 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 20 solved, 265 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 5 (OVERLAPS) 90/138 variables, 48/58 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 22/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 80 constraints, problems are : Problem set: 22 solved, 263 unsolved in 4715 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 22 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/8 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/10 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 90/138 variables, 48/58 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 22/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 263/343 constraints. Problems are: Problem set: 22 solved, 263 unsolved
[2024-06-01 04:57:14] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 344 constraints, problems are : Problem set: 22 solved, 263 unsolved in 10298 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 263/285 constraints, Known Traps: 4/4 constraints]
After SMT, in 15612ms problems are : Problem set: 22 solved, 263 unsolved
Search for dead transitions found 22 dead transitions in 15624ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 22 transitions.
[2024-06-01 04:57:21] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-06-01 04:57:21] [INFO ] Computed 9 invariants in 7 ms
[2024-06-01 04:57:21] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 04:57:21] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:57:21] [INFO ] Invariant cache hit.
[2024-06-01 04:57:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 04:57:21] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/48 places, 266/288 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15859 ms. Remains : 48/48 places, 266/288 transitions.
Support contains 14 out of 48 places after structural reductions.
[2024-06-01 04:57:21] [INFO ] Flatten gal took : 35 ms
[2024-06-01 04:57:21] [INFO ] Flatten gal took : 29 ms
[2024-06-01 04:57:21] [INFO ] Input system was already deterministic with 266 transitions.
RANDOM walk for 40000 steps (442 resets) in 1132 ms. (35 steps per ms) remains 14/18 properties
BEST_FIRST walk for 40003 steps (164 resets) in 337 ms. (118 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (216 resets) in 285 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (151 resets) in 145 ms. (273 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (180 resets) in 212 ms. (187 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (140 resets) in 166 ms. (239 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (137 resets) in 161 ms. (246 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (196 resets) in 169 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (152 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (165 resets) in 216 ms. (184 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (138 resets) in 179 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (136 resets) in 185 ms. (215 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (180 resets) in 180 ms. (221 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (166 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (156 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
[2024-06-01 04:57:22] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:57:22] [INFO ] Invariant cache hit.
[2024-06-01 04:57:22] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 15/134 variables, and 4 constraints, problems are : Problem set: 14 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/48 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 14 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 14 atomic propositions for a total of 5 simplifications.
[2024-06-01 04:57:22] [INFO ] Flatten gal took : 15 ms
[2024-06-01 04:57:22] [INFO ] Flatten gal took : 17 ms
[2024-06-01 04:57:23] [INFO ] Input system was already deterministic with 266 transitions.
Computed a total of 31 stabilizing places and 42 stable transitions
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 265
Applied a total of 3 rules in 32 ms. Remains 46 /48 variables (removed 2) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-06-01 04:57:23] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 46 cols
[2024-06-01 04:57:23] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 04:57:23] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 04:57:24] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 04:57:25] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/131 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 76 constraints, problems are : Problem set: 0 solved, 262 unsolved in 5322 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 04:57:29] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 85/131 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 262/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 12 (OVERLAPS) 0/131 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 339 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8972 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
After SMT, in 14646ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 14651ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 14685 ms. Remains : 46/48 places, 265/266 transitions.
[2024-06-01 04:57:37] [INFO ] Flatten gal took : 30 ms
[2024-06-01 04:57:37] [INFO ] Flatten gal took : 26 ms
[2024-06-01 04:57:37] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 7 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-06-01 04:57:37] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-06-01 04:57:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 04:57:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 04:57:38] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 3942 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 04:57:45] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8461 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
After SMT, in 12845ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 12850ms
Finished structural reductions in LTL mode , in 1 iterations and 12859 ms. Remains : 45/48 places, 265/266 transitions.
[2024-06-01 04:57:50] [INFO ] Flatten gal took : 17 ms
[2024-06-01 04:57:50] [INFO ] Flatten gal took : 15 ms
[2024-06-01 04:57:50] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Applied a total of 2 rules in 4 ms. Remains 46 /48 variables (removed 2) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 04:57:50] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-06-01 04:57:50] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 04:57:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:57:51] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:57:53] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 04:57:53] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 76 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4907 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 7177 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 12412ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 12417ms
Finished structural reductions in LTL mode , in 1 iterations and 12422 ms. Remains : 46/48 places, 266/266 transitions.
[2024-06-01 04:58:03] [INFO ] Flatten gal took : 11 ms
[2024-06-01 04:58:03] [INFO ] Flatten gal took : 10 ms
[2024-06-01 04:58:03] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 3 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 04:58:03] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-06-01 04:58:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 04:58:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:03] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:05] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4801 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:10] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10766 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15865ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15868ms
Finished structural reductions in LTL mode , in 1 iterations and 15872 ms. Remains : 47/48 places, 266/266 transitions.
[2024-06-01 04:58:19] [INFO ] Flatten gal took : 10 ms
[2024-06-01 04:58:19] [INFO ] Flatten gal took : 33 ms
[2024-06-01 04:58:19] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 17 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-06-01 04:58:19] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-06-01 04:58:19] [INFO ] Computed 7 invariants in 7 ms
[2024-06-01 04:58:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 04:58:20] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 3710 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 04:58:26] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8545 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
After SMT, in 12535ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 12539ms
Finished structural reductions in LTL mode , in 1 iterations and 12564 ms. Remains : 45/48 places, 265/266 transitions.
[2024-06-01 04:58:31] [INFO ] Flatten gal took : 21 ms
[2024-06-01 04:58:31] [INFO ] Flatten gal took : 37 ms
[2024-06-01 04:58:31] [INFO ] Input system was already deterministic with 265 transitions.
[2024-06-01 04:58:31] [INFO ] Flatten gal took : 24 ms
[2024-06-01 04:58:31] [INFO ] Flatten gal took : 26 ms
[2024-06-01 04:58:31] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 04:58:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 266 transitions and 1922 arcs took 20 ms.
Total runtime 89416 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-01
Could not compute solution for formula : BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-02
Could not compute solution for formula : BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-03
Could not compute solution for formula : BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-07
Could not compute solution for formula : BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-08

BK_STOP 1717217912338

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/640/ctl_0_
ctl formula name BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/640/ctl_1_
ctl formula name BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/640/ctl_2_
ctl formula name BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/640/ctl_3_
ctl formula name BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/640/ctl_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="BridgeAndVehicles-COL-V10P10N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-COL-V10P10N10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620398600009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V10P10N10.tgz
mv BridgeAndVehicles-COL-V10P10N10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;