Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Apr 13 02:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 13 02:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 13 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 13 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 13 03:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 41K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717218083398

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:01:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:01:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:01:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:01:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:01:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 520 ms
[2024-06-01 05:01:25] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:01:25] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-06-01 05:01:25] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
RANDOM walk for 40000 steps (8 resets) in 1017 ms. (39 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 448 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/2 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:01:25] [INFO ] Computed 4 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 3/22 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
[2024-06-01 05:01:26] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-06-01 05:01:26] [INFO ] Flatten gal took : 13 ms
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:01:26] [INFO ] Flatten gal took : 1 ms
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 05:01:26] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 47 ms.
[2024-06-01 05:01:26] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Support contains 10 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 2228
Applied a total of 1 rules in 45 ms. Remains 107 /108 variables (removed 1) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-06-01 05:01:26] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2024-06-01 05:01:26] [INFO ] Computed 6 invariants in 14 ms
[2024-06-01 05:01:26] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:01:48] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/397 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:02:17] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 1 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1596 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/397 variables, and 7 constraints, problems are : Problem set: 9 solved, 2216 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 55663ms problems are : Problem set: 9 solved, 2216 unsolved
Search for dead transitions found 9 dead transitions in 55706ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
[2024-06-01 05:02:22] [INFO ] Flow matrix only has 290 transitions (discarded 1929 similar events)
// Phase 1: matrix 290 rows 107 cols
[2024-06-01 05:02:22] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:02:22] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-01 05:02:22] [INFO ] Flow matrix only has 290 transitions (discarded 1929 similar events)
[2024-06-01 05:02:22] [INFO ] Invariant cache hit.
[2024-06-01 05:02:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:02:23] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 2219/2228 transitions.
Applied a total of 0 rules in 17 ms. Remains 107 /107 variables (removed 0) and now considering 2219/2219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56988 ms. Remains : 107/108 places, 2219/2228 transitions.
Support contains 10 out of 107 places after structural reductions.
[2024-06-01 05:02:23] [INFO ] Flatten gal took : 135 ms
[2024-06-01 05:02:23] [INFO ] Flatten gal took : 118 ms
[2024-06-01 05:02:23] [INFO ] Input system was already deterministic with 2219 transitions.
RANDOM walk for 40000 steps (228 resets) in 1692 ms. (23 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40002 steps (108 resets) in 311 ms. (128 steps per ms) remains 1/1 properties
[2024-06-01 05:02:24] [INFO ] Flow matrix only has 290 transitions (discarded 1929 similar events)
[2024-06-01 05:02:24] [INFO ] Invariant cache hit.
[2024-06-01 05:02:24] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 6/397 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Computed a total of 50 stabilizing places and 84 stable transitions
Graph (complete) has 3180 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.30 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 2219/2219 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 2219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 105 transition count 2218
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 105 transition count 2218
Applied a total of 3 rules in 31 ms. Remains 105 /107 variables (removed 2) and now considering 2218/2219 (removed 1) transitions.
Running 2215 sub problems to find dead transitions.
[2024-06-01 05:02:24] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-06-01 05:02:24] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:02:24] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-06-01 05:02:47] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2215/2215 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-06-01 05:03:20] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 2 ms to minimize.
Problem TDEAD1637 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 7 constraints, problems are : Problem set: 1 solved, 2214 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2215 constraints, Known Traps: 2/2 constraints]
After SMT, in 56351ms problems are : Problem set: 1 solved, 2214 unsolved
Search for dead transitions found 1 dead transitions in 56380ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-06-01 05:03:21] [INFO ] Flow matrix only has 289 transitions (discarded 1928 similar events)
[2024-06-01 05:03:21] [INFO ] Invariant cache hit.
[2024-06-01 05:03:21] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-06-01 05:03:21] [INFO ] Flow matrix only has 289 transitions (discarded 1928 similar events)
[2024-06-01 05:03:21] [INFO ] Invariant cache hit.
[2024-06-01 05:03:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:03:23] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2001 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/107 places, 2217/2219 transitions.
Applied a total of 0 rules in 20 ms. Remains 104 /104 variables (removed 0) and now considering 2217/2217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58443 ms. Remains : 104/107 places, 2217/2219 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04
Product exploration explored 100000 steps with 9469 reset in 853 ms.
Product exploration explored 100000 steps with 9329 reset in 677 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/104 stabilizing places and 83/2217 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
[2024-06-01 05:03:25] [INFO ] Flow matrix only has 289 transitions (discarded 1928 similar events)
// Phase 1: matrix 289 rows 104 cols
[2024-06-01 05:03:25] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:03:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:26] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-06-01 05:03:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:26] [INFO ] [Nat]Absence check using state equation in 39 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04 finished in 62297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 2219/2219 transitions.
Graph (complete) has 3180 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 2218
Applied a total of 3 rules in 426 ms. Remains 105 /107 variables (removed 2) and now considering 2218/2219 (removed 1) transitions.
Running 2215 sub problems to find dead transitions.
[2024-06-01 05:03:27] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-06-01 05:03:27] [INFO ] Computed 5 invariants in 9 ms
[2024-06-01 05:03:27] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-06-01 05:03:48] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2215/2215 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2215 constraints, Known Traps: 1/1 constraints]
After SMT, in 55712ms problems are : Problem set: 0 solved, 2215 unsolved
Search for dead transitions found 0 dead transitions in 55741ms
[2024-06-01 05:04:23] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:04:23] [INFO ] Invariant cache hit.
[2024-06-01 05:04:23] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 05:04:23] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:04:23] [INFO ] Invariant cache hit.
[2024-06-01 05:04:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:04:24] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1275 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/107 places, 2218/2219 transitions.
Applied a total of 0 rules in 254 ms. Remains 104 /104 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57704 ms. Remains : 104/107 places, 2218/2219 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05
Product exploration explored 100000 steps with 684 reset in 945 ms.
Product exploration explored 100000 steps with 685 reset in 709 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/104 stabilizing places and 83/2218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 362 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 170 steps (0 resets) in 8 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 597 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2218/2218 transitions.
Applied a total of 0 rules in 239 ms. Remains 104 /104 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
Running 2215 sub problems to find dead transitions.
[2024-06-01 05:04:27] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
// Phase 1: matrix 289 rows 104 cols
[2024-06-01 05:04:27] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:04:27] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-06-01 05:04:49] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2215/2215 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2215 constraints, Known Traps: 1/1 constraints]
After SMT, in 54970ms problems are : Problem set: 0 solved, 2215 unsolved
Search for dead transitions found 0 dead transitions in 54997ms
[2024-06-01 05:05:22] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:05:22] [INFO ] Invariant cache hit.
[2024-06-01 05:05:23] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 05:05:23] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:05:23] [INFO ] Invariant cache hit.
[2024-06-01 05:05:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:05:24] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
[2024-06-01 05:05:24] [INFO ] Redundant transitions in 121 ms returned []
Running 2215 sub problems to find dead transitions.
[2024-06-01 05:05:24] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:05:24] [INFO ] Invariant cache hit.
[2024-06-01 05:05:24] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-06-01 05:05:45] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2024-06-01 05:06:03] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 1 ms to minimize.
Problem TDEAD1637 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2096 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/393 variables, and 7 constraints, problems are : Problem set: 10 solved, 2205 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2215/2215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 2205 unsolved
Problem TDEAD2147 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/7 constraints. Problems are: Problem set: 11 solved, 2204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 2204 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 289/393 variables, 104/111 constraints. Problems are: Problem set: 13 solved, 2202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 102/213 constraints. Problems are: Problem set: 13 solved, 2202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/393 variables, and 2415 constraints, problems are : Problem set: 13 solved, 2202 unsolved in 34689 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2202/2215 constraints, Known Traps: 2/2 constraints]
After SMT, in 79667ms problems are : Problem set: 13 solved, 2202 unsolved
Search for dead transitions found 13 dead transitions in 79691ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 2205/2218 transitions.
Applied a total of 0 rules in 178 ms. Remains 104 /104 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2024-06-01 05:06:44] [INFO ] Redundant transitions in 98 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 136586 ms. Remains : 104/104 places, 2205/2218 transitions.
Computed a total of 47 stabilizing places and 81 stable transitions
Computed a total of 47 stabilizing places and 81 stable transitions
Detected a total of 47/104 stabilizing places and 81/2205 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 260 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 159 steps (0 resets) in 8 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 583 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 685 reset in 904 ms.
Product exploration explored 100000 steps with 685 reset in 748 ms.
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2205/2205 transitions.
Applied a total of 0 rules in 212 ms. Remains 104 /104 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 2202 sub problems to find dead transitions.
[2024-06-01 05:06:47] [INFO ] Flow matrix only has 286 transitions (discarded 1919 similar events)
// Phase 1: matrix 286 rows 104 cols
[2024-06-01 05:06:47] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 05:06:47] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2202 unsolved
[2024-06-01 05:07:09] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2024-06-01 05:07:11] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1083 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/390 variables, and 8 constraints, problems are : Problem set: 19 solved, 2183 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2202/2202 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 19 solved, 2183 unsolved
Problem TDEAD1134 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/8 constraints. Problems are: Problem set: 20 solved, 2182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/390 variables, and 8 constraints, problems are : Problem set: 20 solved, 2182 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2202 constraints, Known Traps: 2/2 constraints]
After SMT, in 55824ms problems are : Problem set: 20 solved, 2182 unsolved
Search for dead transitions found 20 dead transitions in 55847ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-06-01 05:07:43] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
// Phase 1: matrix 285 rows 104 cols
[2024-06-01 05:07:43] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 05:07:43] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-01 05:07:43] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
[2024-06-01 05:07:43] [INFO ] Invariant cache hit.
[2024-06-01 05:07:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:07:44] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 1756 ms to find 0 implicit places.
[2024-06-01 05:07:44] [INFO ] Redundant transitions in 55 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 2185/2205 transitions.
Applied a total of 0 rules in 220 ms. Remains 104 /104 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58103 ms. Remains : 104/104 places, 2185/2205 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05 finished in 258536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 2219/2219 transitions.
Graph (complete) has 3180 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2218
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 101 transition count 2215
Applied a total of 10 rules in 365 ms. Remains 101 /107 variables (removed 6) and now considering 2215/2219 (removed 4) transitions.
[2024-06-01 05:07:45] [INFO ] Flow matrix only has 286 transitions (discarded 1929 similar events)
// Phase 1: matrix 286 rows 101 cols
[2024-06-01 05:07:45] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 05:07:46] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-06-01 05:07:46] [INFO ] Flow matrix only has 286 transitions (discarded 1929 similar events)
[2024-06-01 05:07:46] [INFO ] Invariant cache hit.
[2024-06-01 05:07:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:07:47] [INFO ] Implicit Places using invariants and state equation in 869 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1224 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/107 places, 2215/2219 transitions.
Applied a total of 0 rules in 205 ms. Remains 100 /100 variables (removed 0) and now considering 2215/2215 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1796 ms. Remains : 100/107 places, 2215/2219 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10
Product exploration explored 100000 steps with 26059 reset in 692 ms.
Product exploration explored 100000 steps with 26175 reset in 553 ms.
Computed a total of 45 stabilizing places and 82 stable transitions
Computed a total of 45 stabilizing places and 82 stable transitions
Detected a total of 45/100 stabilizing places and 82/2215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 9 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-06-01 05:07:48] [INFO ] Flow matrix only has 286 transitions (discarded 1929 similar events)
// Phase 1: matrix 286 rows 100 cols
[2024-06-01 05:07:49] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:07:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:07:49] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-01 05:07:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:07:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:07:50] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 05:07:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:07:50] [INFO ] [Nat]Added 102 Read/Feed constraints in 575 ms returned sat
[2024-06-01 05:07:50] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 193 transitions) in 136 ms.
[2024-06-01 05:07:51] [INFO ] Added : 3 causal constraints over 2 iterations in 248 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 2215/2215 transitions.
Applied a total of 0 rules in 173 ms. Remains 100 /100 variables (removed 0) and now considering 2215/2215 (removed 0) transitions.
[2024-06-01 05:07:51] [INFO ] Flow matrix only has 286 transitions (discarded 1929 similar events)
[2024-06-01 05:07:51] [INFO ] Invariant cache hit.
[2024-06-01 05:07:51] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-06-01 05:07:51] [INFO ] Flow matrix only has 286 transitions (discarded 1929 similar events)
[2024-06-01 05:07:51] [INFO ] Invariant cache hit.
[2024-06-01 05:07:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:07:52] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2024-06-01 05:07:52] [INFO ] Redundant transitions in 56 ms returned []
Running 2212 sub problems to find dead transitions.
[2024-06-01 05:07:52] [INFO ] Flow matrix only has 286 transitions (discarded 1929 similar events)
[2024-06-01 05:07:52] [INFO ] Invariant cache hit.
[2024-06-01 05:07:52] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2212 unsolved
[2024-06-01 05:08:22] [INFO ] Deduced a trap composed of 53 places in 234 ms of which 1 ms to minimize.
Problem TDEAD633 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1143 is UNSAT
[2024-06-01 05:08:31] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 0 ms to minimize.
Problem TDEAD1195 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1705 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/386 variables, and 6 constraints, problems are : Problem set: 22 solved, 2190 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2212/2212 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 22 solved, 2190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 22 solved, 2190 unsolved
Problem TDEAD1756 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2164 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/6 constraints. Problems are: Problem set: 31 solved, 2181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 31 solved, 2181 unsolved
SMT process timed out in 75657ms, After SMT, problems are : Problem set: 31 solved, 2181 unsolved
Search for dead transitions found 31 dead transitions in 75683ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 2184/2215 transitions.
Applied a total of 0 rules in 230 ms. Remains 100 /100 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-06-01 05:09:08] [INFO ] Redundant transitions in 55 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 77433 ms. Remains : 100/100 places, 2184/2215 transitions.
Computed a total of 45 stabilizing places and 82 stable transitions
Computed a total of 45 stabilizing places and 82 stable transitions
Detected a total of 45/100 stabilizing places and 82/2184 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 05:09:09] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
// Phase 1: matrix 284 rows 100 cols
[2024-06-01 05:09:09] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:09:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:09:09] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-06-01 05:09:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:09:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:09:10] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-01 05:09:10] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:09:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 05:09:12] [INFO ] [Nat]Added 100 Read/Feed constraints in 2259 ms returned sat
[2024-06-01 05:09:12] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 1 ms to minimize.
[2024-06-01 05:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2024-06-01 05:09:13] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 191 transitions) in 86 ms.
[2024-06-01 05:09:13] [INFO ] Added : 23 causal constraints over 6 iterations in 269 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 26025 reset in 661 ms.
Product exploration explored 100000 steps with 26161 reset in 519 ms.
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 2184/2184 transitions.
Applied a total of 0 rules in 161 ms. Remains 100 /100 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-06-01 05:09:14] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
[2024-06-01 05:09:14] [INFO ] Invariant cache hit.
[2024-06-01 05:09:14] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 05:09:14] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
[2024-06-01 05:09:14] [INFO ] Invariant cache hit.
[2024-06-01 05:09:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:09:16] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
[2024-06-01 05:09:16] [INFO ] Redundant transitions in 66 ms returned []
Running 2181 sub problems to find dead transitions.
[2024-06-01 05:09:16] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
[2024-06-01 05:09:16] [INFO ] Invariant cache hit.
[2024-06-01 05:09:16] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/384 variables, and 4 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2181/2181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
At refinement iteration 2 (OVERLAPS) 284/384 variables, 100/104 constraints. Problems are: Problem set: 81 solved, 2100 unsolved
SMT process timed out in 76153ms, After SMT, problems are : Problem set: 81 solved, 2100 unsolved
Search for dead transitions found 81 dead transitions in 76179ms
Found 81 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 81 transitions
Dead transitions reduction (with SMT) removed 81 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 2103/2184 transitions.
Reduce places removed 9 places and 316 transitions.
Applied a total of 0 rules in 162 ms. Remains 91 /100 variables (removed 9) and now considering 1787/2103 (removed 316) transitions.
[2024-06-01 05:10:32] [INFO ] Redundant transitions in 37 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 78476 ms. Remains : 91/100 places, 1787/2184 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 finished in 167686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 2219/2219 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 2219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 105 transition count 2218
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 105 transition count 2218
Applied a total of 3 rules in 29 ms. Remains 105 /107 variables (removed 2) and now considering 2218/2219 (removed 1) transitions.
Running 2215 sub problems to find dead transitions.
[2024-06-01 05:10:33] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-06-01 05:10:33] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:10:33] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-06-01 05:10:56] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2215/2215 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2215 constraints, Known Traps: 1/1 constraints]
After SMT, in 56696ms problems are : Problem set: 0 solved, 2215 unsolved
Search for dead transitions found 0 dead transitions in 56731ms
[2024-06-01 05:11:29] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:11:29] [INFO ] Invariant cache hit.
[2024-06-01 05:11:30] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 05:11:30] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:11:30] [INFO ] Invariant cache hit.
[2024-06-01 05:11:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:11:31] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1343 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/107 places, 2218/2219 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58125 ms. Remains : 104/107 places, 2218/2219 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 164 steps with 1 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11 finished in 58298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p0))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 2219/2219 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2218
Applied a total of 2 rules in 178 ms. Remains 106 /107 variables (removed 1) and now considering 2218/2219 (removed 1) transitions.
Running 2215 sub problems to find dead transitions.
[2024-06-01 05:11:31] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-06-01 05:11:31] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 05:11:31] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-06-01 05:11:53] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2215/2215 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2215 constraints, Known Traps: 1/1 constraints]
After SMT, in 56365ms problems are : Problem set: 0 solved, 2215 unsolved
Search for dead transitions found 0 dead transitions in 56386ms
[2024-06-01 05:12:27] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:12:27] [INFO ] Invariant cache hit.
[2024-06-01 05:12:28] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 05:12:28] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:12:28] [INFO ] Invariant cache hit.
[2024-06-01 05:12:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:12:29] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1542 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/107 places, 2218/2219 transitions.
Applied a total of 0 rules in 170 ms. Remains 104 /104 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58281 ms. Remains : 104/107 places, 2218/2219 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14
Product exploration explored 100000 steps with 1471 reset in 768 ms.
Product exploration explored 100000 steps with 1478 reset in 638 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 3090 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/104 stabilizing places and 83/2218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 206 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 05:12:31] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
// Phase 1: matrix 289 rows 104 cols
[2024-06-01 05:12:31] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:12:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:12:32] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-01 05:12:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:12:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:12:33] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 05:12:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:12:33] [INFO ] [Nat]Added 102 Read/Feed constraints in 383 ms returned sat
[2024-06-01 05:12:33] [INFO ] Deduced a trap composed of 55 places in 241 ms of which 2 ms to minimize.
[2024-06-01 05:12:34] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2024-06-01 05:12:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1313 ms
[2024-06-01 05:12:34] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 147 ms.
[2024-06-01 05:12:35] [INFO ] Added : 27 causal constraints over 7 iterations in 343 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2218/2218 transitions.
Applied a total of 0 rules in 206 ms. Remains 104 /104 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
Running 2215 sub problems to find dead transitions.
[2024-06-01 05:12:35] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:12:35] [INFO ] Invariant cache hit.
[2024-06-01 05:12:35] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-06-01 05:12:57] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2215/2215 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2215 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2215 constraints, Known Traps: 1/1 constraints]
After SMT, in 56560ms problems are : Problem set: 0 solved, 2215 unsolved
Search for dead transitions found 0 dead transitions in 56590ms
[2024-06-01 05:13:31] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:13:31] [INFO ] Invariant cache hit.
[2024-06-01 05:13:32] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-01 05:13:32] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:13:32] [INFO ] Invariant cache hit.
[2024-06-01 05:13:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:13:33] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1348 ms to find 0 implicit places.
[2024-06-01 05:13:33] [INFO ] Redundant transitions in 56 ms returned []
Running 2215 sub problems to find dead transitions.
[2024-06-01 05:13:33] [INFO ] Flow matrix only has 289 transitions (discarded 1929 similar events)
[2024-06-01 05:13:33] [INFO ] Invariant cache hit.
[2024-06-01 05:13:33] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-06-01 05:13:55] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 2 ms to minimize.
[2024-06-01 05:14:17] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 3 ms to minimize.
Problem TDEAD1637 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1739 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/393 variables, and 7 constraints, problems are : Problem set: 3 solved, 2212 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2215/2215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2212 unsolved
Problem TDEAD1790 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2147 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/7 constraints. Problems are: Problem set: 11 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/393 variables, and 7 constraints, problems are : Problem set: 11 solved, 2204 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2215 constraints, Known Traps: 2/2 constraints]
After SMT, in 75804ms problems are : Problem set: 11 solved, 2204 unsolved
Search for dead transitions found 11 dead transitions in 75832ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 2207/2218 transitions.
Applied a total of 0 rules in 171 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
[2024-06-01 05:14:49] [INFO ] Redundant transitions in 37 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 134270 ms. Remains : 104/104 places, 2207/2218 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 3077 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/104 stabilizing places and 83/2207 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 272 steps (0 resets) in 6 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 05:14:50] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 104 cols
[2024-06-01 05:14:50] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:14:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:14:50] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-06-01 05:14:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:14:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:14:51] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-06-01 05:14:51] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:14:51] [INFO ] [Nat]Added 101 Read/Feed constraints in 174 ms returned sat
[2024-06-01 05:14:51] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 195 transitions) in 99 ms.
[2024-06-01 05:14:52] [INFO ] Added : 23 causal constraints over 6 iterations in 694 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1478 reset in 754 ms.
Product exploration explored 100000 steps with 1494 reset in 584 ms.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2207/2207 transitions.
Applied a total of 0 rules in 154 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:14:54] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:14:54] [INFO ] Invariant cache hit.
[2024-06-01 05:14:54] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:15:16] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55475ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55496ms
[2024-06-01 05:15:49] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:15:49] [INFO ] Invariant cache hit.
[2024-06-01 05:15:49] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-01 05:15:49] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:15:49] [INFO ] Invariant cache hit.
[2024-06-01 05:15:49] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:15:50] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2024-06-01 05:15:50] [INFO ] Redundant transitions in 44 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:15:50] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:15:50] [INFO ] Invariant cache hit.
[2024-06-01 05:15:50] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:16:12] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 75734ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 75755ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 132739 ms. Remains : 104/104 places, 2207/2207 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14 finished in 335283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p0))'
[2024-06-01 05:17:07] [INFO ] Flatten gal took : 121 ms
[2024-06-01 05:17:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:17:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 2219 transitions and 17117 arcs took 27 ms.
Total runtime 942806 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14

BK_STOP 1717219301887

--------------------
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
mcc2024
ltl formula name BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05
ltl formula formula --ltl=/tmp/1353/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 107 places, 2219 transitions and 17117 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.060 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1353/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1353/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1353/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1353/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 108, there are 2229 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~168 levels ~10000 states ~28136 transitions
pnml2lts-mc( 2/ 4): ~168 levels ~20000 states ~66108 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~40000 states ~129844 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~80000 states ~274096 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~160000 states ~574028 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~320000 states ~1180844 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~640000 states ~2424492 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~1280000 states ~5698936 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~2560000 states ~12287132 transitions
pnml2lts-mc( 2/ 4): ~168 levels ~5120000 states ~25203164 transitions
pnml2lts-mc( 1/ 4): ~171 levels ~10240000 states ~52775996 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11729127
pnml2lts-mc( 0/ 4): unique states count: 11729512
pnml2lts-mc( 0/ 4): unique transitions count: 61228797
pnml2lts-mc( 0/ 4): - self-loop count: 40
pnml2lts-mc( 0/ 4): - claim dead count: 49844269
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 11841548
pnml2lts-mc( 0/ 4): - cum. max stack depth: 681
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11841548 states 61943394 transitions, fanout: 5.231
pnml2lts-mc( 0/ 4): Total exploration time 164.840 sec (164.840 sec minimum, 164.840 sec on average)
pnml2lts-mc( 0/ 4): States per second: 71837, Transitions per second: 375779
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 153.5MB, 13.7 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 34.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2276 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 153.5MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10
ltl formula formula --ltl=/tmp/1353/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 107 places, 2219 transitions and 17117 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.080 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1353/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1353/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1353/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1353/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 108, there are 2220 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7204
pnml2lts-mc( 0/ 4): unique states count: 7204
pnml2lts-mc( 0/ 4): unique transitions count: 13190
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7146
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8244
pnml2lts-mc( 0/ 4): - cum. max stack depth: 330
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8244 states 16163 transitions, fanout: 1.961
pnml2lts-mc( 0/ 4): Total exploration time 0.160 sec (0.160 sec minimum, 0.160 sec on average)
pnml2lts-mc( 0/ 4): States per second: 51525, Transitions per second: 101019
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 26.5 B/state, compr.: 6.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2276 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14
ltl formula formula --ltl=/tmp/1353/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 107 places, 2219 transitions and 17117 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.070 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1353/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1353/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1353/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1353/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 108, there are 2224 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~168 levels ~10000 states ~26016 transitions
pnml2lts-mc( 3/ 4): ~168 levels ~20000 states ~54224 transitions
pnml2lts-mc( 0/ 4): ~168 levels ~40000 states ~112436 transitions
pnml2lts-mc( 0/ 4): ~168 levels ~80000 states ~226808 transitions
pnml2lts-mc( 2/ 4): ~171 levels ~160000 states ~432664 transitions
pnml2lts-mc( 2/ 4): ~171 levels ~320000 states ~876680 transitions
pnml2lts-mc( 2/ 4): ~171 levels ~640000 states ~1999872 transitions
pnml2lts-mc( 3/ 4): ~174 levels ~1280000 states ~4148448 transitions
pnml2lts-mc( 3/ 4): ~174 levels ~2560000 states ~8486668 transitions
pnml2lts-mc( 3/ 4): ~174 levels ~5120000 states ~17368376 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7624644
pnml2lts-mc( 0/ 4): unique states count: 7624951
pnml2lts-mc( 0/ 4): unique transitions count: 26814955
pnml2lts-mc( 0/ 4): - self-loop count: 40
pnml2lts-mc( 0/ 4): - claim dead count: 19225883
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7647673
pnml2lts-mc( 0/ 4): - cum. max stack depth: 684
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7647673 states 26893306 transitions, fanout: 3.517
pnml2lts-mc( 0/ 4): Total exploration time 103.330 sec (103.320 sec minimum, 103.325 sec on average)
pnml2lts-mc( 0/ 4): States per second: 74012, Transitions per second: 260266
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 122.2MB, 16.8 B/state, compr.: 3.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2276 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 122.2MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-COL-V20P20N50, 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 r472-tajo-171620398700059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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