fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r060-tall-165254771600139
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DLCround-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
503.836 63845.00 85681.00 2108.20 FFTFTFFTFTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254771600139.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DLCround-PT-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254771600139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 07:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 547K May 10 09:33 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 DLCround-PT-04b-LTLCardinality-00
FORMULA_NAME DLCround-PT-04b-LTLCardinality-01
FORMULA_NAME DLCround-PT-04b-LTLCardinality-02
FORMULA_NAME DLCround-PT-04b-LTLCardinality-03
FORMULA_NAME DLCround-PT-04b-LTLCardinality-04
FORMULA_NAME DLCround-PT-04b-LTLCardinality-05
FORMULA_NAME DLCround-PT-04b-LTLCardinality-06
FORMULA_NAME DLCround-PT-04b-LTLCardinality-07
FORMULA_NAME DLCround-PT-04b-LTLCardinality-08
FORMULA_NAME DLCround-PT-04b-LTLCardinality-09
FORMULA_NAME DLCround-PT-04b-LTLCardinality-10
FORMULA_NAME DLCround-PT-04b-LTLCardinality-11
FORMULA_NAME DLCround-PT-04b-LTLCardinality-12
FORMULA_NAME DLCround-PT-04b-LTLCardinality-13
FORMULA_NAME DLCround-PT-04b-LTLCardinality-14
FORMULA_NAME DLCround-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652567123364

