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-162075406800341.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800341
=====================================================================

--------------------
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 1620837684293

Running Version 0
[2021-05-12 16:41:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:41:39] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-12 16:41:39] [INFO ] Transformed 262 places.
[2021-05-12 16:41:39] [INFO ] Transformed 284 transitions.
[2021-05-12 16:41:39] [INFO ] Found NUPN structural information;
[2021-05-12 16:41:39] [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:39] [INFO ] Parsed PT model containing 262 places and 284 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:41:39] [INFO ] Initial state test concluded for 3 properties.
Support contains 32 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 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 32 place count 230 transition count 258
Iterating global reduction 1 with 26 rules applied. Total rules applied 58 place count 230 transition count 258
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 221 transition count 249
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 221 transition count 249
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 217 transition count 245
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 217 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 217 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 216 transition count 243
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 216 transition count 243
Applied a total of 87 rules in 74 ms. Remains 216 /262 variables (removed 46) and now considering 243/284 (removed 41) transitions.
// Phase 1: matrix 243 rows 216 cols
[2021-05-12 16:41:39] [INFO ] Computed 0 place invariants in 19 ms
[2021-05-12 16:41:40] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 243 rows 216 cols
[2021-05-12 16:41:40] [INFO ] Computed 0 place invariants in 9 ms
[2021-05-12 16:41:40] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 216 cols
[2021-05-12 16:41:40] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-12 16:41:40] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 216/262 places, 243/284 transitions.
[2021-05-12 16:41:40] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 16:41:40] [INFO ] Flatten gal took : 43 ms
FORMULA IBM703-PT-none-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:41:40] [INFO ] Flatten gal took : 17 ms
[2021-05-12 16:41:40] [INFO ] Input system was already deterministic with 243 transitions.
Incomplete random walk after 100000 steps, including 1841 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 30) seen :25
Running SMT prover for 5 properties.
// Phase 1: matrix 243 rows 216 cols
[2021-05-12 16:41:40] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-12 16:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:41:40] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-12 16:41:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:41:41] [INFO ] [Nat]Absence check using state equation in 61 ms returned unsat
[2021-05-12 16:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:41:41] [INFO ] [Real]Absence check using state equation in 55 ms returned unsat
[2021-05-12 16:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:41:41] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-12 16:41:41] [INFO ] Computed and/alt/rep : 242/272/242 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-12 16:41:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:41:41] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-12 16:41:41] [INFO ] Computed and/alt/rep : 242/272/242 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-12 16:41:41] [INFO ] Added : 43 causal constraints over 9 iterations in 155 ms. Result :sat
[2021-05-12 16:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:41:41] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-12 16:41:41] [INFO ] Computed and/alt/rep : 242/272/242 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-12 16:41:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:41:41] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-12 16:41:41] [INFO ] Computed and/alt/rep : 242/272/242 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-12 16:41:42] [INFO ] Added : 43 causal constraints over 9 iterations in 153 ms. Result :sat
[2021-05-12 16:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:41:42] [INFO ] [Real]Absence check using state equation in 65 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA IBM703-PT-none-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 155 place count 215 transition count 87
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 173 rules applied. Total rules applied 328 place count 60 transition count 69
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 341 place count 48 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 342 place count 47 transition count 68
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 342 place count 47 transition count 58
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 362 place count 37 transition count 58
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 369 place count 30 transition count 50
Iterating global reduction 4 with 7 rules applied. Total rules applied 376 place count 30 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 4 with 2 rules applied. Total rules applied 378 place count 30 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 379 place count 29 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 379 place count 29 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 381 place count 28 transition count 47
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 382 place count 27 transition count 46
Iterating global reduction 6 with 1 rules applied. Total rules applied 383 place count 27 transition count 46
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 384 place count 26 transition count 45
Iterating global reduction 6 with 1 rules applied. Total rules applied 385 place count 26 transition count 45
Performed 17 Post agglomeration using F-continuation condition with reduction of 5 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 419 place count 9 transition count 23
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 6 with 9 rules applied. Total rules applied 428 place count 9 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 430 place count 8 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 434 place count 6 transition count 11
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 436 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 438 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 439 place count 5 transition count 8
Applied a total of 439 rules in 37 ms. Remains 5 /216 variables (removed 211) and now considering 8/243 (removed 235) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 16:41:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:42] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 16:41:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:42] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-12 16:41:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 16:41:42] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:42] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/216 places, 8/243 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBM703-PT-none-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 1), p1:(EQ s1 1)], nbAcceptance=2, 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 3 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-00 finished in 300 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 155 place count 215 transition count 87
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 173 rules applied. Total rules applied 328 place count 60 transition count 69
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 340 place count 48 transition count 69
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 340 place count 48 transition count 59
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 360 place count 38 transition count 59
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 367 place count 31 transition count 51
Iterating global reduction 3 with 7 rules applied. Total rules applied 374 place count 31 transition count 51
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 3 with 2 rules applied. Total rules applied 376 place count 31 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 377 place count 30 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 377 place count 30 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 379 place count 29 transition count 48
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 380 place count 28 transition count 47
Iterating global reduction 5 with 1 rules applied. Total rules applied 381 place count 28 transition count 47
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 382 place count 27 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 383 place count 27 transition count 46
Performed 18 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 419 place count 9 transition count 22
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 428 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 430 place count 8 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 434 place count 6 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 435 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 437 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 438 place count 5 transition count 8
Applied a total of 438 rules in 11 ms. Remains 5 /216 variables (removed 211) and now considering 8/243 (removed 235) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 16:41:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:42] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 16:41:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:42] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-12 16:41:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 16:41:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:42] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/216 places, 8/243 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBM703-PT-none-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s4 0), p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 28621 reset in 177 ms.
Product exploration explored 100000 steps with 28586 reset in 113 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 8
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 (NOT p1))), (F (G p0)), (NOT p1), 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 529 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 215 transition count 86
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 177 rules applied. Total rules applied 333 place count 59 transition count 65
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 348 place count 45 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 349 place count 44 transition count 64
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 349 place count 44 transition count 55
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 367 place count 35 transition count 55
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 374 place count 28 transition count 47
Iterating global reduction 4 with 7 rules applied. Total rules applied 381 place count 28 transition count 47
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 4 with 2 rules applied. Total rules applied 383 place count 28 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 384 place count 27 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 384 place count 27 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 386 place count 26 transition count 44
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 387 place count 25 transition count 43
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 25 transition count 43
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 389 place count 24 transition count 42
Iterating global reduction 6 with 1 rules applied. Total rules applied 390 place count 24 transition count 42
Performed 18 Post agglomeration using F-continuation condition with reduction of 7 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 426 place count 6 transition count 17
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 432 place count 6 transition count 11
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 438 place count 3 transition count 6
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 440 place count 3 transition count 4
Applied a total of 440 rules in 24 ms. Remains 3 /216 variables (removed 213) and now considering 4/243 (removed 239) transitions.
// Phase 1: matrix 4 rows 3 cols
[2021-05-12 16:41:43] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:43] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-12 16:41:43] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:43] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-12 16:41:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-12 16:41:43] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:43] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/216 places, 4/243 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : IBM703-PT-none-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-02 finished in 91 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U (G(p0)||(p0&&(p1||X(F(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 243/243 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 204 transition count 231
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 204 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 204 transition count 230
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 197 transition count 223
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 197 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 197 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 194 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 194 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 192 transition count 217
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 192 transition count 217
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 190 transition count 215
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 190 transition count 215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 188 transition count 213
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 188 transition count 213
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 187 transition count 212
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 187 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 186 transition count 211
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 186 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 185 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 185 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 185 transition count 209
Applied a total of 65 rules in 24 ms. Remains 185 /216 variables (removed 31) and now considering 209/243 (removed 34) transitions.
// Phase 1: matrix 209 rows 185 cols
[2021-05-12 16:41:43] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:43] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 209 rows 185 cols
[2021-05-12 16:41:43] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:43] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 209 rows 185 cols
[2021-05-12 16:41:43] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:43] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/216 places, 209/243 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p2:(NEQ s172 1), p0:(NEQ s146 1), p1:(NEQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 185 transition count 209
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 p2)), (F (G p0)), (F (G p1)), p2, p0, p1]
Adopting property with smaller alphabet thanks to knowledge :(F (G p2))
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Support contains 2 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 185/185 places, 209/209 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 183 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 183 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 182 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 182 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 177 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 177 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 176 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 176 transition count 200
Applied a total of 18 rules in 19 ms. Remains 176 /185 variables (removed 9) and now considering 200/209 (removed 9) transitions.
// Phase 1: matrix 200 rows 176 cols
[2021-05-12 16:41:50] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:50] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 200 rows 176 cols
[2021-05-12 16:41:50] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-12 16:41:50] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 176 cols
[2021-05-12 16:41:50] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-12 16:41:50] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 176/185 places, 200/209 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Product exploration explored 100000 steps with 33333 reset in 119 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Support contains 2 out of 176 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 176/176 places, 200/200 transitions.
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 176 transition count 200
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 87 place count 176 transition count 205
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 115 place count 176 transition count 205
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 174 place count 117 transition count 146
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 233 place count 117 transition count 146
Performed 37 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 270 place count 117 transition count 143
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 280 place count 117 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 280 place count 117 transition count 133
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 117 transition count 133
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 355 place count 43 transition count 58
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 74 rules applied. Total rules applied 429 place count 43 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 430 place count 43 transition count 57
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 433 place count 40 transition count 54
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 436 place count 40 transition count 54
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 442 place count 40 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 443 place count 40 transition count 51
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 456 place count 27 transition count 38
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 469 place count 27 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 470 place count 27 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 471 place count 27 transition count 37
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 473 place count 25 transition count 35
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 475 place count 25 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 476 place count 25 transition count 35
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 478 place count 23 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 480 place count 23 transition count 33
Performed 6 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 486 place count 23 transition count 63
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 497 place count 23 transition count 52
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 507 place count 13 transition count 23
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 6 with 10 rules applied. Total rules applied 517 place count 13 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 518 place count 13 transition count 29
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 522 place count 13 transition count 25
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 525 place count 10 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 528 place count 10 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 528 rules in 36 ms. Remains 10 /176 variables (removed 166) and now considering 16/200 (removed 184) transitions.
[2021-05-12 16:41:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2021-05-12 16:41:51] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:51] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/176 places, 16/200 transitions.
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Product exploration explored 100000 steps with 33333 reset in 222 ms.
Starting structural reductions, iteration 0 : 185/185 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 185 cols
[2021-05-12 16:41:51] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:51] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 209 rows 185 cols
[2021-05-12 16:41:51] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:41:51] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 209 rows 185 cols
[2021-05-12 16:41:51] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:41:51] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 209/209 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620837713252

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-162075406800341"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;