Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460700238.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S05J40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460700238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 10:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 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 PolyORBNT-COL-S05J40-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717126088564

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-31 03:28:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 03:28:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:28:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 03:28:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 03:28:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 554 ms
[2024-05-31 03:28:11] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 03:28:11] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-31 03:28:11] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 790 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 255 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 236 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 03:28:12] [INFO ] Computed 13 invariants in 5 ms
[2024-05-31 03:28:12] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-31 03:28:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 03:28:12] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 03:28:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:28:12] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 03:28:12] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 5 ms to minimize.
[2024-05-31 03:28:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-31 03:28:12] [INFO ] After 89ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:28:12] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:28:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-31 03:28:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:28:12] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:28:12] [INFO ] After 49ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:28:12] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-31 03:28:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-05-31 03:28:12] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-31 03:28:12] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
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 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 27 place count 34 transition count 28
Applied a total of 27 rules in 27 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2024-05-31 03:28:12] [INFO ] Computed 12 invariants in 6 ms
[2024-05-31 03:28:12] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10000 steps, including 1173 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 361 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Probably explored full state space saw : 335 states, properties seen :0
Probabilistic random walk after 889 steps, saw 335 distinct states, run finished after 15 ms. (steps per millisecond=59 ) properties seen :0
Explored full state space saw : 335 states, properties seen :0
Exhaustive walk after 889 steps, saw 335 distinct states, run finished after 3 ms. (steps per millisecond=296 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 03:28:12] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-31 03:28:12] [INFO ] Flatten gal took : 27 ms
FORMULA PolyORBNT-COL-S05J40-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 03:28:12] [INFO ] Flatten gal took : 7 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-31 03:28:13] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 49 ms.
[2024-05-31 03:28:13] [INFO ] Unfolded 11 HLPN properties in 0 ms.
[2024-05-31 03:28:13] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 190 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 934
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 934
Applied a total of 7 rules in 73 ms. Remains 623 /629 variables (removed 6) and now considering 934/935 (removed 1) transitions.
[2024-05-31 03:28:13] [INFO ] Flow matrix only has 930 transitions (discarded 4 similar events)
// Phase 1: matrix 930 rows 623 cols
[2024-05-31 03:28:13] [INFO ] Computed 97 invariants in 86 ms
[2024-05-31 03:28:14] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2024-05-31 03:28:14] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-05-31 03:28:14] [INFO ] Computed 97 invariants in 34 ms
[2024-05-31 03:28:14] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-31 03:28:14] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:28:14] [INFO ] Invariant cache hit.
[2024-05-31 03:28:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:28:16] [INFO ] Implicit Places using invariants and state equation in 2199 ms returned []
Implicit Place search using SMT with State Equation took 2621 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/935 transitions.
Applied a total of 0 rules in 20 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3639 ms. Remains : 623/629 places, 839/935 transitions.
Support contains 190 out of 623 places after structural reductions.
[2024-05-31 03:28:16] [INFO ] Flatten gal took : 96 ms
[2024-05-31 03:28:17] [INFO ] Flatten gal took : 103 ms
[2024-05-31 03:28:17] [INFO ] Input system was already deterministic with 839 transitions.
Incomplete random walk after 10000 steps, including 686 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-31 03:28:17] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:28:17] [INFO ] Invariant cache hit.
[2024-05-31 03:28:17] [INFO ] [Real]Absence check using 91 positive place invariants in 22 ms returned sat
[2024-05-31 03:28:17] [INFO ] [Real]Absence check using 91 positive and 6 generalized place invariants in 10 ms returned sat
[2024-05-31 03:28:17] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:28:17] [INFO ] [Nat]Absence check using 91 positive place invariants in 20 ms returned sat
[2024-05-31 03:28:17] [INFO ] [Nat]Absence check using 91 positive and 6 generalized place invariants in 12 ms returned sat
[2024-05-31 03:28:18] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:28:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:28:18] [INFO ] After 97ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:28:18] [INFO ] Deduced a trap composed of 268 places in 329 ms of which 2 ms to minimize.
[2024-05-31 03:28:18] [INFO ] Deduced a trap composed of 265 places in 291 ms of which 1 ms to minimize.
[2024-05-31 03:28:19] [INFO ] Deduced a trap composed of 268 places in 254 ms of which 1 ms to minimize.
[2024-05-31 03:28:19] [INFO ] Deduced a trap composed of 259 places in 242 ms of which 1 ms to minimize.
[2024-05-31 03:28:19] [INFO ] Deduced a trap composed of 259 places in 229 ms of which 1 ms to minimize.
[2024-05-31 03:28:20] [INFO ] Deduced a trap composed of 250 places in 212 ms of which 0 ms to minimize.
[2024-05-31 03:28:20] [INFO ] Deduced a trap composed of 259 places in 259 ms of which 1 ms to minimize.
[2024-05-31 03:28:20] [INFO ] Deduced a trap composed of 253 places in 255 ms of which 1 ms to minimize.
[2024-05-31 03:28:21] [INFO ] Deduced a trap composed of 253 places in 256 ms of which 0 ms to minimize.
[2024-05-31 03:28:21] [INFO ] Deduced a trap composed of 241 places in 178 ms of which 0 ms to minimize.
[2024-05-31 03:28:21] [INFO ] Deduced a trap composed of 256 places in 194 ms of which 1 ms to minimize.
[2024-05-31 03:28:21] [INFO ] Deduced a trap composed of 271 places in 227 ms of which 0 ms to minimize.
[2024-05-31 03:28:22] [INFO ] Deduced a trap composed of 271 places in 299 ms of which 0 ms to minimize.
[2024-05-31 03:28:22] [INFO ] Deduced a trap composed of 247 places in 259 ms of which 1 ms to minimize.
[2024-05-31 03:28:23] [INFO ] Deduced a trap composed of 265 places in 226 ms of which 0 ms to minimize.
[2024-05-31 03:28:23] [INFO ] Deduced a trap composed of 268 places in 226 ms of which 1 ms to minimize.
[2024-05-31 03:28:24] [INFO ] Deduced a trap composed of 268 places in 339 ms of which 0 ms to minimize.
[2024-05-31 03:28:24] [INFO ] Deduced a trap composed of 265 places in 264 ms of which 1 ms to minimize.
[2024-05-31 03:28:25] [INFO ] Deduced a trap composed of 253 places in 263 ms of which 2 ms to minimize.
[2024-05-31 03:28:25] [INFO ] Deduced a trap composed of 253 places in 252 ms of which 0 ms to minimize.
[2024-05-31 03:28:25] [INFO ] Deduced a trap composed of 262 places in 278 ms of which 0 ms to minimize.
[2024-05-31 03:28:26] [INFO ] Deduced a trap composed of 256 places in 262 ms of which 1 ms to minimize.
[2024-05-31 03:28:26] [INFO ] Deduced a trap composed of 256 places in 234 ms of which 0 ms to minimize.
[2024-05-31 03:28:27] [INFO ] Deduced a trap composed of 268 places in 276 ms of which 1 ms to minimize.
[2024-05-31 03:28:27] [INFO ] Deduced a trap composed of 256 places in 406 ms of which 2 ms to minimize.
[2024-05-31 03:28:28] [INFO ] Deduced a trap composed of 268 places in 285 ms of which 1 ms to minimize.
[2024-05-31 03:28:28] [INFO ] Deduced a trap composed of 250 places in 294 ms of which 1 ms to minimize.
[2024-05-31 03:28:29] [INFO ] Deduced a trap composed of 253 places in 361 ms of which 0 ms to minimize.
[2024-05-31 03:28:30] [INFO ] Deduced a trap composed of 268 places in 313 ms of which 1 ms to minimize.
[2024-05-31 03:28:30] [INFO ] Deduced a trap composed of 259 places in 279 ms of which 1 ms to minimize.
[2024-05-31 03:28:32] [INFO ] Deduced a trap composed of 259 places in 276 ms of which 2 ms to minimize.
[2024-05-31 03:28:33] [INFO ] Deduced a trap composed of 244 places in 273 ms of which 2 ms to minimize.
[2024-05-31 03:28:42] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 24298 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 03:28:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 03:28:42] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 839/839 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 623 transition count 794
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 578 transition count 794
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 578 transition count 749
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 533 transition count 749
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 186 place count 530 transition count 746
Applied a total of 186 rules in 74 ms. Remains 530 /623 variables (removed 93) and now considering 746/839 (removed 93) transitions.
[2024-05-31 03:28:42] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2024-05-31 03:28:42] [INFO ] Computed 97 invariants in 23 ms
[2024-05-31 03:28:43] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 676 ms. Remains : 530/623 places, 746/839 transitions.
Incomplete random walk after 10000 steps, including 532 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 474430 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 474430 steps, saw 143797 distinct states, run finished after 3010 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 03:28:46] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:28:46] [INFO ] Invariant cache hit.
[2024-05-31 03:28:46] [INFO ] [Real]Absence check using 90 positive place invariants in 22 ms returned sat
[2024-05-31 03:28:46] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-31 03:28:46] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:28:46] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2024-05-31 03:28:46] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 03:28:46] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:28:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:28:47] [INFO ] After 105ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:28:47] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 0 ms to minimize.
[2024-05-31 03:28:47] [INFO ] Deduced a trap composed of 161 places in 163 ms of which 1 ms to minimize.
[2024-05-31 03:28:47] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 0 ms to minimize.
[2024-05-31 03:28:47] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 0 ms to minimize.
[2024-05-31 03:28:48] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 1 ms to minimize.
[2024-05-31 03:28:48] [INFO ] Deduced a trap composed of 170 places in 195 ms of which 0 ms to minimize.
[2024-05-31 03:28:48] [INFO ] Deduced a trap composed of 167 places in 234 ms of which 0 ms to minimize.
[2024-05-31 03:28:48] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2024-05-31 03:28:49] [INFO ] Deduced a trap composed of 168 places in 169 ms of which 0 ms to minimize.
[2024-05-31 03:28:49] [INFO ] Deduced a trap composed of 176 places in 233 ms of which 1 ms to minimize.
[2024-05-31 03:28:49] [INFO ] Deduced a trap composed of 176 places in 217 ms of which 1 ms to minimize.
[2024-05-31 03:28:50] [INFO ] Deduced a trap composed of 152 places in 213 ms of which 2 ms to minimize.
[2024-05-31 03:28:50] [INFO ] Deduced a trap composed of 167 places in 229 ms of which 1 ms to minimize.
[2024-05-31 03:28:50] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2024-05-31 03:28:50] [INFO ] Deduced a trap composed of 173 places in 193 ms of which 0 ms to minimize.
[2024-05-31 03:28:51] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2024-05-31 03:28:51] [INFO ] Deduced a trap composed of 161 places in 192 ms of which 1 ms to minimize.
[2024-05-31 03:28:51] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2024-05-31 03:28:51] [INFO ] Deduced a trap composed of 170 places in 175 ms of which 1 ms to minimize.
[2024-05-31 03:28:52] [INFO ] Deduced a trap composed of 167 places in 214 ms of which 1 ms to minimize.
[2024-05-31 03:28:52] [INFO ] Deduced a trap composed of 161 places in 239 ms of which 1 ms to minimize.
[2024-05-31 03:28:53] [INFO ] Deduced a trap composed of 167 places in 197 ms of which 5 ms to minimize.
[2024-05-31 03:28:53] [INFO ] Deduced a trap composed of 170 places in 193 ms of which 1 ms to minimize.
[2024-05-31 03:28:54] [INFO ] Deduced a trap composed of 173 places in 168 ms of which 1 ms to minimize.
[2024-05-31 03:28:54] [INFO ] Deduced a trap composed of 170 places in 243 ms of which 0 ms to minimize.
[2024-05-31 03:28:55] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 1 ms to minimize.
[2024-05-31 03:28:56] [INFO ] Deduced a trap composed of 173 places in 204 ms of which 0 ms to minimize.
[2024-05-31 03:28:57] [INFO ] Deduced a trap composed of 177 places in 183 ms of which 1 ms to minimize.
[2024-05-31 03:29:01] [INFO ] Deduced a trap composed of 176 places in 223 ms of which 1 ms to minimize.
[2024-05-31 03:29:10] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 23190 ms
[2024-05-31 03:29:10] [INFO ] After 23412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:29:10] [INFO ] After 23723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 64 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 41 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2024-05-31 03:29:10] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:29:10] [INFO ] Invariant cache hit.
[2024-05-31 03:29:11] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-31 03:29:11] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:29:11] [INFO ] Invariant cache hit.
[2024-05-31 03:29:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:29:14] [INFO ] Implicit Places using invariants and state equation in 2708 ms returned []
Implicit Place search using SMT with State Equation took 3652 ms to find 0 implicit places.
[2024-05-31 03:29:14] [INFO ] Redundant transitions in 85 ms returned []
[2024-05-31 03:29:14] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:29:14] [INFO ] Invariant cache hit.
[2024-05-31 03:29:15] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4659 ms. Remains : 530/530 places, 746/746 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 530 transition count 741
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 155 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2024-05-31 03:29:15] [INFO ] Computed 97 invariants in 20 ms
[2024-05-31 03:29:15] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2024-05-31 03:29:15] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 03:29:15] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:29:15] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2024-05-31 03:29:15] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 03:29:15] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:29:16] [INFO ] Deduced a trap composed of 165 places in 241 ms of which 1 ms to minimize.
[2024-05-31 03:29:16] [INFO ] Deduced a trap composed of 150 places in 248 ms of which 6 ms to minimize.
[2024-05-31 03:29:16] [INFO ] Deduced a trap composed of 171 places in 241 ms of which 1 ms to minimize.
[2024-05-31 03:29:17] [INFO ] Deduced a trap composed of 183 places in 529 ms of which 1 ms to minimize.
[2024-05-31 03:29:17] [INFO ] Deduced a trap composed of 174 places in 282 ms of which 1 ms to minimize.
[2024-05-31 03:29:17] [INFO ] Deduced a trap composed of 165 places in 229 ms of which 0 ms to minimize.
[2024-05-31 03:29:18] [INFO ] Deduced a trap composed of 147 places in 292 ms of which 1 ms to minimize.
[2024-05-31 03:29:18] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2024-05-31 03:29:18] [INFO ] Deduced a trap composed of 165 places in 241 ms of which 1 ms to minimize.
[2024-05-31 03:29:19] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 1 ms to minimize.
[2024-05-31 03:29:19] [INFO ] Deduced a trap composed of 153 places in 192 ms of which 0 ms to minimize.
[2024-05-31 03:29:19] [INFO ] Deduced a trap composed of 171 places in 192 ms of which 0 ms to minimize.
[2024-05-31 03:29:19] [INFO ] Deduced a trap composed of 177 places in 225 ms of which 0 ms to minimize.
[2024-05-31 03:29:20] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 1 ms to minimize.
[2024-05-31 03:29:20] [INFO ] Deduced a trap composed of 171 places in 355 ms of which 1 ms to minimize.
[2024-05-31 03:29:21] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 0 ms to minimize.
[2024-05-31 03:29:27] [INFO ] Deduced a trap composed of 168 places in 6561 ms of which 1 ms to minimize.
[2024-05-31 03:29:27] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2024-05-31 03:29:28] [INFO ] Deduced a trap composed of 174 places in 296 ms of which 1 ms to minimize.
[2024-05-31 03:29:28] [INFO ] Deduced a trap composed of 153 places in 245 ms of which 0 ms to minimize.
[2024-05-31 03:29:28] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2024-05-31 03:29:29] [INFO ] Deduced a trap composed of 153 places in 173 ms of which 0 ms to minimize.
[2024-05-31 03:29:29] [INFO ] Deduced a trap composed of 183 places in 171 ms of which 1 ms to minimize.
[2024-05-31 03:29:29] [INFO ] Deduced a trap composed of 183 places in 225 ms of which 1 ms to minimize.
[2024-05-31 03:29:29] [INFO ] Deduced a trap composed of 171 places in 192 ms of which 1 ms to minimize.
[2024-05-31 03:29:30] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 0 ms to minimize.
[2024-05-31 03:29:30] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2024-05-31 03:29:30] [INFO ] Deduced a trap composed of 174 places in 224 ms of which 1 ms to minimize.
[2024-05-31 03:29:30] [INFO ] Deduced a trap composed of 159 places in 291 ms of which 1 ms to minimize.
[2024-05-31 03:29:31] [INFO ] Deduced a trap composed of 171 places in 276 ms of which 0 ms to minimize.
[2024-05-31 03:29:31] [INFO ] Deduced a trap composed of 168 places in 350 ms of which 1 ms to minimize.
[2024-05-31 03:29:32] [INFO ] Deduced a trap composed of 168 places in 258 ms of which 1 ms to minimize.
[2024-05-31 03:29:36] [INFO ] Deduced a trap composed of 156 places in 3722 ms of which 1 ms to minimize.
[2024-05-31 03:29:36] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 1 ms to minimize.
[2024-05-31 03:29:36] [INFO ] Deduced a trap composed of 150 places in 212 ms of which 0 ms to minimize.
[2024-05-31 03:29:36] [INFO ] Deduced a trap composed of 165 places in 199 ms of which 0 ms to minimize.
[2024-05-31 03:29:37] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 1 ms to minimize.
[2024-05-31 03:29:37] [INFO ] Deduced a trap composed of 177 places in 183 ms of which 1 ms to minimize.
[2024-05-31 03:29:37] [INFO ] Deduced a trap composed of 159 places in 231 ms of which 1 ms to minimize.
[2024-05-31 03:29:38] [INFO ] Deduced a trap composed of 153 places in 197 ms of which 0 ms to minimize.
[2024-05-31 03:29:38] [INFO ] Deduced a trap composed of 171 places in 221 ms of which 1 ms to minimize.
[2024-05-31 03:29:38] [INFO ] Deduced a trap composed of 165 places in 232 ms of which 1 ms to minimize.
[2024-05-31 03:29:38] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 1 ms to minimize.
[2024-05-31 03:29:39] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 1 ms to minimize.
[2024-05-31 03:29:39] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 0 ms to minimize.
[2024-05-31 03:29:39] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2024-05-31 03:29:40] [INFO ] Deduced a trap composed of 159 places in 195 ms of which 0 ms to minimize.
[2024-05-31 03:29:40] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 0 ms to minimize.
[2024-05-31 03:29:40] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 0 ms to minimize.
[2024-05-31 03:29:40] [INFO ] Deduced a trap composed of 159 places in 203 ms of which 1 ms to minimize.
[2024-05-31 03:29:41] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 1 ms to minimize.
[2024-05-31 03:29:41] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2024-05-31 03:29:41] [INFO ] Deduced a trap composed of 174 places in 214 ms of which 1 ms to minimize.
[2024-05-31 03:29:42] [INFO ] Deduced a trap composed of 171 places in 234 ms of which 1 ms to minimize.
[2024-05-31 03:29:42] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 1 ms to minimize.
[2024-05-31 03:29:43] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 0 ms to minimize.
[2024-05-31 03:29:43] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 0 ms to minimize.
[2024-05-31 03:29:43] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 1 ms to minimize.
[2024-05-31 03:29:43] [INFO ] Deduced a trap composed of 165 places in 243 ms of which 1 ms to minimize.
[2024-05-31 03:29:44] [INFO ] Deduced a trap composed of 159 places in 202 ms of which 0 ms to minimize.
[2024-05-31 03:29:44] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 1 ms to minimize.
[2024-05-31 03:29:45] [INFO ] Deduced a trap composed of 171 places in 224 ms of which 0 ms to minimize.
[2024-05-31 03:29:45] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 1 ms to minimize.
[2024-05-31 03:29:45] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2024-05-31 03:29:46] [INFO ] Deduced a trap composed of 165 places in 240 ms of which 1 ms to minimize.
[2024-05-31 03:29:46] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 1 ms to minimize.
[2024-05-31 03:29:46] [INFO ] Deduced a trap composed of 165 places in 216 ms of which 1 ms to minimize.
[2024-05-31 03:29:46] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2024-05-31 03:29:47] [INFO ] Deduced a trap composed of 165 places in 233 ms of which 1 ms to minimize.
[2024-05-31 03:29:47] [INFO ] Deduced a trap composed of 171 places in 234 ms of which 0 ms to minimize.
[2024-05-31 03:29:48] [INFO ] Deduced a trap composed of 153 places in 235 ms of which 1 ms to minimize.
[2024-05-31 03:29:48] [INFO ] Deduced a trap composed of 165 places in 229 ms of which 1 ms to minimize.
[2024-05-31 03:29:49] [INFO ] Deduced a trap composed of 171 places in 233 ms of which 0 ms to minimize.
[2024-05-31 03:29:49] [INFO ] Deduced a trap composed of 156 places in 248 ms of which 1 ms to minimize.
[2024-05-31 03:29:50] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2024-05-31 03:29:51] [INFO ] Deduced a trap composed of 159 places in 231 ms of which 1 ms to minimize.
[2024-05-31 03:29:52] [INFO ] Deduced a trap composed of 150 places in 220 ms of which 0 ms to minimize.
[2024-05-31 03:29:52] [INFO ] Deduced a trap composed of 156 places in 231 ms of which 1 ms to minimize.
[2024-05-31 03:29:53] [INFO ] Deduced a trap composed of 156 places in 238 ms of which 3 ms to minimize.
[2024-05-31 03:29:54] [INFO ] Deduced a trap composed of 168 places in 234 ms of which 1 ms to minimize.
[2024-05-31 03:29:54] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 0 ms to minimize.
[2024-05-31 03:29:54] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 1 ms to minimize.
[2024-05-31 03:29:55] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 0 ms to minimize.
[2024-05-31 03:29:55] [INFO ] Deduced a trap composed of 168 places in 234 ms of which 0 ms to minimize.
[2024-05-31 03:29:56] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2024-05-31 03:29:57] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 1 ms to minimize.
[2024-05-31 03:29:58] [INFO ] Deduced a trap composed of 165 places in 236 ms of which 1 ms to minimize.
[2024-05-31 03:30:00] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 1 ms to minimize.
[2024-05-31 03:30:00] [INFO ] Deduced a trap composed of 171 places in 240 ms of which 0 ms to minimize.
[2024-05-31 03:30:00] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2024-05-31 03:30:01] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 0 ms to minimize.
[2024-05-31 03:30:01] [INFO ] Deduced a trap composed of 165 places in 232 ms of which 1 ms to minimize.
[2024-05-31 03:30:02] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 1 ms to minimize.
[2024-05-31 03:30:02] [INFO ] Deduced a trap composed of 165 places in 214 ms of which 1 ms to minimize.
[2024-05-31 03:30:02] [INFO ] Deduced a trap composed of 171 places in 244 ms of which 0 ms to minimize.
[2024-05-31 03:30:03] [INFO ] Deduced a trap composed of 153 places in 238 ms of which 0 ms to minimize.
[2024-05-31 03:30:03] [INFO ] Deduced a trap composed of 153 places in 224 ms of which 1 ms to minimize.
[2024-05-31 03:30:03] [INFO ] Deduced a trap composed of 183 places in 218 ms of which 1 ms to minimize.
[2024-05-31 03:30:03] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2024-05-31 03:30:04] [INFO ] Deduced a trap composed of 150 places in 203 ms of which 1 ms to minimize.
[2024-05-31 03:30:04] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 0 ms to minimize.
[2024-05-31 03:30:05] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2024-05-31 03:30:06] [INFO ] Deduced a trap composed of 169 places in 233 ms of which 0 ms to minimize.
[2024-05-31 03:30:07] [INFO ] Deduced a trap composed of 153 places in 230 ms of which 1 ms to minimize.
[2024-05-31 03:30:07] [INFO ] Deduced a trap composed of 165 places in 239 ms of which 0 ms to minimize.
[2024-05-31 03:30:08] [INFO ] Deduced a trap composed of 171 places in 219 ms of which 1 ms to minimize.
[2024-05-31 03:30:08] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 1 ms to minimize.
[2024-05-31 03:30:09] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 1 ms to minimize.
[2024-05-31 03:30:09] [INFO ] Deduced a trap composed of 159 places in 217 ms of which 1 ms to minimize.
[2024-05-31 03:30:10] [INFO ] Deduced a trap composed of 171 places in 250 ms of which 1 ms to minimize.
[2024-05-31 03:30:10] [INFO ] Deduced a trap composed of 177 places in 237 ms of which 0 ms to minimize.
[2024-05-31 03:30:11] [INFO ] Deduced a trap composed of 153 places in 220 ms of which 0 ms to minimize.
[2024-05-31 03:30:13] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 1 ms to minimize.
[2024-05-31 03:30:14] [INFO ] Deduced a trap composed of 165 places in 231 ms of which 0 ms to minimize.
[2024-05-31 03:30:16] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 1 ms to minimize.
[2024-05-31 03:30:17] [INFO ] Deduced a trap composed of 159 places in 231 ms of which 0 ms to minimize.
[2024-05-31 03:30:18] [INFO ] Deduced a trap composed of 165 places in 239 ms of which 0 ms to minimize.
[2024-05-31 03:30:18] [INFO ] Deduced a trap composed of 183 places in 235 ms of which 1 ms to minimize.
[2024-05-31 03:30:19] [INFO ] Deduced a trap composed of 165 places in 235 ms of which 0 ms to minimize.
[2024-05-31 03:30:21] [INFO ] Deduced a trap composed of 177 places in 223 ms of which 0 ms to minimize.
[2024-05-31 03:30:30] [INFO ] Trap strengthening (SAT) tested/added 120/120 trap constraints in 74370 ms
[2024-05-31 03:30:30] [INFO ] After 74739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:30:30] [INFO ] After 74924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBNT-COL-S05J40-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBNT-COL-S05J40-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 623 transition count 794
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 578 transition count 794
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 578 transition count 750
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 178 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 182 place count 532 transition count 748
Applied a total of 182 rules in 65 ms. Remains 532 /623 variables (removed 91) and now considering 748/839 (removed 91) transitions.
[2024-05-31 03:30:30] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-05-31 03:30:30] [INFO ] Computed 97 invariants in 14 ms
[2024-05-31 03:30:31] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
[2024-05-31 03:30:31] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-31 03:30:31] [INFO ] Invariant cache hit.
[2024-05-31 03:30:31] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-31 03:30:31] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-31 03:30:31] [INFO ] Invariant cache hit.
[2024-05-31 03:30:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:30:33] [INFO ] Implicit Places using invariants and state equation in 1901 ms returned []
Implicit Place search using SMT with State Equation took 2480 ms to find 0 implicit places.
[2024-05-31 03:30:33] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-31 03:30:33] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-31 03:30:33] [INFO ] Invariant cache hit.
[2024-05-31 03:30:34] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/623 places, 748/839 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3605 ms. Remains : 532/623 places, 748/839 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s529 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 4 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-03 finished in 3899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(!p0))||(p1&&X(F(!p0)))))&&X(p2)))'
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Applied a total of 0 rules in 19 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
[2024-05-31 03:30:34] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-05-31 03:30:34] [INFO ] Computed 97 invariants in 16 ms
[2024-05-31 03:30:35] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
[2024-05-31 03:30:35] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:35] [INFO ] Invariant cache hit.
[2024-05-31 03:30:35] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-31 03:30:35] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:35] [INFO ] Invariant cache hit.
[2024-05-31 03:30:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:30:39] [INFO ] Implicit Places using invariants and state equation in 3709 ms returned []
Implicit Place search using SMT with State Equation took 4135 ms to find 0 implicit places.
[2024-05-31 03:30:39] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:39] [INFO ] Invariant cache hit.
[2024-05-31 03:30:40] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5605 ms. Remains : 623/623 places, 839/839 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) p0), p0, (NOT p2), p0, true]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s214 1) (LT s480 1)), p0:(GEQ s619 1), p2:(GEQ s258 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-05 finished in 5898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||X(G(p1))))))'
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Applied a total of 0 rules in 14 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
[2024-05-31 03:30:40] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:40] [INFO ] Invariant cache hit.
[2024-05-31 03:30:41] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
[2024-05-31 03:30:41] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:41] [INFO ] Invariant cache hit.
[2024-05-31 03:30:41] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-31 03:30:41] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:41] [INFO ] Invariant cache hit.
[2024-05-31 03:30:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:30:44] [INFO ] Implicit Places using invariants and state equation in 2635 ms returned []
Implicit Place search using SMT with State Equation took 3177 ms to find 0 implicit places.
[2024-05-31 03:30:44] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:44] [INFO ] Invariant cache hit.
[2024-05-31 03:30:44] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4494 ms. Remains : 623/623 places, 839/839 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s533 1) (GEQ s621 10)), p0:(GEQ s619 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-06 finished in 4686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p2)||F(G(p3))||p1)))))'
Support contains 88 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Applied a total of 0 rules in 13 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
[2024-05-31 03:30:45] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:45] [INFO ] Invariant cache hit.
[2024-05-31 03:30:45] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
[2024-05-31 03:30:45] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:45] [INFO ] Invariant cache hit.
[2024-05-31 03:30:46] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-31 03:30:46] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:46] [INFO ] Invariant cache hit.
[2024-05-31 03:30:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:30:48] [INFO ] Implicit Places using invariants and state equation in 2386 ms returned []
Implicit Place search using SMT with State Equation took 2781 ms to find 0 implicit places.
[2024-05-31 03:30:48] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-31 03:30:48] [INFO ] Invariant cache hit.
[2024-05-31 03:30:49] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4134 ms. Remains : 623/623 places, 839/839 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s42 1) (LT s123 1) (LT s126 1)) (OR (LT s42 1) (LT s118 1) (LT s126 1)) (OR (LT s42 1) (LT s89 1) (LT s126 1)) (OR (LT s42 1) (LT s103 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 991 ms.
Product exploration explored 100000 steps with 50000 reset in 712 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0)]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S05J40-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-08 finished in 6155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 623 transition count 796
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 580 transition count 795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 579 transition count 795
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 88 place count 579 transition count 752
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 174 place count 536 transition count 752
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 533 transition count 749
Applied a total of 180 rules in 53 ms. Remains 533 /623 variables (removed 90) and now considering 749/839 (removed 90) transitions.
[2024-05-31 03:30:51] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2024-05-31 03:30:51] [INFO ] Computed 97 invariants in 9 ms
[2024-05-31 03:30:51] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
[2024-05-31 03:30:51] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-31 03:30:51] [INFO ] Invariant cache hit.
[2024-05-31 03:30:52] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-31 03:30:52] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-31 03:30:52] [INFO ] Invariant cache hit.
[2024-05-31 03:30:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:30:54] [INFO ] Implicit Places using invariants and state equation in 2480 ms returned []
Implicit Place search using SMT with State Equation took 2970 ms to find 0 implicit places.
[2024-05-31 03:30:54] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 03:30:54] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-31 03:30:54] [INFO ] Invariant cache hit.
[2024-05-31 03:30:55] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 533/623 places, 749/839 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3949 ms. Remains : 533/623 places, 749/839 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s529 1) (AND (GEQ s527 1) (GEQ s531 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11946 reset in 386 ms.
Product exploration explored 100000 steps with 11956 reset in 367 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
[2024-05-31 03:30:56] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-31 03:30:56] [INFO ] Invariant cache hit.
[2024-05-31 03:30:57] [INFO ] [Real]Absence check using 90 positive place invariants in 69 ms returned sat
[2024-05-31 03:30:57] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 60 ms returned sat
[2024-05-31 03:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:30:58] [INFO ] [Real]Absence check using state equation in 1475 ms returned sat
[2024-05-31 03:30:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:30:59] [INFO ] [Nat]Absence check using 90 positive place invariants in 69 ms returned sat
[2024-05-31 03:30:59] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-31 03:30:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:31:00] [INFO ] [Nat]Absence check using state equation in 1384 ms returned sat
[2024-05-31 03:31:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:31:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 48 ms returned sat
[2024-05-31 03:31:00] [INFO ] Computed and/alt/rep : 364/1259/364 causal constraints (skipped 375 transitions) in 90 ms.
[2024-05-31 03:31:01] [INFO ] Added : 19 causal constraints over 4 iterations in 516 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 749/749 transitions.
Applied a total of 0 rules in 48 ms. Remains 533 /533 variables (removed 0) and now considering 749/749 (removed 0) transitions.
[2024-05-31 03:31:01] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-31 03:31:01] [INFO ] Invariant cache hit.
[2024-05-31 03:31:01] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
[2024-05-31 03:31:01] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-31 03:31:01] [INFO ] Invariant cache hit.
[2024-05-31 03:31:02] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-31 03:31:02] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-31 03:31:02] [INFO ] Invariant cache hit.
[2024-05-31 03:31:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:31:04] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 2444 ms to find 0 implicit places.
[2024-05-31 03:31:04] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 03:31:04] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-31 03:31:04] [INFO ] Invariant cache hit.
[2024-05-31 03:31:04] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3598 ms. Remains : 533/533 places, 749/749 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2024-05-31 03:31:05] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-31 03:31:05] [INFO ] Invariant cache hit.
[2024-05-31 03:31:05] [INFO ] [Real]Absence check using 90 positive place invariants in 52 ms returned sat
[2024-05-31 03:31:05] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 61 ms returned sat
[2024-05-31 03:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:31:07] [INFO ] [Real]Absence check using state equation in 1264 ms returned sat
[2024-05-31 03:31:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:31:07] [INFO ] [Nat]Absence check using 90 positive place invariants in 67 ms returned sat
[2024-05-31 03:31:07] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-31 03:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:31:08] [INFO ] [Nat]Absence check using state equation in 1168 ms returned sat
[2024-05-31 03:31:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:31:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2024-05-31 03:31:09] [INFO ] Computed and/alt/rep : 364/1259/364 causal constraints (skipped 375 transitions) in 70 ms.
[2024-05-31 03:31:09] [INFO ] Added : 19 causal constraints over 4 iterations in 454 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11932 reset in 395 ms.
Product exploration explored 100000 steps with 11949 reset in 406 ms.
Built C files in :
/tmp/ltsmin5444048740598235545
[2024-05-31 03:31:10] [INFO ] Computing symmetric may disable matrix : 749 transitions.
[2024-05-31 03:31:10] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:31:10] [INFO ] Computing symmetric may enable matrix : 749 transitions.
[2024-05-31 03:31:10] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:31:10] [INFO ] Computing Do-Not-Accords matrix : 749 transitions.
[2024-05-31 03:31:10] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:31:10] [INFO ] Built C files in 277ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5444048740598235545
Running compilation step : cd /tmp/ltsmin5444048740598235545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2446 ms.
Running link step : cd /tmp/ltsmin5444048740598235545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin5444048740598235545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7966007126445394284.hoa' '--buchi-type=spotba'
LTSmin run took 6969 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-11 finished in 28916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 41 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 623 transition count 835
Reduce places removed 4 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 45 rules applied. Total rules applied 49 place count 619 transition count 794
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 90 place count 578 transition count 794
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 90 place count 578 transition count 790
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 574 transition count 790
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 571 transition count 787
Applied a total of 104 rules in 44 ms. Remains 571 /623 variables (removed 52) and now considering 787/839 (removed 52) transitions.
[2024-05-31 03:31:20] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
// Phase 1: matrix 783 rows 571 cols
[2024-05-31 03:31:20] [INFO ] Computed 97 invariants in 11 ms
[2024-05-31 03:31:20] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
[2024-05-31 03:31:20] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2024-05-31 03:31:20] [INFO ] Invariant cache hit.
[2024-05-31 03:31:21] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-31 03:31:21] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2024-05-31 03:31:21] [INFO ] Invariant cache hit.
[2024-05-31 03:31:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:31:23] [INFO ] Implicit Places using invariants and state equation in 2112 ms returned []
Implicit Place search using SMT with State Equation took 2543 ms to find 0 implicit places.
[2024-05-31 03:31:23] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 03:31:23] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2024-05-31 03:31:23] [INFO ] Invariant cache hit.
[2024-05-31 03:31:23] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/623 places, 787/839 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3611 ms. Remains : 571/623 places, 787/839 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-12 finished in 3679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 8 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 623 transition count 795
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 579 transition count 795
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 88 place count 579 transition count 751
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 176 place count 535 transition count 751
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 182 place count 532 transition count 748
Applied a total of 182 rules in 64 ms. Remains 532 /623 variables (removed 91) and now considering 748/839 (removed 91) transitions.
[2024-05-31 03:31:23] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-05-31 03:31:24] [INFO ] Computed 97 invariants in 9 ms
[2024-05-31 03:31:24] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
[2024-05-31 03:31:24] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-31 03:31:24] [INFO ] Invariant cache hit.
[2024-05-31 03:31:24] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-31 03:31:24] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-31 03:31:24] [INFO ] Invariant cache hit.
[2024-05-31 03:31:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:31:26] [INFO ] Implicit Places using invariants and state equation in 2018 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
[2024-05-31 03:31:26] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 03:31:26] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-31 03:31:26] [INFO ] Invariant cache hit.
[2024-05-31 03:31:27] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/623 places, 748/839 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3574 ms. Remains : 532/623 places, 748/839 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s259 1) (GEQ s261 1) (GEQ s265 9)) (AND (GEQ s259 1) (GEQ s262 1) (GEQ s265 9)) (AND (GEQ s259 1) (GEQ s263 1) (GEQ s265 9)) (AND (GEQ s2...], 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 23 steps with 1 reset in 3 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-13 finished in 3693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 42 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 623 transition count 835
Reduce places removed 4 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 45 rules applied. Total rules applied 49 place count 619 transition count 794
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 90 place count 578 transition count 794
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 90 place count 578 transition count 790
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 574 transition count 790
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 571 transition count 787
Applied a total of 104 rules in 57 ms. Remains 571 /623 variables (removed 52) and now considering 787/839 (removed 52) transitions.
[2024-05-31 03:31:27] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
// Phase 1: matrix 783 rows 571 cols
[2024-05-31 03:31:27] [INFO ] Computed 97 invariants in 20 ms
[2024-05-31 03:31:28] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
[2024-05-31 03:31:28] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2024-05-31 03:31:28] [INFO ] Invariant cache hit.
[2024-05-31 03:31:28] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-05-31 03:31:28] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2024-05-31 03:31:28] [INFO ] Invariant cache hit.
[2024-05-31 03:31:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:31:30] [INFO ] Implicit Places using invariants and state equation in 1994 ms returned []
Implicit Place search using SMT with State Equation took 2593 ms to find 0 implicit places.
[2024-05-31 03:31:30] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-31 03:31:30] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
[2024-05-31 03:31:30] [INFO ] Invariant cache hit.
[2024-05-31 03:31:31] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/623 places, 787/839 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3739 ms. Remains : 571/623 places, 787/839 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 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 21 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-14 finished in 3852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 623 transition count 794
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 578 transition count 794
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 578 transition count 749
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 533 transition count 749
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 186 place count 530 transition count 746
Applied a total of 186 rules in 61 ms. Remains 530 /623 variables (removed 93) and now considering 746/839 (removed 93) transitions.
[2024-05-31 03:31:31] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2024-05-31 03:31:31] [INFO ] Computed 97 invariants in 13 ms
[2024-05-31 03:31:32] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
[2024-05-31 03:31:32] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:31:32] [INFO ] Invariant cache hit.
[2024-05-31 03:31:32] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-05-31 03:31:32] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:31:32] [INFO ] Invariant cache hit.
[2024-05-31 03:31:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:31:34] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2468 ms to find 0 implicit places.
[2024-05-31 03:31:34] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 03:31:34] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:31:34] [INFO ] Invariant cache hit.
[2024-05-31 03:31:35] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/623 places, 746/839 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3583 ms. Remains : 530/623 places, 746/839 transitions.
Stuttering acceptance computed with spot in 49 ms :[p0]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s256 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5278 reset in 549 ms.
Product exploration explored 100000 steps with 5309 reset in 442 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p0]
Finished random walk after 180 steps, including 10 resets, run visited all 1 properties in 3 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 50 ms :[p0]
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 15 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2024-05-31 03:31:36] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:31:36] [INFO ] Invariant cache hit.
[2024-05-31 03:31:36] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
[2024-05-31 03:31:36] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:31:36] [INFO ] Invariant cache hit.
[2024-05-31 03:31:37] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-05-31 03:31:37] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:31:37] [INFO ] Invariant cache hit.
[2024-05-31 03:31:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:31:39] [INFO ] Implicit Places using invariants and state equation in 2347 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
[2024-05-31 03:31:39] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-31 03:31:39] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:31:39] [INFO ] Invariant cache hit.
[2024-05-31 03:31:40] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4017 ms. Remains : 530/530 places, 746/746 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Finished random walk after 57 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[p0]
Stuttering acceptance computed with spot in 55 ms :[p0]
Stuttering acceptance computed with spot in 48 ms :[p0]
Product exploration explored 100000 steps with 5341 reset in 516 ms.
Product exploration explored 100000 steps with 5267 reset in 498 ms.
Built C files in :
/tmp/ltsmin5130679703400294245
[2024-05-31 03:31:41] [INFO ] Computing symmetric may disable matrix : 746 transitions.
[2024-05-31 03:31:41] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:31:41] [INFO ] Computing symmetric may enable matrix : 746 transitions.
[2024-05-31 03:31:41] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:31:42] [INFO ] Computing Do-Not-Accords matrix : 746 transitions.
[2024-05-31 03:31:42] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:31:42] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5130679703400294245
Running compilation step : cd /tmp/ltsmin5130679703400294245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2541 ms.
Running link step : cd /tmp/ltsmin5130679703400294245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin5130679703400294245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1513599608259997213.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 13 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2024-05-31 03:31:57] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:31:57] [INFO ] Invariant cache hit.
[2024-05-31 03:31:57] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
[2024-05-31 03:31:57] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:31:57] [INFO ] Invariant cache hit.
[2024-05-31 03:31:57] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-31 03:31:57] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:31:57] [INFO ] Invariant cache hit.
[2024-05-31 03:31:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:00] [INFO ] Implicit Places using invariants and state equation in 3019 ms returned []
Implicit Place search using SMT with State Equation took 3408 ms to find 0 implicit places.
[2024-05-31 03:32:00] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 03:32:00] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-31 03:32:00] [INFO ] Invariant cache hit.
[2024-05-31 03:32:01] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4242 ms. Remains : 530/530 places, 746/746 transitions.
Built C files in :
/tmp/ltsmin9860177328243452173
[2024-05-31 03:32:01] [INFO ] Computing symmetric may disable matrix : 746 transitions.
[2024-05-31 03:32:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:32:01] [INFO ] Computing symmetric may enable matrix : 746 transitions.
[2024-05-31 03:32:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:32:01] [INFO ] Computing Do-Not-Accords matrix : 746 transitions.
[2024-05-31 03:32:01] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:32:01] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9860177328243452173
Running compilation step : cd /tmp/ltsmin9860177328243452173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2496 ms.
Running link step : cd /tmp/ltsmin9860177328243452173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin9860177328243452173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15965748274132283235.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 03:32:16] [INFO ] Flatten gal took : 58 ms
[2024-05-31 03:32:16] [INFO ] Flatten gal took : 47 ms
[2024-05-31 03:32:16] [INFO ] Time to serialize gal into /tmp/LTL8434444346694871297.gal : 9 ms
[2024-05-31 03:32:16] [INFO ] Time to serialize properties into /tmp/LTL1393228054928971097.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8434444346694871297.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5089528701570134635.hoa' '-atoms' '/tmp/LTL1393228054928971097.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1393228054928971097.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5089528701570134635.hoa
Detected timeout of ITS tools.
[2024-05-31 03:32:31] [INFO ] Flatten gal took : 63 ms
[2024-05-31 03:32:31] [INFO ] Flatten gal took : 50 ms
[2024-05-31 03:32:31] [INFO ] Time to serialize gal into /tmp/LTL11693578436009907832.gal : 8 ms
[2024-05-31 03:32:31] [INFO ] Time to serialize properties into /tmp/LTL7660230047361092876.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11693578436009907832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7660230047361092876.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(place_522_0<3)"))))
Formula 0 simplified : GF!"(place_522_0<3)"
Detected timeout of ITS tools.
[2024-05-31 03:32:46] [INFO ] Flatten gal took : 31 ms
[2024-05-31 03:32:46] [INFO ] Applying decomposition
[2024-05-31 03:32:47] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17473939325755224893.txt' '-o' '/tmp/graph17473939325755224893.bin' '-w' '/tmp/graph17473939325755224893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17473939325755224893.bin' '-l' '-1' '-v' '-w' '/tmp/graph17473939325755224893.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:32:47] [INFO ] Decomposing Gal with order
[2024-05-31 03:32:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:32:47] [INFO ] Removed a total of 844 redundant transitions.
[2024-05-31 03:32:47] [INFO ] Flatten gal took : 123 ms
[2024-05-31 03:32:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 20 ms.
[2024-05-31 03:32:47] [INFO ] Time to serialize gal into /tmp/LTL18281091490766632608.gal : 12 ms
[2024-05-31 03:32:47] [INFO ] Time to serialize properties into /tmp/LTL16202541973492790067.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18281091490766632608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16202541973492790067.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i28.u43.place_522_0<3)"))))
Formula 0 simplified : GF!"(i28.u43.place_522_0<3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6849467180854157580
[2024-05-31 03:33:02] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6849467180854157580
Running compilation step : cd /tmp/ltsmin6849467180854157580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1658 ms.
Running link step : cd /tmp/ltsmin6849467180854157580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin6849467180854157580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-15 finished in 106107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
[2024-05-31 03:33:17] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1188650521016216372
[2024-05-31 03:33:17] [INFO ] Computing symmetric may disable matrix : 839 transitions.
[2024-05-31 03:33:17] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:33:17] [INFO ] Applying decomposition
[2024-05-31 03:33:17] [INFO ] Computing symmetric may enable matrix : 839 transitions.
[2024-05-31 03:33:17] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:33:17] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3212885599513716883.txt' '-o' '/tmp/graph3212885599513716883.bin' '-w' '/tmp/graph3212885599513716883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3212885599513716883.bin' '-l' '-1' '-v' '-w' '/tmp/graph3212885599513716883.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:33:18] [INFO ] Decomposing Gal with order
[2024-05-31 03:33:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:33:18] [INFO ] Computing Do-Not-Accords matrix : 839 transitions.
[2024-05-31 03:33:18] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:33:18] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1188650521016216372
Running compilation step : cd /tmp/ltsmin1188650521016216372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 03:33:18] [INFO ] Removed a total of 881 redundant transitions.
[2024-05-31 03:33:18] [INFO ] Flatten gal took : 116 ms
[2024-05-31 03:33:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 271 labels/synchronizations in 26 ms.
[2024-05-31 03:33:18] [INFO ] Time to serialize gal into /tmp/LTLFireability11438984029384061950.gal : 10 ms
[2024-05-31 03:33:18] [INFO ] Time to serialize properties into /tmp/LTLFireability7121654767612084478.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11438984029384061950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7121654767612084478.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(i16.u40.place_522_0<3)"))))
Formula 0 simplified : GF!"(i16.u40.place_522_0<3)"
Compilation finished in 2754 ms.
Running link step : cd /tmp/ltsmin1188650521016216372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin1188650521016216372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.118: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.138: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.146: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.153: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.158: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.175: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.193: Initializing POR dependencies: labels 840, guards 839
pins2lts-mc-linux64( 3/ 8), 0.195: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 10.430: LTL layer: formula: <>([](!(LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 10.430: "<>([](!(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 10.431: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 11.045: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 11.081: There are 841 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 11.081: State length is 624, there are 843 groups
pins2lts-mc-linux64( 0/ 8), 11.081: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 11.081: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 11.081: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 11.081: Visible groups: 0 / 843, labels: 1 / 841
pins2lts-mc-linux64( 0/ 8), 11.081: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 11.081: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 11.194: [Blue] ~39 levels ~960 states ~2168 transitions
pins2lts-mc-linux64( 0/ 8), 11.268: [Blue] ~52 levels ~1920 states ~4400 transitions
pins2lts-mc-linux64( 4/ 8), 11.363: [Blue] ~39 levels ~3840 states ~7688 transitions
pins2lts-mc-linux64( 2/ 8), 11.543: [Blue] ~64 levels ~7680 states ~15616 transitions
pins2lts-mc-linux64( 2/ 8), 11.907: [Blue] ~64 levels ~15360 states ~28528 transitions
pins2lts-mc-linux64( 2/ 8), 12.628: [Blue] ~64 levels ~30720 states ~53520 transitions
pins2lts-mc-linux64( 2/ 8), 14.009: [Blue] ~64 levels ~61440 states ~104392 transitions
pins2lts-mc-linux64( 2/ 8), 16.470: [Blue] ~64 levels ~122880 states ~206056 transitions
pins2lts-mc-linux64( 7/ 8), 25.978: [Blue] ~65 levels ~245760 states ~402496 transitions
pins2lts-mc-linux64( 7/ 8), 52.791: [Blue] ~65 levels ~491520 states ~799080 transitions
pins2lts-mc-linux64( 7/ 8), 83.953: [Blue] ~65 levels ~983040 states ~1591232 transitions
pins2lts-mc-linux64( 7/ 8), 117.374: [Blue] ~65 levels ~1966080 states ~3121832 transitions
pins2lts-mc-linux64( 7/ 8), 187.379: [Blue] ~65 levels ~3932160 states ~6251648 transitions
pins2lts-mc-linux64( 2/ 8), 330.172: [Blue] ~64 levels ~7864320 states ~12794208 transitions
pins2lts-mc-linux64( 2/ 8), 617.399: [Blue] ~64 levels ~15728640 states ~25696936 transitions
pins2lts-mc-linux64( 2/ 8), 1174.631: [Blue] ~64 levels ~31457280 states ~51317216 transitions
pins2lts-mc-linux64( 4/ 8), 1202.002: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1202.056:
pins2lts-mc-linux64( 0/ 8), 1202.056: Explored 29918605 states 52582130 transitions, fanout: 1.758
pins2lts-mc-linux64( 0/ 8), 1202.056: Total exploration time 1190.960 sec (1190.900 sec minimum, 1190.924 sec on average)
pins2lts-mc-linux64( 0/ 8), 1202.056: States per second: 25121, Transitions per second: 44151
pins2lts-mc-linux64( 0/ 8), 1202.056:
pins2lts-mc-linux64( 0/ 8), 1202.056: State space has 29920284 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1202.056: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1202.056: blue states: 29918605 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1202.056: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1202.056: all-red states: 9084975 (30.36%), bogus 22 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1202.056:
pins2lts-mc-linux64( 0/ 8), 1202.056: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1202.056:
pins2lts-mc-linux64( 0/ 8), 1202.056: Queue width: 8B, total height: 414, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1202.056: Tree memory: 484.3MB, 17.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1202.056: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1202.056: Stored 1011 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1202.056: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1202.056: Est. total memory use: 484.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1188650521016216372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1188650521016216372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 03:55:00] [INFO ] Applying decomposition
[2024-05-31 03:55:00] [INFO ] Flatten gal took : 27 ms
[2024-05-31 03:55:00] [INFO ] Decomposing Gal with order
[2024-05-31 03:55:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:55:00] [INFO ] Removed a total of 2721 redundant transitions.
[2024-05-31 03:55:00] [INFO ] Flatten gal took : 68 ms
[2024-05-31 03:55:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-31 03:55:00] [INFO ] Time to serialize gal into /tmp/LTLFireability239477225992987892.gal : 8 ms
[2024-05-31 03:55:00] [INFO ] Time to serialize properties into /tmp/LTLFireability16894583666343277216.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability239477225992987892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16894583666343277216.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(place_522.place_522_0<3)"))))
Formula 0 simplified : GF!"(place_522.place_522_0<3)"
Detected timeout of ITS tools.
[2024-05-31 04:16:45] [INFO ] Flatten gal took : 608 ms
[2024-05-31 04:16:47] [INFO ] Input system was already deterministic with 839 transitions.
[2024-05-31 04:16:47] [INFO ] Transformed 623 places.
[2024-05-31 04:16:47] [INFO ] Transformed 839 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 04:17:17] [INFO ] Time to serialize gal into /tmp/LTLFireability14465706244158458224.gal : 57 ms
[2024-05-31 04:17:17] [INFO ] Time to serialize properties into /tmp/LTLFireability13359538451152181234.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14465706244158458224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13359538451152181234.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(place_522_0<3)"))))
Formula 0 simplified : GF!"(place_522_0<3)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 847692 kB
After kill :
MemTotal: 16393356 kB
MemFree: 15568300 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-COL-S05J40, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460700238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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