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.r245-tall-171654350000483.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 NeoElection-COL-7, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350000483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 11K Apr 11 19:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 19:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 108K 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 NeoElection-COL-7-LTLCardinality-00
FORMULA_NAME NeoElection-COL-7-LTLCardinality-01
FORMULA_NAME NeoElection-COL-7-LTLCardinality-02
FORMULA_NAME NeoElection-COL-7-LTLCardinality-03
FORMULA_NAME NeoElection-COL-7-LTLCardinality-04
FORMULA_NAME NeoElection-COL-7-LTLCardinality-05
FORMULA_NAME NeoElection-COL-7-LTLCardinality-06
FORMULA_NAME NeoElection-COL-7-LTLCardinality-07
FORMULA_NAME NeoElection-COL-7-LTLCardinality-08
FORMULA_NAME NeoElection-COL-7-LTLCardinality-09
FORMULA_NAME NeoElection-COL-7-LTLCardinality-10
FORMULA_NAME NeoElection-COL-7-LTLCardinality-11
FORMULA_NAME NeoElection-COL-7-LTLCardinality-12
FORMULA_NAME NeoElection-COL-7-LTLCardinality-13
FORMULA_NAME NeoElection-COL-7-LTLCardinality-14
FORMULA_NAME NeoElection-COL-7-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716670855042

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 21:00:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 21:00:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:00:56] [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-25 21:00:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 21:00:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 666 ms
[2024-05-25 21:00:57] [INFO ] Detected 6 constant HL places corresponding to 3552 PT places.
[2024-05-25 21:00:57] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 7128 PT places and 22272.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 21:00:57] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 6 ms.
[2024-05-25 21:00:57] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA NeoElection-COL-7-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Remains 11 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-7-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40011 steps (960 resets) in 309 ms. (129 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (139 resets) in 416 ms. (95 steps per ms) remains 1/1 properties
// Phase 1: matrix 7 rows 6 cols
[2024-05-25 21:00:57] [INFO ] Computed 1 invariants in 5 ms
[2024-05-25 21:00:57] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
FORMULA NeoElection-COL-7-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 21:00:57] [INFO ] Flatten gal took : 13 ms
[2024-05-25 21:00:57] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA NeoElection-COL-7-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 21:00:57] [INFO ] Flatten gal took : 2 ms
Domain [M(8), POS(7), M(8)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 7)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-25 21:00:57] [INFO ] Unfolded HLPN to a Petri net with 7128 places and 12460 transitions 70880 arcs in 203 ms.
[2024-05-25 21:00:57] [INFO ] Unfolded 3 HLPN properties in 1 ms.
Deduced a syphon composed of 6688 places in 40 ms
Reduce places removed 6737 places and 11850 transitions.
Reduce places removed 8 places and 0 transitions.
Support contains 21 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 610/610 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 341 transition count 610
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 107 place count 276 transition count 250
Iterating global reduction 1 with 65 rules applied. Total rules applied 172 place count 276 transition count 250
Applied a total of 172 rules in 47 ms. Remains 276 /383 variables (removed 107) and now considering 250/610 (removed 360) transitions.
[2024-05-25 21:00:58] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
// Phase 1: matrix 214 rows 276 cols
[2024-05-25 21:00:58] [INFO ] Computed 62 invariants in 22 ms
[2024-05-25 21:00:58] [INFO ] Implicit Places using invariants in 281 ms returned [19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 290 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/383 places, 250/610 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 355 ms. Remains : 227/383 places, 250/610 transitions.
Support contains 21 out of 227 places after structural reductions.
[2024-05-25 21:00:58] [INFO ] Flatten gal took : 34 ms
[2024-05-25 21:00:58] [INFO ] Flatten gal took : 27 ms
[2024-05-25 21:00:58] [INFO ] Input system was already deterministic with 250 transitions.
RANDOM walk for 40000 steps (68 resets) in 1125 ms. (35 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
[2024-05-25 21:00:58] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
// Phase 1: matrix 214 rows 227 cols
[2024-05-25 21:00:58] [INFO ] Computed 13 invariants in 6 ms
[2024-05-25 21:00:58] [INFO ] State equation strengthened by 6 read => feed constraints.
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 7/441 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/227 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
Computed a total of 227 stabilizing places and 250 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 227 transition count 250
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 7 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 220 transition count 243
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 220 transition count 243
Applied a total of 14 rules in 9 ms. Remains 220 /227 variables (removed 7) and now considering 243/250 (removed 7) transitions.
[2024-05-25 21:00:59] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 220 cols
[2024-05-25 21:00:59] [INFO ] Computed 13 invariants in 2 ms
[2024-05-25 21:00:59] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-25 21:00:59] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2024-05-25 21:00:59] [INFO ] Invariant cache hit.
[2024-05-25 21:00:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:00:59] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-25 21:00:59] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2024-05-25 21:00:59] [INFO ] Invariant cache hit.
[2024-05-25 21:00:59] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 7/220 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Problem TDEAD18 is UNSAT
At refinement iteration 4 (OVERLAPS) 207/427 variables, 220/233 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 6/239 constraints. Problems are: Problem set: 1 solved, 235 unsolved
[2024-05-25 21:01:03] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 21 ms to minimize.
[2024-05-25 21:01:03] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-25 21:01:03] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-25 21:01:03] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:01:03] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:01:03] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-25 21:01:03] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
[2024-05-25 21:01:03] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
[2024-05-25 21:01:04] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-25 21:01:04] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 2 ms to minimize.
[2024-05-25 21:01:05] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-05-25 21:01:05] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-25 21:01:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 21:01:05] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-25 21:01:05] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-25 21:01:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 21:01:05] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-25 21:01:05] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-25 21:01:05] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-25 21:01:05] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 20/259 constraints. Problems are: Problem set: 1 solved, 235 unsolved
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-25 21:01:07] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-25 21:01:08] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
[2024-05-25 21:01:08] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
[2024-05-25 21:01:08] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-25 21:01:08] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-25 21:01:08] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-25 21:01:08] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 20/279 constraints. Problems are: Problem set: 1 solved, 235 unsolved
[2024-05-25 21:01:09] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-25 21:01:09] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-25 21:01:09] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-25 21:01:09] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-25 21:01:09] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-25 21:01:09] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-25 21:01:09] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-25 21:01:09] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-25 21:01:09] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-25 21:01:09] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-25 21:01:10] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-25 21:01:10] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-25 21:01:11] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-25 21:01:11] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 14/293 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 235 unsolved
[2024-05-25 21:01:14] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-25 21:01:14] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-25 21:01:14] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 5 ms to minimize.
[2024-05-25 21:01:14] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-25 21:01:14] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-25 21:01:14] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-25 21:01:15] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-25 21:01:15] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-25 21:01:15] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/427 variables, 9/302 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 12 (OVERLAPS) 0/427 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 302 constraints, problems are : Problem set: 1 solved, 235 unsolved in 21706 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 220/220 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 1 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 7/220 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 63/76 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 207/427 variables, 220/296 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 6/302 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 235/537 constraints. Problems are: Problem set: 1 solved, 235 unsolved
[2024-05-25 21:01:24] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-25 21:01:24] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-25 21:01:27] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 3/540 constraints. Problems are: Problem set: 1 solved, 235 unsolved
[2024-05-25 21:01:32] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 1/541 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/541 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 11 (OVERLAPS) 0/427 variables, 0/541 constraints. Problems are: Problem set: 1 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 541 constraints, problems are : Problem set: 1 solved, 235 unsolved in 25317 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 220/220 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 235/236 constraints, Known Traps: 67/67 constraints]
After SMT, in 47172ms problems are : Problem set: 1 solved, 235 unsolved
Search for dead transitions found 1 dead transitions in 47179ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 220/227 places, 242/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 220 /220 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47546 ms. Remains : 220/227 places, 242/250 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA NeoElection-COL-7-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLCardinality-05 finished in 47870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(p0)))))'
Support contains 7 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 227 /227 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-25 21:01:46] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
// Phase 1: matrix 214 rows 227 cols
[2024-05-25 21:01:46] [INFO ] Computed 13 invariants in 5 ms
[2024-05-25 21:01:46] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-25 21:01:46] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2024-05-25 21:01:46] [INFO ] Invariant cache hit.
[2024-05-25 21:01:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:01:47] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-25 21:01:47] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2024-05-25 21:01:47] [INFO ] Invariant cache hit.
[2024-05-25 21:01:47] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 7/227 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Problem TDEAD18 is UNSAT
At refinement iteration 4 (OVERLAPS) 214/441 variables, 227/240 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 6/246 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:01:51] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:01:51] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-25 21:01:51] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:01:51] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-25 21:01:51] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-25 21:01:51] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-25 21:01:51] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-25 21:01:51] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-25 21:01:52] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-25 21:01:52] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 21:01:52] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-25 21:01:52] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-25 21:01:52] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-25 21:01:52] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-25 21:01:53] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-25 21:01:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-25 21:01:53] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-25 21:01:53] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-25 21:01:53] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-25 21:01:53] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/266 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:01:54] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-25 21:01:54] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-25 21:01:55] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-25 21:01:55] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-25 21:01:55] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-25 21:01:55] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-25 21:01:55] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/286 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-25 21:01:56] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-25 21:01:57] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-25 21:01:58] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 20/306 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-25 21:01:59] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-25 21:02:01] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-25 21:02:01] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:02:01] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-25 21:02:01] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-25 21:02:01] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 12/318 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:02:03] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-25 21:02:03] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-25 21:02:03] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-25 21:02:03] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 3 ms to minimize.
[2024-05-25 21:02:04] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 5/323 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:02:04] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/324 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:02:09] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-25 21:02:09] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/441 variables, 2/326 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/326 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 15 (OVERLAPS) 0/441 variables, 0/326 constraints. Problems are: Problem set: 1 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 326 constraints, problems are : Problem set: 1 solved, 242 unsolved in 28124 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 227/227 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 1 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 7/227 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 80/93 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 214/441 variables, 227/320 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 6/326 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 242/568 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/441 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 568 constraints, problems are : Problem set: 1 solved, 242 unsolved in 15407 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 227/227 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 242/243 constraints, Known Traps: 80/80 constraints]
After SMT, in 43632ms problems are : Problem set: 1 solved, 242 unsolved
Search for dead transitions found 1 dead transitions in 43641ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 227/227 places, 249/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 227 /227 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43963 ms. Remains : 227/227 places, 249/250 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-7-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLCardinality-06 finished in 44127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 7 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-25 21:02:31] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2024-05-25 21:02:31] [INFO ] Invariant cache hit.
[2024-05-25 21:02:31] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-25 21:02:31] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2024-05-25 21:02:31] [INFO ] Invariant cache hit.
[2024-05-25 21:02:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 21:02:31] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-25 21:02:31] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2024-05-25 21:02:31] [INFO ] Invariant cache hit.
[2024-05-25 21:02:31] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 7/227 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Problem TDEAD18 is UNSAT
At refinement iteration 4 (OVERLAPS) 214/441 variables, 227/240 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 6/246 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:02:35] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-25 21:02:35] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-25 21:02:35] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-25 21:02:35] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-25 21:02:35] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-25 21:02:35] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-25 21:02:35] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-25 21:02:35] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-25 21:02:36] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-25 21:02:36] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-25 21:02:36] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-25 21:02:37] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-25 21:02:37] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-25 21:02:37] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-25 21:02:37] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-25 21:02:37] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-25 21:02:37] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-25 21:02:37] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-25 21:02:37] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-25 21:02:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/266 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:02:38] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-25 21:02:39] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
[2024-05-25 21:02:39] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-25 21:02:39] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-25 21:02:39] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-25 21:02:39] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/286 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-25 21:02:40] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-25 21:02:41] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-25 21:02:42] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-25 21:02:42] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 20/306 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-25 21:02:43] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-25 21:02:44] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-25 21:02:44] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-25 21:02:45] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-25 21:02:45] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-25 21:02:45] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 12/318 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:02:46] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-25 21:02:47] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-25 21:02:47] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-25 21:02:47] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-25 21:02:48] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 5/323 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:02:48] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/324 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 242 unsolved
[2024-05-25 21:02:53] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-25 21:02:53] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/441 variables, 2/326 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/326 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 15 (OVERLAPS) 0/441 variables, 0/326 constraints. Problems are: Problem set: 1 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 326 constraints, problems are : Problem set: 1 solved, 242 unsolved in 27870 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 227/227 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 1 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 7/227 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 80/93 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 214/441 variables, 227/320 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 6/326 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 242/568 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/441 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 568 constraints, problems are : Problem set: 1 solved, 242 unsolved in 15627 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 227/227 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 242/243 constraints, Known Traps: 80/80 constraints]
After SMT, in 43610ms problems are : Problem set: 1 solved, 242 unsolved
Search for dead transitions found 1 dead transitions in 43614ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 227/227 places, 249/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43920 ms. Remains : 227/227 places, 249/250 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-7-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLCardinality-08 finished in 44034 ms.
All properties solved by simple procedures.
Total runtime 138800 ms.
ITS solved all properties within timeout

BK_STOP 1716670995140

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is NeoElection-COL-7, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654350000483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-7.tgz
mv NeoElection-COL-7 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;