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.r140-tall-162089127600284.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 NoC3x3-PT-4B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127600284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 608K 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 NoC3x3-PT-4B-00
FORMULA_NAME NoC3x3-PT-4B-01
FORMULA_NAME NoC3x3-PT-4B-02
FORMULA_NAME NoC3x3-PT-4B-03
FORMULA_NAME NoC3x3-PT-4B-04
FORMULA_NAME NoC3x3-PT-4B-05
FORMULA_NAME NoC3x3-PT-4B-06
FORMULA_NAME NoC3x3-PT-4B-07
FORMULA_NAME NoC3x3-PT-4B-08
FORMULA_NAME NoC3x3-PT-4B-09
FORMULA_NAME NoC3x3-PT-4B-10
FORMULA_NAME NoC3x3-PT-4B-11
FORMULA_NAME NoC3x3-PT-4B-12
FORMULA_NAME NoC3x3-PT-4B-13
FORMULA_NAME NoC3x3-PT-4B-14
FORMULA_NAME NoC3x3-PT-4B-15

=== Now, execution of the tool begins

BK_START 1620958312176

Running Version 0
[2021-05-14 02:11:53] [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-14 02:11:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 02:11:53] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2021-05-14 02:11:53] [INFO ] Transformed 2328 places.
[2021-05-14 02:11:53] [INFO ] Transformed 2701 transitions.
[2021-05-14 02:11:53] [INFO ] Found NUPN structural information;
[2021-05-14 02:11:53] [INFO ] Parsed PT model containing 2328 places and 2701 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 02:11:53] [INFO ] Initial state test concluded for 2 properties.
FORMULA NoC3x3-PT-4B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Discarding 589 places :
Symmetric choice reduction at 0 with 589 rule applications. Total rules 589 place count 1739 transition count 2112
Iterating global reduction 0 with 589 rules applied. Total rules applied 1178 place count 1739 transition count 2112
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 1480 place count 1437 transition count 1810
Iterating global reduction 0 with 302 rules applied. Total rules applied 1782 place count 1437 transition count 1810
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Iterating post reduction 0 with 106 rules applied. Total rules applied 1888 place count 1437 transition count 1704
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 1918 place count 1407 transition count 1674
Iterating global reduction 1 with 30 rules applied. Total rules applied 1948 place count 1407 transition count 1674
Applied a total of 1948 rules in 704 ms. Remains 1407 /2328 variables (removed 921) and now considering 1674/2701 (removed 1027) transitions.
// Phase 1: matrix 1674 rows 1407 cols
[2021-05-14 02:11:54] [INFO ] Computed 66 place invariants in 28 ms
[2021-05-14 02:11:55] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 1674 rows 1407 cols
[2021-05-14 02:11:55] [INFO ] Computed 66 place invariants in 8 ms
[2021-05-14 02:11:56] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
// Phase 1: matrix 1674 rows 1407 cols
[2021-05-14 02:11:56] [INFO ] Computed 66 place invariants in 7 ms
[2021-05-14 02:11:56] [INFO ] Dead Transitions using invariants and state equation in 782 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1407/2328 places, 1674/2701 transitions.
[2021-05-14 02:11:57] [INFO ] Flatten gal took : 136 ms
[2021-05-14 02:11:57] [INFO ] Flatten gal took : 79 ms
[2021-05-14 02:11:57] [INFO ] Input system was already deterministic with 1674 transitions.
Incomplete random walk after 100000 steps, including 72 resets, run finished after 502 ms. (steps per millisecond=199 ) properties (out of 27) seen :23
Running SMT prover for 4 properties.
// Phase 1: matrix 1674 rows 1407 cols
[2021-05-14 02:11:58] [INFO ] Computed 66 place invariants in 7 ms
[2021-05-14 02:11:58] [INFO ] [Real]Absence check using 66 positive place invariants in 32 ms returned sat
[2021-05-14 02:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:11:58] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2021-05-14 02:11:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:11:59] [INFO ] [Nat]Absence check using 66 positive place invariants in 31 ms returned sat
[2021-05-14 02:11:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:11:59] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2021-05-14 02:11:59] [INFO ] Computed and/alt/rep : 1671/2637/1671 causal constraints (skipped 2 transitions) in 88 ms.
[2021-05-14 02:12:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 02:12:19] [INFO ] [Real]Absence check using 66 positive place invariants in 33 ms returned sat
[2021-05-14 02:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:12:19] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2021-05-14 02:12:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:12:19] [INFO ] [Nat]Absence check using 66 positive place invariants in 33 ms returned sat
[2021-05-14 02:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:12:20] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2021-05-14 02:12:20] [INFO ] Computed and/alt/rep : 1671/2637/1671 causal constraints (skipped 2 transitions) in 92 ms.
[2021-05-14 02:12:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 02:12:39] [INFO ] [Real]Absence check using 66 positive place invariants in 31 ms returned sat
[2021-05-14 02:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:12:40] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2021-05-14 02:12:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:12:40] [INFO ] [Nat]Absence check using 66 positive place invariants in 32 ms returned sat
[2021-05-14 02:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:12:41] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2021-05-14 02:12:41] [INFO ] Computed and/alt/rep : 1671/2637/1671 causal constraints (skipped 2 transitions) in 81 ms.
[2021-05-14 02:13:01] [INFO ] Deduced a trap composed of 6 places in 552 ms of which 12 ms to minimize.
[2021-05-14 02:13:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-14 02:13:01] [INFO ] [Real]Absence check using 66 positive place invariants in 30 ms returned sat
[2021-05-14 02:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:13:01] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2021-05-14 02:13:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:13:01] [INFO ] [Nat]Absence check using 66 positive place invariants in 31 ms returned sat
[2021-05-14 02:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:13:02] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2021-05-14 02:13:02] [INFO ] Computed and/alt/rep : 1671/2637/1671 causal constraints (skipped 2 transitions) in 61 ms.
[2021-05-14 02:13:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G((p0||G(p1))))||(F(!p1)&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1383 transition count 1650
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1383 transition count 1650
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1383 transition count 1649
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 1373 transition count 1639
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 1373 transition count 1639
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 1373 transition count 1633
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 1371 transition count 1631
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 1371 transition count 1631
Applied a total of 79 rules in 616 ms. Remains 1371 /1407 variables (removed 36) and now considering 1631/1674 (removed 43) transitions.
// Phase 1: matrix 1631 rows 1371 cols
[2021-05-14 02:13:22] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 02:13:22] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 1631 rows 1371 cols
[2021-05-14 02:13:22] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 02:13:23] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
// Phase 1: matrix 1631 rows 1371 cols
[2021-05-14 02:13:23] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 02:13:24] [INFO ] Dead Transitions using invariants and state equation in 721 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1371/1407 places, 1631/1674 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-4B-00 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s1292 0) (EQ s551 1)), p0:(AND (EQ s1038 0) (EQ s1327 1)), p1:(NEQ s1126 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][false, false, false, false]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NoC3x3-PT-4B-00 finished in 2881 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F((p0&&X((p1&&F(G(p1))))))) U p1))], workingDir=/home/mcc/execution]
Support contains 3 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1380 transition count 1647
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1380 transition count 1647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1380 transition count 1646
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 1368 transition count 1634
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 1368 transition count 1634
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 85 place count 1368 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 1365 transition count 1625
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 1365 transition count 1625
Applied a total of 91 rules in 138 ms. Remains 1365 /1407 variables (removed 42) and now considering 1625/1674 (removed 49) transitions.
// Phase 1: matrix 1625 rows 1365 cols
[2021-05-14 02:13:24] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 02:13:25] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 1625 rows 1365 cols
[2021-05-14 02:13:25] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 02:13:26] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
// Phase 1: matrix 1625 rows 1365 cols
[2021-05-14 02:13:26] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 02:13:26] [INFO ] Dead Transitions using invariants and state equation in 732 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1365/1407 places, 1625/1674 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s566 1), p0:(OR (EQ s56 0) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2165 steps with 0 reset in 22 ms.
FORMULA NoC3x3-PT-4B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-01 finished in 2252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Graph (trivial) has 1321 edges and 1407 vertex of which 852 / 1407 are part of one of the 33 SCC in 12 ms
Free SCC test removed 819 places
Ensure Unique test removed 959 transitions
Reduce isomorphic transitions removed 959 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 587 transition count 698
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 22 rules applied. Total rules applied 39 place count 571 transition count 692
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 44 place count 567 transition count 691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 566 transition count 691
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 45 place count 566 transition count 655
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 117 place count 530 transition count 655
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 143 place count 504 transition count 601
Iterating global reduction 4 with 26 rules applied. Total rules applied 169 place count 504 transition count 601
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 169 place count 504 transition count 599
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 502 transition count 599
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 176 place count 499 transition count 592
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 499 transition count 592
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 405 place count 386 transition count 479
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 409 place count 386 transition count 475
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 411 place count 385 transition count 478
Applied a total of 411 rules in 183 ms. Remains 385 /1407 variables (removed 1022) and now considering 478/1674 (removed 1196) transitions.
[2021-05-14 02:13:27] [INFO ] Flow matrix only has 445 transitions (discarded 33 similar events)
// Phase 1: matrix 445 rows 385 cols
[2021-05-14 02:13:27] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 02:13:27] [INFO ] Implicit Places using invariants in 198 ms returned [12, 46, 87, 123, 180, 242, 283, 322, 365]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 200 ms to find 9 implicit places.
[2021-05-14 02:13:27] [INFO ] Redundant transitions in 29 ms returned []
[2021-05-14 02:13:27] [INFO ] Flow matrix only has 445 transitions (discarded 33 similar events)
// Phase 1: matrix 445 rows 376 cols
[2021-05-14 02:13:27] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 02:13:27] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
Starting structural reductions, iteration 1 : 376/1407 places, 478/1674 transitions.
Graph (trivial) has 267 edges and 376 vertex of which 44 / 376 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 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 0 with 1 rules applied. Total rules applied 2 place count 354 transition count 433
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 353 transition count 432
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 2 with 2 rules applied. Total rules applied 6 place count 352 transition count 431
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 352 transition count 429
Applied a total of 8 rules in 35 ms. Remains 352 /376 variables (removed 24) and now considering 429/478 (removed 49) transitions.
[2021-05-14 02:13:27] [INFO ] Flow matrix only has 396 transitions (discarded 33 similar events)
// Phase 1: matrix 396 rows 352 cols
[2021-05-14 02:13:27] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 02:13:27] [INFO ] Implicit Places using invariants in 154 ms returned []
[2021-05-14 02:13:27] [INFO ] Flow matrix only has 396 transitions (discarded 33 similar events)
// Phase 1: matrix 396 rows 352 cols
[2021-05-14 02:13:27] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 02:13:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-14 02:13:28] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 352/1407 places, 429/1674 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s120 1), p1:(AND (NEQ s9 0) (NEQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-03 finished in 1349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0&&(X(p2)||p1)))&&(p3 U p2))))], workingDir=/home/mcc/execution]
Support contains 8 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1382 transition count 1649
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1382 transition count 1649
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 1382 transition count 1648
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 1371 transition count 1637
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 1371 transition count 1637
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 78 place count 1371 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 1368 transition count 1629
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 1368 transition count 1629
Applied a total of 84 rules in 148 ms. Remains 1368 /1407 variables (removed 39) and now considering 1629/1674 (removed 45) transitions.
// Phase 1: matrix 1629 rows 1368 cols
[2021-05-14 02:13:28] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 02:13:28] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 1629 rows 1368 cols
[2021-05-14 02:13:28] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 02:13:29] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
// Phase 1: matrix 1629 rows 1368 cols
[2021-05-14 02:13:29] [INFO ] Computed 66 place invariants in 11 ms
[2021-05-14 02:13:30] [INFO ] Dead Transitions using invariants and state equation in 724 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1368/1407 places, 1629/1674 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4B-04 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=4 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s472 0) (EQ s324 1) (EQ s262 0) (EQ s144 1)), p1:(OR (EQ s264 0) (EQ s519 1)), p2:(OR (EQ s472 0) (EQ s324 1)), p3:(OR (EQ s417 0) (EQ s611 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 70 reset in 371 ms.
Product exploration explored 100000 steps with 68 reset in 415 ms.
Knowledge obtained : [p0, p1, p2, p3]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 67 reset in 285 ms.
Product exploration explored 100000 steps with 70 reset in 319 ms.
[2021-05-14 02:13:32] [INFO ] Flatten gal took : 63 ms
[2021-05-14 02:13:32] [INFO ] Flatten gal took : 57 ms
[2021-05-14 02:13:32] [INFO ] Time to serialize gal into /tmp/LTL15526594188969565963.gal : 25 ms
[2021-05-14 02:13:32] [INFO ] Time to serialize properties into /tmp/LTL3453933859984798948.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15526594188969565963.gal, -t, CGAL, -LTL, /tmp/LTL3453933859984798948.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15526594188969565963.gal -t CGAL -LTL /tmp/LTL3453933859984798948.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(("((((p773==0)||(p511==1))||(p408==0))||(p204==1))")&&(("((p413==0)||(p856==1))")||(X("((p773==0)||(p511==1))")))))&&(("((p677==0)||(p1016==1))")U("((p773==0)||(p511==1))")))))
Formula 0 simplified : !X(G("((((p773==0)||(p511==1))||(p408==0))||(p204==1))" & ("((p413==0)||(p856==1))" | X"((p773==0)||(p511==1))")) & ("((p677==0)||(p1016==1))" U "((p773==0)||(p511==1))"))
Detected timeout of ITS tools.
[2021-05-14 02:13:47] [INFO ] Flatten gal took : 51 ms
[2021-05-14 02:13:47] [INFO ] Applying decomposition
[2021-05-14 02:13:47] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14458608935105421466.txt, -o, /tmp/graph14458608935105421466.bin, -w, /tmp/graph14458608935105421466.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14458608935105421466.bin, -l, -1, -v, -w, /tmp/graph14458608935105421466.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 02:13:47] [INFO ] Decomposing Gal with order
[2021-05-14 02:13:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 02:13:48] [INFO ] Removed a total of 463 redundant transitions.
[2021-05-14 02:13:48] [INFO ] Flatten gal took : 130 ms
[2021-05-14 02:13:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 32 ms.
[2021-05-14 02:13:48] [INFO ] Time to serialize gal into /tmp/LTL8779178749532280972.gal : 21 ms
[2021-05-14 02:13:48] [INFO ] Time to serialize properties into /tmp/LTL15746822692868235503.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8779178749532280972.gal, -t, CGAL, -LTL, /tmp/LTL15746822692868235503.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8779178749532280972.gal -t CGAL -LTL /tmp/LTL15746822692868235503.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(("((((i8.u180.p773==0)||(i4.u129.p511==1))||(i2.i1.i1.u102.p408==0))||(i0.i1.i2.u59.p204==1))")&&(("((i2.i1.i2.u101.p413==0)||(i8.u198.p856==1))")||(X("((i8.u180.p773==0)||(i4.u129.p511==1))")))))&&(("((i6.u160.p677==0)||(i11.u232.p1016==1))")U("((i8.u180.p773==0)||(i4.u129.p511==1))")))))
Formula 0 simplified : !X(G("((((i8.u180.p773==0)||(i4.u129.p511==1))||(i2.i1.i1.u102.p408==0))||(i0.i1.i2.u59.p204==1))" & ("((i2.i1.i2.u101.p413==0)||(i8.u198.p856==1))" | X"((i8.u180.p773==0)||(i4.u129.p511==1))")) & ("((i6.u160.p677==0)||(i11.u232.p1016==1))" U "((i8.u180.p773==0)||(i4.u129.p511==1))"))
Reverse transition relation is NOT exact ! Due to transitions t510, t666, t706, t833, t992, i0.t1271, i0.i1.t1236, i2.t1112, i2.i0.t1150, i2.i0.i3.u80.t1190, i4.u129.t1062, i7.u136.t1032, i8.t871, i8.u185.t909, i14.u248.t746, i16.u246.t748, i18.i0.i2.u313.t548, i18.i1.i2.u311.t550, i20.t352, i20.u372.t395, i23.t226, i23.u415.t270, i23.u417.t268, i27.i1.i2.u466.t117, i27.i1.i3.u468.t115, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1582/25/1607
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13252720552562202500
[2021-05-14 02:14:03] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13252720552562202500
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13252720552562202500]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13252720552562202500] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13252720552562202500] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-4B-04 finished in 36095 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&(X(G(p1)) U G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1384 transition count 1651
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1384 transition count 1651
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 1375 transition count 1642
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 1375 transition count 1642
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 68 place count 1375 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 1372 transition count 1635
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 1372 transition count 1635
Applied a total of 74 rules in 138 ms. Remains 1372 /1407 variables (removed 35) and now considering 1635/1674 (removed 39) transitions.
// Phase 1: matrix 1635 rows 1372 cols
[2021-05-14 02:14:04] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 02:14:04] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 1635 rows 1372 cols
[2021-05-14 02:14:04] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 02:14:05] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
// Phase 1: matrix 1635 rows 1372 cols
[2021-05-14 02:14:05] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 02:14:06] [INFO ] Dead Transitions using invariants and state equation in 685 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1372/1407 places, 1635/1674 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-4B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (NEQ s1008 0) (NEQ s1088 1)), p2:(OR (EQ s740 0) (EQ s375 1) (EQ s1008 0) (EQ s1088 1)), p1:(OR (EQ s1131 0) (EQ s715 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1527 steps with 0 reset in 13 ms.
FORMULA NoC3x3-PT-4B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-05 finished in 2217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Graph (trivial) has 1326 edges and 1407 vertex of which 888 / 1407 are part of one of the 33 SCC in 2 ms
Free SCC test removed 855 places
Ensure Unique test removed 1003 transitions
Reduce isomorphic transitions removed 1003 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 34 Pre rules applied. Total rules applied 1 place count 551 transition count 636
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 0 with 68 rules applied. Total rules applied 69 place count 517 transition count 636
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 95 place count 491 transition count 582
Iterating global reduction 0 with 26 rules applied. Total rules applied 121 place count 491 transition count 582
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 121 place count 491 transition count 579
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 127 place count 488 transition count 579
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 130 place count 485 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 133 place count 485 transition count 571
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 0 with 208 rules applied. Total rules applied 341 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 342 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 352 place count 347 transition count 466
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 400 place count 347 transition count 418
Applied a total of 400 rules in 83 ms. Remains 347 /1407 variables (removed 1060) and now considering 418/1674 (removed 1256) transitions.
[2021-05-14 02:14:06] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
// Phase 1: matrix 385 rows 347 cols
[2021-05-14 02:14:06] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 02:14:06] [INFO ] Implicit Places using invariants in 132 ms returned []
[2021-05-14 02:14:06] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
// Phase 1: matrix 385 rows 347 cols
[2021-05-14 02:14:06] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 02:14:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-14 02:14:07] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2021-05-14 02:14:07] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-14 02:14:07] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
// Phase 1: matrix 385 rows 347 cols
[2021-05-14 02:14:07] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 02:14:07] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 1 iterations. Remains : 347/1407 places, 418/1674 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-06 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 s276 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 13162 steps with 176 reset in 72 ms.
FORMULA NoC3x3-PT-4B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-06 finished in 831 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(X(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1381 transition count 1648
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1381 transition count 1648
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1381 transition count 1647
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 1370 transition count 1636
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 1370 transition count 1636
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 1370 transition count 1630
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 1367 transition count 1627
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 1367 transition count 1627
Applied a total of 87 rules in 155 ms. Remains 1367 /1407 variables (removed 40) and now considering 1627/1674 (removed 47) transitions.
// Phase 1: matrix 1627 rows 1367 cols
[2021-05-14 02:14:07] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 02:14:07] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 1627 rows 1367 cols
[2021-05-14 02:14:07] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 02:14:08] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
// Phase 1: matrix 1627 rows 1367 cols
[2021-05-14 02:14:08] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 02:14:09] [INFO ] Dead Transitions using invariants and state equation in 715 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1367/1407 places, 1627/1674 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : NoC3x3-PT-4B-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1030 0) (EQ s103 1) (EQ s506 0) (EQ s19 1)), p1:(OR (EQ s506 0) (EQ s19 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13537 steps with 9 reset in 49 ms.
FORMULA NoC3x3-PT-4B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-08 finished in 2204 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 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Graph (trivial) has 1322 edges and 1407 vertex of which 879 / 1407 are part of one of the 33 SCC in 1 ms
Free SCC test removed 846 places
Ensure Unique test removed 991 transitions
Reduce isomorphic transitions removed 991 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 560 transition count 678
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 556 transition count 678
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 9 place count 556 transition count 644
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 77 place count 522 transition count 644
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 105 place count 494 transition count 588
Iterating global reduction 2 with 28 rules applied. Total rules applied 133 place count 494 transition count 588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 494 transition count 587
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 134 place count 494 transition count 584
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 140 place count 491 transition count 584
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 144 place count 487 transition count 574
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 487 transition count 574
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 358 place count 382 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 381 transition count 468
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 372 vertex of which 46 / 372 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
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 11 rules applied. Total rules applied 370 place count 349 transition count 467
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 418 place count 348 transition count 420
Applied a total of 418 rules in 71 ms. Remains 348 /1407 variables (removed 1059) and now considering 420/1674 (removed 1254) transitions.
[2021-05-14 02:14:09] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
// Phase 1: matrix 388 rows 348 cols
[2021-05-14 02:14:09] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 02:14:09] [INFO ] Implicit Places using invariants in 136 ms returned []
[2021-05-14 02:14:09] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
// Phase 1: matrix 388 rows 348 cols
[2021-05-14 02:14:09] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 02:14:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-14 02:14:10] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2021-05-14 02:14:10] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 02:14:10] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
// Phase 1: matrix 388 rows 348 cols
[2021-05-14 02:14:10] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 02:14:10] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Finished structural reductions, in 1 iterations. Remains : 348/1407 places, 420/1674 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-10 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 s176 0) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1067 steps with 14 reset in 6 ms.
FORMULA NoC3x3-PT-4B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-10 finished in 786 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1382 transition count 1649
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1382 transition count 1649
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 1382 transition count 1648
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 1371 transition count 1637
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 1371 transition count 1637
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 1371 transition count 1631
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 1368 transition count 1628
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 1368 transition count 1628
Applied a total of 85 rules in 147 ms. Remains 1368 /1407 variables (removed 39) and now considering 1628/1674 (removed 46) transitions.
// Phase 1: matrix 1628 rows 1368 cols
[2021-05-14 02:14:10] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 02:14:10] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 1628 rows 1368 cols
[2021-05-14 02:14:10] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 02:14:11] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
// Phase 1: matrix 1628 rows 1368 cols
[2021-05-14 02:14:11] [INFO ] Computed 66 place invariants in 19 ms
[2021-05-14 02:14:12] [INFO ] Dead Transitions using invariants and state equation in 759 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1368/1407 places, 1628/1674 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s422 0) (EQ s1049 1)), p1:(AND (NEQ s1099 0) (NEQ s458 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1584 steps with 0 reset in 5 ms.
FORMULA NoC3x3-PT-4B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-11 finished in 2251 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((X(p1)&&p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1381 transition count 1648
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1381 transition count 1648
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1381 transition count 1647
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 1370 transition count 1636
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 1370 transition count 1636
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 80 place count 1370 transition count 1631
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 1367 transition count 1628
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 1367 transition count 1628
Applied a total of 86 rules in 148 ms. Remains 1367 /1407 variables (removed 40) and now considering 1628/1674 (removed 46) transitions.
// Phase 1: matrix 1628 rows 1367 cols
[2021-05-14 02:14:12] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 02:14:13] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 1628 rows 1367 cols
[2021-05-14 02:14:13] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 02:14:14] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
// Phase 1: matrix 1628 rows 1367 cols
[2021-05-14 02:14:14] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 02:14:14] [INFO ] Dead Transitions using invariants and state equation in 731 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1367/1407 places, 1628/1674 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4B-12 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s929 0) (EQ s1314 1)), p1:(AND (NEQ s1314 0) (NEQ s929 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1366 steps with 0 reset in 5 ms.
FORMULA NoC3x3-PT-4B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-12 finished in 2184 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1381 transition count 1648
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1381 transition count 1648
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1381 transition count 1647
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 1370 transition count 1636
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 1370 transition count 1636
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 1370 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 1368 transition count 1628
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 1368 transition count 1628
Applied a total of 85 rules in 147 ms. Remains 1368 /1407 variables (removed 39) and now considering 1628/1674 (removed 46) transitions.
// Phase 1: matrix 1628 rows 1368 cols
[2021-05-14 02:14:15] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 02:14:15] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 1628 rows 1368 cols
[2021-05-14 02:14:15] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 02:14:16] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
// Phase 1: matrix 1628 rows 1368 cols
[2021-05-14 02:14:16] [INFO ] Computed 66 place invariants in 20 ms
[2021-05-14 02:14:16] [INFO ] Dead Transitions using invariants and state equation in 746 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1368/1407 places, 1628/1674 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4B-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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (NEQ s980 0) (NEQ s1100 1)), p1:(AND (NEQ s232 0) (NEQ s254 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 71 reset in 322 ms.
Product exploration explored 100000 steps with 69 reset in 369 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 69 reset in 277 ms.
Product exploration explored 100000 steps with 70 reset in 309 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1368 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1368/1368 places, 1628/1628 transitions.
Graph (trivial) has 1275 edges and 1368 vertex of which 847 / 1368 are part of one of the 33 SCC in 1 ms
Free SCC test removed 814 places
Ensure Unique test removed 951 transitions
Reduce isomorphic transitions removed 951 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 554 transition count 677
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 38 Pre rules applied. Total rules applied 6 place count 554 transition count 726
Deduced a syphon composed of 43 places in 2 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 44 place count 554 transition count 726
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 70 place count 528 transition count 667
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 96 place count 528 transition count 667
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 121 place count 503 transition count 609
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 146 place count 503 transition count 609
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 244 place count 503 transition count 609
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 117 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 246 place count 503 transition count 622
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 247 place count 503 transition count 621
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 250 place count 500 transition count 612
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 253 place count 500 transition count 612
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 115 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 254 place count 500 transition count 633
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 260 place count 500 transition count 627
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 262 place count 498 transition count 619
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 264 place count 498 transition count 619
Deduced a syphon composed of 113 places in 1 ms
Applied a total of 264 rules in 166 ms. Remains 498 /1368 variables (removed 870) and now considering 619/1628 (removed 1009) transitions.
[2021-05-14 02:14:19] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 02:14:19] [INFO ] Flow matrix only has 586 transitions (discarded 33 similar events)
// Phase 1: matrix 586 rows 498 cols
[2021-05-14 02:14:19] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 02:14:19] [INFO ] Dead Transitions using invariants and state equation in 293 ms returned []
Finished structural reductions, in 1 iterations. Remains : 498/1368 places, 619/1628 transitions.
Entered a terminal (fully accepting) state of product in 28800 steps with 312 reset in 311 ms.
FORMULA NoC3x3-PT-4B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-13 finished in 4750 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p0&&(p1 U (p2||G(p1))))||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1407 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1407/1407 places, 1674/1674 transitions.
Graph (trivial) has 1323 edges and 1407 vertex of which 884 / 1407 are part of one of the 33 SCC in 1 ms
Free SCC test removed 851 places
Ensure Unique test removed 997 transitions
Reduce isomorphic transitions removed 997 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 34 Pre rules applied. Total rules applied 1 place count 555 transition count 642
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 0 with 68 rules applied. Total rules applied 69 place count 521 transition count 642
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 96 place count 494 transition count 587
Iterating global reduction 0 with 27 rules applied. Total rules applied 123 place count 494 transition count 587
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 123 place count 494 transition count 584
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 129 place count 491 transition count 584
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 133 place count 487 transition count 574
Iterating global reduction 0 with 4 rules applied. Total rules applied 137 place count 487 transition count 574
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 0 with 208 rules applied. Total rules applied 345 place count 383 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 346 place count 382 transition count 469
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 267 edges and 373 vertex of which 48 / 373 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 356 place count 349 transition count 469
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 404 place count 349 transition count 421
Applied a total of 404 rules in 65 ms. Remains 349 /1407 variables (removed 1058) and now considering 421/1674 (removed 1253) transitions.
[2021-05-14 02:14:19] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
// Phase 1: matrix 389 rows 349 cols
[2021-05-14 02:14:19] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 02:14:19] [INFO ] Implicit Places using invariants in 163 ms returned []
[2021-05-14 02:14:19] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
// Phase 1: matrix 389 rows 349 cols
[2021-05-14 02:14:19] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 02:14:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-14 02:14:20] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2021-05-14 02:14:20] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 02:14:20] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
// Phase 1: matrix 389 rows 349 cols
[2021-05-14 02:14:20] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 02:14:20] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 349/1407 places, 421/1674 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-4B-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={1} source=1 dest: 2}, { cond=(AND p3 p0 (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s258 0), p2:(AND (NEQ s63 1) (NEQ s258 1)), p1:(NEQ s258 1), p3:(OR (NEQ s258 1) (AND (NEQ s63 1) (NEQ s258 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 202 steps with 2 reset in 1 ms.
FORMULA NoC3x3-PT-4B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-14 finished in 855 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1260118618230761603
[2021-05-14 02:14:20] [INFO ] Too many transitions (1674) to apply POR reductions. Disabling POR matrices.
[2021-05-14 02:14:20] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1260118618230761603
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1260118618230761603]
[2021-05-14 02:14:20] [INFO ] Applying decomposition
[2021-05-14 02:14:20] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5751412443076869742.txt, -o, /tmp/graph5751412443076869742.bin, -w, /tmp/graph5751412443076869742.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5751412443076869742.bin, -l, -1, -v, -w, /tmp/graph5751412443076869742.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 02:14:20] [INFO ] Decomposing Gal with order
[2021-05-14 02:14:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 02:14:20] [INFO ] Removed a total of 455 redundant transitions.
[2021-05-14 02:14:20] [INFO ] Flatten gal took : 101 ms
[2021-05-14 02:14:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 19 ms.
[2021-05-14 02:14:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality17651894236064584951.gal : 9 ms
[2021-05-14 02:14:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality14054701209061450681.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality17651894236064584951.gal, -t, CGAL, -LTL, /tmp/LTLCardinality14054701209061450681.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality17651894236064584951.gal -t CGAL -LTL /tmp/LTLCardinality14054701209061450681.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(("((((i10.u188.p773==0)||(i5.u133.p511==1))||(i3.u108.p408==0))||(i0.i1.i1.u58.p204==1))")&&(("((i3.u107.p413==0)||(i10.u204.p856==1))")||(X("((i10.u188.p773==0)||(i5.u133.p511==1))")))))&&(("((i7.u167.p677==0)||(i12.u239.p1016==1))")U("((i10.u188.p773==0)||(i5.u133.p511==1))")))))
Formula 0 simplified : !X(G("((((i10.u188.p773==0)||(i5.u133.p511==1))||(i3.u108.p408==0))||(i0.i1.i1.u58.p204==1))" & ("((i3.u107.p413==0)||(i10.u204.p856==1))" | X"((i10.u188.p773==0)||(i5.u133.p511==1))")) & ("((i7.u167.p677==0)||(i12.u239.p1016==1))" U "((i10.u188.p773==0)||(i5.u133.p511==1))"))
Compilation finished in 14135 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1260118618230761603]
Link finished in 47 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](((LTLAPp0==true)&&(X((LTLAPp2==true))||(LTLAPp1==true))))&&((LTLAPp3==true) U (LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin1260118618230761603]
Reverse transition relation is NOT exact ! Due to transitions t446, t640, t881, t1122, t1387, t1831, t1887, t1951, i0.t2034, i0.i0.t2090, i0.i0.i1.t2146, i0.i0.i4.u44.t2110, i5.u83.t1950, i5.u133.t1758, i6.t1646, i6.i0.i1.u142.t1708, i7.u158.t1594, i10.t1443, i11.u225.t1370, i12.u192.t1506, i13.t1178, i13.u252.t1248, i13.u254.t1243, i18.u320.t944, i19.u318.t949, i20.u356.t810, i25.u376.t702, i27.u427.t514, i27.u429.t510, i29.t267, i29.u485.t277, i29.u487.t273, i29.u490.t231, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1622/33/1655
Computing Next relation with stutter on 7.03927e+39 deadlock states
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](((LTLAPp0==true)&&(X((LTLAPp2==true))||(LTLAPp1==true))))&&((LTLAPp3==true) U (LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin1260118618230761603]
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](((LTLAPp0==true)&&(X((LTLAPp2==true))||(LTLAPp1==true))))&&((LTLAPp3==true) U (LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin1260118618230761603]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.061: LTL layer: formula: X(([](((LTLAPp0==true)&&(X((LTLAPp2==true))||(LTLAPp1==true))))&&((LTLAPp3==true) U (LTLAPp2==true))))
pins2lts-mc-linux64( 2/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.061: "X(([](((LTLAPp0==true)&&(X((LTLAPp2==true))||(LTLAPp1==true))))&&((LTLAPp3==true) U (LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.062: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.091: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.125: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.423: DFS-FIFO for weak LTL, using special progress label 1679
pins2lts-mc-linux64( 0/ 8), 0.423: There are 1680 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.423: State length is 1408, there are 1689 groups
pins2lts-mc-linux64( 0/ 8), 0.423: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.423: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.423: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.423: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.655: ~2 levels ~960 states ~3576 transitions
pins2lts-mc-linux64( 6/ 8), 0.719: ~2 levels ~1920 states ~8472 transitions
pins2lts-mc-linux64( 4/ 8), 0.838: ~1 levels ~3840 states ~16520 transitions
pins2lts-mc-linux64( 4/ 8), 1.067: ~1 levels ~7680 states ~34008 transitions
pins2lts-mc-linux64( 4/ 8), 1.558: ~1 levels ~15360 states ~75248 transitions
pins2lts-mc-linux64( 4/ 8), 2.627: ~1 levels ~30720 states ~173904 transitions
pins2lts-mc-linux64( 4/ 8), 4.978: ~1 levels ~61440 states ~381840 transitions
pins2lts-mc-linux64( 4/ 8), 9.406: ~1 levels ~122880 states ~835832 transitions
pins2lts-mc-linux64( 4/ 8), 18.399: ~1 levels ~245760 states ~1768056 transitions
pins2lts-mc-linux64( 0/ 8), 38.895: ~2 levels ~491520 states ~3692384 transitions
pins2lts-mc-linux64( 0/ 8), 75.639: ~2 levels ~983040 states ~7661320 transitions
pins2lts-mc-linux64( 0/ 8), 150.557: ~2 levels ~1966080 states ~15867184 transitions
pins2lts-mc-linux64( 0/ 8), 312.133: ~2 levels ~3932160 states ~32766000 transitions
pins2lts-mc-linux64( 0/ 8), 639.821: ~2 levels ~7864320 states ~67281208 transitions
pins2lts-mc-linux64( 4/ 8), 737.655: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 737.740:
pins2lts-mc-linux64( 0/ 8), 737.740: mean standard work distribution: 2.1% (states) 2.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 737.740:
pins2lts-mc-linux64( 0/ 8), 737.740: Explored 8661847 states 79013062 transitions, fanout: 9.122
pins2lts-mc-linux64( 0/ 8), 737.740: Total exploration time 737.280 sec (737.200 sec minimum, 737.232 sec on average)
pins2lts-mc-linux64( 0/ 8), 737.740: States per second: 11748, Transitions per second: 107168
pins2lts-mc-linux64( 0/ 8), 737.740:
pins2lts-mc-linux64( 0/ 8), 737.740: Progress states detected: 14542375
pins2lts-mc-linux64( 0/ 8), 737.740: Redundant explorations: -40.4374
pins2lts-mc-linux64( 0/ 8), 737.740:
pins2lts-mc-linux64( 0/ 8), 737.740: Queue width: 8B, total height: 10109916, memory: 77.13MB
pins2lts-mc-linux64( 0/ 8), 737.740: Tree memory: 366.9MB, 26.5 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 737.740: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 737.740: Stored 1706 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 737.740: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 737.740: Est. total memory use: 444.1MB (~1101.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](((LTLAPp0==true)&&(X((LTLAPp2==true))||(LTLAPp1==true))))&&((LTLAPp3==true) U (LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin1260118618230761603]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](((LTLAPp0==true)&&(X((LTLAPp2==true))||(LTLAPp1==true))))&&((LTLAPp3==true) U (LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin1260118618230761603]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-14 02:35:09] [INFO ] Applying decomposition
[2021-05-14 02:35:09] [INFO ] Flatten gal took : 41 ms
[2021-05-14 02:35:09] [INFO ] Decomposing Gal with order
[2021-05-14 02:35:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 02:35:09] [INFO ] Removed a total of 99 redundant transitions.
[2021-05-14 02:35:09] [INFO ] Flatten gal took : 63 ms
[2021-05-14 02:35:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 999 labels/synchronizations in 102 ms.
[2021-05-14 02:35:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality5250466912811455819.gal : 9 ms
[2021-05-14 02:35:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality4797665858169786201.ltl : 6062 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality5250466912811455819.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4797665858169786201.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality5250466912811455819.gal -t CGAL -LTL /tmp/LTLCardinality4797665858169786201.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(("((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u86.p773==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u78.p511==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u76.p408==0))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u69.p204==1))")&&(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u76.p413==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u89.p856==1))")||(X("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u86.p773==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u78.p511==1))")))))&&(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u83.p677==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u92.p1016==1))")U("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u86.p773==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u78.p511==1))")))))
Formula 0 simplified : !X(G("((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u86.p773==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u78.p511==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u76.p408==0))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u69.p204==1))" & ("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u76.p413==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u89.p856==1))" | X"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u86.p773==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u78.p511==1))")) & ("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u83.p677==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u92.p1016==1))" U "((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u86.p773==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u78.p511==1))"))
Detected timeout of ITS tools.
[2021-05-14 02:56:05] [INFO ] Flatten gal took : 420 ms
[2021-05-14 02:56:13] [INFO ] Input system was already deterministic with 1674 transitions.
[2021-05-14 02:56:13] [INFO ] Transformed 1407 places.
[2021-05-14 02:56:13] [INFO ] Transformed 1674 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 02:56:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality17487769568596339115.gal : 23 ms
[2021-05-14 02:56:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality3724721437803461108.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality17487769568596339115.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3724721437803461108.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality17487769568596339115.gal -t CGAL -LTL /tmp/LTLCardinality3724721437803461108.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G(("((((p773==0)||(p511==1))||(p408==0))||(p204==1))")&&(("((p413==0)||(p856==1))")||(X("((p773==0)||(p511==1))")))))&&(("((p677==0)||(p1016==1))")U("((p773==0)||(p511==1))")))))
Formula 0 simplified : !X(G("((((p773==0)||(p511==1))||(p408==0))||(p204==1))" & ("((p413==0)||(p856==1))" | X"((p773==0)||(p511==1))")) & ("((p677==0)||(p1016==1))" U "((p773==0)||(p511==1))"))

BK_TIME_CONFINEMENT_REACHED

--------------------
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="NoC3x3-PT-4B"
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 NoC3x3-PT-4B, 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 r140-tall-162089127600284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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