fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r204-oct2-165281599000219
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for SafeBus-COL-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16220.575 3600000.00 5529464.00 311552.50 TFFTFFFFFT?FFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599000219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SafeBus-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599000219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 6.2K Apr 29 11:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 11:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 29 11:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 29 11:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 42K May 10 09:34 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 SafeBus-COL-10-LTLCardinality-00
FORMULA_NAME SafeBus-COL-10-LTLCardinality-01
FORMULA_NAME SafeBus-COL-10-LTLCardinality-02
FORMULA_NAME SafeBus-COL-10-LTLCardinality-03
FORMULA_NAME SafeBus-COL-10-LTLCardinality-04
FORMULA_NAME SafeBus-COL-10-LTLCardinality-05
FORMULA_NAME SafeBus-COL-10-LTLCardinality-06
FORMULA_NAME SafeBus-COL-10-LTLCardinality-07
FORMULA_NAME SafeBus-COL-10-LTLCardinality-08
FORMULA_NAME SafeBus-COL-10-LTLCardinality-09
FORMULA_NAME SafeBus-COL-10-LTLCardinality-10
FORMULA_NAME SafeBus-COL-10-LTLCardinality-11
FORMULA_NAME SafeBus-COL-10-LTLCardinality-12
FORMULA_NAME SafeBus-COL-10-LTLCardinality-13
FORMULA_NAME SafeBus-COL-10-LTLCardinality-14
FORMULA_NAME SafeBus-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652949821007

