fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r039-tajo-167813692800635
Last Updated
May 14, 2023

About the Execution of LoLa+red for CANConstruction-PT-030

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
666.212 127517.00 159815.00 109.10 FTFFTTFFTFFFFFTF 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.r039-tajo-167813692800635.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 lolaxred
Input is CANConstruction-PT-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Feb 25 21:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 21:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 21:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 21:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 21:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 CANConstruction-PT-030-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-030-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678504042262

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:07:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:07:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:07:24] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-11 03:07:24] [INFO ] Transformed 2162 places.
[2023-03-11 03:07:24] [INFO ] Transformed 3840 transitions.
[2023-03-11 03:07:24] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-030-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 818 places :
Symmetric choice reduction at 0 with 818 rule applications. Total rules 818 place count 1344 transition count 2204
Iterating global reduction 0 with 818 rules applied. Total rules applied 1636 place count 1344 transition count 2204
Applied a total of 1636 rules in 360 ms. Remains 1344 /2162 variables (removed 818) and now considering 2204/3840 (removed 1636) transitions.
// Phase 1: matrix 2204 rows 1344 cols
[2023-03-11 03:07:25] [INFO ] Computed 61 place invariants in 37 ms
[2023-03-11 03:07:26] [INFO ] Implicit Places using invariants in 1264 ms returned [12, 26, 40, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 418]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1305 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1316/2162 places, 2204/3840 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1289 transition count 2177
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1289 transition count 2177
Applied a total of 54 rules in 120 ms. Remains 1289 /1316 variables (removed 27) and now considering 2177/2204 (removed 27) transitions.
// Phase 1: matrix 2177 rows 1289 cols
[2023-03-11 03:07:26] [INFO ] Computed 33 place invariants in 30 ms
[2023-03-11 03:07:27] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2023-03-11 03:07:27] [INFO ] Invariant cache hit.
[2023-03-11 03:07:28] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:07:34] [INFO ] Implicit Places using invariants and state equation in 7264 ms returned []
Implicit Place search using SMT with State Equation took 8335 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1289/2162 places, 2177/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10122 ms. Remains : 1289/2162 places, 2177/3840 transitions.
Support contains 54 out of 1289 places after structural reductions.
[2023-03-11 03:07:35] [INFO ] Flatten gal took : 152 ms
[2023-03-11 03:07:35] [INFO ] Flatten gal took : 80 ms
[2023-03-11 03:07:35] [INFO ] Input system was already deterministic with 2177 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 31) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-11 03:07:36] [INFO ] Invariant cache hit.
[2023-03-11 03:07:36] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2023-03-11 03:07:36] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 03:07:36] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-11 03:07:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-11 03:07:37] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-11 03:07:38] [INFO ] After 939ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2023-03-11 03:07:38] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:07:39] [INFO ] After 706ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :6 sat :5
[2023-03-11 03:07:39] [INFO ] After 1558ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :5
Attempting to minimize the solution found.
Minimization took 711 ms.
[2023-03-11 03:07:40] [INFO ] After 3607ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :5
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 75 ms.
Support contains 10 out of 1289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 1289 transition count 1985
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 193 rules applied. Total rules applied 385 place count 1097 transition count 1984
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 386 place count 1096 transition count 1984
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 386 place count 1096 transition count 1956
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 442 place count 1068 transition count 1956
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 459 place count 1051 transition count 1922
Iterating global reduction 3 with 17 rules applied. Total rules applied 476 place count 1051 transition count 1922
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 484 place count 1051 transition count 1914
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 492 place count 1043 transition count 1914
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 560 place count 1009 transition count 1880
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 566 place count 1009 transition count 1874
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 572 place count 1003 transition count 1874
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 573 place count 1003 transition count 1874
Applied a total of 573 rules in 814 ms. Remains 1003 /1289 variables (removed 286) and now considering 1874/2177 (removed 303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 819 ms. Remains : 1003/1289 places, 1874/2177 transitions.
Finished random walk after 3150 steps, including 15 resets, run visited all 2 properties in 25 ms. (steps per millisecond=126 )
FORMULA CANConstruction-PT-030-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
FORMULA CANConstruction-PT-030-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 94 stabilizing places and 123 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1289 transition count 1980
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1092 transition count 1980
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 394 place count 1092 transition count 1952
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 450 place count 1064 transition count 1952
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 471 place count 1043 transition count 1910
Iterating global reduction 2 with 21 rules applied. Total rules applied 492 place count 1043 transition count 1910
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 506 place count 1043 transition count 1896
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 520 place count 1029 transition count 1896
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 580 place count 999 transition count 1866
Applied a total of 580 rules in 188 ms. Remains 999 /1289 variables (removed 290) and now considering 1866/2177 (removed 311) transitions.
// Phase 1: matrix 1866 rows 999 cols
[2023-03-11 03:07:42] [INFO ] Computed 33 place invariants in 11 ms
[2023-03-11 03:07:42] [INFO ] Implicit Places using invariants in 873 ms returned [14, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 876 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/1289 places, 1866/2177 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 997 transition count 1862
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 993 transition count 1862
Applied a total of 8 rules in 77 ms. Remains 993 /997 variables (removed 4) and now considering 1862/1866 (removed 4) transitions.
// Phase 1: matrix 1862 rows 993 cols
[2023-03-11 03:07:42] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-11 03:07:43] [INFO ] Implicit Places using invariants in 640 ms returned []
[2023-03-11 03:07:43] [INFO ] Invariant cache hit.
[2023-03-11 03:07:44] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:07:49] [INFO ] Implicit Places using invariants and state equation in 5524 ms returned []
Implicit Place search using SMT with State Equation took 6171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 993/1289 places, 1862/2177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7314 ms. Remains : 993/1289 places, 1862/2177 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s503 s415)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 222 steps with 0 reset in 23 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-03 finished in 7603 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||(p1&&F(G(p1)))))))'
Support contains 2 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1266 transition count 2132
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1266 transition count 2132
Applied a total of 46 rules in 136 ms. Remains 1266 /1289 variables (removed 23) and now considering 2132/2177 (removed 45) transitions.
// Phase 1: matrix 2132 rows 1266 cols
[2023-03-11 03:07:49] [INFO ] Computed 33 place invariants in 14 ms
[2023-03-11 03:07:50] [INFO ] Implicit Places using invariants in 580 ms returned [48, 350]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 585 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1264/1289 places, 2132/2177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1262 transition count 2130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1262 transition count 2130
Applied a total of 4 rules in 120 ms. Remains 1262 /1264 variables (removed 2) and now considering 2130/2132 (removed 2) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2023-03-11 03:07:50] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-11 03:07:50] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-03-11 03:07:50] [INFO ] Invariant cache hit.
[2023-03-11 03:07:51] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:07:57] [INFO ] Implicit Places using invariants and state equation in 6629 ms returned []
Implicit Place search using SMT with State Equation took 7282 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1262/1289 places, 2130/2177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8125 ms. Remains : 1262/1289 places, 2130/2177 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1062 s91), p1:(LEQ 1 s91)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1537 ms.
Product exploration explored 100000 steps with 50000 reset in 1375 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-04 finished in 11445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||((p1 U p2)&&(p1||X(X(p3)))))))'
Support contains 7 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1269 transition count 2138
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1269 transition count 2138
Applied a total of 40 rules in 116 ms. Remains 1269 /1289 variables (removed 20) and now considering 2138/2177 (removed 39) transitions.
// Phase 1: matrix 2138 rows 1269 cols
[2023-03-11 03:08:01] [INFO ] Computed 33 place invariants in 21 ms
[2023-03-11 03:08:01] [INFO ] Implicit Places using invariants in 737 ms returned [48, 350]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 741 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1267/1289 places, 2138/2177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1265 transition count 2136
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1265 transition count 2136
Applied a total of 4 rules in 113 ms. Remains 1265 /1267 variables (removed 2) and now considering 2136/2138 (removed 2) transitions.
// Phase 1: matrix 2136 rows 1265 cols
[2023-03-11 03:08:01] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-11 03:08:02] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-11 03:08:02] [INFO ] Invariant cache hit.
[2023-03-11 03:08:02] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:08] [INFO ] Implicit Places using invariants and state equation in 6267 ms returned []
Implicit Place search using SMT with State Equation took 6776 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1265/1289 places, 2136/2177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7751 ms. Remains : 1265/1289 places, 2136/2177 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3), true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p3) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}]], initial=5, aps=[p2:(LEQ 1 s334), p1:(LEQ s945 s946), p0:(LEQ s1245 s1160), p3:(LEQ s666 s190)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 928 ms.
Product exploration explored 100000 steps with 33333 reset in 825 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0 p3), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-05 finished in 10030 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((p0&&F(p1))))'
Support contains 3 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1268 transition count 2135
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1268 transition count 2135
Applied a total of 42 rules in 93 ms. Remains 1268 /1289 variables (removed 21) and now considering 2135/2177 (removed 42) transitions.
// Phase 1: matrix 2135 rows 1268 cols
[2023-03-11 03:08:11] [INFO ] Computed 33 place invariants in 35 ms
[2023-03-11 03:08:11] [INFO ] Implicit Places using invariants in 683 ms returned [48, 351]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 687 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1266/1289 places, 2135/2177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1264 transition count 2133
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1264 transition count 2133
Applied a total of 4 rules in 100 ms. Remains 1264 /1266 variables (removed 2) and now considering 2133/2135 (removed 2) transitions.
// Phase 1: matrix 2133 rows 1264 cols
[2023-03-11 03:08:11] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-11 03:08:12] [INFO ] Implicit Places using invariants in 659 ms returned []
[2023-03-11 03:08:12] [INFO ] Invariant cache hit.
[2023-03-11 03:08:12] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:19] [INFO ] Implicit Places using invariants and state equation in 6750 ms returned []
Implicit Place search using SMT with State Equation took 7417 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1264/1289 places, 2133/2177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8297 ms. Remains : 1264/1289 places, 2133/2177 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LEQ s1228 s240) (LEQ 1 s138)), p0:(GT s1228 s240)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-06 finished in 8407 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))||G(p1)))'
Support contains 6 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1289 transition count 1982
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1094 transition count 1982
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 390 place count 1094 transition count 1954
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 446 place count 1066 transition count 1954
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 465 place count 1047 transition count 1916
Iterating global reduction 2 with 19 rules applied. Total rules applied 484 place count 1047 transition count 1916
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 494 place count 1047 transition count 1906
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 504 place count 1037 transition count 1906
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 568 place count 1005 transition count 1874
Applied a total of 568 rules in 207 ms. Remains 1005 /1289 variables (removed 284) and now considering 1874/2177 (removed 303) transitions.
// Phase 1: matrix 1874 rows 1005 cols
[2023-03-11 03:08:19] [INFO ] Computed 33 place invariants in 21 ms
[2023-03-11 03:08:20] [INFO ] Implicit Places using invariants in 774 ms returned [14, 96]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 781 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1289 places, 1874/2177 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1003 transition count 1870
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 999 transition count 1870
Applied a total of 8 rules in 72 ms. Remains 999 /1003 variables (removed 4) and now considering 1870/1874 (removed 4) transitions.
// Phase 1: matrix 1870 rows 999 cols
[2023-03-11 03:08:20] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-11 03:08:20] [INFO ] Implicit Places using invariants in 530 ms returned []
[2023-03-11 03:08:20] [INFO ] Invariant cache hit.
[2023-03-11 03:08:21] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:26] [INFO ] Implicit Places using invariants and state equation in 5964 ms returned []
Implicit Place search using SMT with State Equation took 6503 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 999/1289 places, 1870/2177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7566 ms. Remains : 999/1289 places, 1870/2177 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT s42 s659), p0:(AND (OR (GT s42 s659) (GT s821 s686)) (GT s71 s636))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 200 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-07 finished in 7732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1289 transition count 1980
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1092 transition count 1980
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 394 place count 1092 transition count 1952
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 450 place count 1064 transition count 1952
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 472 place count 1042 transition count 1908
Iterating global reduction 2 with 22 rules applied. Total rules applied 494 place count 1042 transition count 1908
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 15 rules applied. Total rules applied 509 place count 1042 transition count 1893
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 524 place count 1027 transition count 1893
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 582 place count 998 transition count 1864
Applied a total of 582 rules in 298 ms. Remains 998 /1289 variables (removed 291) and now considering 1864/2177 (removed 313) transitions.
// Phase 1: matrix 1864 rows 998 cols
[2023-03-11 03:08:27] [INFO ] Computed 33 place invariants in 20 ms
[2023-03-11 03:08:27] [INFO ] Implicit Places using invariants in 654 ms returned [14, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 656 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 996/1289 places, 1864/2177 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 1860
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 992 transition count 1860
Applied a total of 8 rules in 58 ms. Remains 992 /996 variables (removed 4) and now considering 1860/1864 (removed 4) transitions.
// Phase 1: matrix 1860 rows 992 cols
[2023-03-11 03:08:28] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-11 03:08:28] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-11 03:08:28] [INFO ] Invariant cache hit.
[2023-03-11 03:08:29] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:34] [INFO ] Implicit Places using invariants and state equation in 5947 ms returned []
Implicit Place search using SMT with State Equation took 6551 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 992/1289 places, 1860/2177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7563 ms. Remains : 992/1289 places, 1860/2177 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s595)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 189 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-09 finished in 7633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1289 transition count 1981
Reduce places removed 196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 197 rules applied. Total rules applied 393 place count 1093 transition count 1980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 1092 transition count 1980
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 394 place count 1092 transition count 1952
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 450 place count 1064 transition count 1952
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 472 place count 1042 transition count 1908
Iterating global reduction 3 with 22 rules applied. Total rules applied 494 place count 1042 transition count 1908
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 15 rules applied. Total rules applied 509 place count 1042 transition count 1893
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 524 place count 1027 transition count 1893
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 582 place count 998 transition count 1864
Applied a total of 582 rules in 174 ms. Remains 998 /1289 variables (removed 291) and now considering 1864/2177 (removed 313) transitions.
// Phase 1: matrix 1864 rows 998 cols
[2023-03-11 03:08:34] [INFO ] Computed 33 place invariants in 19 ms
[2023-03-11 03:08:35] [INFO ] Implicit Places using invariants in 632 ms returned [14, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 634 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 996/1289 places, 1864/2177 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 1860
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 992 transition count 1860
Applied a total of 8 rules in 72 ms. Remains 992 /996 variables (removed 4) and now considering 1860/1864 (removed 4) transitions.
// Phase 1: matrix 1860 rows 992 cols
[2023-03-11 03:08:35] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-11 03:08:36] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-11 03:08:36] [INFO ] Invariant cache hit.
[2023-03-11 03:08:36] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:41] [INFO ] Implicit Places using invariants and state equation in 5775 ms returned []
Implicit Place search using SMT with State Equation took 6395 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 992/1289 places, 1860/2177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7277 ms. Remains : 992/1289 places, 1860/2177 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 485 reset in 641 ms.
Stack based approach found an accepted trace after 6151 steps with 30 reset with depth 140 and stack size 140 in 39 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-12 finished in 8004 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 4 out of 1289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1289 transition count 1983
Reduce places removed 194 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 389 place count 1095 transition count 1982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 1094 transition count 1982
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 390 place count 1094 transition count 1954
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 446 place count 1066 transition count 1954
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 466 place count 1046 transition count 1914
Iterating global reduction 3 with 20 rules applied. Total rules applied 486 place count 1046 transition count 1914
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 13 rules applied. Total rules applied 499 place count 1046 transition count 1901
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 512 place count 1033 transition count 1901
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 574 place count 1002 transition count 1870
Applied a total of 574 rules in 222 ms. Remains 1002 /1289 variables (removed 287) and now considering 1870/2177 (removed 307) transitions.
// Phase 1: matrix 1870 rows 1002 cols
[2023-03-11 03:08:42] [INFO ] Computed 33 place invariants in 21 ms
[2023-03-11 03:08:43] [INFO ] Implicit Places using invariants in 569 ms returned [14, 94]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 572 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1289 places, 1870/2177 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1000 transition count 1866
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 996 transition count 1866
Applied a total of 8 rules in 59 ms. Remains 996 /1000 variables (removed 4) and now considering 1866/1870 (removed 4) transitions.
// Phase 1: matrix 1866 rows 996 cols
[2023-03-11 03:08:43] [INFO ] Computed 31 place invariants in 29 ms
[2023-03-11 03:08:44] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-03-11 03:08:44] [INFO ] Invariant cache hit.
[2023-03-11 03:08:44] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:49] [INFO ] Implicit Places using invariants and state equation in 5525 ms returned []
Implicit Place search using SMT with State Equation took 6142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1289 places, 1866/2177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6995 ms. Remains : 996/1289 places, 1866/2177 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-13 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:(OR (LEQ s20 s291) (LEQ s712 s968)), p0:(LEQ s712 s968)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 479 reset in 740 ms.
Product exploration explored 100000 steps with 476 reset in 619 ms.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 273 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-11 03:08:51] [INFO ] Invariant cache hit.
[2023-03-11 03:08:51] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 404 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1866/1866 transitions.
Applied a total of 0 rules in 74 ms. Remains 996 /996 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2023-03-11 03:08:52] [INFO ] Invariant cache hit.
[2023-03-11 03:08:53] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-11 03:08:53] [INFO ] Invariant cache hit.
[2023-03-11 03:08:53] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:59] [INFO ] Implicit Places using invariants and state equation in 6072 ms returned []
Implicit Place search using SMT with State Equation took 6710 ms to find 0 implicit places.
[2023-03-11 03:08:59] [INFO ] Redundant transitions in 154 ms returned []
[2023-03-11 03:08:59] [INFO ] Invariant cache hit.
[2023-03-11 03:09:00] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7787 ms. Remains : 996/996 places, 1866/1866 transitions.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Finished random walk after 5241 steps, including 25 resets, run visited all 1 properties in 34 ms. (steps per millisecond=154 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Product exploration explored 100000 steps with 479 reset in 560 ms.
Product exploration explored 100000 steps with 481 reset in 537 ms.
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1866/1866 transitions.
Applied a total of 0 rules in 48 ms. Remains 996 /996 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2023-03-11 03:09:01] [INFO ] Invariant cache hit.
[2023-03-11 03:09:02] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-11 03:09:02] [INFO ] Invariant cache hit.
[2023-03-11 03:09:02] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:09:08] [INFO ] Implicit Places using invariants and state equation in 6179 ms returned []
Implicit Place search using SMT with State Equation took 6774 ms to find 0 implicit places.
[2023-03-11 03:09:08] [INFO ] Redundant transitions in 112 ms returned []
[2023-03-11 03:09:08] [INFO ] Invariant cache hit.
[2023-03-11 03:09:09] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7680 ms. Remains : 996/996 places, 1866/1866 transitions.
Treatment of property CANConstruction-PT-030-LTLCardinality-13 finished in 26944 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 2 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1267 transition count 2134
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1267 transition count 2134
Applied a total of 44 rules in 128 ms. Remains 1267 /1289 variables (removed 22) and now considering 2134/2177 (removed 43) transitions.
// Phase 1: matrix 2134 rows 1267 cols
[2023-03-11 03:09:09] [INFO ] Computed 33 place invariants in 18 ms
[2023-03-11 03:09:10] [INFO ] Implicit Places using invariants in 715 ms returned [48, 350]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 718 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1265/1289 places, 2134/2177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1263 transition count 2132
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1263 transition count 2132
Applied a total of 4 rules in 100 ms. Remains 1263 /1265 variables (removed 2) and now considering 2132/2134 (removed 2) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-11 03:09:10] [INFO ] Computed 31 place invariants in 23 ms
[2023-03-11 03:09:11] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-11 03:09:11] [INFO ] Invariant cache hit.
[2023-03-11 03:09:11] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:09:17] [INFO ] Implicit Places using invariants and state equation in 6368 ms returned []
Implicit Place search using SMT with State Equation took 6974 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1263/1289 places, 2132/2177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7922 ms. Remains : 1263/1289 places, 2132/2177 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-14 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 s772 s364)], 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 50000 reset in 1196 ms.
Product exploration explored 100000 steps with 50000 reset in 1048 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLCardinality-14 finished in 10379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||(F(p1)&&X(p2))))))'
Support contains 5 out of 1289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1289/1289 places, 2177/2177 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1268 transition count 2136
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1268 transition count 2136
Applied a total of 42 rules in 135 ms. Remains 1268 /1289 variables (removed 21) and now considering 2136/2177 (removed 41) transitions.
// Phase 1: matrix 2136 rows 1268 cols
[2023-03-11 03:09:20] [INFO ] Computed 33 place invariants in 21 ms
[2023-03-11 03:09:20] [INFO ] Implicit Places using invariants in 740 ms returned [350]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 742 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1267/1289 places, 2136/2177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1266 transition count 2135
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1266 transition count 2135
Applied a total of 2 rules in 114 ms. Remains 1266 /1267 variables (removed 1) and now considering 2135/2136 (removed 1) transitions.
// Phase 1: matrix 2135 rows 1266 cols
[2023-03-11 03:09:21] [INFO ] Computed 32 place invariants in 19 ms
[2023-03-11 03:09:21] [INFO ] Implicit Places using invariants in 727 ms returned []
[2023-03-11 03:09:21] [INFO ] Invariant cache hit.
[2023-03-11 03:09:22] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:09:28] [INFO ] Implicit Places using invariants and state equation in 6645 ms returned []
Implicit Place search using SMT with State Equation took 7376 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1266/1289 places, 2135/2177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8368 ms. Remains : 1266/1289 places, 2135/2177 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ s453 s1032), p0:(LEQ 1 s607), p2:(GT s118 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-030-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLCardinality-15 finished in 8771 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))))'
[2023-03-11 03:09:29] [INFO ] Flatten gal took : 91 ms
[2023-03-11 03:09:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 03:09:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1289 places, 2177 transitions and 7963 arcs took 17 ms.
Total runtime 124791 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-030
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA CANConstruction-PT-030-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678504169779

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 CANConstruction-PT-030-LTLCardinality-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CANConstruction-PT-030-LTLCardinality-13
lola: result : false
lola: markings : 1316
lola: fired transitions : 2489
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-030-LTLCardinality-13: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="CANConstruction-PT-030"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CANConstruction-PT-030, 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 r039-tajo-167813692800635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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