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.r083-tall-162048875300388.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 DiscoveryGPU-PT-15b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875300388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 18:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 111K 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 DiscoveryGPU-PT-15b-00
FORMULA_NAME DiscoveryGPU-PT-15b-01
FORMULA_NAME DiscoveryGPU-PT-15b-02
FORMULA_NAME DiscoveryGPU-PT-15b-03
FORMULA_NAME DiscoveryGPU-PT-15b-04
FORMULA_NAME DiscoveryGPU-PT-15b-05
FORMULA_NAME DiscoveryGPU-PT-15b-06
FORMULA_NAME DiscoveryGPU-PT-15b-07
FORMULA_NAME DiscoveryGPU-PT-15b-08
FORMULA_NAME DiscoveryGPU-PT-15b-09
FORMULA_NAME DiscoveryGPU-PT-15b-10
FORMULA_NAME DiscoveryGPU-PT-15b-11
FORMULA_NAME DiscoveryGPU-PT-15b-12
FORMULA_NAME DiscoveryGPU-PT-15b-13
FORMULA_NAME DiscoveryGPU-PT-15b-14
FORMULA_NAME DiscoveryGPU-PT-15b-15

=== Now, execution of the tool begins

BK_START 1620582529131

Running Version 0
[2021-05-09 17:48:50] [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-09 17:48:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 17:48:50] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2021-05-09 17:48:50] [INFO ] Transformed 436 places.
[2021-05-09 17:48:50] [INFO ] Transformed 464 transitions.
[2021-05-09 17:48:50] [INFO ] Found NUPN structural information;
[2021-05-09 17:48:50] [INFO ] Parsed PT model containing 436 places and 464 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA DiscoveryGPU-PT-15b-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 436 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 436/436 places, 464/464 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 406 transition count 464
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 98 place count 338 transition count 396
Iterating global reduction 1 with 68 rules applied. Total rules applied 166 place count 338 transition count 396
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 180 place count 324 transition count 382
Iterating global reduction 1 with 14 rules applied. Total rules applied 194 place count 324 transition count 382
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 206 place count 312 transition count 370
Iterating global reduction 1 with 12 rules applied. Total rules applied 218 place count 312 transition count 370
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 227 place count 303 transition count 361
Iterating global reduction 1 with 9 rules applied. Total rules applied 236 place count 303 transition count 361
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 242 place count 297 transition count 349
Iterating global reduction 1 with 6 rules applied. Total rules applied 248 place count 297 transition count 349
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 253 place count 292 transition count 344
Iterating global reduction 1 with 5 rules applied. Total rules applied 258 place count 292 transition count 344
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 262 place count 288 transition count 340
Iterating global reduction 1 with 4 rules applied. Total rules applied 266 place count 288 transition count 340
Applied a total of 266 rules in 115 ms. Remains 288 /436 variables (removed 148) and now considering 340/464 (removed 124) transitions.
// Phase 1: matrix 340 rows 288 cols
[2021-05-09 17:48:51] [INFO ] Computed 2 place invariants in 20 ms
[2021-05-09 17:48:51] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 340 rows 288 cols
[2021-05-09 17:48:51] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 17:48:51] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
// Phase 1: matrix 340 rows 288 cols
[2021-05-09 17:48:51] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 17:48:51] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Finished structural reductions, in 1 iterations. Remains : 288/436 places, 340/464 transitions.
[2021-05-09 17:48:51] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 17:48:51] [INFO ] Flatten gal took : 53 ms
FORMULA DiscoveryGPU-PT-15b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 17:48:51] [INFO ] Flatten gal took : 21 ms
[2021-05-09 17:48:52] [INFO ] Input system was already deterministic with 340 transitions.
Incomplete random walk after 100000 steps, including 205 resets, run finished after 370 ms. (steps per millisecond=270 ) properties (out of 20) seen :18
Running SMT prover for 2 properties.
// Phase 1: matrix 340 rows 288 cols
[2021-05-09 17:48:52] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:48:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 17:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 17:48:52] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-09 17:48:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 17:48:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 17:48:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 17:48:52] [INFO ] [Nat]Absence check using state equation in 58 ms returned unsat
[2021-05-09 17:48:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 17:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 17:48:52] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2021-05-09 17:48:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 17:48:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 17:48:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 17:48:52] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-09 17:48:53] [INFO ] Computed and/alt/rep : 335/532/335 causal constraints (skipped 4 transitions) in 19 ms.
[2021-05-09 17:48:53] [INFO ] Added : 125 causal constraints over 25 iterations in 485 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-09 17:48:53] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-15b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)||(p1 U (G(p1)||p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 272 transition count 323
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 272 transition count 323
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 262 transition count 309
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 262 transition count 309
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 254 transition count 300
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 254 transition count 300
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 247 transition count 291
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 247 transition count 291
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 244 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 244 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 242 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 242 transition count 286
Applied a total of 92 rules in 34 ms. Remains 242 /288 variables (removed 46) and now considering 286/340 (removed 54) transitions.
// Phase 1: matrix 286 rows 242 cols
[2021-05-09 17:48:53] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:48:53] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 286 rows 242 cols
[2021-05-09 17:48:53] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:48:53] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 242 cols
[2021-05-09 17:48:53] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 17:48:53] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 242/288 places, 286/340 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s86 1), p2:(OR (EQ s234 0) (EQ s81 1)), p1:(OR (EQ s128 0) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22156 reset in 322 ms.
Product exploration explored 100000 steps with 22239 reset in 211 ms.
Graph (complete) has 491 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 22050 reset in 185 ms.
Product exploration explored 100000 steps with 22337 reset in 172 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 242 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 242/242 places, 286/286 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 242 transition count 286
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 28 place count 242 transition count 422
Deduced a syphon composed of 75 places in 1 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 75 place count 242 transition count 422
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 95 place count 242 transition count 422
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 241 transition count 421
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 241 transition count 421
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -140
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 139 place count 241 transition count 561
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 151 place count 229 transition count 513
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 163 place count 229 transition count 513
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 199 place count 193 transition count 417
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 235 place count 193 transition count 417
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 268 place count 160 transition count 340
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 301 place count 160 transition count 340
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 312 place count 149 transition count 318
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 323 place count 149 transition count 318
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 345 place count 127 transition count 263
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 367 place count 127 transition count 263
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 411 place count 83 transition count 153
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 455 place count 83 transition count 153
Deduced a syphon composed of 46 places in 0 ms
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 472 place count 83 transition count 136
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 476 place count 79 transition count 128
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 480 place count 79 transition count 128
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 480 rules in 109 ms. Remains 79 /242 variables (removed 163) and now considering 128/286 (removed 158) transitions.
[2021-05-09 17:48:55] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 17:48:55] [INFO ] Flow matrix only has 120 transitions (discarded 8 similar events)
// Phase 1: matrix 120 rows 79 cols
[2021-05-09 17:48:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:48:55] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/242 places, 128/286 transitions.
Product exploration explored 100000 steps with 26681 reset in 483 ms.
Product exploration explored 100000 steps with 26668 reset in 345 ms.
[2021-05-09 17:48:56] [INFO ] Flatten gal took : 16 ms
[2021-05-09 17:48:56] [INFO ] Flatten gal took : 16 ms
[2021-05-09 17:48:56] [INFO ] Time to serialize gal into /tmp/LTL6480702055590300314.gal : 8 ms
[2021-05-09 17:48:56] [INFO ] Time to serialize properties into /tmp/LTL16413204095523850388.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/LTL6480702055590300314.gal, -t, CGAL, -LTL, /tmp/LTL16413204095523850388.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/LTL6480702055590300314.gal -t CGAL -LTL /tmp/LTL16413204095523850388.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(p139==1)"))||(("((p220==0)||(p80==1))")U(("((p420==0)||(p125==1))")||(G("((p220==0)||(p80==1))"))))))))
Formula 0 simplified : !XX(F"(p139==1)" | ("((p220==0)||(p80==1))" U ("((p420==0)||(p125==1))" | G"((p220==0)||(p80==1))")))
Detected timeout of ITS tools.
[2021-05-09 17:49:11] [INFO ] Flatten gal took : 13 ms
[2021-05-09 17:49:11] [INFO ] Applying decomposition
[2021-05-09 17:49:11] [INFO ] Flatten gal took : 13 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/graph2625100663963794367.txt, -o, /tmp/graph2625100663963794367.bin, -w, /tmp/graph2625100663963794367.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/graph2625100663963794367.bin, -l, -1, -v, -w, /tmp/graph2625100663963794367.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 17:49:11] [INFO ] Decomposing Gal with order
[2021-05-09 17:49:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 17:49:11] [INFO ] Removed a total of 115 redundant transitions.
[2021-05-09 17:49:11] [INFO ] Flatten gal took : 64 ms
[2021-05-09 17:49:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2021-05-09 17:49:11] [INFO ] Time to serialize gal into /tmp/LTL1153427404938558932.gal : 6 ms
[2021-05-09 17:49:11] [INFO ] Time to serialize properties into /tmp/LTL5705749330399366042.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/LTL1153427404938558932.gal, -t, CGAL, -LTL, /tmp/LTL5705749330399366042.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/LTL1153427404938558932.gal -t CGAL -LTL /tmp/LTL5705749330399366042.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(i13.u30.p139==1)"))||(("((i6.u43.p220==0)||(u19.p80==1))")U(("((i1.i0.u82.p420==0)||(i13.u29.p125==1))")||(G("((i6.u43.p220==0)||(u19.p80==1))"))))))))
Formula 0 simplified : !XX(F"(i13.u30.p139==1)" | ("((i6.u43.p220==0)||(u19.p80==1))" U ("((i1.i0.u82.p420==0)||(i13.u29.p125==1))" | G"((i6.u43.p220==0)||(u19.p80==1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4678447622922746937
[2021-05-09 17:49:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4678447622922746937
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/ltsmin4678447622922746937]
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/ltsmin4678447622922746937] 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/ltsmin4678447622922746937] 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 DiscoveryGPU-PT-15b-00 finished in 34549 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((G(F(p0))||(X(p0) U ((p1&&X(p0))||X(G(p0))))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 270 transition count 321
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 270 transition count 321
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 260 transition count 307
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 260 transition count 307
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 252 transition count 298
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 252 transition count 298
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 79 place count 245 transition count 289
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 245 transition count 289
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 242 transition count 286
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 242 transition count 286
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 240 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 240 transition count 284
Applied a total of 96 rules in 32 ms. Remains 240 /288 variables (removed 48) and now considering 284/340 (removed 56) transitions.
// Phase 1: matrix 284 rows 240 cols
[2021-05-09 17:49:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:49:28] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 284 rows 240 cols
[2021-05-09 17:49:28] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 17:49:28] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 240 cols
[2021-05-09 17:49:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:49:28] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 240/288 places, 284/340 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (NEQ s26 0) (NEQ s168 1)), p0:(AND (NEQ s168 0) (NEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 693 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-04 finished in 552 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 287 transition count 290
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 238 transition count 290
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 98 place count 238 transition count 250
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 178 place count 198 transition count 250
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 186 place count 190 transition count 240
Iterating global reduction 2 with 8 rules applied. Total rules applied 194 place count 190 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 194 place count 190 transition count 239
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 189 transition count 239
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 201 place count 184 transition count 232
Iterating global reduction 2 with 5 rules applied. Total rules applied 206 place count 184 transition count 232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 209 place count 181 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 212 place count 181 transition count 228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 213 place count 180 transition count 227
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 180 transition count 227
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 358 place count 108 transition count 155
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 370 place count 96 transition count 132
Iterating global reduction 2 with 12 rules applied. Total rules applied 382 place count 96 transition count 132
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 393 place count 85 transition count 119
Iterating global reduction 2 with 11 rules applied. Total rules applied 404 place count 85 transition count 119
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 415 place count 74 transition count 98
Iterating global reduction 2 with 11 rules applied. Total rules applied 426 place count 74 transition count 98
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 437 place count 63 transition count 86
Iterating global reduction 2 with 11 rules applied. Total rules applied 448 place count 63 transition count 86
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 459 place count 52 transition count 65
Iterating global reduction 2 with 11 rules applied. Total rules applied 470 place count 52 transition count 65
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 481 place count 41 transition count 53
Iterating global reduction 2 with 11 rules applied. Total rules applied 492 place count 41 transition count 53
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 494 place count 39 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 496 place count 39 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 497 place count 38 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 498 place count 38 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 499 place count 38 transition count 48
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 500 place count 38 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 501 place count 37 transition count 47
Reduce places removed 2 places and 0 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 2 with 10 rules applied. Total rules applied 511 place count 35 transition count 39
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 519 place count 27 transition count 39
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 541 place count 16 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 543 place count 15 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 544 place count 15 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 546 place count 15 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 547 place count 14 transition count 24
Applied a total of 547 rules in 58 ms. Remains 14 /288 variables (removed 274) and now considering 24/340 (removed 316) transitions.
[2021-05-09 17:49:28] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 14 cols
[2021-05-09 17:49:28] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 17:49:28] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 17:49:28] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 14 cols
[2021-05-09 17:49:28] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-09 17:49:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:49:28] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-09 17:49:28] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:49:28] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 14 cols
[2021-05-09 17:49:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:49:28] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/288 places, 24/340 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15b-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s2 0) (EQ s7 1)), p0:(OR (EQ s9 0) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-05 finished in 169 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G((p1||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 272 transition count 323
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 272 transition count 323
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 265 transition count 313
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 265 transition count 313
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 259 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 259 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 254 transition count 300
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 254 transition count 300
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 252 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 252 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 251 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 251 transition count 297
Applied a total of 74 rules in 21 ms. Remains 251 /288 variables (removed 37) and now considering 297/340 (removed 43) transitions.
// Phase 1: matrix 297 rows 251 cols
[2021-05-09 17:49:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:49:28] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 297 rows 251 cols
[2021-05-09 17:49:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:49:29] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
// Phase 1: matrix 297 rows 251 cols
[2021-05-09 17:49:29] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:49:29] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 251/288 places, 297/340 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DiscoveryGPU-PT-15b-06 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (NEQ s132 0) (NEQ s247 1)), p1:(AND (NEQ s194 0) (NEQ s213 1)), p2:(NEQ s53 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-06 finished in 517 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 273 transition count 325
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 273 transition count 325
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 264 transition count 312
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 264 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 257 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 257 transition count 304
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 250 transition count 295
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 250 transition count 295
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 248 transition count 293
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 248 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 247 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 247 transition count 292
Applied a total of 82 rules in 19 ms. Remains 247 /288 variables (removed 41) and now considering 292/340 (removed 48) transitions.
// Phase 1: matrix 292 rows 247 cols
[2021-05-09 17:49:29] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:49:29] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 292 rows 247 cols
[2021-05-09 17:49:29] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:49:29] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
// Phase 1: matrix 292 rows 247 cols
[2021-05-09 17:49:29] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:49:29] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 247/288 places, 292/340 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15b-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s126 0) (EQ s144 1) (EQ s195 0) (EQ s109 1)), p0:(OR (EQ s195 0) (EQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33376 reset in 200 ms.
Product exploration explored 100000 steps with 33432 reset in 181 ms.
Graph (complete) has 500 edges and 247 vertex of which 246 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 33431 reset in 166 ms.
Product exploration explored 100000 steps with 33231 reset in 181 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Support contains 4 out of 247 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 247/247 places, 292/292 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 247 transition count 292
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 33 place count 247 transition count 430
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 80 place count 247 transition count 430
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 99 place count 247 transition count 430
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 246 transition count 429
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 246 transition count 429
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -152
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 147 place count 246 transition count 581
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 159 place count 234 transition count 533
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 171 place count 234 transition count 533
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 205 place count 200 transition count 443
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 239 place count 200 transition count 443
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 272 place count 167 transition count 366
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 305 place count 167 transition count 366
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 316 place count 156 transition count 344
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 327 place count 156 transition count 344
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 349 place count 134 transition count 289
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 371 place count 134 transition count 289
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 412 place count 93 transition count 187
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 453 place count 93 transition count 187
Deduced a syphon composed of 57 places in 1 ms
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 478 place count 93 transition count 162
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 482 place count 89 transition count 154
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 486 place count 89 transition count 154
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 486 rules in 45 ms. Remains 89 /247 variables (removed 158) and now considering 154/292 (removed 138) transitions.
[2021-05-09 17:49:30] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-09 17:49:30] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
// Phase 1: matrix 142 rows 89 cols
[2021-05-09 17:49:30] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:49:30] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 89/247 places, 154/292 transitions.
Product exploration explored 100000 steps with 33346 reset in 425 ms.
Product exploration explored 100000 steps with 33368 reset in 463 ms.
[2021-05-09 17:49:31] [INFO ] Flatten gal took : 11 ms
[2021-05-09 17:49:31] [INFO ] Flatten gal took : 12 ms
[2021-05-09 17:49:31] [INFO ] Time to serialize gal into /tmp/LTL4334016863228409742.gal : 2 ms
[2021-05-09 17:49:31] [INFO ] Time to serialize properties into /tmp/LTL2507015779397232883.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4334016863228409742.gal, -t, CGAL, -LTL, /tmp/LTL2507015779397232883.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/LTL4334016863228409742.gal -t CGAL -LTL /tmp/LTL2507015779397232883.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p337==0)||(p186==1))"))U(X(G("((((p214==0)||(p245==1))||(p337==0))||(p186==1))")))))
Formula 0 simplified : !(G"((p337==0)||(p186==1))" U XG"((((p214==0)||(p245==1))||(p337==0))||(p186==1))")
Detected timeout of ITS tools.
[2021-05-09 17:49:46] [INFO ] Flatten gal took : 11 ms
[2021-05-09 17:49:46] [INFO ] Applying decomposition
[2021-05-09 17:49:46] [INFO ] Flatten gal took : 13 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/graph3020014658460777937.txt, -o, /tmp/graph3020014658460777937.bin, -w, /tmp/graph3020014658460777937.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/graph3020014658460777937.bin, -l, -1, -v, -w, /tmp/graph3020014658460777937.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 17:49:46] [INFO ] Decomposing Gal with order
[2021-05-09 17:49:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 17:49:47] [INFO ] Removed a total of 118 redundant transitions.
[2021-05-09 17:49:47] [INFO ] Flatten gal took : 23 ms
[2021-05-09 17:49:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2021-05-09 17:49:47] [INFO ] Time to serialize gal into /tmp/LTL5552380970809345909.gal : 4 ms
[2021-05-09 17:49:47] [INFO ] Time to serialize properties into /tmp/LTL7589650068184400877.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5552380970809345909.gal, -t, CGAL, -LTL, /tmp/LTL7589650068184400877.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/LTL5552380970809345909.gal -t CGAL -LTL /tmp/LTL7589650068184400877.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i19.u66.p337==0)||(i23.u7.p186==1))"))U(X(G("((((i15.u47.p214==0)||(i4.u51.p245==1))||(i19.u66.p337==0))||(i23.u7.p186==1))")))))
Formula 0 simplified : !(G"((i19.u66.p337==0)||(i23.u7.p186==1))" U XG"((((i15.u47.p214==0)||(i4.u51.p245==1))||(i19.u66.p337==0))||(i23.u7.p186==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15393749199052893684
[2021-05-09 17:50:02] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15393749199052893684
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/ltsmin15393749199052893684]
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/ltsmin15393749199052893684] 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/ltsmin15393749199052893684] 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 DiscoveryGPU-PT-15b-08 finished in 33810 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 287 transition count 291
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 239 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 238 transition count 290
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 98 place count 238 transition count 249
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 180 place count 197 transition count 249
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 188 place count 189 transition count 240
Iterating global reduction 3 with 8 rules applied. Total rules applied 196 place count 189 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 196 place count 189 transition count 239
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 188 transition count 239
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 203 place count 183 transition count 232
Iterating global reduction 3 with 5 rules applied. Total rules applied 208 place count 183 transition count 232
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 212 place count 179 transition count 226
Iterating global reduction 3 with 4 rules applied. Total rules applied 216 place count 179 transition count 226
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 218 place count 177 transition count 224
Iterating global reduction 3 with 2 rules applied. Total rules applied 220 place count 177 transition count 224
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 366 place count 104 transition count 151
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 379 place count 91 transition count 126
Iterating global reduction 3 with 13 rules applied. Total rules applied 392 place count 91 transition count 126
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 405 place count 78 transition count 111
Iterating global reduction 3 with 13 rules applied. Total rules applied 418 place count 78 transition count 111
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 430 place count 66 transition count 88
Iterating global reduction 3 with 12 rules applied. Total rules applied 442 place count 66 transition count 88
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 454 place count 54 transition count 75
Iterating global reduction 3 with 12 rules applied. Total rules applied 466 place count 54 transition count 75
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 478 place count 42 transition count 52
Iterating global reduction 3 with 12 rules applied. Total rules applied 490 place count 42 transition count 52
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 502 place count 30 transition count 39
Iterating global reduction 3 with 12 rules applied. Total rules applied 514 place count 30 transition count 39
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 516 place count 28 transition count 36
Iterating global reduction 3 with 2 rules applied. Total rules applied 518 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 519 place count 27 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 520 place count 27 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 521 place count 27 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 522 place count 27 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 523 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 7 rules applied. Total rules applied 530 place count 24 transition count 28
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 535 place count 19 transition count 28
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 553 place count 10 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 555 place count 10 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 556 place count 9 transition count 16
Applied a total of 556 rules in 37 ms. Remains 9 /288 variables (removed 279) and now considering 16/340 (removed 324) transitions.
[2021-05-09 17:50:03] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 17:50:03] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:50:03] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 17:50:03] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 17:50:03] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:50:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:50:03] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-09 17:50:03] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:50:03] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 17:50:03] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:50:03] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/288 places, 16/340 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s2 0) (NEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-10 finished in 148 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 271 transition count 322
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 271 transition count 322
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 261 transition count 308
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 261 transition count 308
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 253 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 253 transition count 299
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 246 transition count 290
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 246 transition count 290
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 243 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 243 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 241 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 241 transition count 285
Applied a total of 94 rules in 19 ms. Remains 241 /288 variables (removed 47) and now considering 285/340 (removed 55) transitions.
// Phase 1: matrix 285 rows 241 cols
[2021-05-09 17:50:03] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 17:50:03] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 285 rows 241 cols
[2021-05-09 17:50:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:50:03] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 285 rows 241 cols
[2021-05-09 17:50:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:50:03] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 241/288 places, 285/340 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s149 0) (EQ s214 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]]
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Graph (complete) has 490 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 241 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 241/241 places, 285/285 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 241 transition count 285
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 29 place count 241 transition count 422
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 77 place count 241 transition count 422
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 241 transition count 422
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 240 transition count 421
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 240 transition count 421
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -150
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 144 place count 240 transition count 571
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 158 place count 226 transition count 515
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 172 place count 226 transition count 515
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 214 place count 184 transition count 403
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 256 place count 184 transition count 403
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 298 place count 142 transition count 305
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 340 place count 142 transition count 305
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 353 place count 129 transition count 279
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 366 place count 129 transition count 279
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 391 place count 104 transition count 218
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 416 place count 104 transition count 218
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 464 place count 56 transition count 98
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 512 place count 56 transition count 98
Deduced a syphon composed of 36 places in 0 ms
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 525 place count 56 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 527 place count 54 transition count 81
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 529 place count 54 transition count 81
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 529 rules in 32 ms. Remains 54 /241 variables (removed 187) and now considering 81/285 (removed 204) transitions.
[2021-05-09 17:50:04] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 17:50:04] [INFO ] Flow matrix only has 77 transitions (discarded 4 similar events)
// Phase 1: matrix 77 rows 54 cols
[2021-05-09 17:50:04] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:50:04] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/241 places, 81/285 transitions.
Product exploration explored 100000 steps with 50000 reset in 443 ms.
Product exploration explored 100000 steps with 50000 reset in 435 ms.
[2021-05-09 17:50:05] [INFO ] Flatten gal took : 10 ms
[2021-05-09 17:50:05] [INFO ] Flatten gal took : 9 ms
[2021-05-09 17:50:05] [INFO ] Time to serialize gal into /tmp/LTL10760197629586909729.gal : 1 ms
[2021-05-09 17:50:05] [INFO ] Time to serialize properties into /tmp/LTL10266945130989906413.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/LTL10760197629586909729.gal, -t, CGAL, -LTL, /tmp/LTL10266945130989906413.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/LTL10760197629586909729.gal -t CGAL -LTL /tmp/LTL10266945130989906413.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p259==0)||(p387==1))"))))
Formula 0 simplified : !XF"((p259==0)||(p387==1))"
Detected timeout of ITS tools.
[2021-05-09 17:50:20] [INFO ] Flatten gal took : 9 ms
[2021-05-09 17:50:20] [INFO ] Applying decomposition
[2021-05-09 17:50:20] [INFO ] Flatten gal took : 9 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/graph13436191542517280356.txt, -o, /tmp/graph13436191542517280356.bin, -w, /tmp/graph13436191542517280356.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/graph13436191542517280356.bin, -l, -1, -v, -w, /tmp/graph13436191542517280356.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 17:50:20] [INFO ] Decomposing Gal with order
[2021-05-09 17:50:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 17:50:20] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-09 17:50:20] [INFO ] Flatten gal took : 16 ms
[2021-05-09 17:50:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 3 ms.
[2021-05-09 17:50:20] [INFO ] Time to serialize gal into /tmp/LTL10580779916888178808.gal : 3 ms
[2021-05-09 17:50:20] [INFO ] Time to serialize properties into /tmp/LTL12745999783423336784.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10580779916888178808.gal, -t, CGAL, -LTL, /tmp/LTL12745999783423336784.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/LTL10580779916888178808.gal -t CGAL -LTL /tmp/LTL12745999783423336784.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i15.u58.p259==0)||(i18.u76.p387==1))"))))
Formula 0 simplified : !XF"((i15.u58.p259==0)||(i18.u76.p387==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10991788771885514824
[2021-05-09 17:50:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10991788771885514824
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/ltsmin10991788771885514824]
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/ltsmin10991788771885514824] 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/ltsmin10991788771885514824] 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 DiscoveryGPU-PT-15b-11 finished in 33470 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 271 transition count 322
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 271 transition count 322
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 262 transition count 310
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 262 transition count 310
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 255 transition count 302
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 255 transition count 302
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 249 transition count 294
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 249 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 246 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 246 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 244 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 244 transition count 289
Applied a total of 88 rules in 25 ms. Remains 244 /288 variables (removed 44) and now considering 289/340 (removed 51) transitions.
// Phase 1: matrix 289 rows 244 cols
[2021-05-09 17:50:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:50:36] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 289 rows 244 cols
[2021-05-09 17:50:36] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:50:36] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 244 cols
[2021-05-09 17:50:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:50:37] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 244/288 places, 289/340 transitions.
Stuttering acceptance computed with spot in 183 ms :[p0, true, p0, p0]
Running random walk in product with property : DiscoveryGPU-PT-15b-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (EQ s43 0) (EQ s137 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2018 steps with 6 reset in 4 ms.
FORMULA DiscoveryGPU-PT-15b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-12 finished in 590 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 274 transition count 325
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 274 transition count 325
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 266 transition count 315
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 266 transition count 315
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 260 transition count 308
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 260 transition count 308
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 255 transition count 301
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 255 transition count 301
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 252 transition count 298
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 252 transition count 298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 250 transition count 296
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 250 transition count 296
Applied a total of 76 rules in 17 ms. Remains 250 /288 variables (removed 38) and now considering 296/340 (removed 44) transitions.
// Phase 1: matrix 296 rows 250 cols
[2021-05-09 17:50:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:50:37] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 296 rows 250 cols
[2021-05-09 17:50:37] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:50:37] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 250 cols
[2021-05-09 17:50:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:50:37] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/288 places, 296/340 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-13 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:(OR (EQ s227 0) (EQ s111 1)), p1:(AND (EQ s40 0) (EQ s85 1) (OR (EQ s35 0) (EQ s136 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2235 steps with 4 reset in 4 ms.
FORMULA DiscoveryGPU-PT-15b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-13 finished in 479 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 287 transition count 290
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 238 transition count 290
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 98 place count 238 transition count 250
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 178 place count 198 transition count 250
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 187 place count 189 transition count 239
Iterating global reduction 2 with 9 rules applied. Total rules applied 196 place count 189 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 196 place count 189 transition count 238
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 188 transition count 238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 204 place count 182 transition count 230
Iterating global reduction 2 with 6 rules applied. Total rules applied 210 place count 182 transition count 230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 214 place count 178 transition count 224
Iterating global reduction 2 with 4 rules applied. Total rules applied 218 place count 178 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 220 place count 176 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 176 transition count 222
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 370 place count 102 transition count 148
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 383 place count 89 transition count 123
Iterating global reduction 2 with 13 rules applied. Total rules applied 396 place count 89 transition count 123
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 409 place count 76 transition count 108
Iterating global reduction 2 with 13 rules applied. Total rules applied 422 place count 76 transition count 108
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 435 place count 63 transition count 83
Iterating global reduction 2 with 13 rules applied. Total rules applied 448 place count 63 transition count 83
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 460 place count 51 transition count 70
Iterating global reduction 2 with 12 rules applied. Total rules applied 472 place count 51 transition count 70
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 484 place count 39 transition count 47
Iterating global reduction 2 with 12 rules applied. Total rules applied 496 place count 39 transition count 47
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 508 place count 27 transition count 34
Iterating global reduction 2 with 12 rules applied. Total rules applied 520 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 522 place count 25 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 524 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 525 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 526 place count 24 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 527 place count 24 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 528 place count 23 transition count 28
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 536 place count 21 transition count 22
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 542 place count 15 transition count 22
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 552 place count 10 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 554 place count 9 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 555 place count 9 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 556 place count 8 transition count 15
Applied a total of 556 rules in 25 ms. Remains 8 /288 variables (removed 280) and now considering 15/340 (removed 325) transitions.
[2021-05-09 17:50:37] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 8 cols
[2021-05-09 17:50:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:50:37] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 17:50:37] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 8 cols
[2021-05-09 17:50:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:50:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:50:37] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-09 17:50:37] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:50:37] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 8 cols
[2021-05-09 17:50:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:50:37] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/288 places, 15/340 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s6 0) (NEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-14 finished in 86 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 340/340 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 270 transition count 321
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 270 transition count 321
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 260 transition count 307
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 260 transition count 307
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 252 transition count 298
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 252 transition count 298
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 79 place count 245 transition count 289
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 245 transition count 289
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 242 transition count 286
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 242 transition count 286
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 240 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 240 transition count 284
Applied a total of 96 rules in 18 ms. Remains 240 /288 variables (removed 48) and now considering 284/340 (removed 56) transitions.
// Phase 1: matrix 284 rows 240 cols
[2021-05-09 17:50:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:50:37] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 284 rows 240 cols
[2021-05-09 17:50:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:50:38] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 240 cols
[2021-05-09 17:50:38] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:50:38] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 240/288 places, 284/340 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-15 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s92 0) (NEQ s198 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-15 finished in 449 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15132927522464066685
[2021-05-09 17:50:38] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2021-05-09 17:50:38] [INFO ] Applying decomposition
[2021-05-09 17:50:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 17:50:38] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2021-05-09 17:50:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 17:50:38] [INFO ] Flatten gal took : 10 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/graph14362241246273026418.txt, -o, /tmp/graph14362241246273026418.bin, -w, /tmp/graph14362241246273026418.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/graph14362241246273026418.bin, -l, -1, -v, -w, /tmp/graph14362241246273026418.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 17:50:38] [INFO ] Decomposing Gal with order
[2021-05-09 17:50:38] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2021-05-09 17:50:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 17:50:38] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 17:50:38] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15132927522464066685
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/ltsmin15132927522464066685]
[2021-05-09 17:50:38] [INFO ] Removed a total of 133 redundant transitions.
[2021-05-09 17:50:38] [INFO ] Flatten gal took : 25 ms
[2021-05-09 17:50:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2021-05-09 17:50:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality8860383891352939489.gal : 3 ms
[2021-05-09 17:50:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality5163251668862991846.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/LTLCardinality8860383891352939489.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5163251668862991846.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/LTLCardinality8860383891352939489.gal -t CGAL -LTL /tmp/LTLCardinality5163251668862991846.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(X((F("(i4.u38.p139==1)"))||(("((i18.u56.p220==0)||(i9.u25.p80==1))")U(("((i1.i0.u0.p420==0)||(i9.u37.p125==1))")||(G("((i18.u56.p220==0)||(i9.u25.p80==1))"))))))))
Formula 0 simplified : !XX(F"(i4.u38.p139==1)" | ("((i18.u56.p220==0)||(i9.u25.p80==1))" U ("((i1.i0.u0.p420==0)||(i9.u37.p125==1))" | G"((i18.u56.p220==0)||(i9.u25.p80==1))")))
Compilation finished in 1712 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15132927522464066685]
Link finished in 43 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X((<>((LTLAPp0==true))||((LTLAPp1==true) U ([]((LTLAPp1==true))||(LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15132927522464066685]
LTSmin run took 1530 ms.
FORMULA DiscoveryGPU-PT-15b-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp3==true)) U X([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15132927522464066685]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp3==true)) U X([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15132927522464066685]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15132927522464066685]
LTSmin run took 474 ms.
FORMULA DiscoveryGPU-PT-15b-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp3==true)) U X([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15132927522464066685]
Detected timeout of ITS tools.
[2021-05-09 18:11:18] [INFO ] Applying decomposition
[2021-05-09 18:11:19] [INFO ] Flatten gal took : 135 ms
[2021-05-09 18:11:19] [INFO ] Decomposing Gal with order
[2021-05-09 18:11:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:11:19] [INFO ] Removed a total of 134 redundant transitions.
[2021-05-09 18:11:19] [INFO ] Flatten gal took : 83 ms
[2021-05-09 18:11:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 920 labels/synchronizations in 240 ms.
[2021-05-09 18:11:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality15380584862480801032.gal : 6 ms
[2021-05-09 18:11:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality8443967519477057052.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/LTLCardinality15380584862480801032.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8443967519477057052.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/LTLCardinality15380584862480801032.gal -t CGAL -LTL /tmp/LTLCardinality8443967519477057052.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i0.i0.i0.i0.u26.p337==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u21.p186==1))"))U(X(G("((((i0.i0.i0.i0.i0.i0.i0.i0.u22.p214==0)||(i0.i0.i0.i0.i0.i0.i0.u23.p245==1))||(i0.i0.i0.i0.u26.p337==0))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u21.p186==1))")))))
Formula 0 simplified : !(G"((i0.i0.i0.i0.u26.p337==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u21.p186==1))" U XG"((((i0.i0.i0.i0.i0.i0.i0.i0.u22.p214==0)||(i0.i0.i0.i0.i0.i0.i0.u23.p245==1))||(i0.i0.i0.i0.u26.p337==0))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u21.p186==1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: LTL layer: formula: ([]((LTLAPp3==true)) U X([]((LTLAPp4==true))))
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: "([]((LTLAPp3==true)) U X([]((LTLAPp4==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.215: There are 347 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.215: State length is 289, there are 355 groups
pins2lts-mc-linux64( 0/ 8), 0.215: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.215: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.215: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.215: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.323: [Blue] ~120 levels ~960 states ~4720 transitions
pins2lts-mc-linux64( 5/ 8), 0.327: [Blue] ~240 levels ~1920 states ~11128 transitions
pins2lts-mc-linux64( 5/ 8), 0.346: [Blue] ~480 levels ~3840 states ~26600 transitions
pins2lts-mc-linux64( 5/ 8), 0.372: [Blue] ~960 levels ~7680 states ~51120 transitions
pins2lts-mc-linux64( 5/ 8), 0.419: [Blue] ~1457 levels ~15360 states ~79056 transitions
pins2lts-mc-linux64( 2/ 8), 0.507: [Blue] ~1560 levels ~30720 states ~168592 transitions
pins2lts-mc-linux64( 2/ 8), 0.719: [Blue] ~1612 levels ~61440 states ~281456 transitions
pins2lts-mc-linux64( 2/ 8), 1.071: [Blue] ~1612 levels ~122880 states ~526832 transitions
pins2lts-mc-linux64( 6/ 8), 1.826: [Blue] ~1220 levels ~245760 states ~985328 transitions
pins2lts-mc-linux64( 5/ 8), 3.327: [Blue] ~1627 levels ~491520 states ~2044272 transitions
pins2lts-mc-linux64( 7/ 8), 5.895: [Blue] ~2638 levels ~983040 states ~4490872 transitions
pins2lts-mc-linux64( 2/ 8), 10.475: [Blue] ~1765 levels ~1966080 states ~9049912 transitions
pins2lts-mc-linux64( 2/ 8), 24.002: [Blue] ~2087 levels ~3932160 states ~18596064 transitions
pins2lts-mc-linux64( 2/ 8), 52.450: [Blue] ~2087 levels ~7864320 states ~40183144 transitions
pins2lts-mc-linux64( 3/ 8), 110.512: [Blue] ~2089 levels ~15728640 states ~82873552 transitions
pins2lts-mc-linux64( 3/ 8), 228.758: [Blue] ~2102 levels ~31457280 states ~170860256 transitions
pins2lts-mc-linux64( 3/ 8), 468.795: [Blue] ~2102 levels ~62914560 states ~353731296 transitions
pins2lts-mc-linux64( 3/ 8), 963.125: [Blue] ~2775 levels ~125829120 states ~719606984 transitions
pins2lts-mc-linux64( 7/ 8), 1102.009: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1107.658:
pins2lts-mc-linux64( 0/ 8), 1107.658: Explored 134186218 states 794034334 transitions, fanout: 5.917
pins2lts-mc-linux64( 0/ 8), 1107.658: Total exploration time 1101.800 sec (1101.780 sec minimum, 1101.791 sec on average)
pins2lts-mc-linux64( 0/ 8), 1107.658: States per second: 121788, Transitions per second: 720670
pins2lts-mc-linux64( 0/ 8), 1107.658:
pins2lts-mc-linux64( 0/ 8), 1107.658: State space has 134217289 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1107.658: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1107.658: blue states: 134186218 (99.98%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1107.658: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1107.658: all-red states: 56 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1107.658:
pins2lts-mc-linux64( 0/ 8), 1107.658: Total memory used for local state coloring: 0.3MB
pins2lts-mc-linux64( 0/ 8), 1107.658:
pins2lts-mc-linux64( 0/ 8), 1107.658: Queue width: 8B, total height: 21072, memory: 0.16MB
pins2lts-mc-linux64( 0/ 8), 1107.658: Tree memory: 1064.9MB, 8.3 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1107.658: Tree fill ratio (roots/leafs): 99.0%/15.0%
pins2lts-mc-linux64( 0/ 8), 1107.678: Stored 358 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1107.679: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1107.679: Est. total memory use: 1065.1MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp3==true)) U X([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15132927522464066685]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp3==true)) U X([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15132927522464066685]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 18:31:55] [INFO ] Flatten gal took : 13 ms
[2021-05-09 18:31:55] [INFO ] Input system was already deterministic with 340 transitions.
[2021-05-09 18:31:55] [INFO ] Transformed 288 places.
[2021-05-09 18:31:55] [INFO ] Transformed 340 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 18:31:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality712666132079012666.gal : 1 ms
[2021-05-09 18:31:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality13795925034261169128.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/LTLCardinality712666132079012666.gal, -t, CGAL, -LTL, /tmp/LTLCardinality13795925034261169128.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality712666132079012666.gal -t CGAL -LTL /tmp/LTLCardinality13795925034261169128.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((p337==0)||(p186==1))"))U(X(G("((((p214==0)||(p245==1))||(p337==0))||(p186==1))")))))
Formula 0 simplified : !(G"((p337==0)||(p186==1))" U XG"((((p214==0)||(p245==1))||(p337==0))||(p186==1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-15b"
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 DiscoveryGPU-PT-15b, 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 r083-tall-162048875300388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-15b.tgz
mv DiscoveryGPU-PT-15b 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 ;