About the Execution of ITS-Tools for NoC3x3-PT-7B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
14466.747 | 1392454.00 | 1628174.00 | 135834.20 | TTTFFFFTFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127700332.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-7B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127700332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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.0K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 07:52 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 2.0M 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-7B-00
FORMULA_NAME NoC3x3-PT-7B-01
FORMULA_NAME NoC3x3-PT-7B-02
FORMULA_NAME NoC3x3-PT-7B-03
FORMULA_NAME NoC3x3-PT-7B-04
FORMULA_NAME NoC3x3-PT-7B-05
FORMULA_NAME NoC3x3-PT-7B-06
FORMULA_NAME NoC3x3-PT-7B-07
FORMULA_NAME NoC3x3-PT-7B-08
FORMULA_NAME NoC3x3-PT-7B-09
FORMULA_NAME NoC3x3-PT-7B-10
FORMULA_NAME NoC3x3-PT-7B-11
FORMULA_NAME NoC3x3-PT-7B-12
FORMULA_NAME NoC3x3-PT-7B-13
FORMULA_NAME NoC3x3-PT-7B-14
FORMULA_NAME NoC3x3-PT-7B-15
=== Now, execution of the tool begins
BK_START 1620972706253
Running Version 0
[2021-05-14 06:12:00] [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 06:12:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 06:12:00] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2021-05-14 06:12:00] [INFO ] Transformed 7014 places.
[2021-05-14 06:12:00] [INFO ] Transformed 8833 transitions.
[2021-05-14 06:12:00] [INFO ] Found NUPN structural information;
[2021-05-14 06:12:00] [INFO ] Parsed PT model containing 7014 places and 8833 transitions in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 06:12:00] [INFO ] Initial state test concluded for 3 properties.
FORMULA NoC3x3-PT-7B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 7014 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Discarding 1854 places :
Symmetric choice reduction at 0 with 1854 rule applications. Total rules 1854 place count 5160 transition count 6979
Iterating global reduction 0 with 1854 rules applied. Total rules applied 3708 place count 5160 transition count 6979
Discarding 489 places :
Symmetric choice reduction at 0 with 489 rule applications. Total rules 4197 place count 4671 transition count 6490
Iterating global reduction 0 with 489 rules applied. Total rules applied 4686 place count 4671 transition count 6490
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 4769 place count 4588 transition count 6324
Iterating global reduction 0 with 83 rules applied. Total rules applied 4852 place count 4588 transition count 6324
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 4935 place count 4505 transition count 6241
Iterating global reduction 0 with 83 rules applied. Total rules applied 5018 place count 4505 transition count 6241
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 5098 place count 4425 transition count 6161
Iterating global reduction 0 with 80 rules applied. Total rules applied 5178 place count 4425 transition count 6161
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 5256 place count 4347 transition count 6039
Iterating global reduction 0 with 78 rules applied. Total rules applied 5334 place count 4347 transition count 6039
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 5410 place count 4271 transition count 5887
Iterating global reduction 0 with 76 rules applied. Total rules applied 5486 place count 4271 transition count 5887
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 5504 place count 4271 transition count 5869
Applied a total of 5504 rules in 5836 ms. Remains 4271 /7014 variables (removed 2743) and now considering 5869/8833 (removed 2964) transitions.
// Phase 1: matrix 5869 rows 4271 cols
[2021-05-14 06:12:16] [INFO ] Computed 66 place invariants in 42 ms
[2021-05-14 06:12:17] [INFO ] Implicit Places using invariants in 1616 ms returned []
// Phase 1: matrix 5869 rows 4271 cols
[2021-05-14 06:12:17] [INFO ] Computed 66 place invariants in 53 ms
[2021-05-14 06:12:18] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 12174 ms to find 0 implicit places.
// Phase 1: matrix 5869 rows 4271 cols
[2021-05-14 06:12:18] [INFO ] Computed 66 place invariants in 23 ms
[2021-05-14 06:12:31] [INFO ] Dead Transitions using invariants and state equation in 12598 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4271/7014 places, 5869/8833 transitions.
[2021-05-14 06:12:32] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 06:12:32] [INFO ] Flatten gal took : 316 ms
FORMULA NoC3x3-PT-7B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 06:12:32] [INFO ] Flatten gal took : 177 ms
[2021-05-14 06:12:32] [INFO ] Input system was already deterministic with 5869 transitions.
Incomplete random walk after 100000 steps, including 37 resets, run finished after 834 ms. (steps per millisecond=119 ) properties (out of 23) seen :15
Running SMT prover for 8 properties.
// Phase 1: matrix 5869 rows 4271 cols
[2021-05-14 06:12:33] [INFO ] Computed 66 place invariants in 16 ms
[2021-05-14 06:12:34] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:8
[2021-05-14 06:12:35] [INFO ] [Nat]Absence check using 66 positive place invariants in 49 ms returned sat
[2021-05-14 06:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 06:12:39] [INFO ] [Nat]Absence check using state equation in 3394 ms returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 931 ms.
[2021-05-14 06:12:40] [INFO ] SMT Verify possible in nat domain returned unsat :2 sat :6
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2021-05-14 06:12:40] [INFO ] Initial state test concluded for 1 properties.
FORMULA NoC3x3-PT-7B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 4271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4271/4271 places, 5869/5869 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 4250 transition count 5846
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 4250 transition count 5846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 4250 transition count 5845
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 4242 transition count 5834
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 4242 transition count 5834
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 4236 transition count 5823
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 4236 transition count 5823
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 4230 transition count 5814
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 4230 transition count 5814
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 4227 transition count 5811
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 4227 transition count 5811
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 4224 transition count 5806
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 4224 transition count 5806
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 4224 transition count 5805
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 4223 transition count 5803
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 4223 transition count 5803
Applied a total of 98 rules in 2287 ms. Remains 4223 /4271 variables (removed 48) and now considering 5803/5869 (removed 66) transitions.
// Phase 1: matrix 5803 rows 4223 cols
[2021-05-14 06:12:44] [INFO ] Computed 66 place invariants in 31 ms
[2021-05-14 06:12:45] [INFO ] Implicit Places using invariants in 1180 ms returned []
// Phase 1: matrix 5803 rows 4223 cols
[2021-05-14 06:12:45] [INFO ] Computed 66 place invariants in 22 ms
[2021-05-14 06:12:46] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
// Phase 1: matrix 5803 rows 4223 cols
[2021-05-14 06:12:46] [INFO ] Computed 66 place invariants in 19 ms
[2021-05-14 06:12:49] [INFO ] Dead Transitions using invariants and state equation in 3189 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4223/4271 places, 5803/5869 transitions.
Stuttering acceptance computed with spot in 6544 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s2575 0) (EQ s1732 1)), p1:(NEQ s738 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2284 ms.
Product exploration explored 100000 steps with 50000 reset in 2133 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 2360 ms.
Product exploration explored 100000 steps with 50000 reset in 2433 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 3 out of 4223 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4223/4223 places, 5803/5803 transitions.
Graph (trivial) has 5105 edges and 4223 vertex of which 3212 / 4223 are part of one of the 33 SCC in 25 ms
Free SCC test removed 3179 places
Ensure Unique test removed 4282 transitions
Reduce isomorphic transitions removed 4282 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1044 transition count 1521
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 1044 transition count 1519
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 8 place count 1044 transition count 1716
Deduced a syphon composed of 48 places in 3 ms
Iterating global reduction 2 with 43 rules applied. Total rules applied 51 place count 1044 transition count 1716
Discarding 275 places :
Symmetric choice reduction at 2 with 275 rule applications. Total rules 326 place count 769 transition count 1305
Deduced a syphon composed of 44 places in 2 ms
Iterating global reduction 2 with 275 rules applied. Total rules applied 601 place count 769 transition count 1305
Discarding 224 places :
Symmetric choice reduction at 2 with 224 rule applications. Total rules 825 place count 545 transition count 861
Deduced a syphon composed of 18 places in 2 ms
Iterating global reduction 2 with 224 rules applied. Total rules applied 1049 place count 545 transition count 861
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 2 with 198 rules applied. Total rules applied 1247 place count 545 transition count 663
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 3 with 134 rules applied. Total rules applied 1381 place count 545 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1382 place count 545 transition count 664
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1383 place count 544 transition count 663
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1384 place count 544 transition count 663
Performed 6 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1390 place count 544 transition count 694
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1406 place count 544 transition count 678
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1417 place count 533 transition count 650
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 5 with 11 rules applied. Total rules applied 1428 place count 533 transition count 650
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1430 place count 533 transition count 674
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1441 place count 533 transition count 663
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1444 place count 530 transition count 650
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1447 place count 530 transition count 650
Deduced a syphon composed of 145 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 1456 place count 530 transition count 641
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1459 place count 527 transition count 637
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1462 place count 527 transition count 637
Deduced a syphon composed of 143 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1465 place count 527 transition count 634
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1467 place count 525 transition count 632
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 1469 place count 525 transition count 632
Deduced a syphon composed of 142 places in 1 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1470 place count 525 transition count 631
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1471 place count 524 transition count 630
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 1472 place count 524 transition count 630
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 1472 rules in 635 ms. Remains 524 /4223 variables (removed 3699) and now considering 630/5803 (removed 5173) transitions.
[2021-05-14 06:13:10] [INFO ] Redundant transitions in 39 ms returned []
[2021-05-14 06:13:10] [INFO ] Flow matrix only has 598 transitions (discarded 32 similar events)
// Phase 1: matrix 598 rows 524 cols
[2021-05-14 06:13:10] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 06:13:11] [INFO ] Dead Transitions using invariants and state equation in 322 ms returned []
Finished structural reductions, in 1 iterations. Remains : 524/4223 places, 630/5803 transitions.
Product exploration explored 100000 steps with 50000 reset in 3985 ms.
Product exploration explored 100000 steps with 50000 reset in 3814 ms.
[2021-05-14 06:13:24] [INFO ] Flatten gal took : 150 ms
[2021-05-14 06:13:24] [INFO ] Flatten gal took : 153 ms
[2021-05-14 06:13:24] [INFO ] Time to serialize gal into /tmp/LTL9106162269966265825.gal : 78 ms
[2021-05-14 06:13:24] [INFO ] Time to serialize properties into /tmp/LTL6396413154658853661.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/LTL9106162269966265825.gal, -t, CGAL, -LTL, /tmp/LTL6396413154658853661.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/LTL9106162269966265825.gal -t CGAL -LTL /tmp/LTL6396413154658853661.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p4257==0)||(p2866==1))"))U(X("(p1198!=1)"))))
Formula 0 simplified : !(G"((p4257==0)||(p2866==1))" U X"(p1198!=1)")
Detected timeout of ITS tools.
[2021-05-14 06:13:39] [INFO ] Flatten gal took : 202 ms
[2021-05-14 06:13:39] [INFO ] Applying decomposition
[2021-05-14 06:13:39] [INFO ] Flatten gal took : 191 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/graph13909079786357454599.txt, -o, /tmp/graph13909079786357454599.bin, -w, /tmp/graph13909079786357454599.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/graph13909079786357454599.bin, -l, -1, -v, -w, /tmp/graph13909079786357454599.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:13:40] [INFO ] Decomposing Gal with order
[2021-05-14 06:13:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:13:41] [INFO ] Removed a total of 1834 redundant transitions.
[2021-05-14 06:13:41] [INFO ] Flatten gal took : 390 ms
[2021-05-14 06:13:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 62 ms.
[2021-05-14 06:13:41] [INFO ] Time to serialize gal into /tmp/LTL7241664215339331061.gal : 40 ms
[2021-05-14 06:13:41] [INFO ] Time to serialize properties into /tmp/LTL11086072471124010086.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/LTL7241664215339331061.gal, -t, CGAL, -LTL, /tmp/LTL11086072471124010086.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/LTL7241664215339331061.gal -t CGAL -LTL /tmp/LTL11086072471124010086.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i20.u1022.p4257==0)||(i14.u701.p2866==1))"))U(X("(i6.u294.p1198!=1)"))))
Formula 0 simplified : !(G"((i20.u1022.p4257==0)||(i14.u701.p2866==1))" U X"(i6.u294.p1198!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12900297593561189941
[2021-05-14 06:13:57] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12900297593561189941
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/ltsmin12900297593561189941]
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/ltsmin12900297593561189941] 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/ltsmin12900297593561189941] 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-7B-02 finished in 77473 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X((p1&&X((p2&&F(!p1))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 4271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4271/4271 places, 5869/5869 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 4252 transition count 5849
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 4252 transition count 5849
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 4252 transition count 5848
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 4244 transition count 5837
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 4244 transition count 5837
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 61 place count 4238 transition count 5826
Iterating global reduction 1 with 6 rules applied. Total rules applied 67 place count 4238 transition count 5826
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 73 place count 4232 transition count 5817
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 4232 transition count 5817
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 4229 transition count 5814
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 4229 transition count 5814
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 4226 transition count 5809
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 4226 transition count 5809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 4226 transition count 5808
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 4225 transition count 5806
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 4225 transition count 5806
Applied a total of 94 rules in 2532 ms. Remains 4225 /4271 variables (removed 46) and now considering 5806/5869 (removed 63) transitions.
// Phase 1: matrix 5806 rows 4225 cols
[2021-05-14 06:14:00] [INFO ] Computed 66 place invariants in 15 ms
[2021-05-14 06:14:01] [INFO ] Implicit Places using invariants in 1008 ms returned []
// Phase 1: matrix 5806 rows 4225 cols
[2021-05-14 06:14:01] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:14:03] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 2728 ms to find 0 implicit places.
// Phase 1: matrix 5806 rows 4225 cols
[2021-05-14 06:14:03] [INFO ] Computed 66 place invariants in 21 ms
[2021-05-14 06:14:07] [INFO ] Dead Transitions using invariants and state equation in 4151 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4225/4271 places, 5806/5869 transitions.
Stuttering acceptance computed with spot in 3886 ms :[(NOT p0), true, true, (OR (NOT p2) p1), p1]
Running random walk in product with property : NoC3x3-PT-7B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1050 0), p1:(OR (EQ s846 0) (EQ s783 1)), p2:(OR (EQ s250 0) (EQ s340 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35982 steps with 13 reset in 234 ms.
FORMULA NoC3x3-PT-7B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-03 finished in 13598 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 4271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4271/4271 places, 5869/5869 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 4249 transition count 5845
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 4249 transition count 5845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4249 transition count 5844
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 4241 transition count 5833
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 4241 transition count 5833
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 4236 transition count 5823
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 4236 transition count 5823
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 4231 transition count 5815
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 4231 transition count 5815
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 4229 transition count 5813
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 4229 transition count 5813
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 4227 transition count 5810
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 4227 transition count 5810
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 4227 transition count 5809
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 4226 transition count 5807
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 4226 transition count 5807
Applied a total of 92 rules in 2115 ms. Remains 4226 /4271 variables (removed 45) and now considering 5807/5869 (removed 62) transitions.
// Phase 1: matrix 5807 rows 4226 cols
[2021-05-14 06:14:13] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:14:14] [INFO ] Implicit Places using invariants in 886 ms returned []
// Phase 1: matrix 5807 rows 4226 cols
[2021-05-14 06:14:14] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:14:15] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1693 ms to find 0 implicit places.
// Phase 1: matrix 5807 rows 4226 cols
[2021-05-14 06:14:15] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:14:18] [INFO ] Dead Transitions using invariants and state equation in 3418 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4226/4271 places, 5807/5869 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7B-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s3333 0), p1:(AND (NEQ s2097 0) (NEQ s2574 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 666 steps with 0 reset in 6 ms.
FORMULA NoC3x3-PT-7B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-04 finished in 7405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G((F(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 4271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4271/4271 places, 5869/5869 transitions.
Graph (trivial) has 5158 edges and 4271 vertex of which 3255 / 4271 are part of one of the 33 SCC in 7 ms
Free SCC test removed 3222 places
Ensure Unique test removed 4340 transitions
Reduce isomorphic transitions removed 4340 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 1048 transition count 1521
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 1041 transition count 1519
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 1039 transition count 1517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 1038 transition count 1517
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 22 place count 1038 transition count 1479
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 98 place count 1000 transition count 1479
Discarding 279 places :
Symmetric choice reduction at 4 with 279 rule applications. Total rules 377 place count 721 transition count 1061
Iterating global reduction 4 with 279 rules applied. Total rules applied 656 place count 721 transition count 1061
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 660 place count 721 transition count 1057
Discarding 201 places :
Symmetric choice reduction at 5 with 201 rule applications. Total rules 861 place count 520 transition count 813
Iterating global reduction 5 with 201 rules applied. Total rules applied 1062 place count 520 transition count 813
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 5 with 201 rules applied. Total rules applied 1263 place count 520 transition count 612
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 6 with 262 rules applied. Total rules applied 1525 place count 389 transition count 481
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1526 place count 388 transition count 480
Iterating global reduction 6 with 1 rules applied. Total rules applied 1527 place count 388 transition count 480
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1528 place count 388 transition count 479
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1529 place count 388 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1530 place count 387 transition count 477
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 270 edges and 378 vertex of which 48 / 378 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 7 with 10 rules applied. Total rules applied 1540 place count 354 transition count 477
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1588 place count 354 transition count 429
Applied a total of 1588 rules in 185 ms. Remains 354 /4271 variables (removed 3917) and now considering 429/5869 (removed 5440) transitions.
[2021-05-14 06:14:19] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
// Phase 1: matrix 397 rows 354 cols
[2021-05-14 06:14:19] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:14:19] [INFO ] Implicit Places using invariants in 151 ms returned []
[2021-05-14 06:14:19] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
// Phase 1: matrix 397 rows 354 cols
[2021-05-14 06:14:19] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:14:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-14 06:14:19] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2021-05-14 06:14:19] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-14 06:14:19] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
// Phase 1: matrix 397 rows 354 cols
[2021-05-14 06:14:19] [INFO ] Computed 57 place invariants in 10 ms
[2021-05-14 06:14:19] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Finished structural reductions, in 1 iterations. Remains : 354/4271 places, 429/5869 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s321 0) (EQ s345 1)), p2:(AND (EQ s316 0) (EQ s311 1)), p0:(OR (EQ s321 0) (EQ s345 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 214 steps with 2 reset in 3 ms.
FORMULA NoC3x3-PT-7B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-05 finished in 921 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 4271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4271/4271 places, 5869/5869 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 4252 transition count 5848
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 4252 transition count 5848
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 4252 transition count 5847
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 4245 transition count 5836
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 4245 transition count 5836
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 4240 transition count 5830
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 4240 transition count 5830
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 4235 transition count 5823
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 4235 transition count 5823
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 4232 transition count 5820
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 4232 transition count 5820
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 4229 transition count 5815
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 4229 transition count 5815
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 4229 transition count 5814
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 4228 transition count 5812
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 4228 transition count 5812
Applied a total of 88 rules in 2091 ms. Remains 4228 /4271 variables (removed 43) and now considering 5812/5869 (removed 57) transitions.
// Phase 1: matrix 5812 rows 4228 cols
[2021-05-14 06:14:22] [INFO ] Computed 66 place invariants in 15 ms
[2021-05-14 06:14:22] [INFO ] Implicit Places using invariants in 886 ms returned []
// Phase 1: matrix 5812 rows 4228 cols
[2021-05-14 06:14:22] [INFO ] Computed 66 place invariants in 15 ms
[2021-05-14 06:14:23] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1647 ms to find 0 implicit places.
// Phase 1: matrix 5812 rows 4228 cols
[2021-05-14 06:14:23] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:14:27] [INFO ] Dead Transitions using invariants and state equation in 3475 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4228/4271 places, 5812/5869 transitions.
Stuttering acceptance computed with spot in 1446 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (NEQ s3748 0) (NEQ s372 1)), p1:(OR (EQ s1900 0) (EQ s3170 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]]
Product exploration explored 100000 steps with 40 reset in 558 ms.
Product exploration explored 100000 steps with 37 reset in 736 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 36 reset in 517 ms.
Product exploration explored 100000 steps with 34 reset in 574 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 4228 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4228/4228 places, 5812/5812 transitions.
Graph (trivial) has 5108 edges and 4228 vertex of which 3234 / 4228 are part of one of the 33 SCC in 4 ms
Free SCC test removed 3201 places
Ensure Unique test removed 4314 transitions
Reduce isomorphic transitions removed 4314 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 1 place count 1027 transition count 1694
Deduced a syphon composed of 37 places in 3 ms
Iterating global reduction 0 with 37 rules applied. Total rules applied 38 place count 1027 transition count 1694
Discarding 273 places :
Symmetric choice reduction at 0 with 273 rule applications. Total rules 311 place count 754 transition count 1282
Deduced a syphon composed of 37 places in 2 ms
Iterating global reduction 0 with 273 rules applied. Total rules applied 584 place count 754 transition count 1282
Discarding 226 places :
Symmetric choice reduction at 0 with 226 rule applications. Total rules 810 place count 528 transition count 833
Deduced a syphon composed of 11 places in 2 ms
Iterating global reduction 0 with 226 rules applied. Total rules applied 1036 place count 528 transition count 833
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 1236 place count 528 transition count 633
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 1366 place count 528 transition count 633
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 1366 rules in 215 ms. Remains 528 /4228 variables (removed 3700) and now considering 633/5812 (removed 5179) transitions.
[2021-05-14 06:14:31] [INFO ] Redundant transitions in 20 ms returned []
[2021-05-14 06:14:31] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
// Phase 1: matrix 601 rows 528 cols
[2021-05-14 06:14:31] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 06:14:32] [INFO ] Dead Transitions using invariants and state equation in 352 ms returned []
Finished structural reductions, in 1 iterations. Remains : 528/4228 places, 633/5812 transitions.
Entered a terminal (fully accepting) state of product in 4292 steps with 47 reset in 77 ms.
FORMULA NoC3x3-PT-7B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-08 finished in 12142 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 4271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4271/4271 places, 5869/5869 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 4249 transition count 5845
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 4249 transition count 5845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4249 transition count 5844
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 4240 transition count 5831
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 4240 transition count 5831
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 4234 transition count 5820
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 4234 transition count 5820
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 4228 transition count 5811
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 4228 transition count 5811
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 4225 transition count 5808
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 4225 transition count 5808
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 4222 transition count 5803
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 4222 transition count 5803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 4222 transition count 5802
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 4221 transition count 5800
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 4221 transition count 5800
Applied a total of 102 rules in 2186 ms. Remains 4221 /4271 variables (removed 50) and now considering 5800/5869 (removed 69) transitions.
// Phase 1: matrix 5800 rows 4221 cols
[2021-05-14 06:14:34] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:14:35] [INFO ] Implicit Places using invariants in 854 ms returned []
// Phase 1: matrix 5800 rows 4221 cols
[2021-05-14 06:14:35] [INFO ] Computed 66 place invariants in 15 ms
[2021-05-14 06:14:36] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
// Phase 1: matrix 5800 rows 4221 cols
[2021-05-14 06:14:36] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:14:39] [INFO ] Dead Transitions using invariants and state equation in 3172 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4221/4271 places, 5800/5869 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s743 0) (EQ s2173 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][false, false, false]]
Stuttering criterion allowed to conclude after 2999 steps with 0 reset in 14 ms.
FORMULA NoC3x3-PT-7B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-09 finished in 7186 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X((p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 4271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4271/4271 places, 5869/5869 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 4249 transition count 5845
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 4249 transition count 5845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4249 transition count 5844
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 4240 transition count 5831
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 4240 transition count 5831
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 4234 transition count 5820
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 4234 transition count 5820
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 4228 transition count 5811
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 4228 transition count 5811
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 4225 transition count 5808
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 4225 transition count 5808
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 4222 transition count 5803
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 4222 transition count 5803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 4222 transition count 5802
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 4221 transition count 5800
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 4221 transition count 5800
Applied a total of 102 rules in 2114 ms. Remains 4221 /4271 variables (removed 50) and now considering 5800/5869 (removed 69) transitions.
// Phase 1: matrix 5800 rows 4221 cols
[2021-05-14 06:14:41] [INFO ] Computed 66 place invariants in 12 ms
[2021-05-14 06:14:42] [INFO ] Implicit Places using invariants in 1240 ms returned []
// Phase 1: matrix 5800 rows 4221 cols
[2021-05-14 06:14:42] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:14:43] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
// Phase 1: matrix 5800 rows 4221 cols
[2021-05-14 06:14:43] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:14:46] [INFO ] Dead Transitions using invariants and state equation in 2987 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4221/4271 places, 5800/5869 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7B-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2331 1), p2:(AND (EQ s3780 1) (EQ s2331 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][false, false]]
Stuttering criterion allowed to conclude after 2941 steps with 0 reset in 18 ms.
FORMULA NoC3x3-PT-7B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-12 finished in 7203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 4271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4271/4271 places, 5869/5869 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 4250 transition count 5846
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 4250 transition count 5846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 4250 transition count 5845
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 4242 transition count 5834
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 4242 transition count 5834
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 4237 transition count 5824
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 4237 transition count 5824
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 4232 transition count 5816
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 4232 transition count 5816
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 4230 transition count 5814
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 4230 transition count 5814
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 4228 transition count 5811
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 4228 transition count 5811
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 4227 transition count 5809
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 4227 transition count 5809
Applied a total of 89 rules in 2200 ms. Remains 4227 /4271 variables (removed 44) and now considering 5809/5869 (removed 60) transitions.
// Phase 1: matrix 5809 rows 4227 cols
[2021-05-14 06:14:48] [INFO ] Computed 66 place invariants in 13 ms
[2021-05-14 06:14:49] [INFO ] Implicit Places using invariants in 783 ms returned []
// Phase 1: matrix 5809 rows 4227 cols
[2021-05-14 06:14:49] [INFO ] Computed 66 place invariants in 16 ms
[2021-05-14 06:14:50] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
// Phase 1: matrix 5809 rows 4227 cols
[2021-05-14 06:14:50] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 06:14:53] [INFO ] Dead Transitions using invariants and state equation in 3662 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4227/4271 places, 5809/5869 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (EQ s1130 0) (EQ s4178 1)) (OR (EQ s758 0) (EQ s173 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 37 reset in 555 ms.
Entered a terminal (fully accepting) state of product in 2274 steps with 0 reset in 14 ms.
FORMULA NoC3x3-PT-7B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-13 finished in 8133 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&(p1||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 4271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4271/4271 places, 5869/5869 transitions.
Graph (trivial) has 5161 edges and 4271 vertex of which 3259 / 4271 are part of one of the 33 SCC in 3 ms
Free SCC test removed 3226 places
Ensure Unique test removed 4344 transitions
Reduce isomorphic transitions removed 4344 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 1045 transition count 1517
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 1037 transition count 1515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 1036 transition count 1515
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 20 place count 1036 transition count 1477
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 96 place count 998 transition count 1477
Discarding 280 places :
Symmetric choice reduction at 3 with 280 rule applications. Total rules 376 place count 718 transition count 1058
Iterating global reduction 3 with 280 rules applied. Total rules applied 656 place count 718 transition count 1058
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 660 place count 718 transition count 1054
Discarding 201 places :
Symmetric choice reduction at 4 with 201 rule applications. Total rules 861 place count 517 transition count 811
Iterating global reduction 4 with 201 rules applied. Total rules applied 1062 place count 517 transition count 811
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 4 with 201 rules applied. Total rules applied 1263 place count 517 transition count 610
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 5 with 264 rules applied. Total rules applied 1527 place count 385 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1529 place count 385 transition count 476
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1530 place count 384 transition count 475
Iterating global reduction 6 with 1 rules applied. Total rules applied 1531 place count 384 transition count 475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1532 place count 384 transition count 474
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 7 with 2 rules applied. Total rules applied 1534 place count 383 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1535 place count 383 transition count 472
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1536 place count 382 transition count 470
Iterating global reduction 8 with 1 rules applied. Total rules applied 1537 place count 382 transition count 470
Applied a total of 1537 rules in 115 ms. Remains 382 /4271 variables (removed 3889) and now considering 470/5869 (removed 5399) transitions.
[2021-05-14 06:14:54] [INFO ] Flow matrix only has 438 transitions (discarded 32 similar events)
// Phase 1: matrix 438 rows 382 cols
[2021-05-14 06:14:54] [INFO ] Computed 66 place invariants in 1 ms
[2021-05-14 06:14:54] [INFO ] Implicit Places using invariants in 163 ms returned [10, 44, 85, 121, 177, 239, 282, 319, 362]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 165 ms to find 9 implicit places.
[2021-05-14 06:14:54] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 06:14:54] [INFO ] Flow matrix only has 438 transitions (discarded 32 similar events)
// Phase 1: matrix 438 rows 373 cols
[2021-05-14 06:14:54] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:14:55] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
Starting structural reductions, iteration 1 : 373/4271 places, 470/5869 transitions.
Graph (trivial) has 266 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
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Applied a total of 1 rules in 6 ms. Remains 349 /373 variables (removed 24) and now considering 422/470 (removed 48) transitions.
[2021-05-14 06:14:55] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
// Phase 1: matrix 390 rows 349 cols
[2021-05-14 06:14:55] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 06:14:55] [INFO ] Implicit Places using invariants in 143 ms returned []
[2021-05-14 06:14:55] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
// Phase 1: matrix 390 rows 349 cols
[2021-05-14 06:14:55] [INFO ] Computed 57 place invariants in 8 ms
[2021-05-14 06:14:55] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-14 06:14:55] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 349/4271 places, 422/5869 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s246 1), p1:(AND (EQ s115 0) (EQ s0 1)), p2:(OR (EQ s0 0) (EQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-14 finished in 1215 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17513652005694202384
[2021-05-14 06:14:55] [INFO ] Too many transitions (5869) to apply POR reductions. Disabling POR matrices.
[2021-05-14 06:14:55] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17513652005694202384
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/ltsmin17513652005694202384]
[2021-05-14 06:14:56] [INFO ] Applying decomposition
[2021-05-14 06:14:56] [INFO ] Flatten gal took : 167 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/graph4634644695467018652.txt, -o, /tmp/graph4634644695467018652.bin, -w, /tmp/graph4634644695467018652.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/graph4634644695467018652.bin, -l, -1, -v, -w, /tmp/graph4634644695467018652.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:14:56] [INFO ] Decomposing Gal with order
[2021-05-14 06:14:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:14:57] [INFO ] Removed a total of 1826 redundant transitions.
[2021-05-14 06:14:57] [INFO ] Flatten gal took : 340 ms
[2021-05-14 06:14:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 60 ms.
[2021-05-14 06:14:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality5496863945404435881.gal : 44 ms
[2021-05-14 06:14:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality9164415768677699029.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/LTLCardinality5496863945404435881.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9164415768677699029.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/LTLCardinality5496863945404435881.gal -t CGAL -LTL /tmp/LTLCardinality9164415768677699029.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i19.i0.i1.i7.u1047.p4257==0)||(i13.u705.p2866==1))"))U(X(("(i5.i0.i0.i0.u300.p1198!=1)")||(X(!("(((i30.u1602.p6506==0)||(i30.u1602.p6506==1))||(i3.u204.p806==0))")))))))
Formula 0 simplified : !(G"((i19.i0.i1.i7.u1047.p4257==0)||(i13.u705.p2866==1))" U X("(i5.i0.i0.i0.u300.p1198!=1)" | X!"(((i30.u1602.p6506==0)||(i30.u1602.p6506==1))||(i3.u204.p806==0))"))
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/ltsmin17513652005694202384] killed by timeout after 36 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/ltsmin17513652005694202384] killed by timeout after 36 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions t1757, t1973, t2392, t2602, t4253, t4471, t4484, t4903, t5317, t5334, t6579, t6790, t6800, t7020, t7429, t8440, i0.t7377, i0.t7315, i0.t7223, i0.t7112, i0.u49.t7358, i0.u69.t7247, i1.t7155, i1.t7044, i1.u88.t7178, i1.u91.t7174, i1.u92.t7151, i1.u112.t7058, i1.u103.t7103, i2.u134.t6975, i2.u137.t6971, i2.u140.t6952, i2.u142.t6948, i2.u149.t6909, i2.u151.t38, i2.u153.t6900, i2.u132.t6855, i2.u170.t6841, i3.t6737, i3.t6733, i3.t6714, i3.t6710, i3.t6671, i3.t6617, i3.t6603, i3.u195.t6610, i3.u218.t6662, i3.u210.t6689, i3.u220.t6655, i4.t6534, i4.t6507, i4.t6459, i4.t6414, i4.t6376, i4.u246.t6407, i4.u258.t6452, i4.u189.t6789, i4.u260.t6486, i5.i0.i0.i0.u298.t6308, i5.i0.i0.i1.u301.t6304, i5.i0.i1.i0.u289.t6197, i5.i1.i0.i1.u308.t6265, i5.i1.i0.i2.u310.t6256, i5.i1.i1.i0.u294.t6331, i5.i1.i1.i0.u296.t6327, i5.i1.i1.i2.u320.t6211, i6.u348.t6105, i6.u351.t6101, i6.u354.t6046, i6.u356.t6080, i6.u361.t6062, i6.u345.t6128, i6.u343.t6124, i6.u363.t6053, i6.u341.t6008, i6.u339.t5994, i6.u375.t6001, i7.t5960, i7.t5833, i7.t5750, i7.u395.t5788, i7.u398.t5908, i7.u406.t5860, i7.u404.t5826, i7.u421.t5781, i7.u400.t5881, i8.i0.i0.i0.u437.t5578, i8.i0.i0.i2.u440.t5705, i8.i0.i0.i3.u469.t5585, i8.i0.i1.i2.u445.t5678, i8.i0.i2.i0.u452.t5657, i8.i0.i2.i3.u459.t5630, i8.i0.i2.i4.u462.t5623, i9.u493.t5502, i9.u497.t5475, i9.u503.t5420, i9.u504.t5454, i9.u509.t5427, i9.u517.t5382, i9.u389.t5959, i9.u489.t5375, i10.t5061, i10.t5057, i10.t5038, i10.t5034, i10.t4995, i10.t4986, i10.t4941, i10.t4927, i10.u626.t4948, i10.u611.t5004, i10.u622.t4972, i11.t5260, i11.t5130, i11.t5106, i11.u561.t5207, i11.u565.t5199, i11.u556.t5175, i11.u554.t5241, i11.u572.t5151, i12.u644.t4738, i12.u647.t4854, i12.u648.t4858, i12.u652.t4835, i12.u654.t4831, i12.u660.t4792, i12.u662.t4783, i12.u676.t4724, i13.u696.t4655, i13.u699.t4651, i13.u703.t4632, i13.u706.t4628, i13.u709.t4566, i13.u541.t5316, i13.u714.t4598, i13.u716.t4589, i13.u718.t4580, i13.u723.t4542, i13.u725.t4535, i13.u692.t4521, i14.t4407, i14.t4345, i14.t4315, i14.t4277, i14.u765.t4389, i14.u877.t3978, i14.u878.t3909, i14.u879.t3983, i14.u774.t4363, i14.u777.t4354, i14.u772.t4322, i14.u773.t4329, i14.u789.t4298, i14.u755.t4284, i15.i1.i1.t4050, i15.i1.i1.i3.t4088, i15.i1.i1.i4.u814.t4095, i15.i1.i1.i5.t4133, i15.i1.i1.i6.t4208, i15.i1.i1.i8.t4181, i15.i1.i1.i9.u829.t4160, i15.i1.i1.i10.u749.t4465, i15.i1.i1.i10.u831.t4151, i15.i1.i1.i11.u840.t4126, i15.i1.i1.i12.u842.t4119, i15.i1.i1.i13.u847.t4081, i16.u868.t3885, i16.u872.t4005, i16.u874.t4001, i16.u870.t3892, i16.u891.t3948, i16.u894.t3939, i16.u896.t3930, i16.u865.t3871, i16.u884.t3916, i17.u919.t3668, i17.u925.t3798, i17.u927.t3802, i17.u930.t3775, i17.u931.t3779, i17.u748.t4470, i17.u936.t3754, i17.u942.t3736, i17.u944.t3727, i17.u934.t3720, i17.u955.t3675, i17.u921.t3682, i18.u976.t3486, i18.u977.t3595, i18.u979.t3599, i18.u982.t3572, i18.u984.t3576, i18.u1000.t3510, i18.u972.t3465, i18.u989.t3551, i18.u991.t3542, i18.u993.t3533, i18.u995.t3524, i18.u997.t3517, i18.u974.t3479, i18.u1007.t3472, i19.i0.i1.t3221, i19.i0.i1.i3.u1035.t3331, i19.i0.i1.i4.u1019.t3431, i19.i0.i1.i4.u1039.t3322, i19.i0.i1.i5.u1044.t3297, i19.i0.i1.i6.u1034.t3290, i19.i0.i1.i8.u1051.t3266, i19.i0.i1.i10.u1026.t3252, i20.u1075.t3056, i20.u1078.t3176, i20.u1082.t3149, i20.u1018.t3436, i20.u1089.t3128, i20.u1091.t3119, i20.u1096.t3101, i20.u1098.t3094, i20.u1100.t3087, i20.u1102.t3063, i20.u1105.t3049, i21.u1142.t2891, i21.u1134.t2925, i21.u1140.t2898, i21.u1121.t2846, i21.u1132.t2946, i21.u1125.t2973, i21.u1151.t2853, i22.u1171.t2650, i22.u1169.t2643, i22.u1174.t2770, i22.u1177.t2743, i22.u1185.t2688, i22.u1186.t2722, i22.u1190.t2713, i22.u1193.t2695, i22.u1184.t2681, i22.u1199.t2657, i23.t2546, i23.t2484, i23.t2416, i23.u1232.t2527, i23.u1238.t2493, i23.u1245.t2461, i23.u1225.t2437, i24.u1277.t2343, i24.u1218.t2601, i24.u1288.t2290, i24.u1290.t2281, i24.u1296.t2258, i24.u1280.t2324, i24.u1276.t2234, i24.u1305.t2213, i25.u1323.t2140, i25.u1328.t2121, i25.u1333.t2055, i25.u1338.t2087, i25.u1340.t2078, i25.u1346.t2031, i25.u1352.t2010, i26.i1.i0.t1911, i26.i1.i0.t1892, i26.i1.i0.t1781, i26.i1.i0.i0.t1849, i26.i1.i0.i4.u1390.t1867, i26.i1.i0.i5.u1393.t1858, i26.i1.i1.i0.u1377.t1802, i26.i1.i1.i2.u1401.t1833, i26.i1.i1.i3.u1369.t1968, i26.i1.i1.i3.u1404.t1826, i26.i1.i2.i1.u1409.t1788, i27.u1428.t1578, i27.u1432.t1708, i27.u1436.t1689, i27.u1444.t1655, i27.u1447.t1646, i27.u1451.t1623, i27.u1455.t1599, i28.u1473.t1375, i28.u1481.t1505, i28.u1483.t1486, i28.u1489.t1461, i28.u1492.t1452, i28.u1494.t1443, i28.u1368.t1972, i28.u1498.t1427, i28.u1487.t1420, i28.u1504.t1396, i28.u1475.t1382, i29.t1225, i29.u1540.t1258, i29.u1545.t1240, i29.u1542.t1249, i29.u1524.t1179, i29.u1537.t1217, i29.u1533.t1283, i29.u1529.t1302, i29.u1556.t1193, i29.u1561.t1172, i30.u1594.t1044, i30.u1596.t1035, i30.u1571.t1147, i30.u1603.t1010, i30.u1592.t1003, i30.u1582.t979, i30.u1610.t965, i31.i0.i0.i0.u1626.t762, i31.i0.i2.i1.u1635.t841, i31.i0.i2.i2.u1572.t1143, i31.i0.i2.i2.u1638.t832, i31.i0.i2.i3.u1642.t807, i31.i0.i2.i4.u1645.t800, i31.i0.i2.i5.u1651.t776, i32.u1674.t573, i32.u1683.t638, i32.u1686.t629, i32.u1690.t604, i32.u1693.t597, i32.u1698.t559, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5505/318/5823
Computing Next relation with stutter on 5.26276e+50 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
111022 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1110.74,12381732,1,0,1.90853e+07,3902,56396,5.63341e+07,335,29558,51520431
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NoC3x3-PT-7B-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1620974098707
--------------------
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-7B"
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-7B, 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-162089127700332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-7B.tgz
mv NoC3x3-PT-7B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;