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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:00 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.9K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 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 SafeBus-COL-10-CTLCardinality-2024-00
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-01
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-02
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-03
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-04
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-05
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-06
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-07
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-08
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-09
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-10
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-11
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-12
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-13
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-14
FORMULA_NAME SafeBus-COL-10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716840291070

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:04:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 20:04:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:04:52] [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-27 20:04:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:04:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 569 ms
[2024-05-27 20:04:52] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2024-05-27 20:04:52] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-05-27 20:04:52] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-27 20:04:52] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
FORMULA SafeBus-COL-10-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (8 resets) in 2587 ms. (15 steps per ms) remains 48/79 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 46/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
// Phase 1: matrix 14 rows 17 cols
[2024-05-27 20:04:54] [INFO ] Computed 7 invariants in 7 ms
[2024-05-27 20:04:54] [INFO ] State equation strengthened by 3 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 35 solved, 11 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 3/6 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/7 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/31 variables, 17/24 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 3/27 constraints. Problems are: Problem set: 45 solved, 1 unsolved
[2024-05-27 20:04:54] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/28 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/28 constraints. Problems are: Problem set: 45 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 28 constraints, problems are : Problem set: 45 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 17/17 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 45 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/2 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/14 variables, 3/5 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/15 variables, 1/7 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/28 variables, 15/22 constraints. Problems are: Problem set: 45 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/28 variables, 2/24 constraints. Problems are: Problem set: 45 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 28/31 variables, and 25 constraints, problems are : Problem set: 46 solved, 0 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 15/17 constraints, ReadFeed: 2/3 constraints, PredecessorRefiner: 1/46 constraints, Known Traps: 1/1 constraints]
After SMT, in 356ms problems are : Problem set: 46 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 46 atomic propositions for a total of 15 simplifications.
FORMULA SafeBus-COL-10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:04:54] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-27 20:04:54] [INFO ] Flatten gal took : 15 ms
FORMULA SafeBus-COL-10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:04:54] [INFO ] Flatten gal took : 4 ms
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2024-05-27 20:04:54] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 43 ms.
[2024-05-27 20:04:54] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 20 places and 20 transitions.
Support contains 286 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 17 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 20:04:54] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 20:04:54] [INFO ] Computed 45 invariants in 34 ms
[2024-05-27 20:04:54] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-27 20:04:54] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:04:54] [INFO ] Invariant cache hit.
[2024-05-27 20:04:55] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:04:55] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-05-27 20:04:55] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:04:55] [INFO ] Invariant cache hit.
[2024-05-27 20:04:55] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 20:05:09] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 3 ms to minimize.
[2024-05-27 20:05:09] [INFO ] Deduced a trap composed of 52 places in 280 ms of which 2 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 3 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 2 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 2 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 2 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2024-05-27 20:05:11] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-05-27 20:05:11] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2024-05-27 20:05:20] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2024-05-27 20:05:20] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 2 ms to minimize.
[2024-05-27 20:05:20] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 2 ms to minimize.
[2024-05-27 20:05:21] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 2 ms to minimize.
[2024-05-27 20:05:21] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 2 ms to minimize.
[2024-05-27 20:05:21] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-05-27 20:05:21] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 2 ms to minimize.
[2024-05-27 20:05:22] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 2 ms to minimize.
[2024-05-27 20:05:22] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 2 ms to minimize.
[2024-05-27 20:05:23] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 20:05:41] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-05-27 20:05:41] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2024-05-27 20:05:42] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 3 ms to minimize.
[2024-05-27 20:05:42] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 2 ms to minimize.
[2024-05-27 20:05:42] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2024-05-27 20:05:42] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 1 ms to minimize.
[2024-05-27 20:05:42] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 2 ms to minimize.
[2024-05-27 20:05:42] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 2 ms to minimize.
[2024-05-27 20:05:43] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 3 ms to minimize.
[2024-05-27 20:05:43] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-05-27 20:05:46] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 2 ms to minimize.
[2024-05-27 20:05:46] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 2 ms to minimize.
[2024-05-27 20:05:46] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 3 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 5 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 2 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 2 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 2 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 2 ms to minimize.
[2024-05-27 20:05:48] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 3 ms to minimize.
[2024-05-27 20:05:48] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 20:05:58] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2024-05-27 20:05:58] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 2 ms to minimize.
[2024-05-27 20:05:58] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 2 ms to minimize.
[2024-05-27 20:06:00] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2024-05-27 20:06:00] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
SMT process timed out in 64784ms, After SMT, problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64808ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 16 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65712 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 286 out of 306 places after structural reductions.
[2024-05-27 20:06:00] [INFO ] Flatten gal took : 152 ms
[2024-05-27 20:06:00] [INFO ] Flatten gal took : 140 ms
[2024-05-27 20:06:01] [INFO ] Input system was already deterministic with 1531 transitions.
RANDOM walk for 40000 steps (8 resets) in 2475 ms. (16 steps per ms) remains 34/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
[2024-05-27 20:06:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:06:02] [INFO ] Invariant cache hit.
[2024-05-27 20:06:02] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 3/21 constraints. Problems are: Problem set: 25 solved, 8 unsolved
[2024-05-27 20:06:02] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 2 ms to minimize.
[2024-05-27 20:06:02] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 1 ms to minimize.
[2024-05-27 20:06:02] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 2 ms to minimize.
[2024-05-27 20:06:03] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 2 ms to minimize.
[2024-05-27 20:06:03] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 5/26 constraints. Problems are: Problem set: 25 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/26 constraints. Problems are: Problem set: 25 solved, 8 unsolved
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/275 variables, 1/27 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/27 constraints. Problems are: Problem set: 28 solved, 5 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 6 (OVERLAPS) 29/304 variables, 21/48 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/48 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/306 variables, 2/50 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/50 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 642/948 variables, 306/356 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/948 variables, 111/467 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/948 variables, 0/467 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/948 variables, 0/467 constraints. Problems are: Problem set: 32 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 948/948 variables, and 467 constraints, problems are : Problem set: 32 solved, 1 unsolved in 1545 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 306/306 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 32 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/217 variables, 9/9 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/9 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/226 variables, 9/18 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/18 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/302 variables, 24/42 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 5/47 constraints. Problems are: Problem set: 32 solved, 1 unsolved
[2024-05-27 20:06:04] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 2 ms to minimize.
[2024-05-27 20:06:04] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 2 ms to minimize.
[2024-05-27 20:06:04] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 2 ms to minimize.
[2024-05-27 20:06:04] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 2 ms to minimize.
[2024-05-27 20:06:05] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 2 ms to minimize.
[2024-05-27 20:06:05] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 2 ms to minimize.
[2024-05-27 20:06:05] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 2 ms to minimize.
[2024-05-27 20:06:05] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 2 ms to minimize.
[2024-05-27 20:06:05] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 9/56 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/56 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/304 variables, 2/58 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/58 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 641/945 variables, 304/362 constraints. Problems are: Problem set: 32 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/945 variables, 110/472 constraints. Problems are: Problem set: 32 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 945/948 variables, and 473 constraints, problems are : Problem set: 33 solved, 0 unsolved in 2726 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 304/306 constraints, ReadFeed: 110/111 constraints, PredecessorRefiner: 1/33 constraints, Known Traps: 14/14 constraints]
After SMT, in 4442ms problems are : Problem set: 33 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 33 atomic propositions for a total of 10 simplifications.
[2024-05-27 20:06:06] [INFO ] Flatten gal took : 78 ms
[2024-05-27 20:06:06] [INFO ] Flatten gal took : 75 ms
[2024-05-27 20:06:06] [INFO ] Input system was already deterministic with 1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 27 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-27 20:06:06] [INFO ] Flatten gal took : 61 ms
[2024-05-27 20:06:07] [INFO ] Flatten gal took : 63 ms
[2024-05-27 20:06:07] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 13 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-27 20:06:07] [INFO ] Flatten gal took : 60 ms
[2024-05-27 20:06:07] [INFO ] Flatten gal took : 61 ms
[2024-05-27 20:06:07] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 233 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 233 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-27 20:06:07] [INFO ] Flatten gal took : 55 ms
[2024-05-27 20:06:07] [INFO ] Flatten gal took : 57 ms
[2024-05-27 20:06:07] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-27 20:06:08] [INFO ] Flatten gal took : 54 ms
[2024-05-27 20:06:08] [INFO ] Flatten gal took : 59 ms
[2024-05-27 20:06:08] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-27 20:06:08] [INFO ] Flatten gal took : 64 ms
[2024-05-27 20:06:08] [INFO ] Flatten gal took : 55 ms
[2024-05-27 20:06:08] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 190 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 190 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-27 20:06:08] [INFO ] Flatten gal took : 48 ms
[2024-05-27 20:06:08] [INFO ] Flatten gal took : 52 ms
[2024-05-27 20:06:08] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 94 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-27 20:06:08] [INFO ] Flatten gal took : 50 ms
[2024-05-27 20:06:09] [INFO ] Flatten gal took : 55 ms
[2024-05-27 20:06:09] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-27 20:06:09] [INFO ] Flatten gal took : 48 ms
[2024-05-27 20:06:09] [INFO ] Flatten gal took : 53 ms
[2024-05-27 20:06:09] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-27 20:06:09] [INFO ] Flatten gal took : 49 ms
[2024-05-27 20:06:09] [INFO ] Flatten gal took : 55 ms
[2024-05-27 20:06:09] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-27 20:06:09] [INFO ] Flatten gal took : 50 ms
[2024-05-27 20:06:09] [INFO ] Flatten gal took : 55 ms
[2024-05-27 20:06:09] [INFO ] Input system was already deterministic with 1531 transitions.
[2024-05-27 20:06:09] [INFO ] Flatten gal took : 72 ms
[2024-05-27 20:06:09] [INFO ] Flatten gal took : 54 ms
[2024-05-27 20:06:09] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-27 20:06:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1531 transitions and 10404 arcs took 13 ms.
Total runtime 77838 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-COL-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 306
TRANSITIONS: 1531
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.051s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 759
MODEL NAME: /home/mcc/execution/414/model
306 places, 1531 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SafeBus-COL-10, 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 r333-tall-171679078300369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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