Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 22K Feb 25 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 210K Feb 25 12:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 818K Feb 25 12:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 108K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 319K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 314K Feb 25 12:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 12:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.9M Mar 5 18:22 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-PT-V50P20N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678616214638

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:16:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 10:16:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:16:56] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-03-12 10:16:56] [INFO ] Transformed 138 places.
[2023-03-12 10:16:56] [INFO ] Transformed 2348 transitions.
[2023-03-12 10:16:56] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 68 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:16:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-12 10:16:57] [INFO ] Computed 6 place invariants in 26 ms
[2023-03-12 10:16:58] [INFO ] Dead Transitions using invariants and state equation in 1082 ms found 0 transitions.
[2023-03-12 10:16:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:16:58] [INFO ] Invariant cache hit.
[2023-03-12 10:16:58] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-12 10:16:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:16:58] [INFO ] Invariant cache hit.
[2023-03-12 10:16:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:16:59] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2023-03-12 10:16:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:16:59] [INFO ] Invariant cache hit.
[2023-03-12 10:16:59] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/138 places, 2348/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2846 ms. Remains : 137/138 places, 2348/2348 transitions.
Support contains 18 out of 137 places after structural reductions.
[2023-03-12 10:17:00] [INFO ] Flatten gal took : 184 ms
[2023-03-12 10:17:00] [INFO ] Flatten gal took : 125 ms
[2023-03-12 10:17:00] [INFO ] Input system was already deterministic with 2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:17:00] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:00] [INFO ] Invariant cache hit.
[2023-03-12 10:17:00] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-12 10:17:00] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 110 stabilizing places and 204 stable transitions
Graph (complete) has 3849 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.23 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0))) U p1)))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 33 ms. Remains 135 /137 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:17:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:17:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:17:02] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
[2023-03-12 10:17:02] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:02] [INFO ] Invariant cache hit.
[2023-03-12 10:17:02] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-12 10:17:02] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:02] [INFO ] Invariant cache hit.
[2023-03-12 10:17:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:03] [INFO ] Implicit Places using invariants and state equation in 899 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1213 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/137 places, 2347/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2048 ms. Remains : 133/137 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p1), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (LEQ 1 (ADD s54 s55)) (GT 1 s0)), p0:(LEQ s111 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 558 reset in 650 ms.
Product exploration explored 100000 steps with 561 reset in 524 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Finished random walk after 126 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
[2023-03-12 10:17:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 10:17:05] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 10:17:06] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:17:06] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-03-12 10:17:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:17:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 10:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:17:06] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-12 10:17:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:07] [INFO ] [Nat]Added 42 Read/Feed constraints in 1059 ms returned sat
[2023-03-12 10:17:08] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 123 ms.
[2023-03-12 10:17:08] [INFO ] Added : 19 causal constraints over 5 iterations in 464 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 21 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:17:08] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:08] [INFO ] Invariant cache hit.
[2023-03-12 10:17:09] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
[2023-03-12 10:17:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:09] [INFO ] Invariant cache hit.
[2023-03-12 10:17:09] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-12 10:17:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:09] [INFO ] Invariant cache hit.
[2023-03-12 10:17:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:10] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
[2023-03-12 10:17:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:10] [INFO ] Invariant cache hit.
[2023-03-12 10:17:11] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3056 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Finished random walk after 186 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
[2023-03-12 10:17:12] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:12] [INFO ] Invariant cache hit.
[2023-03-12 10:17:12] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:17:13] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2023-03-12 10:17:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:17:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 10:17:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:17:13] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2023-03-12 10:17:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:14] [INFO ] [Nat]Added 42 Read/Feed constraints in 765 ms returned sat
[2023-03-12 10:17:14] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 110 ms.
[2023-03-12 10:17:14] [INFO ] Added : 20 causal constraints over 5 iterations in 238 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 558 reset in 647 ms.
Product exploration explored 100000 steps with 556 reset in 548 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 2347
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 1 rules in 404 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:17:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 10:17:16] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:17:17] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
[2023-03-12 10:17:17] [INFO ] Redundant transitions in 194 ms returned []
[2023-03-12 10:17:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:17] [INFO ] Invariant cache hit.
[2023-03-12 10:17:18] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/133 places, 2347/2347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2329 ms. Remains : 133/133 places, 2347/2347 transitions.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 12 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:17:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 10:17:18] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:17:19] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
[2023-03-12 10:17:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:19] [INFO ] Invariant cache hit.
[2023-03-12 10:17:19] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-12 10:17:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:19] [INFO ] Invariant cache hit.
[2023-03-12 10:17:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:20] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
[2023-03-12 10:17:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:20] [INFO ] Invariant cache hit.
[2023-03-12 10:17:21] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2748 ms. Remains : 133/133 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-01 finished in 20571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(p0)))))))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 31 ms. Remains 135 /137 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:17:21] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:17:21] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:17:22] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
[2023-03-12 10:17:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:22] [INFO ] Invariant cache hit.
[2023-03-12 10:17:23] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-12 10:17:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:17:23] [INFO ] Invariant cache hit.
[2023-03-12 10:17:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:24] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1662 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/137 places, 2347/2348 transitions.
Applied a total of 0 rules in 16 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2548 ms. Remains : 133/137 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(GT 1 (ADD s109 s110))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 117 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-04 finished in 2743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Graph (complete) has 3849 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 280 ms. Remains 136 /137 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:17:24] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 10:17:24] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:17:25] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
[2023-03-12 10:17:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:25] [INFO ] Invariant cache hit.
[2023-03-12 10:17:26] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-12 10:17:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:26] [INFO ] Invariant cache hit.
[2023-03-12 10:17:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:27] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1755 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/137 places, 2348/2348 transitions.
Applied a total of 0 rules in 253 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3144 ms. Remains : 134/137 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ (ADD s107 s108) s109) (LEQ 2 s53))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14899 reset in 977 ms.
Product exploration explored 100000 steps with 15107 reset in 815 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 136 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 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 139 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
[2023-03-12 10:17:30] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2023-03-12 10:17:30] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:17:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:17:31] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2023-03-12 10:17:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:17:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:17:32] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2023-03-12 10:17:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:32] [INFO ] [Nat]Added 42 Read/Feed constraints in 577 ms returned sat
[2023-03-12 10:17:32] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 95 ms.
[2023-03-12 10:17:33] [INFO ] Added : 19 causal constraints over 5 iterations in 328 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 257 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:17:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:33] [INFO ] Invariant cache hit.
[2023-03-12 10:17:34] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
[2023-03-12 10:17:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:34] [INFO ] Invariant cache hit.
[2023-03-12 10:17:34] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 10:17:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:34] [INFO ] Invariant cache hit.
[2023-03-12 10:17:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:35] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
[2023-03-12 10:17:35] [INFO ] Redundant transitions in 155 ms returned []
[2023-03-12 10:17:35] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:35] [INFO ] Invariant cache hit.
[2023-03-12 10:17:36] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3413 ms. Remains : 134/134 places, 2348/2348 transitions.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 183 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 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 155 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
[2023-03-12 10:17:37] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:37] [INFO ] Invariant cache hit.
[2023-03-12 10:17:38] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:17:39] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2023-03-12 10:17:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:17:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:17:39] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-12 10:17:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 422 ms returned sat
[2023-03-12 10:17:40] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 106 ms.
[2023-03-12 10:17:40] [INFO ] Added : 21 causal constraints over 6 iterations in 287 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14825 reset in 978 ms.
Product exploration explored 100000 steps with 14845 reset in 828 ms.
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 238 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:17:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:42] [INFO ] Invariant cache hit.
[2023-03-12 10:17:43] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
[2023-03-12 10:17:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:43] [INFO ] Invariant cache hit.
[2023-03-12 10:17:43] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-12 10:17:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:43] [INFO ] Invariant cache hit.
[2023-03-12 10:17:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:44] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
[2023-03-12 10:17:44] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-12 10:17:44] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:44] [INFO ] Invariant cache hit.
[2023-03-12 10:17:45] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3000 ms. Remains : 134/134 places, 2348/2348 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-07 finished in 21325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1&&X(G(p2)))))))'
Support contains 6 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Applied a total of 0 rules in 264 ms. Remains 137 /137 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:17:46] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-12 10:17:46] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-12 10:17:46] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
[2023-03-12 10:17:47] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:47] [INFO ] Invariant cache hit.
[2023-03-12 10:17:47] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-12 10:17:47] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:47] [INFO ] Invariant cache hit.
[2023-03-12 10:17:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:48] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1455 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/137 places, 2348/2348 transitions.
Applied a total of 0 rules in 249 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2861 ms. Remains : 136/137 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GT s113 s110), p0:(LEQ s54 s52), p2:(LEQ s111 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 969 reset in 620 ms.
Product exploration explored 100000 steps with 978 reset in 599 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 267 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0) p2)), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 352 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 50 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2023-03-12 10:17:50] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 10:17:50] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:17:51] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:17:52] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2023-03-12 10:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:17:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:17:53] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2023-03-12 10:17:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:53] [INFO ] [Nat]Added 42 Read/Feed constraints in 77 ms returned sat
[2023-03-12 10:17:54] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 7 ms to minimize.
[2023-03-12 10:17:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2023-03-12 10:17:54] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 113 ms.
[2023-03-12 10:17:55] [INFO ] Added : 67 causal constraints over 14 iterations in 1349 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 577 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:17:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:56] [INFO ] Invariant cache hit.
[2023-03-12 10:17:57] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
[2023-03-12 10:17:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:57] [INFO ] Invariant cache hit.
[2023-03-12 10:17:57] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-12 10:17:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:57] [INFO ] Invariant cache hit.
[2023-03-12 10:17:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:59] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1737 ms to find 0 implicit places.
[2023-03-12 10:17:59] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-12 10:17:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:17:59] [INFO ] Invariant cache hit.
[2023-03-12 10:17:59] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4256 ms. Remains : 136/136 places, 2348/2348 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 422 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 271 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0) p2)), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 505 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2023-03-12 10:18:01] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:18:01] [INFO ] Invariant cache hit.
[2023-03-12 10:18:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:18:02] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2023-03-12 10:18:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:18:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:18:03] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2023-03-12 10:18:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:03] [INFO ] [Nat]Added 42 Read/Feed constraints in 112 ms returned sat
[2023-03-12 10:18:04] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 1 ms to minimize.
[2023-03-12 10:18:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 447 ms
[2023-03-12 10:18:04] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 194 ms.
[2023-03-12 10:18:05] [INFO ] Added : 67 causal constraints over 14 iterations in 1337 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 968 reset in 753 ms.
Product exploration explored 100000 steps with 976 reset in 577 ms.
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 231 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:18:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:18:07] [INFO ] Invariant cache hit.
[2023-03-12 10:18:10] [INFO ] Dead Transitions using invariants and state equation in 2798 ms found 0 transitions.
[2023-03-12 10:18:10] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:18:10] [INFO ] Invariant cache hit.
[2023-03-12 10:18:10] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-12 10:18:10] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:18:10] [INFO ] Invariant cache hit.
[2023-03-12 10:18:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:11] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
[2023-03-12 10:18:11] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-12 10:18:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:18:11] [INFO ] Invariant cache hit.
[2023-03-12 10:18:12] [INFO ] Dead Transitions using invariants and state equation in 1218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5814 ms. Remains : 136/136 places, 2348/2348 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-08 finished in 27158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Graph (complete) has 3849 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 133 transition count 2346
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 132 transition count 2345
Applied a total of 8 rules in 581 ms. Remains 132 /137 variables (removed 5) and now considering 2345/2348 (removed 3) transitions.
[2023-03-12 10:18:13] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
// Phase 1: matrix 287 rows 132 cols
[2023-03-12 10:18:13] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-12 10:18:13] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-12 10:18:13] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 10:18:13] [INFO ] Invariant cache hit.
[2023-03-12 10:18:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:14] [INFO ] Implicit Places using invariants and state equation in 882 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1273 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/137 places, 2345/2348 transitions.
Applied a total of 0 rules in 288 ms. Remains 130 /130 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2143 ms. Remains : 130/137 places, 2345/2348 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s105 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 312 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-09 finished in 2225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Graph (complete) has 3849 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 257 ms. Remains 135 /137 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:18:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:18:15] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:18:16] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
[2023-03-12 10:18:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:16] [INFO ] Invariant cache hit.
[2023-03-12 10:18:16] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-12 10:18:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:16] [INFO ] Invariant cache hit.
[2023-03-12 10:18:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:17] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1320 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/137 places, 2347/2348 transitions.
Applied a total of 0 rules in 238 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2587 ms. Remains : 133/137 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 1 s108) (GT 2 s0)), p1:(GT 1 s108)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1042 reset in 682 ms.
Product exploration explored 100000 steps with 1026 reset in 572 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 124 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 370 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 10:18:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 10:18:20] [INFO ] Computed 5 place invariants in 17 ms
[2023-03-12 10:18:21] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:18:21] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2023-03-12 10:18:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:18:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:18:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:18:22] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-12 10:18:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:22] [INFO ] [Nat]Added 42 Read/Feed constraints in 203 ms returned sat
[2023-03-12 10:18:22] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 94 ms.
[2023-03-12 10:18:23] [INFO ] Added : 21 causal constraints over 5 iterations in 312 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 267 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:18:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:23] [INFO ] Invariant cache hit.
[2023-03-12 10:18:24] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
[2023-03-12 10:18:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:24] [INFO ] Invariant cache hit.
[2023-03-12 10:18:24] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-12 10:18:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:24] [INFO ] Invariant cache hit.
[2023-03-12 10:18:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:25] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
[2023-03-12 10:18:25] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-12 10:18:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:25] [INFO ] Invariant cache hit.
[2023-03-12 10:18:26] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3295 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 384 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 24 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 522 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 10:18:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:27] [INFO ] Invariant cache hit.
[2023-03-12 10:18:28] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 10:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:18:28] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-12 10:18:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:18:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:18:30] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2023-03-12 10:18:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:31] [INFO ] [Nat]Added 42 Read/Feed constraints in 710 ms returned sat
[2023-03-12 10:18:31] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 74 ms.
[2023-03-12 10:18:31] [INFO ] Added : 19 causal constraints over 4 iterations in 189 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1034 reset in 529 ms.
Product exploration explored 100000 steps with 1035 reset in 509 ms.
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 182 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:18:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:32] [INFO ] Invariant cache hit.
[2023-03-12 10:18:33] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
[2023-03-12 10:18:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:33] [INFO ] Invariant cache hit.
[2023-03-12 10:18:34] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-12 10:18:34] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:34] [INFO ] Invariant cache hit.
[2023-03-12 10:18:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:35] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
[2023-03-12 10:18:35] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-12 10:18:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:35] [INFO ] Invariant cache hit.
[2023-03-12 10:18:37] [INFO ] Dead Transitions using invariants and state equation in 2595 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5251 ms. Remains : 133/133 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-10 finished in 22811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(p1)))'
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Applied a total of 0 rules in 200 ms. Remains 137 /137 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:18:38] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-12 10:18:38] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 10:18:39] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
[2023-03-12 10:18:39] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:18:39] [INFO ] Invariant cache hit.
[2023-03-12 10:18:39] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-12 10:18:39] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:18:39] [INFO ] Invariant cache hit.
[2023-03-12 10:18:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:40] [INFO ] Implicit Places using invariants and state equation in 835 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1217 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/137 places, 2348/2348 transitions.
Applied a total of 0 rules in 251 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2876 ms. Remains : 136/137 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s52), p0:(LEQ s113 s107)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 53907 steps with 18007 reset in 496 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-11 finished in 3610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 136 transition count 2348
Applied a total of 1 rules in 12 ms. Remains 136 /137 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:18:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 10:18:41] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:18:42] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
[2023-03-12 10:18:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:18:42] [INFO ] Invariant cache hit.
[2023-03-12 10:18:43] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-12 10:18:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:18:43] [INFO ] Invariant cache hit.
[2023-03-12 10:18:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:44] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1465 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/137 places, 2348/2348 transitions.
Applied a total of 0 rules in 31 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2730 ms. Remains : 135/137 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ s52 s107), p0:(OR (LEQ s123 s55) (LEQ 1 s54))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1118 ms.
Product exploration explored 100000 steps with 50000 reset in 1128 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 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 p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-12 finished in 5463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 29 ms. Remains 135 /137 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:18:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:18:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:18:47] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
[2023-03-12 10:18:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:47] [INFO ] Invariant cache hit.
[2023-03-12 10:18:48] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 10:18:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:48] [INFO ] Invariant cache hit.
[2023-03-12 10:18:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:49] [INFO ] Implicit Places using invariants and state equation in 987 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1301 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/137 places, 2347/2348 transitions.
Applied a total of 0 rules in 14 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2099 ms. Remains : 133/137 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 832 ms.
Product exploration explored 100000 steps with 25000 reset in 893 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 163 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 22 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:18:52] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 10:18:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:18:52] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
[2023-03-12 10:18:52] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:52] [INFO ] Invariant cache hit.
[2023-03-12 10:18:53] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-12 10:18:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:53] [INFO ] Invariant cache hit.
[2023-03-12 10:18:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:18:54] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
[2023-03-12 10:18:54] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:18:54] [INFO ] Invariant cache hit.
[2023-03-12 10:18:55] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2896 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 159 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1146 ms.
Product exploration explored 100000 steps with 25000 reset in 884 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 2347
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 270 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:18:59] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 10:18:59] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:19:00] [INFO ] Dead Transitions using invariants and state equation in 1164 ms found 0 transitions.
[2023-03-12 10:19:00] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-12 10:19:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:19:00] [INFO ] Invariant cache hit.
[2023-03-12 10:19:01] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/133 places, 2347/2347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2305 ms. Remains : 133/133 places, 2347/2347 transitions.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:19:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 10:19:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:19:01] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
[2023-03-12 10:19:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:19:01] [INFO ] Invariant cache hit.
[2023-03-12 10:19:02] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-12 10:19:02] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:19:02] [INFO ] Invariant cache hit.
[2023-03-12 10:19:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:19:03] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
[2023-03-12 10:19:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:19:03] [INFO ] Invariant cache hit.
[2023-03-12 10:19:04] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3390 ms. Remains : 133/133 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-13 finished in 17508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Graph (complete) has 3849 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 274 ms. Remains 135 /137 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:19:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:19:04] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:19:05] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
[2023-03-12 10:19:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:19:05] [INFO ] Invariant cache hit.
[2023-03-12 10:19:06] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-12 10:19:06] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:19:06] [INFO ] Invariant cache hit.
[2023-03-12 10:19:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:19:07] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1640 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/137 places, 2347/2348 transitions.
Applied a total of 0 rules in 243 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3087 ms. Remains : 133/137 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6930 steps with 44 reset in 80 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-14 finished in 3258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0))) U p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1&&X(G(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-13
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 137/137 places, 2348/2348 transitions.
Graph (complete) has 3849 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
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 133 transition count 2346
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 131 transition count 2344
Applied a total of 10 rules in 73 ms. Remains 131 /137 variables (removed 6) and now considering 2344/2348 (removed 4) transitions.
[2023-03-12 10:19:08] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2023-03-12 10:19:08] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 10:19:08] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-12 10:19:08] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:19:08] [INFO ] Invariant cache hit.
[2023-03-12 10:19:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:19:09] [INFO ] Implicit Places using invariants and state equation in 926 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1331 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 129/137 places, 2344/2348 transitions.
Applied a total of 0 rules in 21 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1425 ms. Remains : 129/137 places, 2344/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 762 ms.
Product exploration explored 100000 steps with 25000 reset in 779 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/129 stabilizing places and 202/2344 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 177 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=88 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 9 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2023-03-12 10:19:12] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 129 cols
[2023-03-12 10:19:12] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 10:19:12] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-12 10:19:12] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:19:12] [INFO ] Invariant cache hit.
[2023-03-12 10:19:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:19:13] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2023-03-12 10:19:13] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:19:13] [INFO ] Invariant cache hit.
[2023-03-12 10:19:14] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1796 ms. Remains : 129/129 places, 2344/2344 transitions.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/129 stabilizing places and 202/2344 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 161 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=53 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 913 ms.
Product exploration explored 100000 steps with 25000 reset in 861 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 243 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2023-03-12 10:19:17] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-12 10:19:17] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:19:17] [INFO ] Invariant cache hit.
[2023-03-12 10:19:19] [INFO ] Dead Transitions using invariants and state equation in 1271 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1616 ms. Remains : 129/129 places, 2344/2344 transitions.
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2023-03-12 10:19:19] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:19:19] [INFO ] Invariant cache hit.
[2023-03-12 10:19:19] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-12 10:19:19] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:19:19] [INFO ] Invariant cache hit.
[2023-03-12 10:19:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:19:20] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2023-03-12 10:19:20] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:19:20] [INFO ] Invariant cache hit.
[2023-03-12 10:19:20] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1671 ms. Remains : 129/129 places, 2344/2344 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-13 finished in 12672 ms.
[2023-03-12 10:19:21] [INFO ] Flatten gal took : 132 ms
[2023-03-12 10:19:21] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 10:19:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 137 places, 2348 transitions and 18089 arcs took 28 ms.
Total runtime 144683 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2038/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2038/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2038/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2038/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2038/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-01
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-07
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-08
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-10
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-13

BK_STOP 1678616365560

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-PT-V50P20N20-LTLCardinality-01
ltl formula formula --ltl=/tmp/2038/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 137 places, 2348 transitions and 18089 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.520 real 0.090 user 0.170 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2038/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2038/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2038/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2038/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-PT-V50P20N20-LTLCardinality-07
ltl formula formula --ltl=/tmp/2038/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 137 places, 2348 transitions and 18089 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.530 real 0.100 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2038/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2038/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2038/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2038/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-PT-V50P20N20-LTLCardinality-08
ltl formula formula --ltl=/tmp/2038/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 137 places, 2348 transitions and 18089 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.600 real 0.130 user 0.130 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2038/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2038/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2038/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2038/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name BridgeAndVehicles-PT-V50P20N20-LTLCardinality-10
ltl formula formula --ltl=/tmp/2038/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 137 places, 2348 transitions and 18089 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.520 real 0.110 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2038/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2038/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2038/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2038/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V50P20N20-LTLCardinality-13
ltl formula formula --ltl=/tmp/2038/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 137 places, 2348 transitions and 18089 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2038/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2038/ltl_4_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.100 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2038/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2038/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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-PT-V50P20N20"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V50P20N20, 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 r041-tajo-167813694400235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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