Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620398600033.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 itstools
Input is BridgeAndVehicles-COL-V20P10N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620398600033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.9K Apr 13 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 02:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:35 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 4.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 14K Apr 13 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 13 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 41K 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-V20P10N50-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716320786449

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-21 19:46:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:46:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:46:28] [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-21 19:46:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 19:46:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 626 ms
[2024-05-21 19:46:28] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
[2024-05-21 19:46:28] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 19:46:28] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.3 ms
Remains 15 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-V20P10N50-CTLCardinality-2024-08 TRUE 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.1 ms
RANDOM walk for 40000 steps (8 resets) in 1792 ms. (22 steps per ms) remains 39/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 19:46:29] [INFO ] Computed 4 invariants in 5 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 35 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 35 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 1 unsolved
Problem AtomicPropp60 is UNSAT
After SMT solving in domain Int declared 7/22 variables, and 2 constraints, problems are : Problem set: 36 solved, 0 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 0/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 287ms problems are : Problem set: 36 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 36 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:46:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 19:46:30] [INFO ] Flatten gal took : 14 ms
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:46:30] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] 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-05-21 19:46:30] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 59 ms.
[2024-05-21 19:46:30] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 15 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 42 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 19:46:30] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 19:46:30] [INFO ] Computed 7 invariants in 20 ms
[2024-05-21 19:46:30] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 19:46:54] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 19:47:24] [INFO ] Deduced a trap composed of 55 places in 241 ms of which 2 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1494 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 7 constraints, problems are : Problem set: 7 solved, 2218 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 58023ms problems are : Problem set: 7 solved, 2218 unsolved
Search for dead transitions found 7 dead transitions in 58068ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 7 transitions.
[2024-05-21 19:47:28] [INFO ] Flow matrix only has 290 transitions (discarded 1931 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 19:47:28] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 19:47:28] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-21 19:47:28] [INFO ] Flow matrix only has 290 transitions (discarded 1931 similar events)
[2024-05-21 19:47:28] [INFO ] Invariant cache hit.
[2024-05-21 19:47:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:47:29] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/108 places, 2221/2228 transitions.
Applied a total of 0 rules in 28 ms. Remains 108 /108 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59768 ms. Remains : 108/108 places, 2221/2228 transitions.
Support contains 15 out of 108 places after structural reductions.
[2024-05-21 19:47:30] [INFO ] Flatten gal took : 188 ms
[2024-05-21 19:47:30] [INFO ] Flatten gal took : 167 ms
[2024-05-21 19:47:30] [INFO ] Input system was already deterministic with 2221 transitions.
RANDOM walk for 40000 steps (228 resets) in 2183 ms. (18 steps per ms) remains 26/44 properties
BEST_FIRST walk for 4006 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
[2024-05-21 19:47:31] [INFO ] Flow matrix only has 290 transitions (discarded 1931 similar events)
[2024-05-21 19:47:31] [INFO ] Invariant cache hit.
[2024-05-21 19:47:31] [INFO ] State equation strengthened by 102 read => feed constraints.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 21 solved, 2 unsolved
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/4 constraints. Problems are: Problem set: 21 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 21 solved, 2 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Real declared 15/398 variables, and 5 constraints, problems are : Problem set: 23 solved, 0 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 4/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
After SMT, in 235ms problems are : Problem set: 23 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 23 atomic propositions for a total of 9 simplifications.
[2024-05-21 19:47:31] [INFO ] Flatten gal took : 64 ms
[2024-05-21 19:47:32] [INFO ] Flatten gal took : 75 ms
[2024-05-21 19:47:32] [INFO ] Input system was already deterministic with 2221 transitions.
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 3183 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2221/2221 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2220
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2220
Applied a total of 4 rules in 27 ms. Remains 105 /108 variables (removed 3) and now considering 2220/2221 (removed 1) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 19:47:32] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-05-21 19:47:32] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 19:47:32] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 19:47:56] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 57025ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 57047ms
[2024-05-21 19:48:29] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
[2024-05-21 19:48:29] [INFO ] Invariant cache hit.
[2024-05-21 19:48:29] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-21 19:48:29] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
[2024-05-21 19:48:29] [INFO ] Invariant cache hit.
[2024-05-21 19:48:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:48:31] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1805 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/108 places, 2220/2221 transitions.
Applied a total of 0 rules in 23 ms. Remains 103 /103 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58907 ms. Remains : 103/108 places, 2220/2221 transitions.
[2024-05-21 19:48:31] [INFO ] Flatten gal took : 94 ms
[2024-05-21 19:48:31] [INFO ] Flatten gal took : 86 ms
[2024-05-21 19:48:31] [INFO ] Input system was already deterministic with 2220 transitions.
Support contains 0 out of 103 places (down from 1) after GAL structural reductions.
[2024-05-21 19:48:31] [INFO ] Flatten gal took : 181 ms
[2024-05-21 19:48:31] [INFO ] Flatten gal took : 93 ms
[2024-05-21 19:48:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality1445530521655707923.gal : 51 ms
[2024-05-21 19:48:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality13977084430136241621.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1445530521655707923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13977084430136241621.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.

BK_STOP 1716320953628

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -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="BridgeAndVehicles-COL-V20P10N50"
export BK_EXAMINATION="CTLCardinality"
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 BridgeAndVehicles-COL-V20P10N50, 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 r048-tajo-171620398600033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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