About the Execution of ITS-Tools for IBM703-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
343.964 | 45131.00 | 16476.00 | 18355.30 | TTTFTFTTFFTTTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406800340.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is IBM703-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 50K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 195K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.1K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 203K May 5 16:51 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 IBM703-PT-none-00
FORMULA_NAME IBM703-PT-none-01
FORMULA_NAME IBM703-PT-none-02
FORMULA_NAME IBM703-PT-none-03
FORMULA_NAME IBM703-PT-none-04
FORMULA_NAME IBM703-PT-none-05
FORMULA_NAME IBM703-PT-none-06
FORMULA_NAME IBM703-PT-none-07
FORMULA_NAME IBM703-PT-none-08
FORMULA_NAME IBM703-PT-none-09
FORMULA_NAME IBM703-PT-none-10
FORMULA_NAME IBM703-PT-none-11
FORMULA_NAME IBM703-PT-none-12
FORMULA_NAME IBM703-PT-none-13
FORMULA_NAME IBM703-PT-none-14
FORMULA_NAME IBM703-PT-none-15
=== Now, execution of the tool begins
BK_START 1620837665225
Running Version 0
[2021-05-12 16:41:20] [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]
[2021-05-12 16:41:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:41:20] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-12 16:41:20] [INFO ] Transformed 262 places.
[2021-05-12 16:41:20] [INFO ] Transformed 284 transitions.
[2021-05-12 16:41:20] [INFO ] Found NUPN structural information;
[2021-05-12 16:41:20] [INFO ] Completing missing partition info from NUPN : creating a component with [merge_s00000450_activated, merge_s00000462_activated, merge_s00000319_activated, merge_s00000446_activated, merge_s00000449_activated, task_s00000720_input_s00000263, task_s00000721_input_s00000263, task_s00000704_input_s00000263, task_s00000714_input_s00000263, task_s00000724_input_s00000263, fork_s00000464_input_s00000263, task_s00000716_input_s00000263, task_s00000762_input_s00000263, task_s00000726_input_s00000263, task_s00000754_input_s00000263, task_s00000727_input_s00000263, task_s00000746_input_s00000263, task_s00000756_input_s00000263, task_s00000757_input_s00000263, merge_s00000320_input_s00000263, merge_s00000453_input_s00000290, merge_s00000319_input_s00000290, merge_s00000455_input_s00000290, merge_s00000446_input_s00000290, merge_s00000456_input_s00000263, merge_s00000458_input_s00000263, merge_s00000457_input_s00000285, task_s00000710_output_s00000264, task_s00000730_output_s00000264, task_s00000740_output_s00000264, task_s00000704_output_s00000264, task_s00000732_output_s00000264, task_s00000714_output_s00000264, task_s00000733_output_s00000264, task_s00000724_output_s00000264, task_s00000752_output_s00000264, task_s00000716_output_s00000264, task_s00000707_output_s00000264, task_s00000744_output_s00000264, task_s00000708_output_s00000264, task_s00000736_output_s00000264, task_s00000727_output_s00000264, task_s00000755_output_s00000264, task_s00000728_output_s00000264, task_s00000738_output_s00000264, task_s00000739_output_s00000264, task_s00000749_output_s00000264, decision_s00000801_activated, decision_s00000804_activated, decision_s00000772_activated, decision_s00000792_activated, decision_s00000793_activated, decision_s00000776_activated, decision_s00000796_activated, decision_s00000788_activated, fork_s00000463_activated_s00000272, fork_s00000464_activated_s00000272, fork_s00000466_activated_s00000272, fork_s00000466_activated_s00000274, decision_s00000773_input_s00000263, decision_s00000793_input_s00000263, decision_s00000775_input_s00000263, decision_s00000787_input_s00000263, process_s00000030__s00000703_input_s00000263, callToProcess_s00000807_output_s00000264, callToProcess_s00000808_output_s00000264, task_s00000710_inputCriterion_s00000257_used, task_s00000711_inputCriterion_s00000257_used, task_s00000721_inputCriterion_s00000257_used, task_s00000740_inputCriterion_s00000257_used, task_s00000722_inputCriterion_s00000257_used, task_s00000741_inputCriterion_s00000257_used, task_s00000732_inputCriterion_s00000257_used, task_s00000714_inputCriterion_s00000257_used, task_s00000760_inputCriterion_s00000257_used, task_s00000733_inputCriterion_s00000257_used, task_s00000724_inputCriterion_s00000257_used, task_s00000706_inputCriterion_s00000257_used, task_s00000752_inputCriterion_s00000257_used, task_s00000725_inputCriterion_s00000257_used, task_s00000707_inputCriterion_s00000257_used, task_s00000753_inputCriterion_s00000257_used, task_s00000735_inputCriterion_s00000257_used, task_s00000726_inputCriterion_s00000257_used, task_s00000708_inputCriterion_s00000257_used, task_s00000745_inputCriterion_s00000257_used, task_s00000736_inputCriterion_s00000257_used, task_s00000718_inputCriterion_s00000257_used, task_s00000755_inputCriterion_s00000257_used, task_s00000737_inputCriterion_s00000257_used, task_s00000719_inputCriterion_s00000257_used, task_s00000738_inputCriterion_s00000257_used, task_s00000757_inputCriterion_s00000257_used, task_s00000748_inputCriterion_s00000257_used, task_s00000758_inputCriterion_s00000257_used, callToProcess_s00000807_inputCriterion_s00000257_used, callToProcess_s00000808_inputCriterion_s00000257_used]
[2021-05-12 16:41:20] [INFO ] Parsed PT model containing 262 places and 284 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:41:20] [INFO ] Initial state test concluded for 2 properties.
FORMULA IBM703-PT-none-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 262 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 284
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 35 place count 227 transition count 255
Iterating global reduction 1 with 29 rules applied. Total rules applied 64 place count 227 transition count 255
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 76 place count 215 transition count 243
Iterating global reduction 1 with 12 rules applied. Total rules applied 88 place count 215 transition count 243
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 97 place count 206 transition count 234
Iterating global reduction 1 with 9 rules applied. Total rules applied 106 place count 206 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 206 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 202 transition count 228
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 202 transition count 228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 198 transition count 224
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 198 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 128 place count 194 transition count 220
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 194 transition count 220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 190 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 190 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 186 transition count 212
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 186 transition count 212
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 183 transition count 209
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 183 transition count 209
Applied a total of 154 rules in 98 ms. Remains 183 /262 variables (removed 79) and now considering 209/284 (removed 75) transitions.
// Phase 1: matrix 209 rows 183 cols
[2021-05-12 16:41:20] [INFO ] Computed 0 place invariants in 15 ms
[2021-05-12 16:41:20] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 209 rows 183 cols
[2021-05-12 16:41:20] [INFO ] Computed 0 place invariants in 9 ms
[2021-05-12 16:41:20] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
// Phase 1: matrix 209 rows 183 cols
[2021-05-12 16:41:20] [INFO ] Computed 0 place invariants in 10 ms
[2021-05-12 16:41:20] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/262 places, 209/284 transitions.
[2021-05-12 16:41:21] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 16:41:21] [INFO ] Flatten gal took : 42 ms
FORMULA IBM703-PT-none-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:41:21] [INFO ] Flatten gal took : 18 ms
[2021-05-12 16:41:21] [INFO ] Input system was already deterministic with 209 transitions.
Incomplete random walk after 100000 steps, including 1908 resets, run finished after 236 ms. (steps per millisecond=423 ) properties (out of 13) seen :12
Running SMT prover for 1 properties.
// Phase 1: matrix 209 rows 183 cols
[2021-05-12 16:41:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:41:21] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-12 16:41:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:41:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:41:21] [INFO ] [Nat]Absence check using state equation in 78 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((X(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 209/209 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 178 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 178 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 178 transition count 203
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 174 transition count 199
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 174 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 172 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 171 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 170 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 169 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 168 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 168 transition count 193
Applied a total of 31 rules in 24 ms. Remains 168 /183 variables (removed 15) and now considering 193/209 (removed 16) transitions.
// Phase 1: matrix 193 rows 168 cols
[2021-05-12 16:41:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:21] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 193 rows 168 cols
[2021-05-12 16:41:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:21] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 168 cols
[2021-05-12 16:41:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:21] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 168/183 places, 193/209 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBM703-PT-none-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s165 0) (EQ s115 1)), p1:(AND (EQ s115 0) (EQ s165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1889 reset in 215 ms.
Product exploration explored 100000 steps with 1866 reset in 195 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 193
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G (NOT p1))), p0, (NOT p1)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA IBM703-PT-none-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property IBM703-PT-none-00 finished in 999 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 209/209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 182 transition count 80
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 145 rules applied. Total rules applied 273 place count 54 transition count 63
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 287 place count 43 transition count 60
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 290 place count 41 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 291 place count 40 transition count 59
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 291 place count 40 transition count 50
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 309 place count 31 transition count 50
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 313 place count 27 transition count 45
Iterating global reduction 5 with 4 rules applied. Total rules applied 317 place count 27 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 319 place count 27 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 320 place count 26 transition count 43
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 321 place count 25 transition count 42
Iterating global reduction 7 with 1 rules applied. Total rules applied 322 place count 25 transition count 42
Performed 19 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 360 place count 6 transition count 17
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 8 rules applied. Total rules applied 368 place count 6 transition count 9
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 370 place count 5 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 372 place count 4 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 373 place count 4 transition count 6
Applied a total of 373 rules in 21 ms. Remains 4 /183 variables (removed 179) and now considering 6/209 (removed 203) transitions.
// Phase 1: matrix 6 rows 4 cols
[2021-05-12 16:41:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:22] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-12 16:41:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:22] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-12 16:41:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-12 16:41:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:22] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/183 places, 6/209 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : IBM703-PT-none-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 30772 reset in 107 ms.
Product exploration explored 100000 steps with 30603 reset in 120 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA IBM703-PT-none-01 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property IBM703-PT-none-01 finished in 366 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(((p0 U p2)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 209/209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 182 transition count 85
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 138 rules applied. Total rules applied 261 place count 59 transition count 70
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 274 place count 49 transition count 67
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 279 place count 47 transition count 64
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 283 place count 44 transition count 63
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 283 place count 44 transition count 54
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 301 place count 35 transition count 54
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 304 place count 32 transition count 50
Iterating global reduction 5 with 3 rules applied. Total rules applied 307 place count 32 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 309 place count 32 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 310 place count 31 transition count 48
Performed 19 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 348 place count 12 transition count 25
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 7 rules applied. Total rules applied 355 place count 12 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 357 place count 11 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 361 place count 9 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 362 place count 9 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 364 place count 9 transition count 17
Applied a total of 364 rules in 11 ms. Remains 9 /183 variables (removed 174) and now considering 17/209 (removed 192) transitions.
// Phase 1: matrix 17 rows 9 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:23] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 17 rows 9 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:23] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-12 16:41:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 9 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 8 ms
[2021-05-12 16:41:23] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/183 places, 17/209 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : IBM703-PT-none-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2 1), p2:(OR (EQ s5 0) (EQ s0 1)), p1:(AND (OR (EQ s4 0) (EQ s4 1)) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-03 finished in 219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 209/209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 182 transition count 78
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 150 rules applied. Total rules applied 280 place count 52 transition count 58
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 296 place count 39 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 298 place count 37 transition count 55
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 298 place count 37 transition count 48
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 312 place count 30 transition count 48
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 315 place count 27 transition count 44
Iterating global reduction 4 with 3 rules applied. Total rules applied 318 place count 27 transition count 44
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 319 place count 26 transition count 43
Iterating global reduction 4 with 1 rules applied. Total rules applied 320 place count 26 transition count 43
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 321 place count 25 transition count 42
Iterating global reduction 4 with 1 rules applied. Total rules applied 322 place count 25 transition count 42
Performed 20 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 362 place count 5 transition count 16
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 370 place count 5 transition count 8
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 374 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 375 place count 3 transition count 4
Applied a total of 375 rules in 9 ms. Remains 3 /183 variables (removed 180) and now considering 4/209 (removed 205) transitions.
// Phase 1: matrix 4 rows 3 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:23] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:23] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-12 16:41:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:23] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/183 places, 4/209 transitions.
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Running random walk in product with property : IBM703-PT-none-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-05 finished in 127 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 209/209 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 178 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 178 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 178 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 175 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 175 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 173 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 173 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 173 transition count 197
Applied a total of 22 rules in 8 ms. Remains 173 /183 variables (removed 10) and now considering 197/209 (removed 12) transitions.
// Phase 1: matrix 197 rows 173 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:23] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 197 rows 173 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-12 16:41:23] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 173 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:23] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 173/183 places, 197/209 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s64 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-08 finished in 242 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 209/209 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 178 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 178 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 178 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 175 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 175 transition count 200
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 172 transition count 197
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 172 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 172 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 171 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 171 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 170 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 170 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 169 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 169 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 168 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 168 transition count 192
Applied a total of 32 rules in 15 ms. Remains 168 /183 variables (removed 15) and now considering 192/209 (removed 17) transitions.
// Phase 1: matrix 192 rows 168 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-12 16:41:23] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 192 rows 168 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 168 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-12 16:41:23] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 1 iterations. Remains : 168/183 places, 192/209 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-13 automaton TGBA [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: 2}]], initial=3, aps=[p0:(EQ s166 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-13 finished in 280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&X(G((p1 U p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 209/209 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 177 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 177 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 177 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 173 transition count 198
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 173 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 171 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 170 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 169 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 168 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 167 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 167 transition count 192
Applied a total of 33 rules in 12 ms. Remains 167 /183 variables (removed 16) and now considering 192/209 (removed 17) transitions.
// Phase 1: matrix 192 rows 167 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-12 16:41:23] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 192 rows 167 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 11 ms
[2021-05-12 16:41:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 167 cols
[2021-05-12 16:41:23] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:24] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 167/183 places, 192/209 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : IBM703-PT-none-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s102 1), p2:(OR (EQ s14 0) (EQ s9 1)), p1:(OR (EQ s69 0) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-15 finished in 503 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620837710356
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="IBM703-PT-none"
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 IBM703-PT-none, 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 r121-tall-162075406800340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;