Running Version 202205111006
[2022-05-14 22:25:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 22:25:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 22:25:24] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2022-05-14 22:25:24] [INFO ] Transformed 1680 places.
[2022-05-14 22:25:24] [INFO ] Transformed 2364 transitions.
[2022-05-14 22:25:24] [INFO ] Found NUPN structural information;
[2022-05-14 22:25:24] [INFO ] Parsed PT model containing 1680 places and 2364 transitions in 272 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-04b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1680/1680 places, 2364/2364 transitions.
Discarding 281 places :
Symmetric choice reduction at 0 with 281 rule applications. Total rules 281 place count 1399 transition count 2083
Iterating global reduction 0 with 281 rules applied. Total rules applied 562 place count 1399 transition count 2083
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 769 place count 1192 transition count 1876
Iterating global reduction 0 with 207 rules applied. Total rules applied 976 place count 1192 transition count 1876
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 980 place count 1192 transition count 1872
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 1026 place count 1146 transition count 1787
Iterating global reduction 1 with 46 rules applied. Total rules applied 1072 place count 1146 transition count 1787
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 1104 place count 1114 transition count 1755
Iterating global reduction 1 with 32 rules applied. Total rules applied 1136 place count 1114 transition count 1755
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1140 place count 1114 transition count 1751
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1157 place count 1097 transition count 1734
Iterating global reduction 2 with 17 rules applied. Total rules applied 1174 place count 1097 transition count 1734
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1190 place count 1081 transition count 1718
Iterating global reduction 2 with 16 rules applied. Total rules applied 1206 place count 1081 transition count 1718
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1222 place count 1065 transition count 1702
Iterating global reduction 2 with 16 rules applied. Total rules applied 1238 place count 1065 transition count 1702
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1249 place count 1054 transition count 1691
Iterating global reduction 2 with 11 rules applied. Total rules applied 1260 place count 1054 transition count 1691
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1267 place count 1047 transition count 1684
Iterating global reduction 2 with 7 rules applied. Total rules applied 1274 place count 1047 transition count 1684
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1279 place count 1042 transition count 1679
Iterating global reduction 2 with 5 rules applied. Total rules applied 1284 place count 1042 transition count 1679
Applied a total of 1284 rules in 699 ms. Remains 1042 /1680 variables (removed 638) and now considering 1679/2364 (removed 685) transitions.
// Phase 1: matrix 1679 rows 1042 cols
[2022-05-14 22:25:25] [INFO ] Computed 69 place invariants in 18 ms
[2022-05-14 22:25:26] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 1679 rows 1042 cols
[2022-05-14 22:25:26] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:25:26] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
// Phase 1: matrix 1679 rows 1042 cols
[2022-05-14 22:25:26] [INFO ] Computed 69 place invariants in 6 ms
[2022-05-14 22:25:27] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1042/1680 places, 1679/2364 transitions.
Finished structural reductions, in 1 iterations. Remains : 1042/1680 places, 1679/2364 transitions.
Support contains 29 out of 1042 places after structural reductions.
[2022-05-14 22:25:27] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-14 22:25:27] [INFO ] Flatten gal took : 122 ms
FORMULA DLCround-PT-04b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 22:25:27] [INFO ] Flatten gal took : 74 ms
[2022-05-14 22:25:27] [INFO ] Input system was already deterministic with 1679 transitions.
Finished random walk after 8379 steps, including 2 resets, run visited all 14 properties in 238 ms. (steps per millisecond=35 )
FORMULA DLCround-PT-04b-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 141 stabilizing places and 141 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(!p0 U !p1))))'
Support contains 4 out of 1042 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1042/1042 places, 1679/1679 transitions.
Graph (trivial) has 962 edges and 1042 vertex of which 290 / 1042 are part of one of the 23 SCC in 4 ms
Free SCC test removed 267 places
Ensure Unique test removed 290 transitions
Reduce isomorphic transitions removed 290 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 178 rules applied. Total rules applied 179 place count 774 transition count 1210
Reduce places removed 178 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 206 rules applied. Total rules applied 385 place count 596 transition count 1182
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 403 place count 578 transition count 1182
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 403 place count 578 transition count 1113
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 541 place count 509 transition count 1113
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 586 place count 464 transition count 951
Iterating global reduction 3 with 45 rules applied. Total rules applied 631 place count 464 transition count 951
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 634 place count 464 transition count 948
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 634 place count 464 transition count 939
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 652 place count 455 transition count 939
Performed 164 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 164 places in 1 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 4 with 328 rules applied. Total rules applied 980 place count 291 transition count 770
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 985 place count 291 transition count 765
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1004 place count 272 transition count 628
Iterating global reduction 5 with 19 rules applied. Total rules applied 1023 place count 272 transition count 628
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1038 place count 272 transition count 613
Performed 17 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1072 place count 255 transition count 719
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1075 place count 252 transition count 685
Iterating global reduction 6 with 3 rules applied. Total rules applied 1078 place count 252 transition count 685
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1094 place count 252 transition count 669
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 7 with 23 rules applied. Total rules applied 1117 place count 252 transition count 646
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1125 place count 244 transition count 630
Iterating global reduction 7 with 8 rules applied. Total rules applied 1133 place count 244 transition count 630
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1141 place count 236 transition count 565
Iterating global reduction 7 with 8 rules applied. Total rules applied 1149 place count 236 transition count 565
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1157 place count 236 transition count 557
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1158 place count 235 transition count 556
Applied a total of 1158 rules in 211 ms. Remains 235 /1042 variables (removed 807) and now considering 556/1679 (removed 1123) transitions.
[2022-05-14 22:25:28] [INFO ] Flow matrix only has 531 transitions (discarded 25 similar events)
// Phase 1: matrix 531 rows 235 cols
[2022-05-14 22:25:28] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:25:28] [INFO ] Implicit Places using invariants in 101 ms returned []
[2022-05-14 22:25:28] [INFO ] Flow matrix only has 531 transitions (discarded 25 similar events)
// Phase 1: matrix 531 rows 235 cols
[2022-05-14 22:25:28] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:25:28] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-14 22:25:28] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2022-05-14 22:25:28] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-14 22:25:28] [INFO ] Flow matrix only has 531 transitions (discarded 25 similar events)
// Phase 1: matrix 531 rows 235 cols
[2022-05-14 22:25:28] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:25:29] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/1042 places, 556/1679 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/1042 places, 556/1679 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s38 1)), p0:(OR (EQ s27 0) (EQ s144 1))], 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 103 steps with 0 reset in 4 ms.
FORMULA DLCround-PT-04b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLCardinality-01 finished in 974 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p1)))||p0)))'
Support contains 2 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1679/1679 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1022 transition count 1659
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1022 transition count 1659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1022 transition count 1658
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 1011 transition count 1647
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1009 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1008 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1008 transition count 1644
Applied a total of 69 rules in 144 ms. Remains 1008 /1042 variables (removed 34) and now considering 1644/1679 (removed 35) transitions.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:29] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:25:29] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:29] [INFO ] Computed 69 place invariants in 5 ms
[2022-05-14 22:25:30] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:30] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:25:30] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1008/1042 places, 1644/1679 transitions.
Finished structural reductions, in 1 iterations. Remains : 1008/1042 places, 1644/1679 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (EQ s693 0) (EQ s9 1)), p1:(OR (EQ s693 0) (EQ s9 1))], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 875 ms.
Product exploration explored 100000 steps with 50000 reset in 835 ms.
Computed a total of 134 stabilizing places and 134 stable transitions
Computed a total of 134 stabilizing places and 134 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DLCround-PT-04b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLCardinality-02 finished in 3585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 2 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1679/1679 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1022 transition count 1659
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1022 transition count 1659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1022 transition count 1658
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 1011 transition count 1647
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1009 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1008 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1008 transition count 1644
Applied a total of 69 rules in 130 ms. Remains 1008 /1042 variables (removed 34) and now considering 1644/1679 (removed 35) transitions.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:33] [INFO ] Computed 69 place invariants in 11 ms
[2022-05-14 22:25:33] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:33] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:25:33] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:33] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:25:34] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1008/1042 places, 1644/1679 transitions.
Finished structural reductions, in 1 iterations. Remains : 1008/1042 places, 1644/1679 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s554 0) (EQ s841 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 33 reset in 277 ms.
Product exploration explored 100000 steps with 26 reset in 402 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 1632 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 870 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=145 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:37] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:25:37] [INFO ] [Real]Absence check using 69 positive place invariants in 46 ms returned sat
[2022-05-14 22:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:25:38] [INFO ] [Real]Absence check using state equation in 1107 ms returned sat
[2022-05-14 22:25:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:25:39] [INFO ] [Nat]Absence check using 69 positive place invariants in 56 ms returned sat
[2022-05-14 22:25:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:25:40] [INFO ] [Nat]Absence check using state equation in 1172 ms returned sat
[2022-05-14 22:25:40] [INFO ] Computed and/alt/rep : 1598/3103/1598 causal constraints (skipped 45 transitions) in 88 ms.
[2022-05-14 22:25:54] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-14 22:25:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1008 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1008/1008 places, 1644/1644 transitions.
Applied a total of 0 rules in 24 ms. Remains 1008 /1008 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:54] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:25:54] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:54] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:25:55] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:55] [INFO ] Computed 69 place invariants in 10 ms
[2022-05-14 22:25:55] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1008/1008 places, 1644/1644 transitions.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1939 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=215 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:25:56] [INFO ] Computed 69 place invariants in 10 ms
[2022-05-14 22:25:56] [INFO ] [Real]Absence check using 69 positive place invariants in 45 ms returned sat
[2022-05-14 22:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:25:58] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2022-05-14 22:25:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:25:58] [INFO ] [Nat]Absence check using 69 positive place invariants in 45 ms returned sat
[2022-05-14 22:25:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:25:59] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2022-05-14 22:25:59] [INFO ] Computed and/alt/rep : 1598/3103/1598 causal constraints (skipped 45 transitions) in 70 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-14 22:26:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 40 reset in 274 ms.
Product exploration explored 100000 steps with 27 reset in 322 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1008 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1008/1008 places, 1644/1644 transitions.
Graph (trivial) has 933 edges and 1008 vertex of which 289 / 1008 are part of one of the 23 SCC in 3 ms
Free SCC test removed 266 places
Ensure Unique test removed 289 transitions
Reduce isomorphic transitions removed 289 transitions.
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 742 transition count 1355
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 18 rules applied. Total rules applied 186 place count 742 transition count 1346
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 186 place count 742 transition count 1352
Deduced a syphon composed of 186 places in 2 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 196 place count 742 transition count 1352
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 294 place count 644 transition count 1105
Deduced a syphon composed of 125 places in 2 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 392 place count 644 transition count 1105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 396 place count 644 transition count 1101
Performed 228 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 353 places in 0 ms
Iterating global reduction 3 with 228 rules applied. Total rules applied 624 place count 644 transition count 1106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 629 place count 644 transition count 1101
Renaming transitions due to excessive name length > 1024 char.
Discarding 176 places :
Symmetric choice reduction at 4 with 176 rule applications. Total rules 805 place count 468 transition count 839
Deduced a syphon composed of 191 places in 0 ms
Iterating global reduction 4 with 176 rules applied. Total rules applied 981 place count 468 transition count 839
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 995 place count 468 transition count 825
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1000 place count 463 transition count 820
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 1005 place count 463 transition count 820
Performed 26 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 5 with 26 rules applied. Total rules applied 1031 place count 463 transition count 1006
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1044 place count 463 transition count 993
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 1080 place count 427 transition count 878
Deduced a syphon composed of 180 places in 0 ms
Iterating global reduction 6 with 36 rules applied. Total rules applied 1116 place count 427 transition count 878
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 1140 place count 427 transition count 854
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1148 place count 419 transition count 838
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1156 place count 419 transition count 838
Deduced a syphon composed of 172 places in 0 ms
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 7 with 23 rules applied. Total rules applied 1179 place count 419 transition count 815
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1188 place count 410 transition count 797
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1197 place count 410 transition count 797
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1206 place count 401 transition count 722
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1215 place count 401 transition count 722
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1228 place count 401 transition count 709
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1236 place count 393 transition count 697
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 8 with 8 rules applied. Total rules applied 1244 place count 393 transition count 697
Deduced a syphon composed of 164 places in 0 ms
Applied a total of 1244 rules in 256 ms. Remains 393 /1008 variables (removed 615) and now considering 697/1644 (removed 947) transitions.
[2022-05-14 22:26:14] [INFO ] Redundant transitions in 75 ms returned []
[2022-05-14 22:26:14] [INFO ] Flow matrix only has 684 transitions (discarded 13 similar events)
// Phase 1: matrix 684 rows 393 cols
[2022-05-14 22:26:14] [INFO ] Computed 69 place invariants in 16 ms
[2022-05-14 22:26:14] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/1008 places, 697/1644 transitions.
Finished structural reductions, in 1 iterations. Remains : 393/1008 places, 697/1644 transitions.
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLCardinality-03 finished in 41806 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(p1)))))'
Support contains 4 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1679/1679 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1023 transition count 1660
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1023 transition count 1660
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1023 transition count 1659
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 1015 transition count 1651
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 1015 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1014 transition count 1650
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1014 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1013 transition count 1649
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1013 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1012 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1012 transition count 1648
Applied a total of 61 rules in 267 ms. Remains 1012 /1042 variables (removed 30) and now considering 1648/1679 (removed 31) transitions.
// Phase 1: matrix 1648 rows 1012 cols
[2022-05-14 22:26:15] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:26:15] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 1648 rows 1012 cols
[2022-05-14 22:26:15] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:26:15] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
// Phase 1: matrix 1648 rows 1012 cols
[2022-05-14 22:26:15] [INFO ] Computed 69 place invariants in 6 ms
[2022-05-14 22:26:16] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1012/1042 places, 1648/1679 transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1042 places, 1648/1679 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s339 0) (EQ s293 1)), p1:(OR (EQ s960 0) (EQ s137 1))], 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]]
Product exploration explored 100000 steps with 33333 reset in 571 ms.
Product exploration explored 100000 steps with 33333 reset in 541 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DLCround-PT-04b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLCardinality-04 finished in 3108 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(F(G(p0))))))'
Support contains 2 out of 1042 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1042/1042 places, 1679/1679 transitions.
Graph (trivial) has 969 edges and 1042 vertex of which 296 / 1042 are part of one of the 24 SCC in 3 ms
Free SCC test removed 272 places
Ensure Unique test removed 295 transitions
Reduce isomorphic transitions removed 295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 181 rules applied. Total rules applied 182 place count 769 transition count 1202
Reduce places removed 181 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 209 rules applied. Total rules applied 391 place count 588 transition count 1174
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 409 place count 570 transition count 1174
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 409 place count 570 transition count 1106
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 545 place count 502 transition count 1106
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 590 place count 457 transition count 937
Iterating global reduction 3 with 45 rules applied. Total rules applied 635 place count 457 transition count 937
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 638 place count 457 transition count 934
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 638 place count 457 transition count 925
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 656 place count 448 transition count 925
Performed 164 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 4 with 328 rules applied. Total rules applied 984 place count 284 transition count 756
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 989 place count 284 transition count 751
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1007 place count 266 transition count 619
Iterating global reduction 5 with 18 rules applied. Total rules applied 1025 place count 266 transition count 619
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1039 place count 266 transition count 605
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1071 place count 250 transition count 699
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1075 place count 246 transition count 653
Iterating global reduction 6 with 4 rules applied. Total rules applied 1079 place count 246 transition count 653
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1100 place count 246 transition count 632
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 7 with 24 rules applied. Total rules applied 1124 place count 246 transition count 608
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1134 place count 236 transition count 588
Iterating global reduction 7 with 10 rules applied. Total rules applied 1144 place count 236 transition count 588
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1154 place count 226 transition count 506
Iterating global reduction 7 with 10 rules applied. Total rules applied 1164 place count 226 transition count 506
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1174 place count 226 transition count 496
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1175 place count 225 transition count 495
Applied a total of 1175 rules in 111 ms. Remains 225 /1042 variables (removed 817) and now considering 495/1679 (removed 1184) transitions.
[2022-05-14 22:26:17] [INFO ] Flow matrix only has 477 transitions (discarded 18 similar events)
// Phase 1: matrix 477 rows 225 cols
[2022-05-14 22:26:17] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-14 22:26:18] [INFO ] Implicit Places using invariants in 91 ms returned []
[2022-05-14 22:26:18] [INFO ] Flow matrix only has 477 transitions (discarded 18 similar events)
// Phase 1: matrix 477 rows 225 cols
[2022-05-14 22:26:18] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-14 22:26:18] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-14 22:26:18] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2022-05-14 22:26:18] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-14 22:26:18] [INFO ] Flow matrix only has 477 transitions (discarded 18 similar events)
// Phase 1: matrix 477 rows 225 cols
[2022-05-14 22:26:18] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:26:18] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 225/1042 places, 495/1679 transitions.
Finished structural reductions, in 1 iterations. Remains : 225/1042 places, 495/1679 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s81 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLCardinality-06 finished in 601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X(!(G(p0) U F(!p1)))))'
Support contains 4 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1679/1679 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1021 transition count 1658
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1021 transition count 1658
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1021 transition count 1657
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 1011 transition count 1647
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1009 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1008 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1008 transition count 1644
Applied a total of 69 rules in 120 ms. Remains 1008 /1042 variables (removed 34) and now considering 1644/1679 (removed 35) transitions.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:26:18] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:26:18] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:26:18] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:26:19] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:26:19] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:26:20] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1008/1042 places, 1644/1679 transitions.
Finished structural reductions, in 1 iterations. Remains : 1008/1042 places, 1644/1679 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-07 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:(OR (EQ s587 0) (EQ s796 1)), p0:(OR (EQ s706 0) (EQ s411 1))], 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 732 ms.
Product exploration explored 100000 steps with 50000 reset in 750 ms.
Computed a total of 135 stabilizing places and 135 stable transitions
Computed a total of 135 stabilizing places and 135 stable transitions
Detected a total of 135/1008 stabilizing places and 135/1644 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (F (OR (G p1) (G (NOT p1))))]
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 5 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DLCround-PT-04b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLCardinality-07 finished in 3317 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1679/1679 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1022 transition count 1659
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1022 transition count 1659
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1012 transition count 1649
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1012 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1011 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1011 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1010 transition count 1647
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1010 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1009 transition count 1646
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1009 transition count 1646
Applied a total of 66 rules in 115 ms. Remains 1009 /1042 variables (removed 33) and now considering 1646/1679 (removed 33) transitions.
// Phase 1: matrix 1646 rows 1009 cols
[2022-05-14 22:26:21] [INFO ] Computed 69 place invariants in 8 ms
[2022-05-14 22:26:22] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 1646 rows 1009 cols
[2022-05-14 22:26:22] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:26:22] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
// Phase 1: matrix 1646 rows 1009 cols
[2022-05-14 22:26:22] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:26:23] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1009/1042 places, 1646/1679 transitions.
Finished structural reductions, in 1 iterations. Remains : 1009/1042 places, 1646/1679 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s995 0) (EQ s289 1))], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLCardinality-08 finished in 1719 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F((F(p0)&&p0)) U G(F(p0)))))))'
Support contains 2 out of 1042 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1042/1042 places, 1679/1679 transitions.
Graph (trivial) has 967 edges and 1042 vertex of which 290 / 1042 are part of one of the 23 SCC in 1 ms
Free SCC test removed 267 places
Ensure Unique test removed 290 transitions
Reduce isomorphic transitions removed 290 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 180 rules applied. Total rules applied 181 place count 774 transition count 1208
Reduce places removed 180 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 208 rules applied. Total rules applied 389 place count 594 transition count 1180
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 407 place count 576 transition count 1180
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 407 place count 576 transition count 1110
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 547 place count 506 transition count 1110
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 593 place count 460 transition count 940
Iterating global reduction 3 with 46 rules applied. Total rules applied 639 place count 460 transition count 940
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 642 place count 460 transition count 937
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 642 place count 460 transition count 928
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 660 place count 451 transition count 928
Performed 165 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 990 place count 286 transition count 758
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 995 place count 286 transition count 753
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1013 place count 268 transition count 624
Iterating global reduction 5 with 18 rules applied. Total rules applied 1031 place count 268 transition count 624
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1046 place count 268 transition count 609
Performed 18 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1082 place count 250 transition count 723
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1086 place count 246 transition count 675
Iterating global reduction 6 with 4 rules applied. Total rules applied 1090 place count 246 transition count 675
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1111 place count 246 transition count 654
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 1136 place count 246 transition count 629
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1145 place count 237 transition count 611
Iterating global reduction 7 with 9 rules applied. Total rules applied 1154 place count 237 transition count 611
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1163 place count 228 transition count 537
Iterating global reduction 7 with 9 rules applied. Total rules applied 1172 place count 228 transition count 537
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1181 place count 228 transition count 528
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1182 place count 227 transition count 527
Applied a total of 1182 rules in 106 ms. Remains 227 /1042 variables (removed 815) and now considering 527/1679 (removed 1152) transitions.
[2022-05-14 22:26:23] [INFO ] Flow matrix only has 506 transitions (discarded 21 similar events)
// Phase 1: matrix 506 rows 227 cols
[2022-05-14 22:26:23] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:26:23] [INFO ] Implicit Places using invariants in 96 ms returned []
[2022-05-14 22:26:23] [INFO ] Flow matrix only has 506 transitions (discarded 21 similar events)
// Phase 1: matrix 506 rows 227 cols
[2022-05-14 22:26:23] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-14 22:26:23] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-14 22:26:23] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2022-05-14 22:26:23] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-14 22:26:23] [INFO ] Flow matrix only has 506 transitions (discarded 21 similar events)
// Phase 1: matrix 506 rows 227 cols
[2022-05-14 22:26:23] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-14 22:26:24] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/1042 places, 527/1679 transitions.
Finished structural reductions, in 1 iterations. Remains : 227/1042 places, 527/1679 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-11 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:(OR (EQ s33 0) (EQ s109 1))], 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 260 steps with 0 reset in 6 ms.
FORMULA DLCround-PT-04b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLCardinality-11 finished in 681 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(p0)))))'
Support contains 5 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1679/1679 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1025 transition count 1662
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1025 transition count 1662
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1025 transition count 1661
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 1016 transition count 1652
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 1016 transition count 1652
Applied a total of 53 rules in 53 ms. Remains 1016 /1042 variables (removed 26) and now considering 1652/1679 (removed 27) transitions.
// Phase 1: matrix 1652 rows 1016 cols
[2022-05-14 22:26:24] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:26:24] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 1652 rows 1016 cols
[2022-05-14 22:26:24] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:26:25] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
// Phase 1: matrix 1652 rows 1016 cols
[2022-05-14 22:26:25] [INFO ] Computed 69 place invariants in 8 ms
[2022-05-14 22:26:25] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1016/1042 places, 1652/1679 transitions.
Finished structural reductions, in 1 iterations. Remains : 1016/1042 places, 1652/1679 transitions.
Stuttering acceptance computed with spot in 1443 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s368 1) (OR (EQ s813 0) (EQ s173 1) (AND (EQ s687 0) (EQ s515 1))))], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLCardinality-15 finished in 2963 ms.
All properties solved by simple procedures.
Total runtime 62703 ms.

BK_STOP 1652567187209

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="DLCround-PT-04b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DLCround-PT-04b, 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 r060-tall-165254771600139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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