Running Version 202205111006
[2022-05-19 08:43:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 08:43:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 08:43:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 08:43:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 08:43:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 569 ms
[2022-05-19 08:43:42] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2022-05-19 08:43:42] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA SafeBus-COL-10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 08:43:42] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 8 ms.
[2022-05-19 08:43:42] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA SafeBus-COL-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14 rows 17 cols
[2022-05-19 08:43:44] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-19 08:43:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-19 08:43:44] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 08:43:44] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2022-05-19 08:43:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 08:43:44] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 08:43:44] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
FORMULA SafeBus-COL-10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 08:43:44] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 08:43:44] [INFO ] Flatten gal took : 26 ms
[2022-05-19 08:43:44] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA SafeBus-COL-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 08:43:44] [INFO ] Flatten gal took : 3 ms
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2022-05-19 08:43:44] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 34 ms.
[2022-05-19 08:43:44] [INFO ] Unfolded 4 HLPN properties in 1 ms.
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 20 places and 20 transitions.
Support contains 253 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 32 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2022-05-19 08:43:44] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:43:44] [INFO ] Computed 45 place invariants in 40 ms
[2022-05-19 08:43:44] [INFO ] Implicit Places using invariants in 416 ms returned []
[2022-05-19 08:43:44] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:43:44] [INFO ] Computed 45 place invariants in 10 ms
[2022-05-19 08:43:45] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-19 08:43:45] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2022-05-19 08:43:45] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:43:45] [INFO ] Computed 45 place invariants in 11 ms
[2022-05-19 08:43:46] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 100 transitions.
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 8 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 306/306 places, 1531/1631 transitions.
Support contains 253 out of 306 places after structural reductions.
[2022-05-19 08:43:46] [INFO ] Flatten gal took : 117 ms
[2022-05-19 08:43:46] [INFO ] Flatten gal took : 110 ms
[2022-05-19 08:43:47] [INFO ] Input system was already deterministic with 1531 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 08:43:47] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:43:47] [INFO ] Computed 45 place invariants in 11 ms
[2022-05-19 08:43:47] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:43:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2022-05-19 08:43:47] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-19 08:43:47] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 30 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 206 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2022-05-19 08:43:47] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:43:47] [INFO ] Computed 45 place invariants in 9 ms
[2022-05-19 08:43:48] [INFO ] Implicit Places using invariants in 336 ms returned []
[2022-05-19 08:43:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:43:48] [INFO ] Computed 45 place invariants in 4 ms
[2022-05-19 08:43:48] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-19 08:43:49] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2022-05-19 08:43:49] [INFO ] Redundant transitions in 79 ms returned []
[2022-05-19 08:43:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:43:49] [INFO ] Computed 45 place invariants in 7 ms
[2022-05-19 08:43:50] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 (ADD s251 s252 s253 s254 s255 s256 s257 s258 s259 s260)) (LEQ (ADD s296 s297 s298 s299 s300 s301 s302 s303 s304 s305) (ADD s231 s232 s233 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 577 ms.
Stack based approach found an accepted trace after 564 steps with 0 reset with depth 565 and stack size 565 in 5 ms.
FORMULA SafeBus-COL-10-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-04 finished in 3484 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 11 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 289 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2022-05-19 08:43:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:43:51] [INFO ] Computed 45 place invariants in 9 ms
[2022-05-19 08:43:51] [INFO ] Implicit Places using invariants in 367 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 371 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 154 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2022-05-19 08:43:51] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-19 08:43:51] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-19 08:43:52] [INFO ] Implicit Places using invariants in 313 ms returned []
[2022-05-19 08:43:52] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-19 08:43:52] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-19 08:43:52] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-19 08:43:53] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions, in 2 iterations. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT (ADD s231 s232 s233 s234 s235 s236 s237 s238 s239 s240) s272)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA SafeBus-COL-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-06 finished in 2644 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(((F(p0) U p0)||F(X(p1)))))))'
Support contains 191 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 190 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2022-05-19 08:43:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:43:53] [INFO ] Computed 45 place invariants in 9 ms
[2022-05-19 08:43:54] [INFO ] Implicit Places using invariants in 281 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 283 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 134 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2022-05-19 08:43:54] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-19 08:43:54] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-19 08:43:54] [INFO ] Implicit Places using invariants in 242 ms returned []
[2022-05-19 08:43:54] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-19 08:43:54] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-19 08:43:54] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-19 08:43:55] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions, in 2 iterations. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18593 reset in 542 ms.
Product exploration explored 100000 steps with 18669 reset in 532 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 191 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 137 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2022-05-19 08:43:57] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-19 08:43:57] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-19 08:43:57] [INFO ] Implicit Places using invariants in 237 ms returned []
[2022-05-19 08:43:57] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-19 08:43:57] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-19 08:43:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-19 08:43:58] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
[2022-05-19 08:43:58] [INFO ] Redundant transitions in 32 ms returned []
[2022-05-19 08:43:58] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-19 08:43:58] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-19 08:43:58] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 286/286 places, 1521/1521 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 31 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18140 reset in 436 ms.
Product exploration explored 100000 steps with 18047 reset in 445 ms.
Built C files in :
/tmp/ltsmin12723117792109270485
[2022-05-19 08:44:00] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:44:00] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12723117792109270485
Running compilation step : cd /tmp/ltsmin12723117792109270485;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2622 ms.
Running link step : cd /tmp/ltsmin12723117792109270485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12723117792109270485;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5530867559200541664.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 191 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 131 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2022-05-19 08:44:15] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-19 08:44:15] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-19 08:44:15] [INFO ] Implicit Places using invariants in 208 ms returned []
[2022-05-19 08:44:15] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-19 08:44:15] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-19 08:44:15] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-19 08:44:16] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
[2022-05-19 08:44:16] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-19 08:44:16] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-19 08:44:16] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-19 08:44:17] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 286/286 places, 1521/1521 transitions.
Built C files in :
/tmp/ltsmin14089834076778351176
[2022-05-19 08:44:17] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:44:17] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14089834076778351176
Running compilation step : cd /tmp/ltsmin14089834076778351176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2472 ms.
Running link step : cd /tmp/ltsmin14089834076778351176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14089834076778351176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12666384141838297944.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 08:44:32] [INFO ] Flatten gal took : 180 ms
[2022-05-19 08:44:33] [INFO ] Flatten gal took : 180 ms
[2022-05-19 08:44:33] [INFO ] Time to serialize gal into /tmp/LTL14067271971542053484.gal : 10 ms
[2022-05-19 08:44:33] [INFO ] Time to serialize properties into /tmp/LTL4937537326148545724.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14067271971542053484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4937537326148545724.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1406727...267
Read 1 LTL properties
Checking formula 0 : !((F(G(X(((F("((((((((AMC_0+AMC_1)+(AMC_2+AMC_3))+((AMC_4+AMC_5)+(AMC_6+AMC_7)))+(((AMC_8+AMC_9)+(AMC_10+AMC_11))+((AMC_12+AMC_13)+(AM...3102
Formula 0 simplified : !FGX((F"((((((((AMC_0+AMC_1)+(AMC_2+AMC_3))+((AMC_4+AMC_5)+(AMC_6+AMC_7)))+(((AMC_8+AMC_9)+(AMC_10+AMC_11))+((AMC_12+AMC_13)+(AMC_14...3087
Detected timeout of ITS tools.
[2022-05-19 08:44:48] [INFO ] Flatten gal took : 65 ms
[2022-05-19 08:44:48] [INFO ] Applying decomposition
[2022-05-19 08:44:48] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15219687768377882621.txt' '-o' '/tmp/graph15219687768377882621.bin' '-w' '/tmp/graph15219687768377882621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15219687768377882621.bin' '-l' '-1' '-v' '-w' '/tmp/graph15219687768377882621.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:44:48] [INFO ] Decomposing Gal with order
[2022-05-19 08:44:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:44:49] [INFO ] Removed a total of 1379 redundant transitions.
[2022-05-19 08:44:49] [INFO ] Flatten gal took : 1034 ms
[2022-05-19 08:44:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 3460 labels/synchronizations in 193 ms.
[2022-05-19 08:44:50] [INFO ] Time to serialize gal into /tmp/LTL9814325347177522521.gal : 12 ms
[2022-05-19 08:44:50] [INFO ] Time to serialize properties into /tmp/LTL16968134731019394641.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9814325347177522521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16968134731019394641.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9814325...267
Read 1 LTL properties
Checking formula 0 : !((F(G(X(((F("((((((((gu1.AMC_0+gu1.AMC_1)+(gu1.AMC_2+gu1.AMC_3))+((gu1.AMC_4+gu1.AMC_5)+(gu1.AMC_6+gu1.AMC_7)))+(((gu1.AMC_8+gu1.AMC_...4266
Formula 0 simplified : !FGX((F"((((((((gu1.AMC_0+gu1.AMC_1)+(gu1.AMC_2+gu1.AMC_3))+((gu1.AMC_4+gu1.AMC_5)+(gu1.AMC_6+gu1.AMC_7)))+(((gu1.AMC_8+gu1.AMC_9)+(...4251
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8570010377309394417
[2022-05-19 08:45:05] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8570010377309394417
Running compilation step : cd /tmp/ltsmin8570010377309394417;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2446 ms.
Running link step : cd /tmp/ltsmin8570010377309394417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8570010377309394417;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X(((<>((LTLAPp0==true)) U (LTLAPp0==true))||<>(X((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SafeBus-COL-10-LTLCardinality-10 finished in 86713 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(p0)))))'
Support contains 11 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 125 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2022-05-19 08:45:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:45:20] [INFO ] Computed 45 place invariants in 4 ms
[2022-05-19 08:45:20] [INFO ] Implicit Places using invariants in 325 ms returned []
[2022-05-19 08:45:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:45:20] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-19 08:45:21] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-19 08:45:22] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2022-05-19 08:45:22] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-19 08:45:22] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-19 08:45:22] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-19 08:45:22] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s284 (ADD s231 s232 s233 s234 s235 s236 s237 s238 s239 s240))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 473 ms.
Stack based approach found an accepted trace after 283 steps with 0 reset with depth 284 and stack size 284 in 3 ms.
FORMULA SafeBus-COL-10-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-14 finished in 3116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(((F(p0) U p0)||F(X(p1)))))))'
[2022-05-19 08:45:23] [INFO ] Flatten gal took : 87 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12331795843003771703
[2022-05-19 08:45:23] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:45:23] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12331795843003771703
Running compilation step : cd /tmp/ltsmin12331795843003771703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 08:45:23] [INFO ] Applying decomposition
[2022-05-19 08:45:23] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17519231702204647206.txt' '-o' '/tmp/graph17519231702204647206.bin' '-w' '/tmp/graph17519231702204647206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17519231702204647206.bin' '-l' '-1' '-v' '-w' '/tmp/graph17519231702204647206.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:45:24] [INFO ] Decomposing Gal with order
[2022-05-19 08:45:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:45:24] [INFO ] Removed a total of 1920 redundant transitions.
[2022-05-19 08:45:24] [INFO ] Flatten gal took : 851 ms
[2022-05-19 08:45:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2280 labels/synchronizations in 132 ms.
[2022-05-19 08:45:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality5702397076061584984.gal : 19 ms
[2022-05-19 08:45:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality8340671020900785161.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5702397076061584984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8340671020900785161.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((F(G(X(((F("((((((((gu5.AMC_0+gu5.AMC_1)+(gu5.AMC_2+gu5.AMC_3))+((gu5.AMC_4+gu5.AMC_5)+(gu5.AMC_6+gu5.AMC_7)))+(((gu5.AMC_8+gu5.AMC_...4266
Formula 0 simplified : !FGX((F"((((((((gu5.AMC_0+gu5.AMC_1)+(gu5.AMC_2+gu5.AMC_3))+((gu5.AMC_4+gu5.AMC_5)+(gu5.AMC_6+gu5.AMC_7)))+(((gu5.AMC_8+gu5.AMC_9)+(...4251
Compilation finished in 2706 ms.
Running link step : cd /tmp/ltsmin12331795843003771703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12331795843003771703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X(((<>((LTLAPp0==true)) U (LTLAPp0==true))||<>(X((LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: LTL layer: formula: <>([](X(((<>((LTLAPp0==true)) U (LTLAPp0==true))||<>(X((LTLAPp1==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.002: "<>([](X(((<>((LTLAPp0==true)) U (LTLAPp0==true))||<>(X((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.167: DFS-FIFO for weak LTL, using special progress label 1534
pins2lts-mc-linux64( 0/ 8), 0.167: There are 1535 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.167: State length is 307, there are 1534 groups
pins2lts-mc-linux64( 0/ 8), 0.167: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.167: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.167: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.167: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.007: ~18 levels ~960 states ~2704 transitions
pins2lts-mc-linux64( 4/ 8), 1.104: ~32 levels ~1920 states ~4584 transitions
pins2lts-mc-linux64( 4/ 8), 1.275: ~32 levels ~3840 states ~8376 transitions
pins2lts-mc-linux64( 6/ 8), 1.632: ~32 levels ~7680 states ~17256 transitions
pins2lts-mc-linux64( 7/ 8), 2.543: ~32 levels ~15360 states ~47016 transitions
pins2lts-mc-linux64( 7/ 8), 4.031: ~32 levels ~30720 states ~89624 transitions
pins2lts-mc-linux64( 7/ 8), 7.048: ~32 levels ~61440 states ~165472 transitions
pins2lts-mc-linux64( 2/ 8), 12.756: ~32 levels ~122880 states ~257432 transitions
pins2lts-mc-linux64( 1/ 8), 24.776: ~32 levels ~245760 states ~577768 transitions
pins2lts-mc-linux64( 1/ 8), 31.793: ~32 levels ~491520 states ~1084240 transitions
pins2lts-mc-linux64( 1/ 8), 43.664: ~32 levels ~983040 states ~2293832 transitions
pins2lts-mc-linux64( 1/ 8), 67.726: ~32 levels ~1966080 states ~5566248 transitions
pins2lts-mc-linux64( 4/ 8), 114.225: ~32 levels ~3932160 states ~10717736 transitions
pins2lts-mc-linux64( 4/ 8), 203.687: ~32 levels ~7864320 states ~19622728 transitions
pins2lts-mc-linux64( 1/ 8), 383.719: ~32 levels ~15728640 states ~37732624 transitions
pins2lts-mc-linux64( 0/ 8), 684.155: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 684.217:
pins2lts-mc-linux64( 0/ 8), 684.217: mean standard work distribution: 3.0% (states) 5.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 684.217:
pins2lts-mc-linux64( 0/ 8), 684.217: Explored 28080524 states 69626214 transitions, fanout: 2.480
pins2lts-mc-linux64( 0/ 8), 684.217: Total exploration time 684.040 sec (683.980 sec minimum, 683.997 sec on average)
pins2lts-mc-linux64( 0/ 8), 684.217: States per second: 41051, Transitions per second: 101787
pins2lts-mc-linux64( 0/ 8), 684.217:
pins2lts-mc-linux64( 0/ 8), 684.217: Progress states detected: 900
pins2lts-mc-linux64( 0/ 8), 684.217: Redundant explorations: -0.0049
pins2lts-mc-linux64( 0/ 8), 684.217:
pins2lts-mc-linux64( 0/ 8), 684.217: Queue width: 8B, total height: 1404, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 684.217: Tree memory: 470.2MB, 17.6 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 684.217: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 684.217: Stored 1564 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 684.217: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 684.217: Est. total memory use: 470.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12331795843003771703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X(((<>((LTLAPp0==true)) U (LTLAPp0==true))||<>(X((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12331795843003771703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X(((<>((LTLAPp0==true)) U (LTLAPp0==true))||<>(X((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 09:05:59] [INFO ] Applying decomposition
[2022-05-19 09:06:00] [INFO ] Flatten gal took : 800 ms
[2022-05-19 09:06:00] [INFO ] Decomposing Gal with order
[2022-05-19 09:06:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:06:01] [INFO ] Removed a total of 6671 redundant transitions.
[2022-05-19 09:06:01] [INFO ] Flatten gal took : 632 ms
[2022-05-19 09:06:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 109 ms.
[2022-05-19 09:06:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality3148201551249846237.gal : 34 ms
[2022-05-19 09:06:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality17411152348156161285.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3148201551249846237.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17411152348156161285.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((F(G(X(((F("((((((((gItIt0.AMC_0+gItIt1.AMC_1)+(gItIt2.AMC_2+gItIt3.AMC_3))+((gItIt4.AMC_4+gItIt5.AMC_5)+(gItIt6.AMC_6+gItIt7.AMC_7)...5398
Formula 0 simplified : !FGX((F"((((((((gItIt0.AMC_0+gItIt1.AMC_1)+(gItIt2.AMC_2+gItIt3.AMC_3))+((gItIt4.AMC_4+gItIt5.AMC_5)+(gItIt6.AMC_6+gItIt7.AMC_7)))+(...5383
Detected timeout of ITS tools.
[2022-05-19 09:26:38] [INFO ] Flatten gal took : 1158 ms
[2022-05-19 09:26:39] [INFO ] Input system was already deterministic with 1531 transitions.
[2022-05-19 09:26:40] [INFO ] Transformed 306 places.
[2022-05-19 09:26:40] [INFO ] Transformed 1531 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 09:27:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality13269811669089292000.gal : 7 ms
[2022-05-19 09:27:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality7252595655779621358.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13269811669089292000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7252595655779621358.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(X(((F("((((((((AMC_0+AMC_1)+(AMC_2+AMC_3))+((AMC_4+AMC_5)+(AMC_6+AMC_7)))+(((AMC_8+AMC_9)+(AMC_10+AMC_11))+((AMC_12+AMC_13)+(AM...3102
Formula 0 simplified : !FGX((F"((((((((AMC_0+AMC_1)+(AMC_2+AMC_3))+((AMC_4+AMC_5)+(AMC_6+AMC_7)))+(((AMC_8+AMC_9)+(AMC_10+AMC_11))+((AMC_12+AMC_13)+(AMC_14...3087

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-COL-10"
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 SafeBus-COL-10, 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 r204-oct2-165281599000219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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