Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950900772.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBNT-PT-S10J40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900772
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 32K Feb 26 00:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 26 00:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 248K Feb 25 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 935K Feb 25 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 78K Feb 26 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 358K Feb 26 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 999K Feb 26 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.3M Feb 26 01:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 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-PT-S10J40-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679644541297

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J40
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 07:55:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 07:55:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 07:55:43] [INFO ] Load time of PNML (sax parser for PT used): 591 ms
[2023-03-24 07:55:43] [INFO ] Transformed 854 places.
[2023-03-24 07:55:44] [INFO ] Transformed 12340 transitions.
[2023-03-24 07:55:44] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 761 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2023-03-24 07:55:44] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-24 07:55:44] [INFO ] Reduced 780 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 122 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 2230
Applied a total of 10 rules in 158 ms. Remains 844 /854 variables (removed 10) and now considering 2230/2230 (removed 0) transitions.
[2023-03-24 07:55:44] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 844 cols
[2023-03-24 07:55:44] [INFO ] Computed 102 place invariants in 136 ms
[2023-03-24 07:55:47] [INFO ] Dead Transitions using invariants and state equation in 2598 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 07:55:47] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 844 cols
[2023-03-24 07:55:47] [INFO ] Computed 102 place invariants in 88 ms
[2023-03-24 07:55:48] [INFO ] Implicit Places using invariants in 1066 ms returned []
[2023-03-24 07:55:48] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 07:55:48] [INFO ] Invariant cache hit.
[2023-03-24 07:55:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:56:00] [INFO ] Implicit Places using invariants and state equation in 12396 ms returned []
Implicit Place search using SMT with State Equation took 13469 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 844/854 places, 1615/2230 transitions.
Applied a total of 0 rules in 35 ms. Remains 844 /844 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16293 ms. Remains : 844/854 places, 1615/2230 transitions.
Support contains 122 out of 844 places after structural reductions.
[2023-03-24 07:56:01] [INFO ] Flatten gal took : 218 ms
[2023-03-24 07:56:01] [INFO ] Flatten gal took : 135 ms
[2023-03-24 07:56:01] [INFO ] Input system was already deterministic with 1615 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 673 ms. (steps per millisecond=14 ) properties (out of 27) seen :7
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :7
Running SMT prover for 11 properties.
[2023-03-24 07:56:02] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 07:56:02] [INFO ] Invariant cache hit.
[2023-03-24 07:56:02] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2023-03-24 07:56:02] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 35 ms returned sat
[2023-03-24 07:56:03] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-24 07:56:03] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-24 07:56:03] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 36 ms returned sat
[2023-03-24 07:56:19] [INFO ] After 15558ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-24 07:56:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:56:28] [INFO ] After 8965ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :9
[2023-03-24 07:56:28] [INFO ] After 8965ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-24 07:56:28] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 56 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1615/1615 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 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 799 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 798 transition count 1569
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 798 transition count 1525
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 753 transition count 1524
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 753 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 751 transition count 1522
Applied a total of 186 rules in 268 ms. Remains 751 /844 variables (removed 93) and now considering 1522/1615 (removed 93) transitions.
[2023-03-24 07:56:28] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 07:56:28] [INFO ] Computed 102 place invariants in 24 ms
[2023-03-24 07:56:29] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1353 ms. Remains : 751/844 places, 1522/1615 transitions.
Incomplete random walk after 10000 steps, including 718 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 07:56:29] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 07:56:29] [INFO ] Invariant cache hit.
[2023-03-24 07:56:29] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2023-03-24 07:56:30] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 30 ms returned sat
[2023-03-24 07:56:30] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 07:56:30] [INFO ] [Nat]Absence check using 81 positive place invariants in 31 ms returned sat
[2023-03-24 07:56:30] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-24 07:56:31] [INFO ] After 974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 07:56:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:56:31] [INFO ] After 120ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 07:56:31] [INFO ] Deduced a trap composed of 310 places in 412 ms of which 4 ms to minimize.
[2023-03-24 07:56:32] [INFO ] Deduced a trap composed of 307 places in 413 ms of which 1 ms to minimize.
[2023-03-24 07:56:32] [INFO ] Deduced a trap composed of 299 places in 437 ms of which 2 ms to minimize.
[2023-03-24 07:56:33] [INFO ] Deduced a trap composed of 321 places in 433 ms of which 2 ms to minimize.
[2023-03-24 07:56:33] [INFO ] Deduced a trap composed of 327 places in 462 ms of which 1 ms to minimize.
[2023-03-24 07:56:34] [INFO ] Deduced a trap composed of 294 places in 426 ms of which 0 ms to minimize.
[2023-03-24 07:56:34] [INFO ] Deduced a trap composed of 340 places in 409 ms of which 0 ms to minimize.
[2023-03-24 07:56:35] [INFO ] Deduced a trap composed of 307 places in 391 ms of which 2 ms to minimize.
[2023-03-24 07:56:35] [INFO ] Deduced a trap composed of 317 places in 412 ms of which 0 ms to minimize.
[2023-03-24 07:56:36] [INFO ] Deduced a trap composed of 322 places in 398 ms of which 0 ms to minimize.
[2023-03-24 07:56:36] [INFO ] Deduced a trap composed of 306 places in 431 ms of which 1 ms to minimize.
[2023-03-24 07:56:37] [INFO ] Deduced a trap composed of 317 places in 419 ms of which 1 ms to minimize.
[2023-03-24 07:56:37] [INFO ] Deduced a trap composed of 300 places in 424 ms of which 0 ms to minimize.
[2023-03-24 07:56:38] [INFO ] Deduced a trap composed of 330 places in 417 ms of which 0 ms to minimize.
[2023-03-24 07:56:38] [INFO ] Deduced a trap composed of 327 places in 420 ms of which 1 ms to minimize.
[2023-03-24 07:56:38] [INFO ] Deduced a trap composed of 306 places in 421 ms of which 1 ms to minimize.
[2023-03-24 07:56:39] [INFO ] Deduced a trap composed of 314 places in 419 ms of which 1 ms to minimize.
[2023-03-24 07:56:40] [INFO ] Deduced a trap composed of 322 places in 397 ms of which 1 ms to minimize.
[2023-03-24 07:56:40] [INFO ] Deduced a trap composed of 300 places in 399 ms of which 1 ms to minimize.
[2023-03-24 07:56:40] [INFO ] Deduced a trap composed of 310 places in 414 ms of which 1 ms to minimize.
[2023-03-24 07:56:41] [INFO ] Deduced a trap composed of 312 places in 409 ms of which 1 ms to minimize.
[2023-03-24 07:56:42] [INFO ] Deduced a trap composed of 316 places in 420 ms of which 1 ms to minimize.
[2023-03-24 07:56:42] [INFO ] Deduced a trap composed of 300 places in 430 ms of which 1 ms to minimize.
[2023-03-24 07:56:43] [INFO ] Deduced a trap composed of 304 places in 418 ms of which 1 ms to minimize.
[2023-03-24 07:56:43] [INFO ] Deduced a trap composed of 326 places in 422 ms of which 1 ms to minimize.
[2023-03-24 07:56:44] [INFO ] Deduced a trap composed of 300 places in 418 ms of which 0 ms to minimize.
[2023-03-24 07:56:44] [INFO ] Deduced a trap composed of 314 places in 408 ms of which 0 ms to minimize.
[2023-03-24 07:56:45] [INFO ] Deduced a trap composed of 306 places in 433 ms of which 0 ms to minimize.
[2023-03-24 07:56:45] [INFO ] Deduced a trap composed of 304 places in 441 ms of which 1 ms to minimize.
[2023-03-24 07:56:46] [INFO ] Deduced a trap composed of 302 places in 448 ms of which 0 ms to minimize.
[2023-03-24 07:56:46] [INFO ] Deduced a trap composed of 316 places in 419 ms of which 1 ms to minimize.
[2023-03-24 07:56:47] [INFO ] Deduced a trap composed of 306 places in 407 ms of which 1 ms to minimize.
[2023-03-24 07:56:48] [INFO ] Deduced a trap composed of 320 places in 432 ms of which 1 ms to minimize.
[2023-03-24 07:56:49] [INFO ] Deduced a trap composed of 304 places in 418 ms of which 2 ms to minimize.
[2023-03-24 07:56:49] [INFO ] Deduced a trap composed of 310 places in 409 ms of which 2 ms to minimize.
[2023-03-24 07:56:51] [INFO ] Deduced a trap composed of 310 places in 418 ms of which 2 ms to minimize.
[2023-03-24 07:56:51] [INFO ] Deduced a trap composed of 291 places in 407 ms of which 1 ms to minimize.
[2023-03-24 07:56:52] [INFO ] Deduced a trap composed of 308 places in 423 ms of which 1 ms to minimize.
[2023-03-24 07:56:53] [INFO ] Deduced a trap composed of 298 places in 429 ms of which 1 ms to minimize.
[2023-03-24 07:56:54] [INFO ] Deduced a trap composed of 324 places in 411 ms of which 2 ms to minimize.
[2023-03-24 07:56:55] [INFO ] Deduced a trap composed of 316 places in 421 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 07:56:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 07:56:55] [INFO ] After 25098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 751 transition count 1521
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1521
Applied a total of 2 rules in 148 ms. Remains 750 /751 variables (removed 1) and now considering 1521/1522 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 750/751 places, 1521/1522 transitions.
Incomplete random walk after 10000 steps, including 744 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 192556 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192556 steps, saw 32595 distinct states, run finished after 3003 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 07:56:58] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-24 07:56:58] [INFO ] Computed 102 place invariants in 41 ms
[2023-03-24 07:56:58] [INFO ] [Real]Absence check using 80 positive place invariants in 17 ms returned sat
[2023-03-24 07:56:58] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 34 ms returned sat
[2023-03-24 07:56:58] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 07:56:58] [INFO ] [Nat]Absence check using 80 positive place invariants in 18 ms returned sat
[2023-03-24 07:56:58] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 33 ms returned sat
[2023-03-24 07:56:59] [INFO ] After 972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 07:56:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:57:00] [INFO ] After 1107ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 07:57:01] [INFO ] Deduced a trap composed of 319 places in 442 ms of which 2 ms to minimize.
[2023-03-24 07:57:01] [INFO ] Deduced a trap composed of 317 places in 422 ms of which 1 ms to minimize.
[2023-03-24 07:57:02] [INFO ] Deduced a trap composed of 316 places in 410 ms of which 1 ms to minimize.
[2023-03-24 07:57:02] [INFO ] Deduced a trap composed of 294 places in 422 ms of which 1 ms to minimize.
[2023-03-24 07:57:03] [INFO ] Deduced a trap composed of 294 places in 421 ms of which 1 ms to minimize.
[2023-03-24 07:57:03] [INFO ] Deduced a trap composed of 294 places in 435 ms of which 1 ms to minimize.
[2023-03-24 07:57:04] [INFO ] Deduced a trap composed of 310 places in 409 ms of which 1 ms to minimize.
[2023-03-24 07:57:04] [INFO ] Deduced a trap composed of 306 places in 407 ms of which 1 ms to minimize.
[2023-03-24 07:57:05] [INFO ] Deduced a trap composed of 300 places in 428 ms of which 0 ms to minimize.
[2023-03-24 07:57:05] [INFO ] Deduced a trap composed of 300 places in 408 ms of which 1 ms to minimize.
[2023-03-24 07:57:06] [INFO ] Deduced a trap composed of 300 places in 434 ms of which 0 ms to minimize.
[2023-03-24 07:57:06] [INFO ] Deduced a trap composed of 310 places in 403 ms of which 1 ms to minimize.
[2023-03-24 07:57:07] [INFO ] Deduced a trap composed of 302 places in 420 ms of which 1 ms to minimize.
[2023-03-24 07:57:07] [INFO ] Deduced a trap composed of 310 places in 400 ms of which 1 ms to minimize.
[2023-03-24 07:57:08] [INFO ] Deduced a trap composed of 316 places in 400 ms of which 1 ms to minimize.
[2023-03-24 07:57:08] [INFO ] Deduced a trap composed of 310 places in 427 ms of which 6 ms to minimize.
[2023-03-24 07:57:09] [INFO ] Deduced a trap composed of 306 places in 423 ms of which 0 ms to minimize.
[2023-03-24 07:57:09] [INFO ] Deduced a trap composed of 306 places in 428 ms of which 1 ms to minimize.
[2023-03-24 07:57:10] [INFO ] Deduced a trap composed of 294 places in 454 ms of which 1 ms to minimize.
[2023-03-24 07:57:10] [INFO ] Deduced a trap composed of 296 places in 413 ms of which 0 ms to minimize.
[2023-03-24 07:57:11] [INFO ] Deduced a trap composed of 320 places in 405 ms of which 1 ms to minimize.
[2023-03-24 07:57:11] [INFO ] Deduced a trap composed of 298 places in 410 ms of which 1 ms to minimize.
[2023-03-24 07:57:12] [INFO ] Deduced a trap composed of 306 places in 410 ms of which 1 ms to minimize.
[2023-03-24 07:57:13] [INFO ] Deduced a trap composed of 296 places in 415 ms of which 1 ms to minimize.
[2023-03-24 07:57:13] [INFO ] Deduced a trap composed of 308 places in 429 ms of which 1 ms to minimize.
[2023-03-24 07:57:14] [INFO ] Deduced a trap composed of 314 places in 391 ms of which 1 ms to minimize.
[2023-03-24 07:57:14] [INFO ] Deduced a trap composed of 312 places in 408 ms of which 1 ms to minimize.
[2023-03-24 07:57:15] [INFO ] Deduced a trap composed of 296 places in 412 ms of which 2 ms to minimize.
[2023-03-24 07:57:15] [INFO ] Deduced a trap composed of 304 places in 409 ms of which 1 ms to minimize.
[2023-03-24 07:57:16] [INFO ] Deduced a trap composed of 310 places in 426 ms of which 1 ms to minimize.
[2023-03-24 07:57:17] [INFO ] Deduced a trap composed of 296 places in 413 ms of which 1 ms to minimize.
[2023-03-24 07:57:17] [INFO ] Deduced a trap composed of 311 places in 445 ms of which 1 ms to minimize.
[2023-03-24 07:57:18] [INFO ] Deduced a trap composed of 307 places in 425 ms of which 1 ms to minimize.
[2023-03-24 07:57:18] [INFO ] Deduced a trap composed of 325 places in 426 ms of which 1 ms to minimize.
[2023-03-24 07:57:19] [INFO ] Deduced a trap composed of 310 places in 416 ms of which 0 ms to minimize.
[2023-03-24 07:57:19] [INFO ] Deduced a trap composed of 296 places in 417 ms of which 0 ms to minimize.
[2023-03-24 07:57:20] [INFO ] Deduced a trap composed of 314 places in 414 ms of which 0 ms to minimize.
[2023-03-24 07:57:20] [INFO ] Deduced a trap composed of 310 places in 413 ms of which 1 ms to minimize.
[2023-03-24 07:57:21] [INFO ] Deduced a trap composed of 294 places in 439 ms of which 1 ms to minimize.
[2023-03-24 07:57:21] [INFO ] Deduced a trap composed of 304 places in 400 ms of which 1 ms to minimize.
[2023-03-24 07:57:22] [INFO ] Deduced a trap composed of 308 places in 408 ms of which 0 ms to minimize.
[2023-03-24 07:57:22] [INFO ] Deduced a trap composed of 296 places in 392 ms of which 1 ms to minimize.
[2023-03-24 07:57:23] [INFO ] Deduced a trap composed of 310 places in 413 ms of which 1 ms to minimize.
[2023-03-24 07:57:23] [INFO ] Deduced a trap composed of 302 places in 416 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 07:57:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 07:57:23] [INFO ] After 25285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 132 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 63 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-24 07:57:24] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 07:57:24] [INFO ] Invariant cache hit.
[2023-03-24 07:57:25] [INFO ] Implicit Places using invariants in 983 ms returned []
[2023-03-24 07:57:25] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 07:57:25] [INFO ] Invariant cache hit.
[2023-03-24 07:57:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:57:36] [INFO ] Implicit Places using invariants and state equation in 11688 ms returned []
Implicit Place search using SMT with State Equation took 12673 ms to find 0 implicit places.
[2023-03-24 07:57:36] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-24 07:57:36] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 07:57:36] [INFO ] Invariant cache hit.
[2023-03-24 07:57:38] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13996 ms. Remains : 750/750 places, 1521/1521 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 750 transition count 1512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 750 transition count 1511
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 11 place count 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 187 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2023-03-24 07:57:38] [INFO ] Computed 102 place invariants in 40 ms
[2023-03-24 07:57:38] [INFO ] [Real]Absence check using 80 positive place invariants in 18 ms returned sat
[2023-03-24 07:57:38] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 35 ms returned sat
[2023-03-24 07:57:38] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 07:57:38] [INFO ] [Nat]Absence check using 80 positive place invariants in 17 ms returned sat
[2023-03-24 07:57:38] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 36 ms returned sat
[2023-03-24 07:57:39] [INFO ] After 666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 07:57:39] [INFO ] Deduced a trap composed of 310 places in 374 ms of which 0 ms to minimize.
[2023-03-24 07:57:40] [INFO ] Deduced a trap composed of 306 places in 386 ms of which 1 ms to minimize.
[2023-03-24 07:57:40] [INFO ] Deduced a trap composed of 296 places in 401 ms of which 1 ms to minimize.
[2023-03-24 07:57:41] [INFO ] Deduced a trap composed of 300 places in 389 ms of which 1 ms to minimize.
[2023-03-24 07:57:41] [INFO ] Deduced a trap composed of 304 places in 389 ms of which 1 ms to minimize.
[2023-03-24 07:57:41] [INFO ] Deduced a trap composed of 306 places in 362 ms of which 1 ms to minimize.
[2023-03-24 07:57:42] [INFO ] Deduced a trap composed of 292 places in 359 ms of which 0 ms to minimize.
[2023-03-24 07:57:42] [INFO ] Deduced a trap composed of 298 places in 364 ms of which 1 ms to minimize.
[2023-03-24 07:57:43] [INFO ] Deduced a trap composed of 300 places in 369 ms of which 0 ms to minimize.
[2023-03-24 07:57:43] [INFO ] Deduced a trap composed of 300 places in 363 ms of which 0 ms to minimize.
[2023-03-24 07:57:44] [INFO ] Deduced a trap composed of 306 places in 363 ms of which 1 ms to minimize.
[2023-03-24 07:57:44] [INFO ] Deduced a trap composed of 300 places in 381 ms of which 1 ms to minimize.
[2023-03-24 07:57:44] [INFO ] Deduced a trap composed of 308 places in 383 ms of which 1 ms to minimize.
[2023-03-24 07:57:45] [INFO ] Deduced a trap composed of 310 places in 345 ms of which 1 ms to minimize.
[2023-03-24 07:57:45] [INFO ] Deduced a trap composed of 306 places in 365 ms of which 1 ms to minimize.
[2023-03-24 07:57:46] [INFO ] Deduced a trap composed of 298 places in 382 ms of which 1 ms to minimize.
[2023-03-24 07:57:46] [INFO ] Deduced a trap composed of 306 places in 377 ms of which 1 ms to minimize.
[2023-03-24 07:57:46] [INFO ] Deduced a trap composed of 302 places in 378 ms of which 1 ms to minimize.
[2023-03-24 07:57:47] [INFO ] Deduced a trap composed of 300 places in 387 ms of which 1 ms to minimize.
[2023-03-24 07:57:47] [INFO ] Deduced a trap composed of 314 places in 378 ms of which 1 ms to minimize.
[2023-03-24 07:57:48] [INFO ] Deduced a trap composed of 318 places in 382 ms of which 1 ms to minimize.
[2023-03-24 07:57:48] [INFO ] Deduced a trap composed of 310 places in 370 ms of which 1 ms to minimize.
[2023-03-24 07:57:49] [INFO ] Deduced a trap composed of 302 places in 380 ms of which 0 ms to minimize.
[2023-03-24 07:57:49] [INFO ] Deduced a trap composed of 298 places in 373 ms of which 1 ms to minimize.
[2023-03-24 07:57:49] [INFO ] Deduced a trap composed of 314 places in 364 ms of which 0 ms to minimize.
[2023-03-24 07:57:50] [INFO ] Deduced a trap composed of 300 places in 366 ms of which 0 ms to minimize.
[2023-03-24 07:57:50] [INFO ] Deduced a trap composed of 298 places in 354 ms of which 1 ms to minimize.
[2023-03-24 07:57:51] [INFO ] Deduced a trap composed of 302 places in 358 ms of which 1 ms to minimize.
[2023-03-24 07:57:51] [INFO ] Deduced a trap composed of 318 places in 370 ms of which 0 ms to minimize.
[2023-03-24 07:57:51] [INFO ] Deduced a trap composed of 316 places in 369 ms of which 0 ms to minimize.
[2023-03-24 07:57:52] [INFO ] Deduced a trap composed of 302 places in 395 ms of which 1 ms to minimize.
[2023-03-24 07:57:52] [INFO ] Deduced a trap composed of 304 places in 369 ms of which 1 ms to minimize.
[2023-03-24 07:57:53] [INFO ] Deduced a trap composed of 308 places in 389 ms of which 1 ms to minimize.
[2023-03-24 07:57:53] [INFO ] Deduced a trap composed of 318 places in 400 ms of which 1 ms to minimize.
[2023-03-24 07:57:54] [INFO ] Deduced a trap composed of 310 places in 373 ms of which 1 ms to minimize.
[2023-03-24 07:57:54] [INFO ] Deduced a trap composed of 292 places in 382 ms of which 1 ms to minimize.
[2023-03-24 07:57:55] [INFO ] Deduced a trap composed of 320 places in 381 ms of which 1 ms to minimize.
[2023-03-24 07:57:55] [INFO ] Deduced a trap composed of 312 places in 371 ms of which 1 ms to minimize.
[2023-03-24 07:57:56] [INFO ] Deduced a trap composed of 318 places in 384 ms of which 0 ms to minimize.
[2023-03-24 07:57:56] [INFO ] Deduced a trap composed of 300 places in 386 ms of which 0 ms to minimize.
[2023-03-24 07:57:57] [INFO ] Deduced a trap composed of 308 places in 384 ms of which 1 ms to minimize.
[2023-03-24 07:57:57] [INFO ] Deduced a trap composed of 296 places in 385 ms of which 0 ms to minimize.
[2023-03-24 07:57:57] [INFO ] Deduced a trap composed of 302 places in 386 ms of which 1 ms to minimize.
[2023-03-24 07:57:58] [INFO ] Deduced a trap composed of 318 places in 367 ms of which 0 ms to minimize.
[2023-03-24 07:57:58] [INFO ] Deduced a trap composed of 300 places in 376 ms of which 1 ms to minimize.
[2023-03-24 07:58:00] [INFO ] Deduced a trap composed of 314 places in 393 ms of which 1 ms to minimize.
[2023-03-24 07:58:01] [INFO ] Deduced a trap composed of 302 places in 391 ms of which 0 ms to minimize.
[2023-03-24 07:58:02] [INFO ] Deduced a trap composed of 312 places in 399 ms of which 1 ms to minimize.
[2023-03-24 07:58:02] [INFO ] Deduced a trap composed of 306 places in 357 ms of which 1 ms to minimize.
[2023-03-24 07:58:03] [INFO ] Deduced a trap composed of 310 places in 364 ms of which 1 ms to minimize.
[2023-03-24 07:58:03] [INFO ] Deduced a trap composed of 306 places in 360 ms of which 1 ms to minimize.
[2023-03-24 07:58:04] [INFO ] Deduced a trap composed of 302 places in 397 ms of which 1 ms to minimize.
[2023-03-24 07:58:04] [INFO ] Deduced a trap composed of 296 places in 372 ms of which 1 ms to minimize.
[2023-03-24 07:58:05] [INFO ] Deduced a trap composed of 300 places in 391 ms of which 0 ms to minimize.
[2023-03-24 07:58:05] [INFO ] Deduced a trap composed of 292 places in 375 ms of which 0 ms to minimize.
[2023-03-24 07:58:05] [INFO ] Deduced a trap composed of 302 places in 367 ms of which 0 ms to minimize.
[2023-03-24 07:58:06] [INFO ] Deduced a trap composed of 310 places in 366 ms of which 1 ms to minimize.
[2023-03-24 07:58:06] [INFO ] Deduced a trap composed of 300 places in 375 ms of which 2 ms to minimize.
[2023-03-24 07:58:07] [INFO ] Deduced a trap composed of 316 places in 364 ms of which 0 ms to minimize.
[2023-03-24 07:58:07] [INFO ] Deduced a trap composed of 302 places in 372 ms of which 1 ms to minimize.
[2023-03-24 07:58:08] [INFO ] Deduced a trap composed of 308 places in 392 ms of which 0 ms to minimize.
[2023-03-24 07:58:08] [INFO ] Deduced a trap composed of 300 places in 374 ms of which 1 ms to minimize.
[2023-03-24 07:58:08] [INFO ] Deduced a trap composed of 296 places in 390 ms of which 0 ms to minimize.
[2023-03-24 07:58:09] [INFO ] Deduced a trap composed of 312 places in 372 ms of which 1 ms to minimize.
[2023-03-24 07:58:09] [INFO ] Deduced a trap composed of 312 places in 360 ms of which 1 ms to minimize.
[2023-03-24 07:58:10] [INFO ] Deduced a trap composed of 300 places in 382 ms of which 0 ms to minimize.
[2023-03-24 07:58:10] [INFO ] Deduced a trap composed of 298 places in 380 ms of which 1 ms to minimize.
[2023-03-24 07:58:11] [INFO ] Deduced a trap composed of 288 places in 376 ms of which 1 ms to minimize.
[2023-03-24 07:58:11] [INFO ] Deduced a trap composed of 298 places in 377 ms of which 1 ms to minimize.
[2023-03-24 07:58:11] [INFO ] Deduced a trap composed of 310 places in 368 ms of which 1 ms to minimize.
[2023-03-24 07:58:12] [INFO ] Deduced a trap composed of 308 places in 376 ms of which 1 ms to minimize.
[2023-03-24 07:58:12] [INFO ] Deduced a trap composed of 328 places in 377 ms of which 1 ms to minimize.
[2023-03-24 07:58:13] [INFO ] Deduced a trap composed of 318 places in 385 ms of which 0 ms to minimize.
[2023-03-24 07:58:13] [INFO ] Deduced a trap composed of 324 places in 391 ms of which 1 ms to minimize.
[2023-03-24 07:58:14] [INFO ] Deduced a trap composed of 294 places in 382 ms of which 0 ms to minimize.
[2023-03-24 07:58:14] [INFO ] Deduced a trap composed of 308 places in 366 ms of which 1 ms to minimize.
[2023-03-24 07:58:14] [INFO ] Deduced a trap composed of 316 places in 368 ms of which 1 ms to minimize.
[2023-03-24 07:58:15] [INFO ] Deduced a trap composed of 318 places in 364 ms of which 1 ms to minimize.
[2023-03-24 07:58:15] [INFO ] Deduced a trap composed of 306 places in 378 ms of which 1 ms to minimize.
[2023-03-24 07:58:16] [INFO ] Deduced a trap composed of 306 places in 396 ms of which 0 ms to minimize.
[2023-03-24 07:58:17] [INFO ] Deduced a trap composed of 310 places in 373 ms of which 1 ms to minimize.
[2023-03-24 07:58:17] [INFO ] Deduced a trap composed of 316 places in 350 ms of which 1 ms to minimize.
[2023-03-24 07:58:17] [INFO ] Deduced a trap composed of 306 places in 348 ms of which 0 ms to minimize.
[2023-03-24 07:58:18] [INFO ] Deduced a trap composed of 300 places in 367 ms of which 1 ms to minimize.
[2023-03-24 07:58:18] [INFO ] Deduced a trap composed of 312 places in 356 ms of which 1 ms to minimize.
[2023-03-24 07:58:19] [INFO ] Deduced a trap composed of 308 places in 356 ms of which 1 ms to minimize.
[2023-03-24 07:58:19] [INFO ] Deduced a trap composed of 302 places in 351 ms of which 1 ms to minimize.
[2023-03-24 07:58:19] [INFO ] Deduced a trap composed of 318 places in 345 ms of which 1 ms to minimize.
[2023-03-24 07:58:20] [INFO ] Deduced a trap composed of 318 places in 361 ms of which 1 ms to minimize.
[2023-03-24 07:58:20] [INFO ] Deduced a trap composed of 302 places in 361 ms of which 0 ms to minimize.
[2023-03-24 07:58:21] [INFO ] Deduced a trap composed of 308 places in 349 ms of which 0 ms to minimize.
[2023-03-24 07:58:21] [INFO ] Deduced a trap composed of 312 places in 347 ms of which 1 ms to minimize.
[2023-03-24 07:58:21] [INFO ] Deduced a trap composed of 318 places in 355 ms of which 1 ms to minimize.
[2023-03-24 07:58:22] [INFO ] Deduced a trap composed of 298 places in 371 ms of which 1 ms to minimize.
[2023-03-24 07:58:22] [INFO ] Deduced a trap composed of 292 places in 369 ms of which 1 ms to minimize.
[2023-03-24 07:58:23] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 1 ms to minimize.
[2023-03-24 07:58:23] [INFO ] Deduced a trap composed of 314 places in 376 ms of which 1 ms to minimize.
[2023-03-24 07:58:24] [INFO ] Deduced a trap composed of 296 places in 372 ms of which 1 ms to minimize.
[2023-03-24 07:58:24] [INFO ] Deduced a trap composed of 304 places in 370 ms of which 1 ms to minimize.
[2023-03-24 07:58:24] [INFO ] Deduced a trap composed of 316 places in 368 ms of which 1 ms to minimize.
[2023-03-24 07:58:25] [INFO ] Deduced a trap composed of 304 places in 370 ms of which 1 ms to minimize.
[2023-03-24 07:58:25] [INFO ] Deduced a trap composed of 292 places in 373 ms of which 1 ms to minimize.
[2023-03-24 07:58:26] [INFO ] Deduced a trap composed of 296 places in 361 ms of which 1 ms to minimize.
[2023-03-24 07:58:26] [INFO ] Deduced a trap composed of 304 places in 377 ms of which 1 ms to minimize.
[2023-03-24 07:58:27] [INFO ] Deduced a trap composed of 296 places in 383 ms of which 0 ms to minimize.
[2023-03-24 07:58:27] [INFO ] Deduced a trap composed of 302 places in 375 ms of which 0 ms to minimize.
[2023-03-24 07:58:28] [INFO ] Deduced a trap composed of 324 places in 391 ms of which 0 ms to minimize.
[2023-03-24 07:58:28] [INFO ] Deduced a trap composed of 298 places in 372 ms of which 1 ms to minimize.
[2023-03-24 07:58:29] [INFO ] Deduced a trap composed of 302 places in 374 ms of which 1 ms to minimize.
[2023-03-24 07:58:29] [INFO ] Deduced a trap composed of 312 places in 369 ms of which 1 ms to minimize.
[2023-03-24 07:58:30] [INFO ] Deduced a trap composed of 306 places in 357 ms of which 0 ms to minimize.
[2023-03-24 08:01:23] [INFO ] Trap strengthening (SAT) tested/added 111/111 trap constraints in 224162 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 08:01:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 08:01:23] [INFO ] After 225025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
FORMULA PolyORBNT-PT-S10J40-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p1||F((X((!p3 U (p1||G(!p3))))&&p2))))))'
Support contains 14 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Applied a total of 0 rules in 18 ms. Remains 844 /844 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
[2023-03-24 08:01:24] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 844 cols
[2023-03-24 08:01:24] [INFO ] Computed 102 place invariants in 37 ms
[2023-03-24 08:01:25] [INFO ] Dead Transitions using invariants and state equation in 1939 ms found 0 transitions.
[2023-03-24 08:01:25] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 08:01:25] [INFO ] Invariant cache hit.
[2023-03-24 08:01:27] [INFO ] Implicit Places using invariants in 1161 ms returned []
[2023-03-24 08:01:27] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 08:01:27] [INFO ] Invariant cache hit.
[2023-03-24 08:01:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:01:42] [INFO ] Implicit Places using invariants and state equation in 15522 ms returned []
Implicit Place search using SMT with State Equation took 16694 ms to find 0 implicit places.
[2023-03-24 08:01:42] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 08:01:42] [INFO ] Invariant cache hit.
[2023-03-24 08:01:44] [INFO ] Dead Transitions using invariants and state equation in 1769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20423 ms. Remains : 844/844 places, 1615/1615 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (NOT p0), (OR (NOT p2) (AND (NOT p1) p3)), (AND (NOT p1) p3), true]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s393 1), p2:(AND (OR (LT s118 1) (LT s136 1) (LT s761 1)) (OR (LT s18 1) (LT s136 1) (LT s761 1)) (OR (LT s136 1) (LT s659 1) (LT s761 1)) (OR (LT ...], 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 3 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-01 finished in 20842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1))&&X(G(p2)))))'
Support contains 2 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 843 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 843 transition count 1614
Applied a total of 2 rules in 44 ms. Remains 843 /844 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 08:01:44] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 08:01:44] [INFO ] Computed 102 place invariants in 22 ms
[2023-03-24 08:01:46] [INFO ] Dead Transitions using invariants and state equation in 1733 ms found 0 transitions.
[2023-03-24 08:01:46] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:01:46] [INFO ] Invariant cache hit.
[2023-03-24 08:01:47] [INFO ] Implicit Places using invariants in 1329 ms returned []
[2023-03-24 08:01:47] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:01:47] [INFO ] Invariant cache hit.
[2023-03-24 08:01:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:02:02] [INFO ] Implicit Places using invariants and state equation in 14777 ms returned []
Implicit Place search using SMT with State Equation took 16108 ms to find 0 implicit places.
[2023-03-24 08:02:02] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:02:02] [INFO ] Invariant cache hit.
[2023-03-24 08:02:04] [INFO ] Dead Transitions using invariants and state equation in 1912 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 843/844 places, 1614/1615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19801 ms. Remains : 843/844 places, 1614/1615 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s514 1) (GEQ s292 1)), p0:(LT s292 1), p2:(GEQ s514 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-02 finished in 20062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 44 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 844 transition count 1569
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 798 transition count 1569
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 798 transition count 1524
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 182 place count 753 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 752 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 752 transition count 1523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 188 place count 750 transition count 1521
Applied a total of 188 rules in 142 ms. Remains 750 /844 variables (removed 94) and now considering 1521/1615 (removed 94) transitions.
[2023-03-24 08:02:04] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-24 08:02:05] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 08:02:06] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
[2023-03-24 08:02:06] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:02:06] [INFO ] Invariant cache hit.
[2023-03-24 08:02:07] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2023-03-24 08:02:07] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:02:07] [INFO ] Invariant cache hit.
[2023-03-24 08:02:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:02:22] [INFO ] Implicit Places using invariants and state equation in 15576 ms returned []
Implicit Place search using SMT with State Equation took 16630 ms to find 0 implicit places.
[2023-03-24 08:02:22] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-24 08:02:22] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:02:22] [INFO ] Invariant cache hit.
[2023-03-24 08:02:23] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/844 places, 1521/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19115 ms. Remains : 750/844 places, 1521/1615 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s235 3), p1:(OR (AND (GEQ s64 1) (GEQ s193 1) (GEQ s335 1)) (AND (GEQ s64 1) (GEQ s241 1) (GEQ s335 1)) (AND (GEQ s64 1) (GEQ s335 1) (GEQ s513 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-03 finished in 19220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 12 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 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 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 799 transition count 1570
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 799 transition count 1526
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 755 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 754 transition count 1525
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 754 transition count 1525
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 184 place count 752 transition count 1523
Applied a total of 184 rules in 120 ms. Remains 752 /844 variables (removed 92) and now considering 1523/1615 (removed 92) transitions.
[2023-03-24 08:02:24] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
// Phase 1: matrix 1514 rows 752 cols
[2023-03-24 08:02:24] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-24 08:02:25] [INFO ] Dead Transitions using invariants and state equation in 1264 ms found 0 transitions.
[2023-03-24 08:02:25] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-24 08:02:25] [INFO ] Invariant cache hit.
[2023-03-24 08:02:26] [INFO ] Implicit Places using invariants in 923 ms returned []
[2023-03-24 08:02:26] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-24 08:02:26] [INFO ] Invariant cache hit.
[2023-03-24 08:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:02:38] [INFO ] Implicit Places using invariants and state equation in 11815 ms returned []
Implicit Place search using SMT with State Equation took 12740 ms to find 0 implicit places.
[2023-03-24 08:02:38] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-24 08:02:38] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-24 08:02:38] [INFO ] Invariant cache hit.
[2023-03-24 08:02:39] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 752/844 places, 1523/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15396 ms. Remains : 752/844 places, 1523/1615 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s143 7) (GEQ s155 1) (GEQ s355 1) (GEQ s364 1) (GEQ s735 1)) (AND (GEQ s143 7) (GEQ s364 1) (GEQ s573 1) (GEQ s681 2)) (AND (GEQ s143 7) ...], 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 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-04 finished in 15454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!p1)||p0)))'
Support contains 13 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 843 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 843 transition count 1614
Applied a total of 2 rules in 38 ms. Remains 843 /844 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 08:02:39] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 08:02:39] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 08:02:41] [INFO ] Dead Transitions using invariants and state equation in 1843 ms found 0 transitions.
[2023-03-24 08:02:41] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:02:41] [INFO ] Invariant cache hit.
[2023-03-24 08:02:42] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2023-03-24 08:02:42] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:02:42] [INFO ] Invariant cache hit.
[2023-03-24 08:02:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:02:58] [INFO ] Implicit Places using invariants and state equation in 16001 ms returned []
Implicit Place search using SMT with State Equation took 17102 ms to find 0 implicit places.
[2023-03-24 08:02:58] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:02:58] [INFO ] Invariant cache hit.
[2023-03-24 08:03:00] [INFO ] Dead Transitions using invariants and state equation in 1764 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 843/844 places, 1614/1615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20754 ms. Remains : 843/844 places, 1614/1615 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s123 1) (AND (GEQ s162 9) (GEQ s403 1) (GEQ s509 1)) (AND (GEQ s162 9) (GEQ s403 1) (GEQ s641 1)) (AND (GEQ s162 9) (GEQ s403 1) (GEQ s786 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2061 ms.
Product exploration explored 100000 steps with 50000 reset in 2036 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J40-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-05 finished in 25040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 45 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 843 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 843 transition count 1614
Applied a total of 2 rules in 40 ms. Remains 843 /844 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 08:03:04] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:03:04] [INFO ] Invariant cache hit.
[2023-03-24 08:03:06] [INFO ] Dead Transitions using invariants and state equation in 1882 ms found 0 transitions.
[2023-03-24 08:03:06] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:03:06] [INFO ] Invariant cache hit.
[2023-03-24 08:03:07] [INFO ] Implicit Places using invariants in 1157 ms returned []
[2023-03-24 08:03:07] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:03:07] [INFO ] Invariant cache hit.
[2023-03-24 08:03:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:03:27] [INFO ] Implicit Places using invariants and state equation in 19372 ms returned []
Implicit Place search using SMT with State Equation took 20530 ms to find 0 implicit places.
[2023-03-24 08:03:27] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:03:27] [INFO ] Invariant cache hit.
[2023-03-24 08:03:28] [INFO ] Dead Transitions using invariants and state equation in 1708 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 843/844 places, 1614/1615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24162 ms. Remains : 843/844 places, 1614/1615 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s223 1) (GEQ s505 1) (GEQ s776 1)) (AND (GEQ s223 1) (GEQ s381 1) (GEQ s776 1)) (AND (GEQ s223 1) (GEQ s729 1) (GEQ s776 1)) (AND (GEQ s2...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-07 finished in 24315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 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 844 transition count 1571
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 800 transition count 1571
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 800 transition count 1527
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 176 place count 756 transition count 1527
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 755 transition count 1526
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 755 transition count 1526
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 753 transition count 1524
Applied a total of 182 rules in 121 ms. Remains 753 /844 variables (removed 91) and now considering 1524/1615 (removed 91) transitions.
[2023-03-24 08:03:28] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
// Phase 1: matrix 1515 rows 753 cols
[2023-03-24 08:03:29] [INFO ] Computed 102 place invariants in 22 ms
[2023-03-24 08:03:30] [INFO ] Dead Transitions using invariants and state equation in 1278 ms found 0 transitions.
[2023-03-24 08:03:30] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:03:30] [INFO ] Invariant cache hit.
[2023-03-24 08:03:31] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2023-03-24 08:03:31] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:03:31] [INFO ] Invariant cache hit.
[2023-03-24 08:03:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:03:41] [INFO ] Implicit Places using invariants and state equation in 10072 ms returned []
Implicit Place search using SMT with State Equation took 11117 ms to find 0 implicit places.
[2023-03-24 08:03:41] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-24 08:03:41] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:03:41] [INFO ] Invariant cache hit.
[2023-03-24 08:03:42] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 753/844 places, 1524/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13802 ms. Remains : 753/844 places, 1524/1615 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-08 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:(OR (LT s18 1) (LT s106 1) (LT s144 6) (LT s156 1) (LT s356 1) (LT s365 1) (AND (GEQ s108 1) (GEQ s281 1) (GEQ s64 1) (GEQ s499 1) (GEQ s604 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]]
Product exploration explored 100000 steps with 6659 reset in 940 ms.
Product exploration explored 100000 steps with 6789 reset in 935 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 654 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Finished Best-First random walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 11 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 1524/1524 transitions.
Applied a total of 0 rules in 51 ms. Remains 753 /753 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
[2023-03-24 08:03:45] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:03:45] [INFO ] Invariant cache hit.
[2023-03-24 08:03:46] [INFO ] Dead Transitions using invariants and state equation in 1258 ms found 0 transitions.
[2023-03-24 08:03:46] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:03:46] [INFO ] Invariant cache hit.
[2023-03-24 08:03:47] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2023-03-24 08:03:47] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:03:47] [INFO ] Invariant cache hit.
[2023-03-24 08:03:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:03:59] [INFO ] Implicit Places using invariants and state equation in 12142 ms returned []
Implicit Place search using SMT with State Equation took 13177 ms to find 0 implicit places.
[2023-03-24 08:03:59] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-24 08:03:59] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:03:59] [INFO ] Invariant cache hit.
[2023-03-24 08:04:01] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15787 ms. Remains : 753/753 places, 1524/1524 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 661 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Finished Best-First random walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6689 reset in 901 ms.
Product exploration explored 100000 steps with 6807 reset in 941 ms.
Support contains 11 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 1524/1524 transitions.
Applied a total of 0 rules in 47 ms. Remains 753 /753 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
[2023-03-24 08:04:03] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:04:03] [INFO ] Invariant cache hit.
[2023-03-24 08:04:04] [INFO ] Dead Transitions using invariants and state equation in 1214 ms found 0 transitions.
[2023-03-24 08:04:04] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:04:04] [INFO ] Invariant cache hit.
[2023-03-24 08:04:05] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2023-03-24 08:04:06] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:04:06] [INFO ] Invariant cache hit.
[2023-03-24 08:04:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:04:17] [INFO ] Implicit Places using invariants and state equation in 11428 ms returned []
Implicit Place search using SMT with State Equation took 12462 ms to find 0 implicit places.
[2023-03-24 08:04:17] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-24 08:04:17] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-24 08:04:17] [INFO ] Invariant cache hit.
[2023-03-24 08:04:18] [INFO ] Dead Transitions using invariants and state equation in 1263 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15041 ms. Remains : 753/753 places, 1524/1524 transitions.
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-08 finished in 50109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((G(F(p1))||G(!p2)) U X(p1))))'
Support contains 6 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 843 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 843 transition count 1614
Applied a total of 2 rules in 36 ms. Remains 843 /844 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 08:04:19] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 08:04:19] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 08:04:20] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
[2023-03-24 08:04:20] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:04:20] [INFO ] Invariant cache hit.
[2023-03-24 08:04:22] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2023-03-24 08:04:22] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:04:22] [INFO ] Invariant cache hit.
[2023-03-24 08:04:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:04:37] [INFO ] Implicit Places using invariants and state equation in 15660 ms returned []
Implicit Place search using SMT with State Equation took 16966 ms to find 0 implicit places.
[2023-03-24 08:04:37] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:04:37] [INFO ] Invariant cache hit.
[2023-03-24 08:04:39] [INFO ] Dead Transitions using invariants and state equation in 1769 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 843/844 places, 1614/1615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20606 ms. Remains : 843/844 places, 1614/1615 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 4}, { cond=p2, acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s99 1) (GEQ s223 1) (GEQ s776 1)), p0:(AND (GEQ s294 1) (GEQ s814 1)), p1:(GEQ s91 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5601 reset in 779 ms.
Product exploration explored 100000 steps with 5602 reset in 844 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 850 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 97069 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 97069 steps, saw 29090 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-24 08:04:46] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:04:46] [INFO ] Invariant cache hit.
[2023-03-24 08:04:46] [INFO ] [Real]Absence check using 81 positive place invariants in 24 ms returned sat
[2023-03-24 08:04:46] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 31 ms returned sat
[2023-03-24 08:04:46] [INFO ] After 740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 08:04:47] [INFO ] [Nat]Absence check using 81 positive place invariants in 22 ms returned sat
[2023-03-24 08:04:47] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-24 08:05:11] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 843/843 places, 1614/1614 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 843 transition count 1569
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 798 transition count 1569
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 798 transition count 1524
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 753 transition count 1524
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 2 with 6 rules applied. Total rules applied 186 place count 750 transition count 1521
Applied a total of 186 rules in 87 ms. Remains 750 /843 variables (removed 93) and now considering 1521/1614 (removed 93) transitions.
[2023-03-24 08:05:12] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-24 08:05:12] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 08:05:13] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1265 ms. Remains : 750/843 places, 1521/1614 transitions.
Incomplete random walk after 10000 steps, including 746 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 192337 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192337 steps, saw 32554 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 08:05:16] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:05:16] [INFO ] Invariant cache hit.
[2023-03-24 08:05:16] [INFO ] [Real]Absence check using 80 positive place invariants in 18 ms returned sat
[2023-03-24 08:05:16] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 39 ms returned sat
[2023-03-24 08:05:16] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 08:05:16] [INFO ] [Nat]Absence check using 80 positive place invariants in 18 ms returned sat
[2023-03-24 08:05:16] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 37 ms returned sat
[2023-03-24 08:05:17] [INFO ] After 687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 08:05:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:05:18] [INFO ] After 1510ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 08:05:19] [INFO ] Deduced a trap composed of 308 places in 403 ms of which 0 ms to minimize.
[2023-03-24 08:05:19] [INFO ] Deduced a trap composed of 292 places in 413 ms of which 1 ms to minimize.
[2023-03-24 08:05:20] [INFO ] Deduced a trap composed of 325 places in 415 ms of which 1 ms to minimize.
[2023-03-24 08:05:20] [INFO ] Deduced a trap composed of 309 places in 421 ms of which 1 ms to minimize.
[2023-03-24 08:05:21] [INFO ] Deduced a trap composed of 304 places in 432 ms of which 1 ms to minimize.
[2023-03-24 08:05:21] [INFO ] Deduced a trap composed of 320 places in 444 ms of which 1 ms to minimize.
[2023-03-24 08:05:22] [INFO ] Deduced a trap composed of 315 places in 438 ms of which 0 ms to minimize.
[2023-03-24 08:05:22] [INFO ] Deduced a trap composed of 317 places in 426 ms of which 1 ms to minimize.
[2023-03-24 08:05:23] [INFO ] Deduced a trap composed of 310 places in 430 ms of which 1 ms to minimize.
[2023-03-24 08:05:23] [INFO ] Deduced a trap composed of 302 places in 421 ms of which 1 ms to minimize.
[2023-03-24 08:05:24] [INFO ] Deduced a trap composed of 311 places in 428 ms of which 1 ms to minimize.
[2023-03-24 08:05:24] [INFO ] Deduced a trap composed of 302 places in 404 ms of which 1 ms to minimize.
[2023-03-24 08:05:25] [INFO ] Deduced a trap composed of 310 places in 411 ms of which 0 ms to minimize.
[2023-03-24 08:05:26] [INFO ] Deduced a trap composed of 294 places in 419 ms of which 1 ms to minimize.
[2023-03-24 08:05:26] [INFO ] Deduced a trap composed of 312 places in 428 ms of which 0 ms to minimize.
[2023-03-24 08:05:26] [INFO ] Deduced a trap composed of 298 places in 420 ms of which 1 ms to minimize.
[2023-03-24 08:05:27] [INFO ] Deduced a trap composed of 314 places in 412 ms of which 1 ms to minimize.
[2023-03-24 08:05:28] [INFO ] Deduced a trap composed of 294 places in 426 ms of which 0 ms to minimize.
[2023-03-24 08:05:28] [INFO ] Deduced a trap composed of 317 places in 402 ms of which 0 ms to minimize.
[2023-03-24 08:05:29] [INFO ] Deduced a trap composed of 310 places in 420 ms of which 0 ms to minimize.
[2023-03-24 08:05:29] [INFO ] Deduced a trap composed of 309 places in 410 ms of which 0 ms to minimize.
[2023-03-24 08:05:30] [INFO ] Deduced a trap composed of 304 places in 422 ms of which 1 ms to minimize.
[2023-03-24 08:05:30] [INFO ] Deduced a trap composed of 302 places in 461 ms of which 0 ms to minimize.
[2023-03-24 08:05:31] [INFO ] Deduced a trap composed of 316 places in 430 ms of which 1 ms to minimize.
[2023-03-24 08:05:31] [INFO ] Deduced a trap composed of 314 places in 426 ms of which 1 ms to minimize.
[2023-03-24 08:05:32] [INFO ] Deduced a trap composed of 324 places in 424 ms of which 0 ms to minimize.
[2023-03-24 08:05:32] [INFO ] Deduced a trap composed of 302 places in 405 ms of which 1 ms to minimize.
[2023-03-24 08:05:33] [INFO ] Deduced a trap composed of 302 places in 437 ms of which 1 ms to minimize.
[2023-03-24 08:05:33] [INFO ] Deduced a trap composed of 308 places in 424 ms of which 1 ms to minimize.
[2023-03-24 08:05:34] [INFO ] Deduced a trap composed of 312 places in 430 ms of which 1 ms to minimize.
[2023-03-24 08:05:34] [INFO ] Deduced a trap composed of 290 places in 407 ms of which 0 ms to minimize.
[2023-03-24 08:05:35] [INFO ] Deduced a trap composed of 309 places in 428 ms of which 1 ms to minimize.
[2023-03-24 08:05:35] [INFO ] Deduced a trap composed of 310 places in 428 ms of which 1 ms to minimize.
[2023-03-24 08:05:36] [INFO ] Deduced a trap composed of 307 places in 439 ms of which 1 ms to minimize.
[2023-03-24 08:05:36] [INFO ] Deduced a trap composed of 311 places in 434 ms of which 1 ms to minimize.
[2023-03-24 08:05:37] [INFO ] Deduced a trap composed of 319 places in 442 ms of which 1 ms to minimize.
[2023-03-24 08:05:38] [INFO ] Deduced a trap composed of 305 places in 409 ms of which 1 ms to minimize.
[2023-03-24 08:05:39] [INFO ] Deduced a trap composed of 313 places in 412 ms of which 1 ms to minimize.
[2023-03-24 08:05:39] [INFO ] Deduced a trap composed of 296 places in 430 ms of which 1 ms to minimize.
[2023-03-24 08:05:40] [INFO ] Deduced a trap composed of 300 places in 394 ms of which 0 ms to minimize.
[2023-03-24 08:05:40] [INFO ] Deduced a trap composed of 320 places in 422 ms of which 0 ms to minimize.
[2023-03-24 08:05:40] [INFO ] Deduced a trap composed of 304 places in 403 ms of which 1 ms to minimize.
[2023-03-24 08:05:41] [INFO ] Deduced a trap composed of 298 places in 409 ms of which 1 ms to minimize.
[2023-03-24 08:05:41] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 22632 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 08:05:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 08:05:41] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 36 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 34 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-24 08:05:41] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:05:41] [INFO ] Invariant cache hit.
[2023-03-24 08:05:42] [INFO ] Implicit Places using invariants in 1094 ms returned []
[2023-03-24 08:05:42] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:05:42] [INFO ] Invariant cache hit.
[2023-03-24 08:05:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:05:54] [INFO ] Implicit Places using invariants and state equation in 11711 ms returned []
Implicit Place search using SMT with State Equation took 12806 ms to find 0 implicit places.
[2023-03-24 08:05:54] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-24 08:05:54] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:05:54] [INFO ] Invariant cache hit.
[2023-03-24 08:05:55] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13983 ms. Remains : 750/750 places, 1521/1521 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 750 transition count 1512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 750 transition count 1511
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 11 place count 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 144 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2023-03-24 08:05:55] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-24 08:05:55] [INFO ] [Real]Absence check using 80 positive place invariants in 18 ms returned sat
[2023-03-24 08:05:55] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 43 ms returned sat
[2023-03-24 08:05:55] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 08:05:56] [INFO ] [Nat]Absence check using 80 positive place invariants in 17 ms returned sat
[2023-03-24 08:05:56] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 44 ms returned sat
[2023-03-24 08:05:57] [INFO ] After 976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 08:05:57] [INFO ] Deduced a trap composed of 299 places in 375 ms of which 1 ms to minimize.
[2023-03-24 08:05:57] [INFO ] Deduced a trap composed of 284 places in 381 ms of which 1 ms to minimize.
[2023-03-24 08:05:58] [INFO ] Deduced a trap composed of 317 places in 384 ms of which 0 ms to minimize.
[2023-03-24 08:05:58] [INFO ] Deduced a trap composed of 302 places in 374 ms of which 0 ms to minimize.
[2023-03-24 08:05:59] [INFO ] Deduced a trap composed of 286 places in 389 ms of which 0 ms to minimize.
[2023-03-24 08:05:59] [INFO ] Deduced a trap composed of 288 places in 378 ms of which 0 ms to minimize.
[2023-03-24 08:06:00] [INFO ] Deduced a trap composed of 286 places in 389 ms of which 0 ms to minimize.
[2023-03-24 08:06:00] [INFO ] Deduced a trap composed of 294 places in 392 ms of which 1 ms to minimize.
[2023-03-24 08:06:00] [INFO ] Deduced a trap composed of 290 places in 381 ms of which 1 ms to minimize.
[2023-03-24 08:06:01] [INFO ] Deduced a trap composed of 304 places in 382 ms of which 1 ms to minimize.
[2023-03-24 08:06:01] [INFO ] Deduced a trap composed of 304 places in 378 ms of which 0 ms to minimize.
[2023-03-24 08:06:02] [INFO ] Deduced a trap composed of 300 places in 378 ms of which 0 ms to minimize.
[2023-03-24 08:06:02] [INFO ] Deduced a trap composed of 298 places in 369 ms of which 1 ms to minimize.
[2023-03-24 08:06:03] [INFO ] Deduced a trap composed of 294 places in 391 ms of which 0 ms to minimize.
[2023-03-24 08:06:03] [INFO ] Deduced a trap composed of 316 places in 383 ms of which 1 ms to minimize.
[2023-03-24 08:06:03] [INFO ] Deduced a trap composed of 284 places in 363 ms of which 2 ms to minimize.
[2023-03-24 08:06:04] [INFO ] Deduced a trap composed of 308 places in 372 ms of which 1 ms to minimize.
[2023-03-24 08:06:04] [INFO ] Deduced a trap composed of 304 places in 376 ms of which 1 ms to minimize.
[2023-03-24 08:06:05] [INFO ] Deduced a trap composed of 288 places in 370 ms of which 1 ms to minimize.
[2023-03-24 08:06:05] [INFO ] Deduced a trap composed of 290 places in 376 ms of which 1 ms to minimize.
[2023-03-24 08:06:06] [INFO ] Deduced a trap composed of 310 places in 365 ms of which 1 ms to minimize.
[2023-03-24 08:06:06] [INFO ] Deduced a trap composed of 310 places in 346 ms of which 1 ms to minimize.
[2023-03-24 08:06:06] [INFO ] Deduced a trap composed of 318 places in 380 ms of which 1 ms to minimize.
[2023-03-24 08:06:07] [INFO ] Deduced a trap composed of 319 places in 363 ms of which 1 ms to minimize.
[2023-03-24 08:06:07] [INFO ] Deduced a trap composed of 298 places in 353 ms of which 1 ms to minimize.
[2023-03-24 08:06:08] [INFO ] Deduced a trap composed of 294 places in 381 ms of which 1 ms to minimize.
[2023-03-24 08:06:08] [INFO ] Deduced a trap composed of 312 places in 362 ms of which 1 ms to minimize.
[2023-03-24 08:06:08] [INFO ] Deduced a trap composed of 314 places in 361 ms of which 1 ms to minimize.
[2023-03-24 08:06:09] [INFO ] Deduced a trap composed of 292 places in 366 ms of which 1 ms to minimize.
[2023-03-24 08:06:09] [INFO ] Deduced a trap composed of 310 places in 372 ms of which 1 ms to minimize.
[2023-03-24 08:06:10] [INFO ] Deduced a trap composed of 300 places in 373 ms of which 1 ms to minimize.
[2023-03-24 08:06:10] [INFO ] Deduced a trap composed of 318 places in 380 ms of which 1 ms to minimize.
[2023-03-24 08:06:11] [INFO ] Deduced a trap composed of 298 places in 364 ms of which 1 ms to minimize.
[2023-03-24 08:06:11] [INFO ] Deduced a trap composed of 292 places in 373 ms of which 1 ms to minimize.
[2023-03-24 08:06:11] [INFO ] Deduced a trap composed of 298 places in 369 ms of which 0 ms to minimize.
[2023-03-24 08:06:12] [INFO ] Deduced a trap composed of 312 places in 368 ms of which 0 ms to minimize.
[2023-03-24 08:06:12] [INFO ] Deduced a trap composed of 314 places in 377 ms of which 1 ms to minimize.
[2023-03-24 08:06:13] [INFO ] Deduced a trap composed of 310 places in 376 ms of which 1 ms to minimize.
[2023-03-24 08:06:13] [INFO ] Deduced a trap composed of 300 places in 380 ms of which 1 ms to minimize.
[2023-03-24 08:06:14] [INFO ] Deduced a trap composed of 296 places in 367 ms of which 1 ms to minimize.
[2023-03-24 08:06:14] [INFO ] Deduced a trap composed of 302 places in 372 ms of which 1 ms to minimize.
[2023-03-24 08:06:15] [INFO ] Deduced a trap composed of 303 places in 367 ms of which 0 ms to minimize.
[2023-03-24 08:06:15] [INFO ] Deduced a trap composed of 300 places in 349 ms of which 0 ms to minimize.
[2023-03-24 08:06:16] [INFO ] Deduced a trap composed of 290 places in 357 ms of which 1 ms to minimize.
[2023-03-24 08:06:16] [INFO ] Deduced a trap composed of 306 places in 381 ms of which 0 ms to minimize.
[2023-03-24 08:06:17] [INFO ] Deduced a trap composed of 308 places in 374 ms of which 1 ms to minimize.
[2023-03-24 08:06:17] [INFO ] Deduced a trap composed of 304 places in 371 ms of which 0 ms to minimize.
[2023-03-24 08:06:18] [INFO ] Deduced a trap composed of 302 places in 369 ms of which 1 ms to minimize.
[2023-03-24 08:06:18] [INFO ] Deduced a trap composed of 314 places in 359 ms of which 1 ms to minimize.
[2023-03-24 08:06:19] [INFO ] Deduced a trap composed of 318 places in 359 ms of which 0 ms to minimize.
[2023-03-24 08:06:19] [INFO ] Deduced a trap composed of 308 places in 362 ms of which 0 ms to minimize.
[2023-03-24 08:06:19] [INFO ] Deduced a trap composed of 294 places in 365 ms of which 1 ms to minimize.
[2023-03-24 08:06:20] [INFO ] Deduced a trap composed of 302 places in 363 ms of which 1 ms to minimize.
[2023-03-24 08:06:20] [INFO ] Deduced a trap composed of 316 places in 376 ms of which 1 ms to minimize.
[2023-03-24 08:06:21] [INFO ] Deduced a trap composed of 306 places in 364 ms of which 1 ms to minimize.
[2023-03-24 08:06:21] [INFO ] Deduced a trap composed of 320 places in 380 ms of which 0 ms to minimize.
[2023-03-24 08:06:22] [INFO ] Deduced a trap composed of 302 places in 361 ms of which 1 ms to minimize.
[2023-03-24 08:06:22] [INFO ] Deduced a trap composed of 296 places in 370 ms of which 1 ms to minimize.
[2023-03-24 08:06:23] [INFO ] Deduced a trap composed of 300 places in 383 ms of which 1 ms to minimize.
[2023-03-24 08:06:23] [INFO ] Deduced a trap composed of 298 places in 370 ms of which 1 ms to minimize.
[2023-03-24 08:06:23] [INFO ] Deduced a trap composed of 318 places in 352 ms of which 1 ms to minimize.
[2023-03-24 08:06:24] [INFO ] Deduced a trap composed of 308 places in 350 ms of which 1 ms to minimize.
[2023-03-24 08:06:24] [INFO ] Deduced a trap composed of 305 places in 369 ms of which 0 ms to minimize.
[2023-03-24 08:06:25] [INFO ] Deduced a trap composed of 304 places in 376 ms of which 1 ms to minimize.
[2023-03-24 08:06:25] [INFO ] Deduced a trap composed of 308 places in 388 ms of which 0 ms to minimize.
[2023-03-24 08:06:26] [INFO ] Deduced a trap composed of 320 places in 356 ms of which 1 ms to minimize.
[2023-03-24 08:06:26] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 1 ms to minimize.
[2023-03-24 08:06:26] [INFO ] Deduced a trap composed of 298 places in 358 ms of which 0 ms to minimize.
[2023-03-24 08:06:27] [INFO ] Deduced a trap composed of 312 places in 384 ms of which 0 ms to minimize.
[2023-03-24 08:06:28] [INFO ] Deduced a trap composed of 312 places in 352 ms of which 1 ms to minimize.
[2023-03-24 08:06:28] [INFO ] Deduced a trap composed of 310 places in 375 ms of which 1 ms to minimize.
[2023-03-24 08:06:30] [INFO ] Deduced a trap composed of 294 places in 392 ms of which 1 ms to minimize.
[2023-03-24 08:06:30] [INFO ] Deduced a trap composed of 292 places in 384 ms of which 1 ms to minimize.
[2023-03-24 08:06:31] [INFO ] Deduced a trap composed of 300 places in 380 ms of which 1 ms to minimize.
[2023-03-24 08:06:31] [INFO ] Deduced a trap composed of 310 places in 381 ms of which 1 ms to minimize.
[2023-03-24 08:06:32] [INFO ] Deduced a trap composed of 317 places in 389 ms of which 1 ms to minimize.
[2023-03-24 08:06:32] [INFO ] Deduced a trap composed of 298 places in 388 ms of which 1 ms to minimize.
[2023-03-24 08:06:32] [INFO ] Deduced a trap composed of 302 places in 369 ms of which 0 ms to minimize.
[2023-03-24 08:06:33] [INFO ] Deduced a trap composed of 308 places in 380 ms of which 1 ms to minimize.
[2023-03-24 08:06:33] [INFO ] Deduced a trap composed of 328 places in 385 ms of which 1 ms to minimize.
[2023-03-24 08:06:34] [INFO ] Deduced a trap composed of 316 places in 392 ms of which 0 ms to minimize.
[2023-03-24 08:06:34] [INFO ] Deduced a trap composed of 290 places in 366 ms of which 1 ms to minimize.
[2023-03-24 08:06:35] [INFO ] Deduced a trap composed of 302 places in 360 ms of which 1 ms to minimize.
[2023-03-24 08:06:35] [INFO ] Deduced a trap composed of 306 places in 377 ms of which 1 ms to minimize.
[2023-03-24 08:06:35] [INFO ] Deduced a trap composed of 296 places in 359 ms of which 1 ms to minimize.
[2023-03-24 08:06:36] [INFO ] Deduced a trap composed of 306 places in 372 ms of which 1 ms to minimize.
[2023-03-24 08:06:36] [INFO ] Deduced a trap composed of 310 places in 368 ms of which 0 ms to minimize.
[2023-03-24 08:06:37] [INFO ] Deduced a trap composed of 312 places in 370 ms of which 1 ms to minimize.
[2023-03-24 08:06:37] [INFO ] Deduced a trap composed of 298 places in 376 ms of which 1 ms to minimize.
[2023-03-24 08:06:38] [INFO ] Deduced a trap composed of 294 places in 373 ms of which 1 ms to minimize.
[2023-03-24 08:06:38] [INFO ] Deduced a trap composed of 302 places in 373 ms of which 0 ms to minimize.
[2023-03-24 08:06:38] [INFO ] Deduced a trap composed of 302 places in 353 ms of which 1 ms to minimize.
[2023-03-24 08:06:39] [INFO ] Deduced a trap composed of 300 places in 352 ms of which 0 ms to minimize.
[2023-03-24 08:06:39] [INFO ] Deduced a trap composed of 300 places in 348 ms of which 0 ms to minimize.
[2023-03-24 08:06:40] [INFO ] Deduced a trap composed of 310 places in 367 ms of which 1 ms to minimize.
[2023-03-24 08:06:40] [INFO ] Deduced a trap composed of 292 places in 357 ms of which 1 ms to minimize.
[2023-03-24 08:06:40] [INFO ] Deduced a trap composed of 316 places in 358 ms of which 1 ms to minimize.
[2023-03-24 08:06:41] [INFO ] Deduced a trap composed of 292 places in 374 ms of which 1 ms to minimize.
[2023-03-24 08:06:41] [INFO ] Deduced a trap composed of 327 places in 356 ms of which 0 ms to minimize.
[2023-03-24 08:06:50] [INFO ] Trap strengthening (SAT) tested/added 99/99 trap constraints in 53684 ms
[2023-03-24 08:06:52] [INFO ] After 56328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 08:06:52] [INFO ] After 56506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 17 factoid took 831 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
[2023-03-24 08:06:53] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 08:06:53] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-24 08:06:55] [INFO ] [Real]Absence check using 81 positive place invariants in 53 ms returned sat
[2023-03-24 08:06:55] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 81 ms returned sat
[2023-03-24 08:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 08:06:57] [INFO ] [Real]Absence check using state equation in 2489 ms returned sat
[2023-03-24 08:06:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 08:06:58] [INFO ] [Nat]Absence check using 81 positive place invariants in 54 ms returned sat
[2023-03-24 08:06:59] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 63 ms returned sat
[2023-03-24 08:06:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 08:07:06] [INFO ] [Nat]Absence check using state equation in 7562 ms returned sat
[2023-03-24 08:07:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:07:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 44 ms returned sat
[2023-03-24 08:07:07] [INFO ] Deduced a trap composed of 392 places in 477 ms of which 1 ms to minimize.
[2023-03-24 08:07:07] [INFO ] Deduced a trap composed of 394 places in 488 ms of which 1 ms to minimize.
[2023-03-24 08:07:08] [INFO ] Deduced a trap composed of 396 places in 490 ms of which 1 ms to minimize.
[2023-03-24 08:07:09] [INFO ] Deduced a trap composed of 382 places in 482 ms of which 0 ms to minimize.
[2023-03-24 08:07:09] [INFO ] Deduced a trap composed of 396 places in 470 ms of which 1 ms to minimize.
[2023-03-24 08:07:10] [INFO ] Deduced a trap composed of 394 places in 456 ms of which 1 ms to minimize.
[2023-03-24 08:07:11] [INFO ] Deduced a trap composed of 386 places in 467 ms of which 1 ms to minimize.
[2023-03-24 08:07:11] [INFO ] Deduced a trap composed of 392 places in 463 ms of which 0 ms to minimize.
[2023-03-24 08:07:12] [INFO ] Deduced a trap composed of 384 places in 511 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 08:07:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 4 out of 843 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 843/843 places, 1614/1614 transitions.
Applied a total of 0 rules in 18 ms. Remains 843 /843 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2023-03-24 08:07:12] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:07:12] [INFO ] Invariant cache hit.
[2023-03-24 08:07:14] [INFO ] Dead Transitions using invariants and state equation in 1839 ms found 0 transitions.
[2023-03-24 08:07:14] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:07:14] [INFO ] Invariant cache hit.
[2023-03-24 08:07:15] [INFO ] Implicit Places using invariants in 1283 ms returned []
[2023-03-24 08:07:15] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:07:15] [INFO ] Invariant cache hit.
[2023-03-24 08:07:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:07:34] [INFO ] Implicit Places using invariants and state equation in 18192 ms returned []
Implicit Place search using SMT with State Equation took 19476 ms to find 0 implicit places.
[2023-03-24 08:07:34] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:07:34] [INFO ] Invariant cache hit.
[2023-03-24 08:07:35] [INFO ] Dead Transitions using invariants and state equation in 1731 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23067 ms. Remains : 843/843 places, 1614/1614 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 417 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 95376 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 95376 steps, saw 28731 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-24 08:07:40] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:07:40] [INFO ] Invariant cache hit.
[2023-03-24 08:07:40] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2023-03-24 08:07:40] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 32 ms returned sat
[2023-03-24 08:07:40] [INFO ] After 711ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 08:07:40] [INFO ] [Nat]Absence check using 81 positive place invariants in 22 ms returned sat
[2023-03-24 08:07:40] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 31 ms returned sat
[2023-03-24 08:08:05] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 843/843 places, 1614/1614 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 843 transition count 1569
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 798 transition count 1569
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 798 transition count 1524
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 753 transition count 1524
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 750 transition count 1521
Applied a total of 186 rules in 89 ms. Remains 750 /843 variables (removed 93) and now considering 1521/1614 (removed 93) transitions.
[2023-03-24 08:08:05] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-24 08:08:05] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 08:08:07] [INFO ] Dead Transitions using invariants and state equation in 1171 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1262 ms. Remains : 750/843 places, 1521/1614 transitions.
Incomplete random walk after 10000 steps, including 725 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 200939 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200939 steps, saw 33892 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 08:08:10] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:08:10] [INFO ] Invariant cache hit.
[2023-03-24 08:08:10] [INFO ] [Real]Absence check using 80 positive place invariants in 22 ms returned sat
[2023-03-24 08:08:10] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 35 ms returned sat
[2023-03-24 08:08:10] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 08:08:10] [INFO ] [Nat]Absence check using 80 positive place invariants in 17 ms returned sat
[2023-03-24 08:08:10] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 36 ms returned sat
[2023-03-24 08:08:11] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 08:08:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:08:12] [INFO ] After 1423ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 08:08:13] [INFO ] Deduced a trap composed of 308 places in 414 ms of which 0 ms to minimize.
[2023-03-24 08:08:13] [INFO ] Deduced a trap composed of 292 places in 426 ms of which 1 ms to minimize.
[2023-03-24 08:08:13] [INFO ] Deduced a trap composed of 325 places in 413 ms of which 1 ms to minimize.
[2023-03-24 08:08:14] [INFO ] Deduced a trap composed of 309 places in 404 ms of which 1 ms to minimize.
[2023-03-24 08:08:15] [INFO ] Deduced a trap composed of 304 places in 416 ms of which 1 ms to minimize.
[2023-03-24 08:08:15] [INFO ] Deduced a trap composed of 320 places in 420 ms of which 1 ms to minimize.
[2023-03-24 08:08:16] [INFO ] Deduced a trap composed of 315 places in 433 ms of which 1 ms to minimize.
[2023-03-24 08:08:16] [INFO ] Deduced a trap composed of 317 places in 427 ms of which 1 ms to minimize.
[2023-03-24 08:08:17] [INFO ] Deduced a trap composed of 310 places in 410 ms of which 1 ms to minimize.
[2023-03-24 08:08:17] [INFO ] Deduced a trap composed of 302 places in 403 ms of which 1 ms to minimize.
[2023-03-24 08:08:17] [INFO ] Deduced a trap composed of 311 places in 387 ms of which 1 ms to minimize.
[2023-03-24 08:08:18] [INFO ] Deduced a trap composed of 302 places in 403 ms of which 1 ms to minimize.
[2023-03-24 08:08:19] [INFO ] Deduced a trap composed of 310 places in 411 ms of which 1 ms to minimize.
[2023-03-24 08:08:19] [INFO ] Deduced a trap composed of 294 places in 416 ms of which 1 ms to minimize.
[2023-03-24 08:08:20] [INFO ] Deduced a trap composed of 312 places in 415 ms of which 1 ms to minimize.
[2023-03-24 08:08:20] [INFO ] Deduced a trap composed of 298 places in 426 ms of which 1 ms to minimize.
[2023-03-24 08:08:20] [INFO ] Deduced a trap composed of 314 places in 398 ms of which 1 ms to minimize.
[2023-03-24 08:08:21] [INFO ] Deduced a trap composed of 294 places in 396 ms of which 1 ms to minimize.
[2023-03-24 08:08:21] [INFO ] Deduced a trap composed of 317 places in 395 ms of which 0 ms to minimize.
[2023-03-24 08:08:22] [INFO ] Deduced a trap composed of 310 places in 393 ms of which 1 ms to minimize.
[2023-03-24 08:08:23] [INFO ] Deduced a trap composed of 309 places in 408 ms of which 1 ms to minimize.
[2023-03-24 08:08:23] [INFO ] Deduced a trap composed of 304 places in 391 ms of which 0 ms to minimize.
[2023-03-24 08:08:24] [INFO ] Deduced a trap composed of 302 places in 403 ms of which 1 ms to minimize.
[2023-03-24 08:08:24] [INFO ] Deduced a trap composed of 316 places in 397 ms of which 1 ms to minimize.
[2023-03-24 08:08:24] [INFO ] Deduced a trap composed of 314 places in 427 ms of which 1 ms to minimize.
[2023-03-24 08:08:25] [INFO ] Deduced a trap composed of 324 places in 420 ms of which 1 ms to minimize.
[2023-03-24 08:08:25] [INFO ] Deduced a trap composed of 302 places in 414 ms of which 1 ms to minimize.
[2023-03-24 08:08:26] [INFO ] Deduced a trap composed of 302 places in 417 ms of which 0 ms to minimize.
[2023-03-24 08:08:26] [INFO ] Deduced a trap composed of 308 places in 434 ms of which 2 ms to minimize.
[2023-03-24 08:08:27] [INFO ] Deduced a trap composed of 312 places in 420 ms of which 1 ms to minimize.
[2023-03-24 08:08:27] [INFO ] Deduced a trap composed of 290 places in 422 ms of which 1 ms to minimize.
[2023-03-24 08:08:28] [INFO ] Deduced a trap composed of 309 places in 409 ms of which 1 ms to minimize.
[2023-03-24 08:08:28] [INFO ] Deduced a trap composed of 310 places in 403 ms of which 0 ms to minimize.
[2023-03-24 08:08:29] [INFO ] Deduced a trap composed of 307 places in 404 ms of which 1 ms to minimize.
[2023-03-24 08:08:30] [INFO ] Deduced a trap composed of 311 places in 408 ms of which 1 ms to minimize.
[2023-03-24 08:08:31] [INFO ] Deduced a trap composed of 319 places in 446 ms of which 1 ms to minimize.
[2023-03-24 08:08:31] [INFO ] Deduced a trap composed of 305 places in 425 ms of which 4 ms to minimize.
[2023-03-24 08:08:32] [INFO ] Deduced a trap composed of 313 places in 406 ms of which 0 ms to minimize.
[2023-03-24 08:08:32] [INFO ] Deduced a trap composed of 296 places in 402 ms of which 1 ms to minimize.
[2023-03-24 08:08:33] [INFO ] Deduced a trap composed of 300 places in 416 ms of which 1 ms to minimize.
[2023-03-24 08:08:33] [INFO ] Deduced a trap composed of 320 places in 402 ms of which 0 ms to minimize.
[2023-03-24 08:08:34] [INFO ] Deduced a trap composed of 304 places in 437 ms of which 1 ms to minimize.
[2023-03-24 08:08:34] [INFO ] Deduced a trap composed of 298 places in 442 ms of which 1 ms to minimize.
[2023-03-24 08:08:35] [INFO ] Deduced a trap composed of 304 places in 434 ms of which 1 ms to minimize.
[2023-03-24 08:08:35] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 22732 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 08:08:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 08:08:35] [INFO ] After 25017ms 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 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 35 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 34 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-24 08:08:35] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:08:35] [INFO ] Invariant cache hit.
[2023-03-24 08:08:36] [INFO ] Implicit Places using invariants in 1122 ms returned []
[2023-03-24 08:08:36] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:08:36] [INFO ] Invariant cache hit.
[2023-03-24 08:08:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:08:48] [INFO ] Implicit Places using invariants and state equation in 11582 ms returned []
Implicit Place search using SMT with State Equation took 12704 ms to find 0 implicit places.
[2023-03-24 08:08:48] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-24 08:08:48] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:08:48] [INFO ] Invariant cache hit.
[2023-03-24 08:08:49] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13901 ms. Remains : 750/750 places, 1521/1521 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 750 transition count 1512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 750 transition count 1511
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 150 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2023-03-24 08:08:49] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 08:08:49] [INFO ] [Real]Absence check using 80 positive place invariants in 18 ms returned sat
[2023-03-24 08:08:49] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 34 ms returned sat
[2023-03-24 08:08:49] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 08:08:49] [INFO ] [Nat]Absence check using 80 positive place invariants in 17 ms returned sat
[2023-03-24 08:08:49] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 36 ms returned sat
[2023-03-24 08:08:50] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 08:08:51] [INFO ] Deduced a trap composed of 299 places in 364 ms of which 1 ms to minimize.
[2023-03-24 08:08:51] [INFO ] Deduced a trap composed of 284 places in 374 ms of which 1 ms to minimize.
[2023-03-24 08:08:52] [INFO ] Deduced a trap composed of 317 places in 368 ms of which 0 ms to minimize.
[2023-03-24 08:08:52] [INFO ] Deduced a trap composed of 302 places in 368 ms of which 0 ms to minimize.
[2023-03-24 08:08:52] [INFO ] Deduced a trap composed of 286 places in 367 ms of which 1 ms to minimize.
[2023-03-24 08:08:53] [INFO ] Deduced a trap composed of 288 places in 363 ms of which 1 ms to minimize.
[2023-03-24 08:08:53] [INFO ] Deduced a trap composed of 286 places in 351 ms of which 0 ms to minimize.
[2023-03-24 08:08:54] [INFO ] Deduced a trap composed of 294 places in 359 ms of which 0 ms to minimize.
[2023-03-24 08:08:54] [INFO ] Deduced a trap composed of 290 places in 372 ms of which 1 ms to minimize.
[2023-03-24 08:08:54] [INFO ] Deduced a trap composed of 304 places in 374 ms of which 0 ms to minimize.
[2023-03-24 08:08:55] [INFO ] Deduced a trap composed of 304 places in 371 ms of which 1 ms to minimize.
[2023-03-24 08:08:55] [INFO ] Deduced a trap composed of 300 places in 379 ms of which 1 ms to minimize.
[2023-03-24 08:08:56] [INFO ] Deduced a trap composed of 298 places in 364 ms of which 0 ms to minimize.
[2023-03-24 08:08:56] [INFO ] Deduced a trap composed of 294 places in 358 ms of which 1 ms to minimize.
[2023-03-24 08:08:56] [INFO ] Deduced a trap composed of 316 places in 366 ms of which 1 ms to minimize.
[2023-03-24 08:08:57] [INFO ] Deduced a trap composed of 284 places in 365 ms of which 0 ms to minimize.
[2023-03-24 08:08:57] [INFO ] Deduced a trap composed of 308 places in 362 ms of which 1 ms to minimize.
[2023-03-24 08:08:58] [INFO ] Deduced a trap composed of 304 places in 363 ms of which 1 ms to minimize.
[2023-03-24 08:08:58] [INFO ] Deduced a trap composed of 288 places in 384 ms of which 0 ms to minimize.
[2023-03-24 08:08:59] [INFO ] Deduced a trap composed of 290 places in 381 ms of which 0 ms to minimize.
[2023-03-24 08:08:59] [INFO ] Deduced a trap composed of 310 places in 376 ms of which 1 ms to minimize.
[2023-03-24 08:08:59] [INFO ] Deduced a trap composed of 310 places in 381 ms of which 0 ms to minimize.
[2023-03-24 08:09:00] [INFO ] Deduced a trap composed of 318 places in 388 ms of which 0 ms to minimize.
[2023-03-24 08:09:00] [INFO ] Deduced a trap composed of 319 places in 382 ms of which 0 ms to minimize.
[2023-03-24 08:09:01] [INFO ] Deduced a trap composed of 298 places in 386 ms of which 1 ms to minimize.
[2023-03-24 08:09:01] [INFO ] Deduced a trap composed of 294 places in 379 ms of which 1 ms to minimize.
[2023-03-24 08:09:02] [INFO ] Deduced a trap composed of 312 places in 379 ms of which 0 ms to minimize.
[2023-03-24 08:09:02] [INFO ] Deduced a trap composed of 314 places in 382 ms of which 0 ms to minimize.
[2023-03-24 08:09:02] [INFO ] Deduced a trap composed of 292 places in 362 ms of which 1 ms to minimize.
[2023-03-24 08:09:03] [INFO ] Deduced a trap composed of 310 places in 362 ms of which 1 ms to minimize.
[2023-03-24 08:09:03] [INFO ] Deduced a trap composed of 300 places in 348 ms of which 0 ms to minimize.
[2023-03-24 08:09:04] [INFO ] Deduced a trap composed of 318 places in 343 ms of which 1 ms to minimize.
[2023-03-24 08:09:04] [INFO ] Deduced a trap composed of 298 places in 378 ms of which 0 ms to minimize.
[2023-03-24 08:09:04] [INFO ] Deduced a trap composed of 292 places in 377 ms of which 1 ms to minimize.
[2023-03-24 08:09:05] [INFO ] Deduced a trap composed of 298 places in 372 ms of which 1 ms to minimize.
[2023-03-24 08:09:05] [INFO ] Deduced a trap composed of 312 places in 364 ms of which 0 ms to minimize.
[2023-03-24 08:09:06] [INFO ] Deduced a trap composed of 314 places in 371 ms of which 1 ms to minimize.
[2023-03-24 08:09:06] [INFO ] Deduced a trap composed of 310 places in 395 ms of which 1 ms to minimize.
[2023-03-24 08:09:07] [INFO ] Deduced a trap composed of 300 places in 355 ms of which 0 ms to minimize.
[2023-03-24 08:09:07] [INFO ] Deduced a trap composed of 296 places in 358 ms of which 1 ms to minimize.
[2023-03-24 08:09:08] [INFO ] Deduced a trap composed of 302 places in 385 ms of which 1 ms to minimize.
[2023-03-24 08:09:08] [INFO ] Deduced a trap composed of 303 places in 376 ms of which 1 ms to minimize.
[2023-03-24 08:09:09] [INFO ] Deduced a trap composed of 300 places in 376 ms of which 1 ms to minimize.
[2023-03-24 08:09:09] [INFO ] Deduced a trap composed of 290 places in 374 ms of which 1 ms to minimize.
[2023-03-24 08:09:10] [INFO ] Deduced a trap composed of 306 places in 380 ms of which 1 ms to minimize.
[2023-03-24 08:09:10] [INFO ] Deduced a trap composed of 308 places in 358 ms of which 0 ms to minimize.
[2023-03-24 08:09:11] [INFO ] Deduced a trap composed of 304 places in 359 ms of which 1 ms to minimize.
[2023-03-24 08:09:11] [INFO ] Deduced a trap composed of 302 places in 363 ms of which 1 ms to minimize.
[2023-03-24 08:09:12] [INFO ] Deduced a trap composed of 314 places in 364 ms of which 0 ms to minimize.
[2023-03-24 08:09:12] [INFO ] Deduced a trap composed of 318 places in 377 ms of which 0 ms to minimize.
[2023-03-24 08:09:12] [INFO ] Deduced a trap composed of 308 places in 358 ms of which 1 ms to minimize.
[2023-03-24 08:09:13] [INFO ] Deduced a trap composed of 294 places in 375 ms of which 1 ms to minimize.
[2023-03-24 08:09:13] [INFO ] Deduced a trap composed of 302 places in 381 ms of which 1 ms to minimize.
[2023-03-24 08:09:14] [INFO ] Deduced a trap composed of 316 places in 357 ms of which 1 ms to minimize.
[2023-03-24 08:09:14] [INFO ] Deduced a trap composed of 306 places in 383 ms of which 0 ms to minimize.
[2023-03-24 08:09:15] [INFO ] Deduced a trap composed of 320 places in 390 ms of which 1 ms to minimize.
[2023-03-24 08:09:15] [INFO ] Deduced a trap composed of 302 places in 381 ms of which 0 ms to minimize.
[2023-03-24 08:09:16] [INFO ] Deduced a trap composed of 296 places in 360 ms of which 1 ms to minimize.
[2023-03-24 08:09:16] [INFO ] Deduced a trap composed of 300 places in 363 ms of which 0 ms to minimize.
[2023-03-24 08:09:16] [INFO ] Deduced a trap composed of 298 places in 371 ms of which 0 ms to minimize.
[2023-03-24 08:09:17] [INFO ] Deduced a trap composed of 318 places in 386 ms of which 0 ms to minimize.
[2023-03-24 08:09:17] [INFO ] Deduced a trap composed of 308 places in 353 ms of which 1 ms to minimize.
[2023-03-24 08:09:18] [INFO ] Deduced a trap composed of 305 places in 367 ms of which 1 ms to minimize.
[2023-03-24 08:09:18] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 1 ms to minimize.
[2023-03-24 08:09:19] [INFO ] Deduced a trap composed of 308 places in 364 ms of which 0 ms to minimize.
[2023-03-24 08:09:19] [INFO ] Deduced a trap composed of 320 places in 358 ms of which 1 ms to minimize.
[2023-03-24 08:09:20] [INFO ] Deduced a trap composed of 304 places in 360 ms of which 0 ms to minimize.
[2023-03-24 08:09:20] [INFO ] Deduced a trap composed of 298 places in 373 ms of which 1 ms to minimize.
[2023-03-24 08:09:20] [INFO ] Deduced a trap composed of 312 places in 360 ms of which 1 ms to minimize.
[2023-03-24 08:09:21] [INFO ] Deduced a trap composed of 312 places in 378 ms of which 0 ms to minimize.
[2023-03-24 08:09:22] [INFO ] Deduced a trap composed of 310 places in 356 ms of which 1 ms to minimize.
[2023-03-24 08:09:23] [INFO ] Deduced a trap composed of 294 places in 366 ms of which 1 ms to minimize.
[2023-03-24 08:09:24] [INFO ] Deduced a trap composed of 292 places in 365 ms of which 1 ms to minimize.
[2023-03-24 08:09:24] [INFO ] Deduced a trap composed of 300 places in 357 ms of which 1 ms to minimize.
[2023-03-24 08:09:24] [INFO ] Deduced a trap composed of 310 places in 355 ms of which 1 ms to minimize.
[2023-03-24 08:09:25] [INFO ] Deduced a trap composed of 317 places in 362 ms of which 2 ms to minimize.
[2023-03-24 08:09:25] [INFO ] Deduced a trap composed of 298 places in 355 ms of which 1 ms to minimize.
[2023-03-24 08:09:26] [INFO ] Deduced a trap composed of 302 places in 364 ms of which 1 ms to minimize.
[2023-03-24 08:09:26] [INFO ] Deduced a trap composed of 308 places in 365 ms of which 0 ms to minimize.
[2023-03-24 08:09:26] [INFO ] Deduced a trap composed of 328 places in 349 ms of which 1 ms to minimize.
[2023-03-24 08:09:27] [INFO ] Deduced a trap composed of 316 places in 381 ms of which 1 ms to minimize.
[2023-03-24 08:09:27] [INFO ] Deduced a trap composed of 290 places in 353 ms of which 1 ms to minimize.
[2023-03-24 08:09:28] [INFO ] Deduced a trap composed of 302 places in 398 ms of which 1 ms to minimize.
[2023-03-24 08:09:28] [INFO ] Deduced a trap composed of 306 places in 368 ms of which 1 ms to minimize.
[2023-03-24 08:09:29] [INFO ] Deduced a trap composed of 296 places in 367 ms of which 1 ms to minimize.
[2023-03-24 08:09:29] [INFO ] Deduced a trap composed of 306 places in 366 ms of which 1 ms to minimize.
[2023-03-24 08:09:29] [INFO ] Deduced a trap composed of 310 places in 369 ms of which 1 ms to minimize.
[2023-03-24 08:09:30] [INFO ] Deduced a trap composed of 312 places in 376 ms of which 1 ms to minimize.
[2023-03-24 08:09:30] [INFO ] Deduced a trap composed of 298 places in 347 ms of which 1 ms to minimize.
[2023-03-24 08:09:31] [INFO ] Deduced a trap composed of 294 places in 365 ms of which 0 ms to minimize.
[2023-03-24 08:09:31] [INFO ] Deduced a trap composed of 302 places in 384 ms of which 1 ms to minimize.
[2023-03-24 08:09:31] [INFO ] Deduced a trap composed of 302 places in 374 ms of which 1 ms to minimize.
[2023-03-24 08:09:32] [INFO ] Deduced a trap composed of 300 places in 379 ms of which 1 ms to minimize.
[2023-03-24 08:09:32] [INFO ] Deduced a trap composed of 300 places in 374 ms of which 1 ms to minimize.
[2023-03-24 08:09:33] [INFO ] Deduced a trap composed of 310 places in 364 ms of which 1 ms to minimize.
[2023-03-24 08:09:33] [INFO ] Deduced a trap composed of 292 places in 350 ms of which 1 ms to minimize.
[2023-03-24 08:09:34] [INFO ] Deduced a trap composed of 316 places in 367 ms of which 1 ms to minimize.
[2023-03-24 08:09:34] [INFO ] Deduced a trap composed of 292 places in 359 ms of which 1 ms to minimize.
[2023-03-24 08:09:34] [INFO ] Deduced a trap composed of 327 places in 351 ms of which 1 ms to minimize.
[2023-03-24 08:09:43] [INFO ] Trap strengthening (SAT) tested/added 99/99 trap constraints in 53157 ms
[2023-03-24 08:09:45] [INFO ] After 55322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 08:09:45] [INFO ] After 55503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 10 factoid took 457 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
[2023-03-24 08:09:46] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 08:09:46] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-24 08:09:47] [INFO ] [Real]Absence check using 81 positive place invariants in 47 ms returned sat
[2023-03-24 08:09:47] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 64 ms returned sat
[2023-03-24 08:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 08:09:49] [INFO ] [Real]Absence check using state equation in 2275 ms returned sat
[2023-03-24 08:09:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 08:09:50] [INFO ] [Nat]Absence check using 81 positive place invariants in 54 ms returned sat
[2023-03-24 08:09:51] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 62 ms returned sat
[2023-03-24 08:09:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 08:09:58] [INFO ] [Nat]Absence check using state equation in 7593 ms returned sat
[2023-03-24 08:09:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:09:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-24 08:09:59] [INFO ] Deduced a trap composed of 392 places in 474 ms of which 1 ms to minimize.
[2023-03-24 08:09:59] [INFO ] Deduced a trap composed of 394 places in 439 ms of which 1 ms to minimize.
[2023-03-24 08:10:00] [INFO ] Deduced a trap composed of 396 places in 445 ms of which 1 ms to minimize.
[2023-03-24 08:10:01] [INFO ] Deduced a trap composed of 396 places in 456 ms of which 1 ms to minimize.
[2023-03-24 08:10:01] [INFO ] Deduced a trap composed of 390 places in 437 ms of which 1 ms to minimize.
[2023-03-24 08:10:02] [INFO ] Deduced a trap composed of 394 places in 451 ms of which 1 ms to minimize.
[2023-03-24 08:10:02] [INFO ] Deduced a trap composed of 388 places in 455 ms of which 1 ms to minimize.
[2023-03-24 08:10:03] [INFO ] Deduced a trap composed of 402 places in 462 ms of which 1 ms to minimize.
[2023-03-24 08:10:03] [INFO ] Deduced a trap composed of 386 places in 436 ms of which 1 ms to minimize.
[2023-03-24 08:10:04] [INFO ] Deduced a trap composed of 398 places in 438 ms of which 1 ms to minimize.
[2023-03-24 08:10:04] [INFO ] Deduced a trap composed of 394 places in 421 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-24 08:10:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 5597 reset in 739 ms.
Product exploration explored 100000 steps with 5602 reset in 765 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Support contains 4 out of 843 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 843/843 places, 1614/1614 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 843 transition count 1614
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 45 place count 843 transition count 1615
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 843 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 842 transition count 1614
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 842 transition count 1614
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 1 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 95 place count 842 transition count 1614
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 139 place count 798 transition count 1570
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 183 place count 798 transition count 1570
Deduced a syphon composed of 48 places in 1 ms
Applied a total of 183 rules in 370 ms. Remains 798 /843 variables (removed 45) and now considering 1570/1614 (removed 44) transitions.
[2023-03-24 08:10:07] [INFO ] Flow matrix only has 1561 transitions (discarded 9 similar events)
// Phase 1: matrix 1561 rows 798 cols
[2023-03-24 08:10:07] [INFO ] Computed 102 place invariants in 29 ms
[2023-03-24 08:10:08] [INFO ] Dead Transitions using invariants and state equation in 1407 ms found 0 transitions.
[2023-03-24 08:10:08] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-24 08:10:08] [INFO ] Flow matrix only has 1561 transitions (discarded 9 similar events)
[2023-03-24 08:10:08] [INFO ] Invariant cache hit.
[2023-03-24 08:10:10] [INFO ] Dead Transitions using invariants and state equation in 1307 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 798/843 places, 1570/1614 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3124 ms. Remains : 798/843 places, 1570/1614 transitions.
Support contains 4 out of 843 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 843/843 places, 1614/1614 transitions.
Applied a total of 0 rules in 24 ms. Remains 843 /843 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2023-03-24 08:10:10] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 08:10:10] [INFO ] Computed 102 place invariants in 29 ms
[2023-03-24 08:10:12] [INFO ] Dead Transitions using invariants and state equation in 1902 ms found 0 transitions.
[2023-03-24 08:10:12] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:10:12] [INFO ] Invariant cache hit.
[2023-03-24 08:10:13] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2023-03-24 08:10:13] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:10:13] [INFO ] Invariant cache hit.
[2023-03-24 08:10:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:10:27] [INFO ] Implicit Places using invariants and state equation in 14138 ms returned []
Implicit Place search using SMT with State Equation took 15402 ms to find 0 implicit places.
[2023-03-24 08:10:27] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:10:27] [INFO ] Invariant cache hit.
[2023-03-24 08:10:29] [INFO ] Dead Transitions using invariants and state equation in 1883 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19213 ms. Remains : 843/843 places, 1614/1614 transitions.
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-09 finished in 370604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||((!p2 U (p3||G(!p2)))&&p1)))))'
Support contains 6 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 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 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 799 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 798 transition count 1569
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 798 transition count 1525
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 753 transition count 1524
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 753 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 751 transition count 1522
Applied a total of 186 rules in 131 ms. Remains 751 /844 variables (removed 93) and now considering 1522/1615 (removed 93) transitions.
[2023-03-24 08:10:29] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 08:10:29] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-24 08:10:30] [INFO ] Dead Transitions using invariants and state equation in 1135 ms found 0 transitions.
[2023-03-24 08:10:30] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 08:10:30] [INFO ] Invariant cache hit.
[2023-03-24 08:10:31] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2023-03-24 08:10:31] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 08:10:31] [INFO ] Invariant cache hit.
[2023-03-24 08:10:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:10:42] [INFO ] Implicit Places using invariants and state equation in 10057 ms returned []
Implicit Place search using SMT with State Equation took 11154 ms to find 0 implicit places.
[2023-03-24 08:10:42] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-24 08:10:42] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 08:10:42] [INFO ] Invariant cache hit.
[2023-03-24 08:10:43] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/844 places, 1522/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13586 ms. Remains : 751/844 places, 1522/1615 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (AND (NOT p3) p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p3) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s365 1) (GEQ s408 1) (GEQ s694 1)), p3:(AND (GEQ s55 1) (GEQ s412 1) (NOT (AND (GEQ s365 1) (GEQ s408 1) (GEQ s694 1)))), p2:(AND (GEQ s365 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-10 finished in 13755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 844 transition count 1569
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 798 transition count 1569
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 798 transition count 1524
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 753 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 752 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 752 transition count 1523
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 188 place count 750 transition count 1521
Applied a total of 188 rules in 118 ms. Remains 750 /844 variables (removed 94) and now considering 1521/1615 (removed 94) transitions.
[2023-03-24 08:10:43] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-24 08:10:43] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 08:10:44] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
[2023-03-24 08:10:44] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:10:44] [INFO ] Invariant cache hit.
[2023-03-24 08:10:45] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2023-03-24 08:10:45] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:10:45] [INFO ] Invariant cache hit.
[2023-03-24 08:10:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:11:01] [INFO ] Implicit Places using invariants and state equation in 15690 ms returned []
Implicit Place search using SMT with State Equation took 16747 ms to find 0 implicit places.
[2023-03-24 08:11:01] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-24 08:11:01] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 08:11:01] [INFO ] Invariant cache hit.
[2023-03-24 08:11:02] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/844 places, 1521/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19199 ms. Remains : 750/844 places, 1521/1615 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s244 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-11 finished in 19246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((false U X(X(p0)))&&(X(G(p1)) U p2))))'
Support contains 6 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Applied a total of 0 rules in 27 ms. Remains 844 /844 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
[2023-03-24 08:11:02] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 844 cols
[2023-03-24 08:11:02] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-24 08:11:04] [INFO ] Dead Transitions using invariants and state equation in 1939 ms found 0 transitions.
[2023-03-24 08:11:04] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 08:11:04] [INFO ] Invariant cache hit.
[2023-03-24 08:11:05] [INFO ] Implicit Places using invariants in 1239 ms returned []
[2023-03-24 08:11:05] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 08:11:05] [INFO ] Invariant cache hit.
[2023-03-24 08:11:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:11:19] [INFO ] Implicit Places using invariants and state equation in 14175 ms returned []
Implicit Place search using SMT with State Equation took 15416 ms to find 0 implicit places.
[2023-03-24 08:11:19] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 08:11:19] [INFO ] Invariant cache hit.
[2023-03-24 08:11:21] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19257 ms. Remains : 844/844 places, 1615/1615 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s18 1) (GEQ s162 9) (GEQ s403 1)), p1:(AND (GEQ s582 1) (GEQ s798 1)), p0:(GEQ s297 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-12 finished in 19561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&G(p1))) U p0)))'
Support contains 2 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 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 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 799 transition count 1570
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 799 transition count 1525
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 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 753 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 753 transition count 1524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 752 transition count 1523
Applied a total of 184 rules in 118 ms. Remains 752 /844 variables (removed 92) and now considering 1523/1615 (removed 92) transitions.
[2023-03-24 08:11:22] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
// Phase 1: matrix 1514 rows 752 cols
[2023-03-24 08:11:22] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-24 08:11:23] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
[2023-03-24 08:11:23] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-24 08:11:23] [INFO ] Invariant cache hit.
[2023-03-24 08:11:24] [INFO ] Implicit Places using invariants in 1084 ms returned []
[2023-03-24 08:11:24] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-24 08:11:24] [INFO ] Invariant cache hit.
[2023-03-24 08:11:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:11:39] [INFO ] Implicit Places using invariants and state equation in 15446 ms returned []
Implicit Place search using SMT with State Equation took 16530 ms to find 0 implicit places.
[2023-03-24 08:11:40] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-24 08:11:40] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-24 08:11:40] [INFO ] Invariant cache hit.
[2023-03-24 08:11:41] [INFO ] Dead Transitions using invariants and state equation in 1154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 752/844 places, 1523/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19050 ms. Remains : 752/844 places, 1523/1615 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s244 2), p1:(LT s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-13 finished in 19179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 843 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 843 transition count 1614
Applied a total of 2 rules in 48 ms. Remains 843 /844 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 08:11:41] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 08:11:41] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 08:11:43] [INFO ] Dead Transitions using invariants and state equation in 1848 ms found 0 transitions.
[2023-03-24 08:11:43] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:11:43] [INFO ] Invariant cache hit.
[2023-03-24 08:11:44] [INFO ] Implicit Places using invariants in 1352 ms returned []
[2023-03-24 08:11:44] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:11:44] [INFO ] Invariant cache hit.
[2023-03-24 08:11:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:11:59] [INFO ] Implicit Places using invariants and state equation in 15109 ms returned []
Implicit Place search using SMT with State Equation took 16462 ms to find 0 implicit places.
[2023-03-24 08:11:59] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-24 08:11:59] [INFO ] Invariant cache hit.
[2023-03-24 08:12:01] [INFO ] Dead Transitions using invariants and state equation in 1869 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 843/844 places, 1614/1615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20229 ms. Remains : 843/844 places, 1614/1615 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s658 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 2 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-15 finished in 20363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((G(F(p1))||G(!p2)) U X(p1))))'
[2023-03-24 08:12:01] [INFO ] Flatten gal took : 84 ms
[2023-03-24 08:12:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-24 08:12:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 844 places, 1615 transitions and 9404 arcs took 14 ms.
Total runtime 978750 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3106/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3106/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-PT-S10J40-LTLFireability-08
Could not compute solution for formula : PolyORBNT-PT-S10J40-LTLFireability-09

BK_STOP 1679645523885

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PolyORBNT-PT-S10J40-LTLFireability-08
ltl formula formula --ltl=/tmp/3106/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 844 places, 1615 transitions and 9404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.040 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3106/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3106/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3106/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3106/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x56407f06c3f4]
1: pnml2lts-mc(+0xa2496) [0x56407f06c496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f40667ed140]
3: pnml2lts-mc(+0x405be5) [0x56407f3cfbe5]
4: pnml2lts-mc(+0x16b3f9) [0x56407f1353f9]
5: pnml2lts-mc(+0x164ac4) [0x56407f12eac4]
6: pnml2lts-mc(+0x272e0a) [0x56407f23ce0a]
7: pnml2lts-mc(+0xb61f0) [0x56407f0801f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f40666404d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f406664067a]
10: pnml2lts-mc(+0xa1581) [0x56407f06b581]
11: pnml2lts-mc(+0xa1910) [0x56407f06b910]
12: pnml2lts-mc(+0xa32a2) [0x56407f06d2a2]
13: pnml2lts-mc(+0xa50f4) [0x56407f06f0f4]
14: pnml2lts-mc(+0xa516b) [0x56407f06f16b]
15: pnml2lts-mc(+0x3f34b3) [0x56407f3bd4b3]
16: pnml2lts-mc(+0x7c63d) [0x56407f04663d]
17: pnml2lts-mc(+0x67d86) [0x56407f031d86]
18: pnml2lts-mc(+0x60a8a) [0x56407f02aa8a]
19: pnml2lts-mc(+0x5eb15) [0x56407f028b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f4066628d0a]
21: pnml2lts-mc(+0x6075e) [0x56407f02a75e]
ltl formula name PolyORBNT-PT-S10J40-LTLFireability-09
ltl formula formula --ltl=/tmp/3106/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 844 places, 1615 transitions and 9404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.050 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3106/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3106/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3106/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3106/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-PT-S10J40"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S10J40, 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 r297-tall-167873950900772"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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