About the Execution of LTSMin+red for BridgeAndVehicles-PT-V50P20N50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1184.396 | 118473.00 | 154698.00 | 122.80 | TFFTF?FFFTTTFTFF | normal |
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-167813694400243.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-V50P20N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694400243
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 29K Feb 25 12:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 12:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 589K Feb 25 12:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Feb 25 12:44 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 16K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 241K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 711K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Feb 25 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K Feb 25 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Feb 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.1M Feb 25 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K 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 4.5M 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-V50P20N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678617299962
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-V50P20N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:35:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 10:35:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:35:01] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2023-03-12 10:35:01] [INFO ] Transformed 168 places.
[2023-03-12 10:35:01] [INFO ] Transformed 5408 transitions.
[2023-03-12 10:35:01] [INFO ] Parsed PT model containing 168 places and 5408 transitions and 42330 arcs in 338 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 4 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Applied a total of 0 rules in 104 ms. Remains 168 /168 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2023-03-12 10:35:02] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2023-03-12 10:35:02] [INFO ] Computed 7 place invariants in 29 ms
[2023-03-12 10:35:04] [INFO ] Dead Transitions using invariants and state equation in 1820 ms found 0 transitions.
[2023-03-12 10:35:04] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:35:04] [INFO ] Invariant cache hit.
[2023-03-12 10:35:04] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-12 10:35:04] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:35:04] [INFO ] Invariant cache hit.
[2023-03-12 10:35:06] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2023-03-12 10:35:06] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:35:06] [INFO ] Invariant cache hit.
[2023-03-12 10:35:07] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5283 ms. Remains : 168/168 places, 5408/5408 transitions.
Support contains 18 out of 168 places after structural reductions.
[2023-03-12 10:35:08] [INFO ] Flatten gal took : 293 ms
[2023-03-12 10:35:08] [INFO ] Flatten gal took : 206 ms
[2023-03-12 10:35:08] [INFO ] Input system was already deterministic with 5408 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 23) seen :17
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 10:35:09] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:35:09] [INFO ] Invariant cache hit.
[2023-03-12 10:35:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 10:35:10] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 7150 edges and 168 vertex of which 166 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.40 ms
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((p0||G(p1))))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 5408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 165 transition count 5407
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 165 transition count 5407
Applied a total of 4 rules in 158 ms. Remains 165 /168 variables (removed 3) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:35:10] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:35:10] [INFO ] Computed 5 place invariants in 14 ms
[2023-03-12 10:35:12] [INFO ] Dead Transitions using invariants and state equation in 1643 ms found 0 transitions.
[2023-03-12 10:35:12] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:35:12] [INFO ] Invariant cache hit.
[2023-03-12 10:35:12] [INFO ] Implicit Places using invariants in 802 ms returned []
[2023-03-12 10:35:12] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:35:12] [INFO ] Invariant cache hit.
[2023-03-12 10:35:14] [INFO ] Implicit Places using invariants and state equation in 1381 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2202 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/168 places, 5407/5408 transitions.
Applied a total of 0 rules in 36 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4040 ms. Remains : 164/168 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-03 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 2 s52), p0:(LEQ s52 s0)], 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 2356 ms.
Product exploration explored 100000 steps with 50000 reset in 1978 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/164 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 6 factoid took 149 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-V50P20N50-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLCardinality-03 finished in 8926 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' '!((!((p0 U p1) U X(X(p0)))&&F(p2)))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 5408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 165 transition count 5407
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 165 transition count 5407
Applied a total of 4 rules in 113 ms. Remains 165 /168 variables (removed 3) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:35:19] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:35:19] [INFO ] Invariant cache hit.
[2023-03-12 10:35:20] [INFO ] Dead Transitions using invariants and state equation in 1575 ms found 0 transitions.
[2023-03-12 10:35:20] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:35:20] [INFO ] Invariant cache hit.
[2023-03-12 10:35:21] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-12 10:35:21] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:35:21] [INFO ] Invariant cache hit.
[2023-03-12 10:35:22] [INFO ] Implicit Places using invariants and state equation in 894 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1390 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/168 places, 5407/5408 transitions.
Applied a total of 0 rules in 37 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3117 ms. Remains : 163/168 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p2) p0), p0, p0, (NOT p2), (AND p1 p0), p0, true, (AND p1 p0), (AND p1 p0), (AND p1 (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 6}]], initial=0, aps=[p1:(LEQ 1 (ADD s54 s55)), p2:(GT (ADD s54 s55) s111), p0:(OR (LEQ s53 1) (LEQ 1 (ADD s54 s55)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLCardinality-04 finished in 3470 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(F(p0)))'
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 5408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 165 transition count 5407
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 165 transition count 5407
Applied a total of 4 rules in 61 ms. Remains 165 /168 variables (removed 3) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:35:22] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:35:22] [INFO ] Invariant cache hit.
[2023-03-12 10:35:24] [INFO ] Dead Transitions using invariants and state equation in 1492 ms found 0 transitions.
[2023-03-12 10:35:24] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:35:24] [INFO ] Invariant cache hit.
[2023-03-12 10:35:24] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-12 10:35:24] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:35:24] [INFO ] Invariant cache hit.
[2023-03-12 10:35:26] [INFO ] Implicit Places using invariants and state equation in 1242 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1887 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/168 places, 5407/5408 transitions.
Applied a total of 0 rules in 29 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3472 ms. Remains : 164/168 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s107)], 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][false, false]]
Product exploration explored 100000 steps with 25383 reset in 1905 ms.
Product exploration explored 100000 steps with 25403 reset in 1768 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/164 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-12 10:35:30] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2023-03-12 10:35:30] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:35:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:35:32] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-03-12 10:35:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:35:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:35:33] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-12 10:35:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:35:34] [INFO ] [Nat]Added 102 Read/Feed constraints in 246 ms returned sat
[2023-03-12 10:35:34] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 256 transitions) in 334 ms.
[2023-03-12 10:35:36] [INFO ] Added : 50 causal constraints over 10 iterations in 1746 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 5407/5407 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 162 transition count 5406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 160 transition count 5404
Applied a total of 7 rules in 1304 ms. Remains 160 /164 variables (removed 4) and now considering 5404/5407 (removed 3) transitions.
[2023-03-12 10:35:37] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 160 cols
[2023-03-12 10:35:37] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-12 10:35:38] [INFO ] Implicit Places using invariants in 758 ms returned []
[2023-03-12 10:35:38] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:35:38] [INFO ] Invariant cache hit.
[2023-03-12 10:35:38] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:35:39] [INFO ] Implicit Places using invariants and state equation in 1843 ms returned []
Implicit Place search using SMT with State Equation took 2606 ms to find 0 implicit places.
[2023-03-12 10:35:40] [INFO ] Redundant transitions in 489 ms returned []
[2023-03-12 10:35:40] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:35:40] [INFO ] Invariant cache hit.
[2023-03-12 10:35:42] [INFO ] Dead Transitions using invariants and state equation in 1610 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/164 places, 5404/5407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6020 ms. Remains : 160/164 places, 5404/5407 transitions.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Detected a total of 105/160 stabilizing places and 202/5404 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-12 10:35:42] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:35:42] [INFO ] Invariant cache hit.
[2023-03-12 10:35:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 10:35:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:35:44] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2023-03-12 10:35:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:35:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:35:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:35:45] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-12 10:35:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:35:45] [INFO ] [Nat]Added 102 Read/Feed constraints in 182 ms returned sat
[2023-03-12 10:35:46] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 253 transitions) in 209 ms.
[2023-03-12 10:35:47] [INFO ] Added : 51 causal constraints over 11 iterations in 1210 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 26118 reset in 1844 ms.
Product exploration explored 100000 steps with 26185 reset in 1511 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 5404/5404 transitions.
Applied a total of 0 rules in 1012 ms. Remains 160 /160 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2023-03-12 10:35:51] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:35:51] [INFO ] Invariant cache hit.
[2023-03-12 10:35:52] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-12 10:35:52] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:35:52] [INFO ] Invariant cache hit.
[2023-03-12 10:35:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:35:54] [INFO ] Implicit Places using invariants and state equation in 1904 ms returned []
Implicit Place search using SMT with State Equation took 2508 ms to find 0 implicit places.
[2023-03-12 10:35:54] [INFO ] Redundant transitions in 509 ms returned []
[2023-03-12 10:35:54] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:35:54] [INFO ] Invariant cache hit.
[2023-03-12 10:35:56] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5568 ms. Remains : 160/160 places, 5404/5404 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLCardinality-05 finished in 33931 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(p0)))'
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 5408
Applied a total of 1 rules in 26 ms. Remains 167 /168 variables (removed 1) and now considering 5408/5408 (removed 0) transitions.
[2023-03-12 10:35:56] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 167 cols
[2023-03-12 10:35:56] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-12 10:35:58] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
[2023-03-12 10:35:58] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:35:58] [INFO ] Invariant cache hit.
[2023-03-12 10:35:58] [INFO ] Implicit Places using invariants in 666 ms returned []
[2023-03-12 10:35:58] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:35:58] [INFO ] Invariant cache hit.
[2023-03-12 10:35:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:36:01] [INFO ] Implicit Places using invariants and state equation in 2365 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3037 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/168 places, 5408/5408 transitions.
Applied a total of 0 rules in 38 ms. Remains 165 /165 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4486 ms. Remains : 165/168 places, 5408/5408 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 s112)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 261 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLCardinality-06 finished in 4615 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((F(G(p0))&&G((p1 U p0)))))'
Support contains 5 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 5408
Applied a total of 1 rules in 25 ms. Remains 167 /168 variables (removed 1) and now considering 5408/5408 (removed 0) transitions.
[2023-03-12 10:36:01] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:36:01] [INFO ] Invariant cache hit.
[2023-03-12 10:36:02] [INFO ] Dead Transitions using invariants and state equation in 1564 ms found 0 transitions.
[2023-03-12 10:36:02] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:36:02] [INFO ] Invariant cache hit.
[2023-03-12 10:36:03] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-12 10:36:03] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:36:03] [INFO ] Invariant cache hit.
[2023-03-12 10:36:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:36:05] [INFO ] Implicit Places using invariants and state equation in 2184 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2820 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/168 places, 5408/5408 transitions.
Applied a total of 0 rules in 42 ms. Remains 165 /165 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4454 ms. Remains : 165/168 places, 5408/5408 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s110 s111)), p1:(LEQ (ADD s54 s55) s112)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLCardinality-07 finished in 4683 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 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Graph (complete) has 7150 edges and 168 vertex of which 166 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 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 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 165 transition count 5407
Applied a total of 3 rules in 1174 ms. Remains 165 /168 variables (removed 3) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:36:07] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:36:07] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:36:08] [INFO ] Dead Transitions using invariants and state equation in 1624 ms found 0 transitions.
[2023-03-12 10:36:08] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:36:08] [INFO ] Invariant cache hit.
[2023-03-12 10:36:09] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-12 10:36:09] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:36:09] [INFO ] Invariant cache hit.
[2023-03-12 10:36:10] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1928 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/168 places, 5407/5408 transitions.
Applied a total of 0 rules in 1086 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5814 ms. Remains : 163/168 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-08 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:(LEQ 1 s111), p1:(AND (LEQ 1 s157) (LEQ s108 s35))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 356 steps with 0 reset in 11 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLCardinality-08 finished in 5979 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(F((p0&&F(p1)&&F(p2)))))'
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 5408
Applied a total of 1 rules in 43 ms. Remains 167 /168 variables (removed 1) and now considering 5408/5408 (removed 0) transitions.
[2023-03-12 10:36:11] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 167 cols
[2023-03-12 10:36:11] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-12 10:36:13] [INFO ] Dead Transitions using invariants and state equation in 1547 ms found 0 transitions.
[2023-03-12 10:36:13] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:36:13] [INFO ] Invariant cache hit.
[2023-03-12 10:36:14] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-12 10:36:14] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:36:14] [INFO ] Invariant cache hit.
[2023-03-12 10:36:14] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:36:17] [INFO ] Implicit Places using invariants and state equation in 3165 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3717 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/168 places, 5408/5408 transitions.
Applied a total of 0 rules in 42 ms. Remains 165 /165 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5350 ms. Remains : 165/168 places, 5408/5408 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s53), p1:(LEQ 3 s113), p2:(GT 1 s56)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 458 steps with 2 reset in 9 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLCardinality-12 finished in 5592 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 U p1))))'
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Graph (complete) has 7150 edges and 168 vertex of which 166 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 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 165 transition count 5407
Applied a total of 3 rules in 1119 ms. Remains 165 /168 variables (removed 3) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:36:18] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:36:18] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:36:20] [INFO ] Dead Transitions using invariants and state equation in 1584 ms found 0 transitions.
[2023-03-12 10:36:20] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:36:20] [INFO ] Invariant cache hit.
[2023-03-12 10:36:20] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-12 10:36:20] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:36:20] [INFO ] Invariant cache hit.
[2023-03-12 10:36:22] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1871 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/168 places, 5407/5408 transitions.
Applied a total of 0 rules in 875 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5452 ms. Remains : 164/168 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s109), p0:(LEQ s112 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1479 steps with 5 reset in 27 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLCardinality-14 finished in 5583 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(F(p0)))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-05
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Graph (complete) has 7150 edges and 168 vertex of which 166 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 165 transition count 5407
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 163 transition count 5406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 161 transition count 5404
Applied a total of 10 rules in 183 ms. Remains 161 /168 variables (removed 7) and now considering 5404/5408 (removed 4) transitions.
[2023-03-12 10:36:23] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 161 cols
[2023-03-12 10:36:23] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-12 10:36:24] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-12 10:36:24] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:36:24] [INFO ] Invariant cache hit.
[2023-03-12 10:36:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:36:27] [INFO ] Implicit Places using invariants and state equation in 3680 ms returned []
Implicit Place search using SMT with State Equation took 4301 ms to find 0 implicit places.
[2023-03-12 10:36:27] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:36:27] [INFO ] Invariant cache hit.
[2023-03-12 10:36:29] [INFO ] Dead Transitions using invariants and state equation in 1501 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 161/168 places, 5404/5408 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5989 ms. Remains : 161/168 places, 5404/5408 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s106)], 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][false, false]]
Product exploration explored 100000 steps with 26125 reset in 1557 ms.
Product exploration explored 100000 steps with 26302 reset in 1715 ms.
Computed a total of 106 stabilizing places and 202 stable transitions
Computed a total of 106 stabilizing places and 202 stable transitions
Detected a total of 106/161 stabilizing places and 202/5404 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-12 10:36:33] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:36:33] [INFO ] Invariant cache hit.
[2023-03-12 10:36:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:36:34] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2023-03-12 10:36:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:36:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:36:36] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-12 10:36:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:36:36] [INFO ] [Nat]Added 102 Read/Feed constraints in 249 ms returned sat
[2023-03-12 10:36:37] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 253 transitions) in 199 ms.
[2023-03-12 10:36:37] [INFO ] Added : 49 causal constraints over 10 iterations in 953 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 5404/5404 transitions.
Applied a total of 0 rules in 994 ms. Remains 161 /161 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2023-03-12 10:36:38] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:36:38] [INFO ] Invariant cache hit.
[2023-03-12 10:36:39] [INFO ] Implicit Places using invariants in 741 ms returned []
[2023-03-12 10:36:39] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:36:39] [INFO ] Invariant cache hit.
[2023-03-12 10:36:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:36:41] [INFO ] Implicit Places using invariants and state equation in 2413 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3159 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/161 places, 5404/5404 transitions.
Applied a total of 0 rules in 893 ms. Remains 160 /160 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5046 ms. Remains : 160/161 places, 5404/5404 transitions.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Detected a total of 105/160 stabilizing places and 202/5404 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-12 10:36:43] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 160 cols
[2023-03-12 10:36:43] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-12 10:36:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:36:45] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-12 10:36:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:36:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:36:46] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2023-03-12 10:36:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:36:46] [INFO ] [Nat]Added 102 Read/Feed constraints in 127 ms returned sat
[2023-03-12 10:36:47] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 253 transitions) in 222 ms.
[2023-03-12 10:36:48] [INFO ] Added : 52 causal constraints over 11 iterations in 1416 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 26116 reset in 1691 ms.
Product exploration explored 100000 steps with 26202 reset in 1502 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 5404/5404 transitions.
Applied a total of 0 rules in 883 ms. Remains 160 /160 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2023-03-12 10:36:52] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:36:52] [INFO ] Invariant cache hit.
[2023-03-12 10:36:53] [INFO ] Implicit Places using invariants in 700 ms returned []
[2023-03-12 10:36:53] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:36:53] [INFO ] Invariant cache hit.
[2023-03-12 10:36:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:36:54] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
[2023-03-12 10:36:54] [INFO ] Redundant transitions in 242 ms returned []
[2023-03-12 10:36:54] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:36:54] [INFO ] Invariant cache hit.
[2023-03-12 10:36:56] [INFO ] Dead Transitions using invariants and state equation in 1495 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4709 ms. Remains : 160/160 places, 5404/5404 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLCardinality-05 finished in 33449 ms.
[2023-03-12 10:36:56] [INFO ] Flatten gal took : 148 ms
[2023-03-12 10:36:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 10:36:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 168 places, 5408 transitions and 42330 arcs took 52 ms.
Total runtime 115165 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1041/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N50-LTLCardinality-05
BK_STOP 1678617418435
--------------------
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-V50P20N50-LTLCardinality-05
ltl formula formula --ltl=/tmp/1041/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 168 places, 5408 transitions and 42330 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 1.020 real 0.220 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1041/ltl_0_
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
double free or corruption (fasttop)
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-V50P20N50"
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-V50P20N50, 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-167813694400243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N50.tgz
mv BridgeAndVehicles-PT-V50P20N50 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 '
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 ;